• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.94-104
• /
• 2007

Iris recognition is biometric technology which uses a unique iris pattern of user in order to identify person. In the captured iris image by conventional iris recognition camera, it is often the case with eyelid occlusion, which covers iris information. The eyelids are unnecessary information that causes bad recognition performance, so this paper proposes robust algorithm in order to detect eyelid. This research has following three advantages compared to previous works. First, we remove the detected eyelash and specular reflection by linear interpolation method because they act as noise factors when locating eyelid. Second, we detect the candidate points of eyelid by using mask in limited eyelid searching area, which is determined by searching the cross position of eyelid and the outer boundary of iris. And our proposed algorithm detects eyelid by using parabolic hough transform based on the detected candidate points. Third, there have been many researches to detect eyelid, but they did not consider the rotation of eyelid in an iris image. Whereas, we consider the rotation factor in parabolic hough transform to overcome such problem. We tested our algorithm with CASIA Database. As the experimental results, the detection accuracy were 90.82% and 96.47% in case of detecting upper and lower eyelid, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.17-22
• /
• 1998

As time goes on, that becomes an issue still more for truth from error of a seal in electronic settlement , or in important document in the field of image recognition. But on the other hand image treatment method of a seal have has the weakness until now. It makes indistinct distinction of part that light and darkness is changed sharply as the edge of things. So it has difficult that edge detection is extracted. In this paper, I investigated the pixel in a specific area by using enhanced smothing method and searched a value of frquent occurrence. The value of pixel is substituted and edge detection is extracted. After then it could be classified rightly according as viligence test is dynamically changed. I applied conventional of Yager's generated intersection operator among fuzzy logic operator in ART1 learning Algorithm. Application of suggested ART1 learning algorithm, it results in improved image recognition rate than a case of using the conventional ART1 algorithm

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.133-140
• /
• 2007

The SWBF(shrink-wrapped boundary face) algorithm is a recent mesh reconstruction method for constructing a surface model from a set of unorganized 3D points. In this paper, we point out the surface duplication problem of SWBF and propose an improved mesh reconstruction scheme. Our method tries to classify the non-boundary cells as the inner cell or the outer cell, and makes an initial mesh without surface duplication by adopting the improved boundary face definition. To handle the directional unbalance of surface sampling density arise in typical 3D scanners, two dimensional connectivity in the cell image is introduced and utilized. According to experiments, our method is proved to be very useful to overcome the surface duplication problem of the SWBF algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.80-89
• /
• 1992

This paper presents algorithms which are region labeling and data structure of a boundary segmentation as image intermediate description process. In the method, the algorithms are region labeling, boundary segmentation, line and curve fitting and extracting data structure of each segment. As a result, a data structure of image is described by a set of region number, segment number, line or curve, starting point and end point of each segment and coefficient of line or curve. These data structures would serve for higher level processing as object recognition. For example we will use this data structure to solve the correspondence problem of stereoscopic image information. And we verified these algorithms through the image reconstruction of data structure.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.3 s.37
• /
• pp.13-22
• /
• 2006

Realistic 3D building construction in urban area has become an important issue because of increasing demand of 3D geo-spatial information in many application. Contrary to the conventional 3D building model construction approach using aerial images and high-resolution satellite imagery, it has been researched widely in building reconstruction using high-accuracy aerial LIDAR data in the latest. This paper presents a method for 3D building construction through building outlines extraction by LoG operator's Zero-crossing and line generation and refinement by Douglas-Peucker algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.75-79
• /
• 2009

In this paper the method was proposed which uses ${\lambda}$-fuzzy measure to detect the edge of the features of the face region. In the conventional method the features was founded using valley, brightness and edge. This method had its drawbacks that it is so sensitive to the external noises and environments. This paper proposed ${\lambda}$-fuzzy measure to cope with this drawbacks. By considering each weight of the pixels the integral evaluation was considered using the center of area method. Thus the continuity of the edge was kept by way of the neighborhood information and the reduction of time complexity wad resulted in.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.83-88
• /
• 2006

Digital image processing algorithm was proposed to measure the area inside of an object image using angle-distance graph used to analyze the pattern of an object in the digital image processing techniques. The first angle-distance graph is generated from a point inside of an object area. The second angle-distance graphs are generated for the areas missed in the first graph by extracting the positions with large gradient in the first angle-distance graph. The order of the graph increases according to the complexity of an object pattern. Size of the area inside of an object boundary is measured by integrating square of distance multiplied by angle for each area from the hierarchical angie-distance graphs.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.782-794
• /
• 2013

This paper proposes the wafer position recognition algorithm using camera. First, for eliminating the image distortions caused by the illumination and the irregular camera position, the wafer image is restored as a circle through projective transformation. Next, we use edge detection algorithm to extract the wafer's edge and then apply Generalized Symmetry Transform(GST) to extract a circle. The GST evaluates symmetry between two points by combining a distance weight function, a phase weight function, and a logarithmic mapping of the points' intensities and detecting interest regions. Trough several experiments, we found out the proposed method is able to prevent the cleaning system and the wafer from damaging.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.3
• /
• pp.260-272
• /
• 2001

In this paper, we have designed a region-based image retrieval system, FRIP(Finding Region In the Pictures). This system includes a robust image segmentation scheme using color and texture direction and retrieval scheme based on features of each region. For image segmentation, by using a circular filter, we can protect the boundary of round object and merge stripes or spots of objects into body region. It also combines scaled and shifted color coordinate and texture direction. After image segmentation, in order to improve the storage management effectively and reduce the computation time, we extract compact features from each region and store as index. For user interface, by the user specified constraints such as color-care / don't care. scale-care / dont care, shape-care / dont care and location-care / dont care, the overal/ matching score is estimated and the top Ie nearest images are reported in the ascending order of the final score.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.4
• /
• pp.407-414
• /
• 2008

This study introduces an automatic image matching algorithm that can be applied for the scale different image pairs consisting of the satellite pushbroom images and the aerial frame images. The proposed method is based on several image processing techniques such as pre-processing, filtering, edge thinning, interest point extraction, and key-descriptor matching, in order to enhance the matching accuracy and the processing speed. The proposed method utilizes various characteristics, such as the different geometry of image acquisition and the different radiometric characteristics, of the multi-sensor images. In addition, the suggested method uses the sensor model to minimize search area and eliminate false-matching points automatically.