Size-Independent Image Segmentation by Hierarchical Clustering and Its Application for Face Detection

In this paper, we introduce a technique to detect a target object quickly. Our idea is based on onservation on the clusters into which an image is divided by hierarchical k-means clustering with space feature and color feature. This clustering method has the advantage of extracting the region of an object with some varied size. We insist that our idea should lead to detect a target object quickly, because it is not necessary to search the locations containing no targets. First, we evaluate our clustering method and second, we demonstrate that our method is effective on an object detection by applying to our face detection system. We show that the detection time can be reduced by 24%.

[1]  M. Brandstein,et al.  Multi-source face tracking with audio and visual data , 1999, 1999 IEEE Third Workshop on Multimedia Signal Processing (Cat. No.99TH8451).

[2]  Narendra Ahuja,et al.  Detecting Faces in Images: A Survey , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  James Theiler,et al.  Contiguity-enhanced k-means clustering algorithm for unsupervised multispectral image segmentation , 1997, Optics & Photonics.

[4]  N. Kato,et al.  Scaling, rotation, and translation invariant image recognition using competing multiple subspaces , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[5]  Erik Hjelmås,et al.  Face Detection: A Survey , 2001, Comput. Vis. Image Underst..

[6]  Fionn Murtagh,et al.  A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..

[7]  Jirí Matousek,et al.  On Approximate Geometric k -Clustering , 2000, Discret. Comput. Geom..

[8]  Takeo Kanade,et al.  Neural Network-Based Face Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..