Skip to main content

A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences

  • Conference paper
  • 1335 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9069))

Abstract

In this paper, we develop a hypergraph matching framework which enables feature correspondence refinement for multi-source images. For images obtained from different sources (e.g., RGB images and infrared images), we first extract feature points by using one feature extraction scheme. We then establish feature point correspondences in terms of feature similarities. In this scenario, mismatches tend to occur because the feature extraction scheme may exhibit certain ambiguity in characterizing feature similarities for multi-source images. To eliminate this ineffectiveness, we establish an association hypergraph based on the feature point correspondences, where one vertex represents a feature point pair resulted from the feature matching and one hyperedge reflects the higher-order structural similarity among feature point tuples. We then reject the mismatches by identifying outlier vertices of the hypergraph through higher order clustering. Our method is invariant to scale variation of objects because of its capability for characterizing higher order structure. Furthermore, our method is computationally more efficient than existing hypergraph matching methods because the feature matching heavily reduces the enumeration of possible point tuples for establishing hypergraph models. Experimental results show the effectiveness of our method for refining feature matching.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Besl, P.J., McKay, N.D.: A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14, 239–256 (1992)

    Article  Google Scholar 

  2. Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24, 509–522 (2002)

    Article  Google Scholar 

  3. Brown, M., Lowe, D.G.: Recognising panoramas. In: Internat. Conf. on Computer Vision (ICCV), vol. 2, pp. 1218–1225 (2003)

    Google Scholar 

  4. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision 2, 91–110 (2004)

    Article  Google Scholar 

  5. Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: SURF: speeded up robust features. Computer Vision and Image Understanding 110, 346–359 (2008)

    Article  Google Scholar 

  6. Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to SIFT or SURF. In: Internat. Conf. on Computer Vision (ICCV), pp. 2564–2571 (2011)

    Google Scholar 

  7. Yan, Q., Shen, X., Xu, L., Zhuo, S., Zhang, X., Shen, L., Jia, J.: Cross-field joint image restoration via scale map. In: Internat. Conf. on Computer Vision (ICCV), pp. 1537–1544 (2013)

    Google Scholar 

  8. Lowe, D.G.: Object Recognition from Local Scale-Invariant Features. In: Internat. Conf. on Computer Vision (ICCV), vol. 2, pp. 1150–1157 (1999)

    Google Scholar 

  9. Ren, P., Wilson, R.C., Hancock, E.R.: High Order Structural Matching Using Dominant Cluster Analysis. In: Maino, G., Foresti, G.L. (eds.) ICIAP 2011, Part I. LNCS, vol. 6978, pp. 1–8. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A Tensor-Based Algorithm for High-Order Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell. 33, 2383–2395 (2011)

    Article  Google Scholar 

  11. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. Int. J. Pattern Recognition and Artificial Intelligence 18, 265–298 (2004)

    Article  Google Scholar 

  12. Gong, M., Zhao, S., Jiao, L., Tian, D., Wang, S.: A novel coarse-to-fine scheme for automatic image registration based on SIFT and mutual information. IEEE Trans. Geoscience and Remote Sensing 52, 4328–4338 (2014)

    Article  Google Scholar 

  13. Lerman, G., Whitehouse, J.T.: On d-dimensional d-semimetrics and simplex-type inequalities for high-dimensional sine functions. J. Approximation Theory 156, 52–81 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to He Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, H., Du, B., Wang, Y., Ren, P. (2015). A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences. In: Liu, CL., Luo, B., Kropatsch, W., Cheng, J. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2015. Lecture Notes in Computer Science(), vol 9069. Springer, Cham. https://doi.org/10.1007/978-3-319-18224-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18224-7_11

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18223-0

  • Online ISBN: 978-3-319-18224-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics