Browsing by Author "CHEN, Z"
Now showing 1 - 20 of 38
- Results Per Page
- Sort Options
Item type:Item, A CHINESE-CHARACTER THINNING ALGORITHM-BASED ON GLOBAL FEATURES AND CONTOUR INFORMATION(1995-04-01) ;LIN, JY ;CHEN, Z ;資訊科學與工程研究所Institute of Computer Science and EngineeringThis paper proposes a method of using run-length coding to perform thinning. First, we construct graphs from characters. The attributes (vertical lines, horizontal lines or points) of each node in the graph are determined according to the node's relationship to the nodes above and below it (we will refer to these relationships as global features) and the black runs within the node. Intersections between two adjacent segments are determined on the basis of the graph constructed and contour information. The thinning algorithm thus employs global features and contour information to produce a more accurate skeleton.Item type:Item, A DGR METHOD FOR EXTRACTING THE TOPOLOGY OF AN UPPER-HALF PROFILE OF A TURNED PART FROM CAD DATA(1991-01-01) ;CHEN, SL ;CHEN, Z ;LI, RK ;資訊工程學系Department of Computer ScienceFor a symmetrical turned part, a 2D upper-half profile is usually the input for planning functions such as turning feature extraction, process planning, and NC code generation. Current approaches to extract the topology of an upper-half profile from 2D CAD engineering drawings are heuristic and have limitations. In this paper, the drawing view cluster method and Drawing Graph Representation (DGR) method are proposed. The former has been developed to cluster front view entities into groups if the input to the activity is more than one view. Using the DGR, rules are developed to identify internal entities, external entities, types of internal profile and possible redundant entities. An example is evaluated to demonstrate the methods.Item type:Item, A FLEXIBLE PARALLEL ARCHITECTURE FOR RELAXATION LABELING ALGORITHMS(1992-05-01) ;LIN, SY ;CHEN, Z ;交大名義發表 ;資訊工程學系National Chiao Tung UniversityThe design of a flexible parallel architecture for both the discrete relaxation labeling (DRL) algorithm and the probabilistic relaxation labeling (PRL) algorithm is addressed. Through the analysis of parallelism in the computational models of both algorithms, the parallel execution of the algorithms on a flexible parallel architecture is presented. Three basic types of parallel operations are performed in the architecture: simultaneous, pipeline, and systolic. An illustrative example is used to show how the DRL algorithm can be executed on the parallel architecture. In doing so the processing element (PE) organization and the combiner organization of the architecture are described. The same architecture with programmable functional units is shown to be able to execute the PRL algorithm, too. The performance comparisons between the proposed architecture and some other existing ones are also given.Item type:Item, A NEW ALGORITHM AND ITS VLSI ARCHITECTURE DESIGN FOR CONNECTED COMPONENT LABELING(1994) ;JEAN, SD ;LIU, CM ;CHANG, CC ;CHEN, Z資訊工程學系Item type:Item, A PARALLEL ARCHITECTURE FOR PROBABILISTIC RELAXATION OPERATIONS ON IMAGES(1990) ;CHEN, Z ;LIN, SY ;CHEN, YY ;交大名義發表資訊工程學系Item type:Item, A SIMPLE VISION ALGORITHM FOR 3-D POSITION DETERMINATION USING A SINGLE CALIBRATION OBJECT(1989) ;CHEN, Z ;TSENG, DC ;LIN, JY ;交大名義發表資訊工程學系Item type:Item, ALGORITHM FOR FINDING ALL MAXIMAL COMPLETE SUBGRAPHS AND AN ESTIMATE OF THE ORDER OF COMPUTATIONAL COMPLEXITY(1978) ;DAS, SR ;SHENG, CL ;CHEN, Z ;交大名義發表資訊工程學系Item type:Item, AN EFFECTIVE SEARCH APPROACH TO CAMERA PARAMETER-ESTIMATION USING AN ARBITRARY PLANAR CALIBRATION OBJECT(1993-05-01) ;CHEN, Z ;WANG, CM ;HO, SY ;交大名義發表資訊科學與工程研究所In this paper we shall present a new method for camera parameter estimation using an arbitrary planar calibration object. We begin with an approximate model for the perspective view and give a parameter-free normalized-line-segment-ratio relationship between the corresponding reference and sensed views. This representation makes parameter decoupling possible and reduces the library dimension from six to one. Then the estimation problem can be viewed as a library search problem. Various mechanisms are provided to reduce the library search time, including (a) library partition by clustering, (b) sensed cluster identification by binary search, and (c) sequential testing for view matching using sorted features. In addition, feature perturbation is also considered to achieve better robustness against feature noise. Both computer-generated and real data are included in experiments, illustrating how our method works.Item type:Item, APPROACH TO MICROPROGRAM OPTIMIZATION THROUGH BIT DIMENSION REDUCTION IN A GIVEN CONTROL STORE SPECIFICATION(1979) ;DAS, SR ;CHEN, Z ;SHENG, CL ;資訊工程學系Department of Computer ScienceItem type:Item, AUTOMATIC 3D MACHINING FEATURE-EXTRACTION FROM 3D CSG SOLID INPUT(1990-06-01) ;PERNG, DB ;CHEN, Z ;LI, RK ;交大名義發表資訊科學與工程研究所Item type:Item, AUTOMATIC CONSISTENCY VERIFICATION OF MECHANICAL CAD FILES(1993-07-01) ;PERNG, DB ;CHEN, Z ;WU, JS ;資訊科學與工程研究所工業工程與管理學系A system for automatic verification of the exactness of the CAD files of a mechanical part with planar and cylindrical faces through 3D part reconstruction is described. A set of consistency checking rules are specified to facilitate the part reconstruction. The system not only reconstructs the 3D geometry from a correct drawing file, but also produces adequate error messages to aid the designer to make corrections. We shall present our method with illustrations. Experimental results indicate that the set of checking rules is very useful and the system is very effective.Item type:Item, AUTOMATIC RECONSTRUCTION OF 3D SOLID OBJECTS FROM 2D ORTHOGRAPHIC VIEWS(1988) ;CHEN, Z ;PERNG, DB ;交大名義發表 ;資訊工程學系National Chiao Tung UniversityItem type:Item, CAD-BASED AUTOMATED MACHINABLE FEATURE-EXTRACTION(1993) ;LIU, CH ;CHEN, Z ;資訊科學與工程研究所Institute of Computer Science and EngineeringItem type:Item, CAMERA PARAMETER DETERMINATION FROM A SINGLE VIEW OF A GENERAL PLANAR CALIBRATION OBJECT(1994) ;WANG, CM ;CHEN, Z ;資訊科學與工程研究所Institute of Computer Science and EngineeringItem type:Item, COMPLEXITY AND PERFORMANCE OF A GRAPH-THEORY ALGORITHM FOR CLUSTER-ANALYSIS(1983) ;DAS, SR ;CHEN, Z ;LEE, SY ;LIN, TSHENG, CLItem type:Item, COMPUTER VISION FOR ROBUST 3D AIRCRAFT RECOGNITION WITH FAST LIBRARY SEARCH(1991) ;CHEN, Z ;HO, SY ;交大名義發表 ;資訊科學與工程研究所National Chiao Tung UniversityA fast but accurate classification method is presented which takes the fundamental problems of aircraft recognition in 3D space into consideration. Elliptic Fourier descriptors are used for aircraft classification and pose determination from a two-dimensional image recorded at an arbitrary viewing angle. The computation model of the nearest neighbor classification rule (or, simply, NNR) is analysed to come up with proper necessary conditions used by our method for reducing the set of near neighbors of a test projection for a fast partial library search. On the other hand, our method is robust to noise by incorporating a perturbation analysis of feature variation into the classifier design. Both graphics-generated data and real data of five aircraft have been used to demonstrate the applicability of the new method. The results indicate that the method is almost as accurate as the NNR method, but is much faster. The method is also shown to outperform other existing classification methods including the decision-tree classification method.Item type:Item, COMPUTING LOCATION AND ORIENTATION OF POLYHEDRAL SURFACES USING A LASER-BASED VISION SYSTEM(1991-12-01) ;TSENG, DC ;CHEN, Z ;資訊工程學系Department of Computer ScienceA laser-based vision system for computing the location and orientation of 3-D polyhedral surfaces is proposed. In this system, an expanded laser beam Passes through a code plate marked with equally spaced vertical and horizontal lines and impinges on a polyhedral object to create a spatial-encoded image for analysis. Then, based on the vanishing points or the directly available line directions of the perceived grid lines on the polyhedral surface, the polyhedral surface orientation can be inferred. In the meantime, the given dimensions of the grid pattern on the Plate are used to estimate the depth information of the polyhedral surfaces. More importantly, we shall solve the noise problem that occurs in the real image by a least squares estimation method and an iterative refinement method based on a geometric constraint criterion. Experiments are conducted to provide practical insight into the method. The experimental results indicate that the method is remarkably accurate and stable.Item type:Item, DESIGN OF IMPROVED FAILURE DETECTION EXPERIMENTS IN SYNCHRONOUS SEQUENTIAL-MACHINES BASED ON TERMINAL MEASUREMENTS(1979) ;DAS, SR ;CHEN, Z ;WU, SM ;LEE, SYBHATTACHARYYA, AItem type:Item, EASILY TESTABLE SEQUENTIAL-MACHINES WITH EXTRA INPUTS AND EXTRA OUTPUTS(1980) ;DAS, SR ;CHEN, Z ;DAI, YL ;交大名義發表資訊工程學系Item type:Item, FAST RECONSTRUCTION OF 3D-MECHANICAL PARTS FROM 2D-ORTHOGRAPHIC VIEWS WITH RULES(1992-01-01) ;CHEN, Z ;PERNG, DB ;CHEN, CJ ;WU, CS資訊科學與工程研究所A fast algorithm for 3D part reconstruction from a 3-view drawing is presented. A set of rules are specified to facilitate the part reconstruction. The main idea is to use the rules to determine the truth or falsity of 3D faces and the coexistence or non-coexistence relationships between 3D faces. In a graph search formulation of the reconstruction problem, these rules can reduce remarkably (a) the graph search space, (b) the occurrence of backtracking in the search and (c) the branching factor of the tree expansion. We shall present our method with illustrations. Currently we limit the type of part to be plane-faced for presentation simplicity, although we are extending our method to cover the cylindrical parts, too. Experimental results indicate the set of rules is useful and our reconstruction method is very effective.