Title :
Detecting objects in image collections using bipartite graph matching
Author :
Xu, Pengfei ; Chen, Ren ; Ning, Yufang
Author_Institution :
Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China
Abstract :
Object-based image retrieval (OBIR) problem, in which the user is only interested in a fraction of the image, remains unsatisfactory, as it relies highly on accuracy. To address this problem, a novel method basing on bipartite graph matching is proposed in this paper. On the basis of the extraction of image features, we define a cost function according to the bipartite graph theory and minimize it by using the optimization technique to obtain an optimal map. Then, we calculate the mahalanobis distance to eliminate the mismatched points, since it takes into account the distribution of matched points. Finally, we apply the measure of coefficient of variation to evaluate the discrete degree and rerank the retrieved images. The experimental results on real video sequences and Caltech256 dataset demonstrate the effectiveness of our approach.
Keywords :
feature extraction; graph theory; image matching; image retrieval; object detection; optimisation; video signal processing; Caltech256 dataset; OBIR problem; bipartite graph matching; bipartite graph theory; coefficient of variation; cost function; discrete degree; image collections; image feature extraction; mahalanobis distance; mismatched points; object detection; object-based image retrieval; optimal map; optimization technique; real video sequences; retrieved images; Bipartite graph; Computer vision; Cost function; Feature extraction; Image retrieval; Image segmentation; Video sequences; bipartite graph matching; coefficient of variation; cost function; mahalanobis distance; object retrieval;
Conference_Titel :
Systems and Informatics (ICSAI), 2012 International Conference on
Conference_Location :
Yantai
Print_ISBN :
978-1-4673-0198-5
DOI :
10.1109/ICSAI.2012.6223420