• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.134-142
• /
• 2006

In this paper, we investigate a Hausdorff distance, which is used for the measurement of image similarity, to see whether it is also effective for document retrieval. The proposed method uses a local crowdedness and a Hausdorff distance to locate text images by determining whether a pair of images scanned at different time comes from the same text or not. To reduce the processing time, which is one of the disadvantages of a Hausdorff distance algorithm, we adopt a local crowdedness for feature point extraction. We apply the proposed method to 190 pairs of the same class and 190 pairs of the different class collected from postal envelop images. The results show that the modified Hausdorff distance proposed in this paper performed well in locating the tort region and calculating the degree of similarity between two images. An improvement of accuracy by 2.7% and 9.0% has been obtained, compared to a binary correlation method and the original Hausdorff distance method, respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.111-123
• /
• 2009

We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.67-73
• /
• 2010

In this paper, a new face detection method that is more accurate than the conventional methods is proposed. This method utilizes a hybrid of Hausdorff distance based on the geometric similarity between the two sets of points and the LBP distance based on the distribution of local micro texture of an image. The parameters for normalization and the optimal blending factor of the two different metrics were calculated from training sample images. Popularly used face database was used to show that the proposed method is more effective and robust to the variation of the pose, illumination, and back ground than the methods based on the Hausdorff distance or LBP distance. In the particular case, the average error distance between the detected and the true face location was reduced to 47.9% of the result of LBP method, and 22.8% of the result of Hausdorff method.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.65-72
• /
• 2000

In this paper we propose the new binary image matching algorithm called the Fuzzy logic induced Hausdorff Distance(FHD) for finding the maximally matched image with the query image. The membership histogram is obtained by normalizing the cardinality of the subset with the corresponding radius after obtaining the distribution of the minimum distance computed by the Hausdroff distance between two binary images. in the proposed algorithm, The fuzzy influence method Center of Gravity(COG) is applied to calculate the best matching candidate in the membership function described above. The proposed algorithm shows the excellent results for the face image recognition when the noise is added to the query image as well as for the character recognition.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.707-714
• /
• 2002

This paper presents a real-time Hausdorff matching algorithm for tracking of moving object acquired from an active camera. The proposed method uses the edge image of object as its model and uses Hausdorff distance as the cost function to identify hypothesis with the model. To enable real-time processing, a high speed approach to calculate Hausdorff distance and half cross matching method to improve performance of existing search methods are also presented. the experimental results demonstrate that the proposed method can accurately track moving object in real-time.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.474-483
• /
• 2004

In this paper, we present a new Practical implementation of a person verification system using the profile of 3-dimensional(3D) face images based on weighted Hausdorff distance(WHD) used depth information. The approach works on finding the nose tip have protrusion shape on the face using iterative selection method to use a fiducial feint and extract the profile image from vertical 3D data for the nose tip. Hausdorff distance(HD) is one of usually used measures for object matching. This works analyze the conventional HD and WHD, which the weighted factor is depth information. The Ll measure for comparing two feature vectors were used, because it is simple and robust. In the experimental results, the WHD method achieves recognition rate of 94.3% when the ranked threshold is 5.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.33-42
• /
• 2011

We present a new technique for removing interior knots of parametric B-spline curves. An initial curve is constructed by continuous $L_{\infty}$ approximation proposed by Eck and Hadenfeld. We employ Hausdorff distance to measure the shape difference between the original curve and the initial one. The final curve is obtained by minimizing their Hausdorff distance. We demonstrate the effectiveness of our technique with experimental results on various types of planar and spatial curves.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.147-152
• /
• 2007

Face detection is a crucial part of the face recognition system. It determines the performance of the whole recognition system. Hausdorff distance metric has been used in face detection and recognition with good results. It defines the distance metric based only on the geometric similarity between two sets or points. However, not only the geometry but also the local patterns around the points are available in most cases. In this paper a new Hausdorff distance measure is proposed that makes hybrid use of the similarity of the geometry and the local patterns around the points. Several experiments shows that the new method outperforms the conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.71-76
• /
• 2007

Object detection process which makes decision on the existence of meaningful objects in a given image is a crucial part of image recognition in computer vision system. Hausdorff distance metric has been used in object detection and shows good results in applications such as face recognition. It defines the dissimilarity between two sets of points and is used to find the object that is most similar to the given model. This paper proposes a Hausdorff distance based detection method that uses directional information of points to improve detection accuracy when the sets of points are derived from edge extraction as is in usual cases. In this method, elastic energy needed to make two directional points coincident is used as a measure of similarity.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.34-45
• /
• 2005

In this paper, a novel implementation of a person verification system based on depth-weighted Hausdorff distance (DWHD) using the surface curvature of the face is proposed. The definition of Hausdorff distance is a measure of the correspondence of two point sets. The approach works by finding the nose tip that has a protrusion shape on the face. In feature recognition of 3D face image, one has to take into consideration the orientated frontal posture to normalize after extracting face area from original image. The binary images are extracted by using the threshold values for the curvature value of surface for the person which has differential depth and surface characteristic information. The proposed DWHD measure for comparing two pixel sets were used, because it is simple and robust. In the experimental results, the minimum curvature which has low pixel distribution achieves recognition rate of 98% among the proposed methods.