Graph Based Re-ranking Method with Application to Handwritten Digits

In this paper a new perspective is provided on the re-ranking problem, which is essential in pattern recognition and computer vision tasks. Items are efficiently organized using the minimal spanning tree (MST) and the orthogonal-MST graph and their similarity is calculated through an appropriate graph traversal method. The graph is augmented consecutively providing alternative paths, however not escaping the data manifold. The introduced method exploits the structure of the underlined manifold and is successfully applied (but not limited) to handwritten digits image database.

[1]  Jitendra Malik,et al.  Shape Context: A New Descriptor for Shape Matching and Object Recognition , 2000, NIPS.

[2]  Yosi Keller,et al.  Improving Shape Retrieval by Spectral Matching and Meta Similarity , 2010, IEEE Transactions on Image Processing.

[3]  Luca Maria Gambardella,et al.  Deep Big Simple Neural Nets Excel on Handwritten Digit Recognition , 2010, ArXiv.

[4]  Rongrong Ji,et al.  Visual Reranking through Weakly Supervised Multi-graph Learning , 2013, 2013 IEEE International Conference on Computer Vision.

[5]  Cheng-Lin Liu,et al.  Handwritten digit recognition: benchmarking of state-of-the-art techniques , 2003, Pattern Recognit..

[6]  Anil K. Jain,et al.  Representation and Recognition of Handwritten Digits Using Deformable Templates , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[8]  Miguel Á. Carreira-Perpiñán,et al.  Proximity Graphs for Clustering and Manifold Learning , 2004, NIPS.

[9]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[10]  Laurent Amsaleg,et al.  Image retrieval with reciprocal and shared nearest neighbors , 2014, 2014 International Conference on Computer Vision Theory and Applications (VISAPP).

[11]  J. Friedman,et al.  Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .

[12]  J. Friedman,et al.  Graphics for the Multivariate Two-Sample Problem , 1981 .

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

[14]  Luca Maria Gambardella,et al.  Deep, Big, Simple Neural Nets for Handwritten Digit Recognition , 2010, Neural Computation.

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

[16]  Jürgen Schmidhuber,et al.  Multi-column deep neural networks for image classification , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

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

[18]  R. Duin,et al.  The dissimilarity representation for pattern recognition , a tutorial , 2009 .

[19]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[20]  Robert P. W. Duin,et al.  The Dissimilarity Representation for Pattern Recognition - Foundations and Applications , 2005, Series in Machine Perception and Artificial Intelligence.