Beyond diffusion process: Neighbor set similarity for fast re-ranking

NSS is proposed to replace the role of Diffusion Process to capture the geometry of the underlying manifold in shape and image retrieval.NSS is more precise than Diffusion Process, and more robust to noise.NSS is computed more efficiently than Diffusion Process, and it no longer needs an iterative process to guarantee the retrieval precision.We obtain state-of-the-art retrieval performance on several benchmark datasets. Measuring the similarity between two instances reliably, shape or image, is a challenging problem in shape and image retrieval. In this paper, a simple yet effective method called Neighbor Set Similarity (NSS) is proposed, which is superior to both traditional pairwise similarity and diffusion process. NSS makes full use of contextual information to capture the geometry of the underlying manifold, and obtains a more precise measure than the original pairwise similarity. Moreover, based on NSS, we propose a powerful fusion process to utilize the complementarity of different descriptors to further enhance the retrieval performance. The experimental results on MPEG-7 shape dataset, N-S image dataset and ORL face dataset demonstrate the effectiveness of the proposed method. In addition, the time complexity of NSS is much lower than diffusion process, which suggests that NSS is more suitable for large scale image retrieval than diffusion process.

[1]  Shao-Hu Peng,et al.  A visual shape descriptor using sectors and shape context of contour lines , 2010, Inf. Sci..

[2]  Qi Tian,et al.  Coupled Binary Embedding for Large-Scale Image Retrieval , 2014, IEEE Transactions on Image Processing.

[3]  Haibin Ling,et al.  Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Frank Nielsen,et al.  Shape Retrieval Using Hierarchical Total Bregman Soft Clustering , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Longin Jan Latecki,et al.  Balancing Deformability and Discriminability for Shape Matching , 2010, ECCV.

[6]  Zhuowen Tu,et al.  Improving Shape Retrieval by Learning Graph Transduction , 2008, ECCV.

[7]  Cheng Wang,et al.  Learning context sensitive similarity measure on pair fusion graph , 2013, 2013 IEEE International Conference on Image Processing.

[8]  Ming Yang,et al.  Contextual weighting for vocabulary tree based image retrieval , 2011, 2011 International Conference on Computer Vision.

[9]  B. Nadler,et al.  Diffusion maps, spectral clustering and reaction coordinates of dynamical systems , 2005, math/0503445.

[10]  Laurent Itti,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence 1 Rapid Biologically-inspired Scene Classification Using Features Shared with Visual Attention , 2022 .

[11]  Ming Yang,et al.  Query Specific Fusion for Image Retrieval , 2012, ECCV.

[12]  Rama Chellappa,et al.  Articulation-Invariant Representation of Non-planar Shapes , 2010, ECCV.

[13]  Bo Wang,et al.  Unsupervised metric fusion by cross diffusion , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Mohammad Reza Daliri,et al.  Robust symbolic representation for shape recognition and retrieval , 2008, Pattern Recognit..

[15]  Andy Harter,et al.  Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[16]  Zhuowen Tu,et al.  Shape Matching and Recognition - Using Generative Models and Informative Features , 2004, ECCV.

[17]  Luc Van Gool,et al.  Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors , 2011, CVPR 2011.

[18]  Zhi-Hua Zhou,et al.  Semi-Supervised Regression with Co-Training , 2005, IJCAI.

[19]  Stéphane Lafon,et al.  Diffusion maps , 2006 .

[20]  Ronald Rosenfeld,et al.  Semi-supervised learning with graphs , 2005 .

[21]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[22]  Avrim Blum,et al.  The Bottleneck , 2021, Monopsony Capitalism.

[23]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[24]  Bo Wang,et al.  Affinity learning via self-diffusion for image segmentation and clustering , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[25]  Qi Tian,et al.  Packing and Padding: Coupled Multi-index for Accurate Image Retrieval , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[26]  Matthijs C. Dorst Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[27]  Yuan Yan Tang,et al.  Multiview Hessian discriminative sparse coding for image annotation , 2013, Comput. Vis. Image Underst..

[28]  Longin Jan Latecki,et al.  Affinity learning on a tensor product graph with applications to shape and image retrieval , 2011, CVPR 2011.

[29]  Ramakrishna Kakarala,et al.  Consensus of k-NNs for Robust Neighborhood Selection on Graph-Based Manifolds , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[30]  Zhi-Hua Zhou,et al.  Tri-training: exploiting unlabeled data using three classifiers , 2005, IEEE Transactions on Knowledge and Data Engineering.

[31]  Zhi-Hua Zhou,et al.  Multi-instance clustering with applications to multi-instance prediction , 2009, Applied Intelligence.

[32]  Bo Wang,et al.  Unsupervised metric learning by Self-Smoothing Operator , 2011, 2011 International Conference on Computer Vision.

[33]  David Nistér,et al.  Scalable Recognition with a Vocabulary Tree , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[34]  Jun Yu,et al.  Exploiting Click Constraints and Multi-view Features for Image Re-ranking , 2014, IEEE Transactions on Multimedia.

[35]  Longin Jan Latecki,et al.  Locally constrained diffusion process on locally densified distance spaces with applications to shape retrieval , 2009, CVPR.

[36]  Longin Jan Latecki,et al.  Affinity Learning with Diffusion on Tensor Product Graph , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[37]  Dacheng Tao,et al.  Fick’s Law Assisted Propagation for Semisupervised Learning , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[38]  Ying Zhang,et al.  Learning context-sensitive similarity by shortest path propagation , 2011, Pattern Recognit..

[39]  Cordelia Schmid,et al.  Accurate Image Search Using the Contextual Dissimilarity Measure , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[40]  Ricardo da Silva Torres,et al.  Exploiting pairwise recommendation and clustering strategies for image re-ranking , 2012, Inf. Sci..

[41]  Soravit Changpinyo,et al.  Similarity Component Analysis , 2013, NIPS.

[42]  Bernhard Schölkopf,et al.  Ranking on Data Manifolds , 2003, NIPS.

[43]  Bo Wang,et al.  Co-transduction for Shape Retrieval , 2010, ECCV.

[44]  Horst Bischof,et al.  Diffusion Processes for Retrieval Revisited , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[45]  Y. Rui,et al.  Learning to Rank Using User Clicks and Visual Features for Image Retrieval , 2015, IEEE Transactions on Cybernetics.

[46]  Zhuowen Tu,et al.  Learning Context-Sensitive Shape Similarity by Graph Transduction , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[47]  Nachum Dershowitz,et al.  Congruency-Based Reranking , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[48]  Junwei Wang,et al.  Shape matching and classification using height functions , 2012, Pattern Recognit. Lett..

[49]  Jun Yu,et al.  Click Prediction for Web Image Reranking Using Multimodal Sparse Coding , 2014, IEEE Transactions on Image Processing.

[50]  Weifeng Liu,et al.  Multiview Hessian Regularization for Image Annotation , 2013, IEEE Transactions on Image Processing.

[51]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.