• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.532-535
• /
• 2003

In this paper, we propose a new algorithm that can enhance the speed of template matching of hand vascular pattern person verification or recognition system. Various template matching algorithms have advantages in the matching accuracy, but most of the algorithms suffer from computational burden. To reduce the computational amount, with accuracy maintained, we propose following template matching scenario as follows. firstly, original hand vascular image is re-sampled in order to reduce spatial resolution. Secondly, reconstructed image is projected to vertical and horizontal direction, being converted to two one dimensional (1D) data. Thirdly, converted data is used to estimate spatial discrepancy between stored template image and target image. Finally, matching begins from where the estimated order is highest, and finishes when matching decision function is computed to be over certain threshold. We've applied the proposed algorithm to hand vascular pattern identification application for biometrics, and observed dramatic matching speed enhancement. This paper presents detailed explanation of the proposed algorithm and evaluation results.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1011-1020
• /
• 2013

In this paper, we present a method for obtaining a high-quality 3D depth. The advantages of active pattern projection and passive stereo matching are combined and a system is established. A diffractive optical element (DOE) is developed to project the active pattern. Cross guidance (CG) and auto guidance (AG) are proposed to perform the passive stereo matching in a stereo image in which a DOE pattern is projected. When obtaining the image, the CG emits a DOE pattern periodically and consecutively receives the original and pattern images. In addition, stereo matching is performed using these images. The AG projects the DOE pattern continuously. It conducts cost aggregation, and the image is restored through the process of removing the pattern from the pattern image. The ground truth is generated to estimate the optimal parameter among various stereo matching algorithms. Using the ground truth, the optimal parameter is estimated and the cost computation and aggregation algorithm are selected. The depth is calculated and bad-pixel errors make up 4.45% of the non-occlusion area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.305-323
• /
• 2010

This paper proposes an efficient and yet powerful local descriptor called phase-space partition based descriptor (PPD). This descriptor is designed for the mobile image matching and retrieval. PPD, which is inspired from SIFT, also encodes the salient aspects of the image gradient in the neighborhood around an interest point. However, without employing SIFT's smoothed gradient orientation histogram, we apply the region based gradient statistics in phase space to the construction of a feature representation, which allows to reduce much computation requirements. The feature matching experiments demonstrate that PPD achieves favorable performance close to that of SIFT and faster building and matching. We also present results showing that the use of PPD descriptors in a mobile image retrieval application results in a comparable performance to SIFT.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2108-2111
• /
• 2003

This paper introduces a new local feature extraction method and image matching method for the localization and classification of targets. Proposed method is based on the block-by-block projection associated with directional pattern of blocks. Each pattern has its own eigen-vertors called as CEBs(Classified Eigen-Blocks). Also proposed block-based image matching method is robust to translation and occlusion. Performance of proposed feature extraction and matching method is verified by the face localization and FLIR-vehicle-image classification test.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권1호
• /
• pp.1-9
• /
• 2015

Template matching is used for many applications in image processing. One of the most researched topics is object tracking. Normalized Cross Correlation (NCC) is the basic statistical approach to match images. NCC is used for template matching or pattern recognition. A template can be considered from a reference image, and an image from a scene can be considered as a source image. The objective is to establish the correspondence between the reference and source images. The matching gives a measure of the degree of similarity between the image and the template. A problem with NCC is its high computational cost and occasional mismatching. To deal with this problem, this paper presents an algorithm based on the Sum of Squared Difference (SSD) and an adaptive template matching to enhance the quality of the template matching in object tracking. The SSD provides low computational cost, while the adaptive template matching increases the accuracy matching. The experimental results showed that the proposed algorithm is quite efficient for image matching. The effectiveness of this method is demonstrated by several situations in the results section.

• 대한기계학회논문집A
• /
• 제25권5호
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.589-592
• /
• 1999

Matching is a key problem in computer vision, image analysis and pattern recognition. In this paper a multiscale image matching algorithm by wavelet local extrema is proposed. This algorithm is based on the multiscale wavelet transform of the curvature which can utilize both the information of local extrema positions and magnitudes of transform results. This method has advantages in computational cost to a single scale image matching. It is also rotation-, translation-, and scale-independent image matching method. This matching can be used for the recognition of occluded objects.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.521-524
• /
• 2005

This paper proposes a fusion algorithm which merges multiple vein pattern images into a single image, larger than those images. As a preprocessing step of template matching, during the verification of biometric data such as fingerprint image, vein pattern image of hand, etc., the fusion technique is used to make reference image larger than the candidate images in order to enhance the matching performance. In this paper, a new algorithm, called BSA (Boundary Stitching Algorithm) is proposed, in which the boundary rectilinear parts extracted from the candidate images are stitched to the reference image in order to enlarge its matching space. By applying BSA to practical vein pattern verification system, its verification rate was increased by about 10%.

• ETRI Journal
• /
• 제8권1호
• /
• pp.3-5
• /
• 1986

본 고는 image의 pattern을 identify하기 위해 그 image data의 FFT(Fast Fourier Transform)를 취한 후 에너지 스펙트럼의 크기를 폐적분한 값으로 부터 original input object와 비교대상의 object에 대한 mean square error 값의 차이를 시뮬레이션한 결과 얻은 threshold value와 비교함으로써 matching 을 구현하기 위함이다. Vax11-780/vms와 Fortran77 Language를 사용하여 시뮬레이션을 수행하였으며 Tektronix graphic terminal이 digitized된 이미지의 모니터용으로 사용되었다.

• 제어로봇시스템학회논문지
• /
• 제13권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.