Reinforcement of keypoint matching by co-segmentation in object retrieval: Face recognition case study

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper investigates a certain group of problems in visual detection and identification of near-identical the-same-class objects. We focus on difficult problems for which: (1) the intra-class visual differences are comparable to inter-class differences, (2) views of the objects are distorted both photometrically and geometrically, and (3) objects are randomly placed in images of unpredictable contents. Since detection of the-same-person faces in complex images is one of such problems, we use it as the case study for the proposed approach. The approach combines a relatively inexpensive technique of near-duplicate fragment detection with a novel co-segmentation algorithm. Thus, the initial pool of matching candidates can be found quickly (however, with limited precision, i.e. many false positives can be detected). It is shown that the subsequent co-segmentation can effectively reject false positives and accurately extract the matching objects from random backgrounds. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Śluzek, A., Paradowski, M., & Yang, D. (2012). Reinforcement of keypoint matching by co-segmentation in object retrieval: Face recognition case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7667 LNCS, pp. 34–41). https://doi.org/10.1007/978-3-642-34500-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free