• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2486-2491
• /
• 2003

This paper presents a method to segment object ID marks on poor quality images under uncontrolled lighting conditions of FA inspection process. The method is based on multiple templates and normalized gray-level correlation (NGC) method. We propose a multiple template method, called as ATM (Active Template Model) which uses combinational relation of multiple templates from model templates to match and segment several characters of the inspection images. Conventional Snakes algorithm provides a good methodology to model the functional of ATM. To increase the computation speed to segment the ID mark regions, we introduce the Dynamic Programming based algorithm. Experimental results using images from real FA environment are presented.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.55 no.4
• /
• pp.167-175
• /
• 2006

This paper presents a method to segment semiconductor wafer ID on poor quality images. The method is based on multiple templates and normalized gray-level correlation (NGC) method. If the lighting condition is not so good and hence, we can not control the image quality, target image to be inspected presents poor quality ID and it is not easy to identify and then recognize the ID characters. Conventional several method to segment the interesting ID regions fails on the bad quality images. In this paper, we propose a multiple template method, which uses combinational relation of multiple templates from model templates to match several characters of the inspection images. To find out the optimal solution of multiple template model in ID regions, we introduce newly-developed snake algorithm. Experimental results using images from real FA environment are presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.8
• /
• pp.726-733
• /
• 2004

This paper presents a method to segment object ID(identification) marks on poor quality images under uncontrolled lighting conditions of automated inspection process. The method is based on dynamic programming using multiple templates and normalized gray-level correlation (NGC) method. If the lighting condition is not good and hence, we can not control the image quality, target image to be inspected presents poor quality ID marks and it is not easy to identify and recognize the ID characters. Conventional several methods to segment the interesting ID mark regions fail on the bad quality images. In this paper, we propose a multiple template method, which uses combinational relation of multiple templates from model templates to match several characters of the inspection images. To increase the computation speed to segment the ID mark regions, we introduce the dynamic programming based algorithm. Experimental results using images from real factory automation(FA) environment are presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.868-874
• /
• 2007

This paper proposes an efficient partial matching system and representation by using a region-based method for 2D image, and we applied to an extraction of the ROI(Region of Interest) according to its matching score. The matching templates consist of the global pattern and the local one. The global pattern can make it by using region-based relation between center region and its rest regions in an object. And, the local pattern can be obtained appling to the same method as global, except relation between objects. As the templates can be normalized, we use this templates for extraction of ROI with invariant to size and position. And, our system operates only one try to match, due to normalizing of region size. To use our system for searching and examining if it's the ROI by evaluating the matching function, at first, we are searching to find candidate regions with the global template. Then, we try to find the ROI among the candidates, and it works this time by using the local template. We experimented to the binary and the color image respectively, they showed that the proposed system can be used efficiently for representing of the template and the useful applications, such as partially retrievals of 2D image.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.1
• /
• pp.25-36
• /
• 2020

Motivation: Fibers as the extracellular filamentous structures determine the shape of the cytoskeletal structures. Their characterization and reconstruction from a 3D cellular image represent very useful quantitative information at the cellular level. In this paper, we presented a novel automatic method to extract fiber diameter distribution through a pipeline to reconstruct fibers from 3D fluorescence confocal images. The pipeline is composed of four steps: segmentation, skeletonization, template fitting and fiber tracking. Segmentation of fiber is achieved by defining an energy based on tensor voting framework. After skeletonizing segmented fibers, we fit a template for each seed point. Then, the fiber tracking step reconstructs fibers by finding the best match of the next fiber segment from the previous template. Thus, we define a fiber as a set of templates, based on which we calculate a diameter distribution of fibers.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.602-607
• /
• 2002

In this paper, we proposed an approach to efficiently compress and transmit multiresoltion 3D lariat models for multimedia and very low bit rate applications. A personal facial model is obtained by a 3D laser digitizer, and further re-quantized at several resolutions according to different scope of applications, such as animation, video game, and video conference. By deforming 2D templates to match and re-quantize a 3D digitized facial model, we obtain its compressed model. In the present study, we create hierarchical 2D lariat wireframe templates are adapted according to facial feature points and the proposed piecewise chainlet affined transformation(PACT) method. The 3D digitized model after requantization are reduced significantly without perceptual loss. Moreover the proposed multiresoulation lariat models possessed of hierarchial data structure are apt to be progressively transmitted and displayed across internet.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.34-39
• /
• 2002

Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

• Journal of Korea Multimedia Society
• /
• v.20 no.1
• /
• pp.17-31
• /
• 2017

The aim of the paper is to present an object recognition method toward augmented reality system that utilizes existing education instruments that was designed without any consideration on image processing and recognition. The light reflection, sizes, shapes, and color range of the existing target education instruments are major hurdles to our object recognition. In addition, the real-time performance requirements on embedded devices and user experience constraints for children users are quite challenging issues to be solved for our image processing and object recognition approach. In order to meet these requirements we employed a method cascading light-weight weak classification methods that are complimentary each other to make a resultant complicated and highly accurate object classifier toward practically reasonable precision ratio. We implemented the proposed method and tested the performance by video with more than 11,700 frames of actual playing scenario. The experimental result showed 0.54% miss ratio and 1.35% false hit ratio.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.783-788
• /
• 2003

In this paper, we present a new approach to detect and recognize human face in the image from vision camera equipped on the mobile robot platform. Due to the mobility of camera platform, obtained facial image is small and pose-various. For this condition, new algorithm should cope with these constraints and can detect and recognize face in nearly real time. In detection step, ‘coarse to fine’ detection strategy is used. Firstly, region boundary including face is roughly located by dual ellipse templates of facial color and on this region, the locations of three main facial features- two eyes and mouth-are estimated. For this, simplified facial feature maps using characteristic chrominance are made out and candidate pixels are segmented as eye or mouth pixels group. These candidate facial features are verified whether the length and orientation of feature pairs are suitable for face geometry. In recognition step, pseudo-convex hull area of gray face image is defined which area includes feature triangle connecting two eyes and mouth. And random lattice line set are composed and laid on this convex hull area, and then 2D appearance of this area is represented. From these procedures, facial information of detected face is obtained and face DB images are similarly processed for each person class. Based on facial information of these areas, distance measure of match of lattice lines is calculated and face image is recognized using this measure as a classifier. This proposed detection and recognition algorithms overcome the constraints of previous approach [15], make real-time face detection and recognition possible, and guarantee the correct recognition irregardless of some pose variation of face. The usefulness at mobile robot application is demonstrated.