A topology-based approach to computing neighborhood-of-interest points using the Morse complex

The work proposes a novel topological operator, called the Local Morse Context.It explores structural information in images through neighborhoods of interest points.The strategy avoids incorrect correspondences in high similarity images.The approach is designed and tested for the correspondence of stereo image pairs.Data sets with synthetic and real images are used in the evaluation of the method. A central problem in image processing and computer vision is the computation of corresponding interest points in a given set of images. Usually, interest points are considered as independent elements described by some local information. Due to the limitations of such an approach, many incorrect correspondences can be obtained. A specific contribution of this paper is the proposition of a topological operator, called Local Morse Context (LMC), computed over Morse complexes, introduced as a way of efficiently computing neighborhoods of interest points to explore the structural information in images. The LMC is used in the development of a matching algorithm, that helps reducing the number of incorrect matches, and obtaining a confidence measure of whether a correspondence is correct or incorrect. The approach is designed and tested for the correspondence of narrow-baseline synthetic and specially challenging underwater stereo pairs of images, for which traditional methods present difficulties for finding correct correspondences.

[1]  Horst Bunke Error-Tolerant Graph Matching: A Formal Framework and Algorithms , 1998, SSPR/SPR.

[2]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[3]  Romain Raveaux,et al.  A graph matching method and a graph matching distance based on subgraph assignments , 2010, Pattern Recognit. Lett..

[4]  Jason Fritts,et al.  Image Segmentation Using Topological Persistence , 2007, CAIP.

[5]  Michal Perdoch,et al.  Efficient sequential correspondence selection by cosegmentation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[7]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, CVPR 2004.

[8]  Larry S. Davis,et al.  A novel feature descriptor based on the shearlet transform , 2011, 2011 18th IEEE International Conference on Image Processing.

[9]  Antonio Torralba,et al.  Sharing Visual Features for Multiclass and Multiview Object Detection , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Andrew Zisserman,et al.  Multiple View Geometry in Computer Vision (2nd ed) , 2003 .

[11]  Yosi Keller,et al.  Efficient High Order Matching , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[13]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[14]  Claudia Landi,et al.  Persistent homology and partial similarity of shapes , 2012, Pattern Recognit. Lett..

[15]  Frédo Durand,et al.  A Topological Approach to Hierarchical Segmentation using Mean Shift , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Leonidas J. Guibas,et al.  A Barcode Shape Descriptor for Curve Point Cloud Data , 2022 .

[18]  Afra J. Zomorodian,et al.  Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics) , 2005 .

[19]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[21]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[22]  Christopher Hunt,et al.  Notes on the OpenSURF Library , 2009 .

[23]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[25]  Richard Szeliski,et al.  Computer Vision - Algorithms and Applications , 2011, Texts in Computer Science.

[26]  Jean Ponce,et al.  A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Weilin Hou,et al.  Feature matching in underwater environments using sparse linear combinations , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[28]  Peter John Wood,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images , 2022 .

[29]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

[30]  Christos Faloutsos,et al.  Unsupervised modeling and recognition of object categories with combination of visual contents and geometric similarity links , 2008, MIR '08.

[31]  Leonidas J. Guibas,et al.  Persistence barcodes for shapes , 2004, SGP '04.

[32]  Leo Grady,et al.  Discrete Calculus - Applied Analysis on Graphs for Computational Science , 2010 .

[33]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[34]  Yanwen Guo,et al.  Exploiting feature correspondence constraints for image recognition , 2011, 2011 18th IEEE International Conference on Image Processing.

[35]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[36]  Richard I. Hartley,et al.  Minimal Solutions for Panoramic Stitching , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[37]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[38]  Valerio Pascucci,et al.  Topological feature extraction and tracking , 2007 .

[39]  Esa Rahtu,et al.  Object recognition and segmentation by non-rigid quasi-dense matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[40]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[41]  H. C. Longuet-Higgins,et al.  An algorithm for associating the features of two images , 1991, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[42]  Christoph H. Lampert,et al.  Efficient Subwindow Search: A Branch and Bound Framework for Object Localization , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[43]  R. Forman Morse Theory for Cell Complexes , 1998 .

[44]  Jan Flusser,et al.  Image registration methods: a survey , 2003, Image Vis. Comput..

[45]  Francesca Odone,et al.  SVD-matching using SIFT features , 2006, Graph. Model..

[46]  Yee-Hong Yang,et al.  Evaluation of constructable match cost measures for stereo correspondence using cluster ranking , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[47]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[48]  Hao Jiang,et al.  Scale and Rotation Invariant Matching Using Linearly Augmented Trees , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[49]  Long Quan,et al.  A quasi-dense approach to surface reconstruction from uncalibrated images , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[50]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[51]  Minsu Cho,et al.  Bilateral Symmetry Detection via Symmetry-Growing , 2009, BMVC.

[52]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[53]  Chen Wang,et al.  Common visual pattern discovery via directed graph model , 2011, 2011 18th IEEE International Conference on Image Processing.

[54]  Afra Zomorodian,et al.  Computational topology , 2010 .

[55]  B. Cyganek An Introduction to 3D Computer Vision Techniques and Algorithms , 2009 .

[56]  Herbert Edelsbrunner,et al.  Hierarchical morse complexes for piecewise linear 2-manifolds , 2001, SCG '01.

[57]  Frédéric Jurie,et al.  Sampling Strategies for Bag-of-Features Image Classification , 2006, ECCV.