By Topic

Detecting objects in image collections using bipartite graph matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pengfei Xu ; Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China ; Ren Chen ; Yufang Ning

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.

Published in:

Systems and Informatics (ICSAI), 2012 International Conference on

Date of Conference:

19-20 May 2012