• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.1
• /
• pp.128-134
• /
• 2009

Iris recognition is a biometric technology which can identify a person using the iris pattern. Recently, using iris information is used in many fields such as access control and information security. But Perform complex operations to extract features of the iris. because High-end hardware for real-time iris recognition is required. This paper is appropriate for the embedded environment using local gradient histogram embedded system using iris feature extraction methods have implement. Experimental results show that the performance of proposed method is comparable to existing methods using Gabor transform noticeably improves recognition performance and it is noted that the processing time of the local gradient histogram transform is much faster than that of the existing method and rotation was also a strong attribute.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.6
• /
• pp.993-1001
• /
• 2011

Unmanned ground vehicle for facility protection mostly uses model of territory for autonomous navigation. However, modeling of territory using several sensors is highly time consuming and sometimes inefficient for road application. Therefore, an estimation of drivable path based on features of road is required for high speed autonomous navigation on road. In this paper, an estimation method of drivable path using camera and 2D laser rangefinder is proposed. First, a vanishing point is estimated based on image data from CCD camera. Second, a road width is estimated based on range data from 2D laser rangefinder. Finally, the drivable path is estimated by fusing the vanishing point and the road width. The proposed method is tested on both well-structured road and unpaved road like cross-country situation.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.603-611
• /
• 2016

Generally, the doctors manually delineated the prostate boundary seeing the image by their eyes, but the manual method not only needed quite much time but also had different boundaries depending on doctors. To reduce the effort like them the automatic delineating methods are needed, but detecting the boundary is hard to do since there are lots of uncertain textures or speckle noises. There have been studied in SVM, SIFT, Gabor texture filter, snake-like contour, and average-shape model methods. Besides, there were lots of studies about 2 and 3 dimension images and CT and MRI. But no studies have been developed superior to human experts and they need additional studies. For this, this paper proposes a method that delineates the boundary predicting its texture features and its average distribution on the prostate image. As result, we got the similar boundary as the method of human experts.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.70-76
• /
• 2002

In this paper, we proposed a personal identification algorithm using the iris region which has discriminant features. First, we acquired the eye image with the black and white CCD camera and extracted the iris region by using a circular edge detector which minimizes the search space for real center and radius of the iris. And then, we localized the iris region into several circles and extracted the features by filtering signals on the perimeters of circles with one dimensional Gabor filter We identified a person by comparing ,correlation values of input signals with the registered signals. We also decided threshold value minimizing average error rate for FRR(Type I)error rate and FAR(Type II)error rate. Experimental results show that proposed algorithm has average error rate less than 5.2%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.256-265
• /
• 2003

To improve reliability and practicality, a fingerprint-based biometric system needs to be robust to rotations of an input fingerprint and the processing speed should be fast. Accordingly, this paper presents a new filterbank-based fingerprint feature extraction and matching method that is robust to diverse rotations and reasonably fast. The proposed method fast extracts fingerprint features using a directional filter bank, which effectively decomposes an image into several subband outputs Since matching is also performed rapidly based on the Euclidean distance between the corresponding feature vectors, the overall processing speed is so fast. To make the system robust to rotations, the proposed method generates a set of feature vectors considering various rotations of an input fingerprint and then matches these feature vectors with the enrolled single template feature vector. Experimental results demonstrated the high speed of the proposed method in feature extraction and matching, along with a comparable verification accuracy to that of other leading techniques.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.759-764
• /
• 2005

In this paper we describe a face recognition using EBGM(Elastic Bunch Graph Matching) method. Usally, the PCA and LDA based face recognition method with the low-dimensional subspace representation use holistic image of faces, but this study uses local features such as a set of convolution coefficients for Gabor kernels of different orientations and frequencies at fiducial points including the eyes, nose and mouth. At pre-recognition step, all images are represented with same size face graphs and they are used to recognize a face comparing with each similarity for all images. The proposed algorithm has less computation time due to simplified face graph than conventional EBGM method and the fuzzy matching method for calculating the similarity of face graphs renders more face recognition results.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.61-74
• /
• 2012

In this paper, we propose a illumination-robust face recognition system using MCS-LBP and 2D-PCA algorithm. A binary pattern transform which has been used in the field of the face recognition and facial expression, has a characteristic of robust to illumination. Thus, this paper propose MCS-LBP which is more robust to illumination than previous LBP, and face recognition system fusing 2D-PCA algorithm. The performance evaluation of proposed system was performed by using various binary pattern images and well-known face recognition features such as PCA, LDA, 2D-PCA and ULBP histogram of gabor images. In the process of performance evaluation, we used a YaleB face database, an extended YaleB face database, and a CMU-PIE face database that are constructed under varying lighting condition, and the proposed system which consists of MCS-LBP image and 2D-PCA feature show the best recognition accuracy.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.717-725
• /
• 2015

Prostate images have been used in the diagnosis of prostate using TRUS images being relatively cheap. Ultrasound images are recorded with 3 dimension and one diagnostic exam is made with a number of the images. A doctor can see 2 dimensional images on the monitor sequentially and 3 dimensional ones to diagnose a disease. To display the images, 2-d images are used with raw 2-d ones, but 3-d images need to be segmented by the prostates and their backgrounds to be seen from different angles and with cut images of inner side. Especially on detecting the boundary, the ones in the middle of all images are easy to find the boundary but the base and apex of the images are hard to do it since there are lots of uncertain boundary. So, in this paper we propose the method that applies an average shape model and detects the boundary, and shows its superiority compared to the existing methods with experiments.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.205-208
• /
• 2013

Generally, binary pattern transforms have been used in the field of the face recognition and facial expression, since they are robust to illumination. Thus, this paper proposes an illumination-robust face recognition system combining an MLDP, which improves the texture component of the LDP, and a 2D-PCA algorithm. Unlike that binary pattern transforms such as LBP and LDP were used to extract histogram features, the proposed method directly uses the MLDP image for feature extraction by 2D-PCA. The performance evaluation of proposed method was carried out using various algorithms such as PCA, 2D-PCA and Gabor wavelets-based LBP on Yale B and CMU-PIE databases which were constructed under varying lighting condition. From the experimental results, we confirmed that the proposed method showed the best recognition accuracy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.95-105
• /
• 2003

A novel reference point detection method is proposed by exploiting tile gradient probabilistic model that captures the curvature information of fingerprint. The detection of reference point is accomplished through searching and locating the points of occurrence of the most evenly distributed gradient in a probabilistic sense. The uniformly distributed gradient texture represents either the core point itself or those of similar points that can be used to establish the rigid reference from which to map the features for recognition. Key benefits are reductions in preprocessing and consistency of locating the same points as the reference points even when processing arch type fingerprints. Moreover, the new feature extraction method is proposed by improving the existing feature extraction using filterbank method. Experimental results indicate the superiority of tile proposed scheme in terms of computational time in feature extraction and verification rate in various noisy environments. In particular, the proposed gradient probabilistic model achieved 49% improvement under ambient noise, 39.2% under brightness noise and 15.7% under a salt and pepper noise environment, respectively, in FAR for the arch type fingerprints. Moreover, a reduction of 0.07sec in reference point detection time of the GPM is shown possible compared to using the leading the poincare index method and a reduction of 0.06sec in code extraction time of the new filterbank mettled is shown possible compared to using the leading the existing filterbank method.