Browsing by Author "LEE, SY"

Now showing 1 - 9 of 9

2D C-STRING - A NEW SPATIAL KNOWLEDGE REPRESENTATION FOR IMAGE DATABASE-SYSTEMS
(1990)
LEE, SY
;
HSU, FJ
;
資訊工程學系
;
電信研究中心
;
Department of Computer Science
CALCULATION OF TURBULENT-FLOW THROUGH ENGINE INLET PORTS
(1992-09-01)
TSUI, YY
;
LEE, SY
;
交大名義發表
;
機械工程學系
;
National Chiao Tung University
The flow in an axisymmetric assembly of an engine intake port and valve is under investigation, using multidimensional analysis. The model is formulated in a curvilinear coordinate system and solved with nonstaggered grids. The turbulent effects are characterized by the k-epsilon model. The epsilon equation is modified to emphasize the effects of the normal stresses. The modification results in reduction of the turbulence and length scale in the valve passage and improves the computational accuracy for the cases considered.
COMPLEXITY AND PERFORMANCE OF A GRAPH-THEORY ALGORITHM FOR CLUSTER-ANALYSIS
(1983)
DAS, SR
;
CHEN, Z
;
LEE, SY
;
LIN, T
;
SHENG, CL
DESIGN OF IMPROVED FAILURE DETECTION EXPERIMENTS IN SYNCHRONOUS SEQUENTIAL-MACHINES BASED ON TERMINAL MEASUREMENTS
(1979)
DAS, SR
;
CHEN, Z
;
WU, SM
;
LEE, SY
;
BHATTACHARYYA, A
ONLINE HANDWRITTEN CHINESE CHARACTER-RECOGNITION VIA A FUZZY ATTRIBUTE REPRESENTATION
(1994-12-01)
CHEN, JW
;
LEE, SY
;
工學院
;
College of Engineering
Chinese characters are constructed by strokes according to structural rules. Therefore, the geometric configurations of characters are important features for character recognition. In handwritten characters, stroke shapes and their spatial relations may vary to some extent. The attribute value of a structural identification is then a fuzzy quantity rather than a binary quantity. Recognizing these facts, we propose a fuzzy attribute representation (FAR) to describe the structural features of handwritten Chinese characters for an on-line Chinese character recognition (OLCCR) system. With a FAR, a fuzzy attribute graph for each handwritten character is created, and the character recognition process is thus transformed into a simple graph matching problem. This character representation and our proposed recognition method allow us to relax the constraints on stroke order and stroke connection. The graph model provides a generalized character representation that can easily incorporate newly added characters into an OLCCR system with an automatic learning capability. The fuzzy representation can describe the degree of structural deformation in handwritten characters. The character matching algorithm is designed to tolerate structural deformations to some extent. Therefore, even input characters with deformations can be recognized correctly once the reference dictionary of the recognition system has been trained using a few representative learning samples. Experimental results are provided to show the effectiveness of the proposed method.
PICTURE ALGEBRA FOR SPATIAL REASONING OF ICONIC IMAGES REPRESENTED IN 2D C-STRING
(1991-07-01)
LEE, SY
;
HSU, FJ
;
資訊科學與工程研究所
;
電信研究中心
;
Institute of Computer Science and Engineering
A new spatial knowledge representation 2D C-string with accompanied cutting mechanism and a set of spatial operators are proposed. 2D C-string is characteristic of spatial knowledge embedded in images and is efficient in representation and manipulation of images. In this paper, transitive laws, distributive laws and manipulation laws of picture algebra are presented. All the binary relationships among objects in an image can be derived from 2D C-string. The picture algebra provides the theoretic basis for spatial reasoning and pictorial query inference.
RETRIEVAL OF SIMILAR PICTURES ON PICTORIAL DATABASES
(1991)
CHANG, CC
;
LEE, SY
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
In this paper, we suggest a method of retrieving iconic pictures in a pictorial database based upon the spatial relationship among the objects in the picture. This special kind of database query problem is generally known as a spatial match retrieval problem. We transform each picture or query into a set of ordered triples (O(i), O(j), r(ij))s, where O(i) and O(j) are two symbolic objects and r(ij) is the spatial relationship between O(i) and O(j). Then we construct a hashing table for all (O(i), O(j), r(ij))s of all the pictures in the pictorial database. By searching the preconstructed hashing table for all of the (O(i), O(j), r(ij))s associated with a query, the pictures satisfying that query can be easily determined.
SIMILARITY RETRIEVAL OF ICONIC IMAGE DATABASE
(1989)
LEE, SY
;
SHAN, MK
;
YANG, WP
;
資訊工程學系
;
Department of Computer Science
SPATIAL REASONING AND SIMILARITY RETRIEVAL OF IMAGES USING 2D C-STRING KNOWLEDGE REPRESENTATION
(1992-03-01)
LEE, SY
;
HSU, FJ
;
資訊科學與工程研究所
;
電信研究中心
;
Institute of Computer Science and Engineering
The data structure called 2D string to represent symbolic pictures was proposed by Chang et al. It allows a natural way to construct iconic indexes for pictures. A new spatial knowledge representation of a 2D C-string with accompanying cutting mechanism and a set of spatial operators are proposed. 2D C-string is more characteristic of spatial knowledge in images and is more efficient in representation and manipulation of images. Since a spatial relationship is a fuzzy concept, the capability of similarity retrieval is essential in image database systems. The spatial query and spatial reasoning based on a 2D C-string representation are presented. The similarity measure is defined and the algorithm for similarity retrieval of iconic images is also proposed.