• International Journal of Contents
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.147-150
• /
• 2000

Hausdorff distance(HD) commonly used measures for object matching, and calculates the distance between two point set of pixels in two-dimentional binary images without establishing correspondence. And it is realized as the image filter applying the fuzzy. In this paper, the fuzzy hardware realizes in order to construct the image filter applying HD, also, propose as the method for the noise removal using it in the image. MIN-MAX circuit designs the circuit using MAX-PLUS, and the fuzzy HD hardware results are obtained to the simulation. And then, the previous computer simulation is confirmed to the result by using MATLAB.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.11-16
• /
• 2006

To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.632-635
• /
• 2003

This paper describes a system fur tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.87-92
• /
• 2003

This paper describes a system for tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

• 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 Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2576-2589
• /
• 2017

Co-saliency detection is a task of detecting same or similar objects in multi-scene, and has been an important preprocessing step for multi-scene image processing. However existing methods lack efficiency to match similar areas from different images. In addition, they are confined to single image detection without a unified framework to calculate co-saliency. In this paper, we propose a novel model called Superpixel Matching-Cellular Automata (SMCA). We use Hausdorff distance adjacent superpixel sets instead of single superpixel since the feature matching accuracy of single superpixel is poor. We further introduce Cellular Automata to exploit the intrinsic relevance of similar regions through interactions with neighbors in multi-scene. Extensive evaluations show that the SMCA model achieves leading performance compared to state-of-the-art methods on both efficiency and accuracy.