Please use this identifier to cite or link to this item:
|Title:||Near duplicate image identification with spatially aligned pyramid matching||Authors:||Xu, D.
|Issue Date:||2008||Citation:||Xu, D.,Cham, T.-J.,Yan, S.,Chang, S.-F. (2008). Near duplicate image identification with spatially aligned pyramid matching. 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR : -. ScholarBank@NUS Repository. https://doi.org/10.1109/CVPR.2008.4587720||Abstract:||A new framework, termed Spatially Aligned Pyramid Matching, is proposed for Near Duplicate Image Identification. The proposed method robustly handles spatial shifts as well as scale changes. Images are divided into both overlapped and non-overlapped blocks over multiple levels. In the first matching stage, pairwise distances between blocks from the examined image pair are computed using SIFT features and Earth Mover's Distance (EMD). In the second stage, multiple alignment hypotheses that consider piecewise spatial shifts and scale variation are postulated and resolved using integer-flow EMD. Two application scenarios are addressed - retrieval ranking and binary classification. For retrieval ranking, a pyramid-based scheme is constructed to fuse matching results from different partition levels. For binary classification, a novel Generalized Neighborhood Component Analysis method is formulated that can be effectively used in tandem with SVMs to select the most critical matching components. The proposed methods are shown to clearly outperform existing methods through extensive testing on the Columbia Near Duplicate Image Database and another new dataset. ©2008 IEEE.||Source Title:||26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR||URI:||http://scholarbank.nus.edu.sg/handle/10635/71100||ISBN:||9781424422432||DOI:||10.1109/CVPR.2008.4587720|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 27, 2022
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.