Skip to main content

Improving the Correspondence Establishment Based on Interactive Homography Estimation

  • Conference paper
Computer Analysis of Images and Patterns (CAIP 2013)

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

Included in the following conference series:

Abstract

We present a method to find the correspondences between salient points of images in which an oracle can interact and influence on the final correspondences between points. The oracle looks up the current point correspondences and imposes new mappings or modifies some of them. This interaction influences on two aspects. On one hand, a new homography is computed such that the Least Square Error is minimized on the imposed correspondences. On the other hand, the Similarity Matrix between the set of points is modified and so, the interaction influences on the output of the Correspondence Algorithm. The method is independent of the algorithm to compute the homography and the correspondences. Practical evaluation shows that in few interactions of the oracle, the optimal correspondence is achieved.

This research is supported by the CICYT project DPI 2010-17112.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Trevai, C., Fukazawa, Y., Ota, J., Yuasa, H., Arai, T., Asama, H.: Cooperative exploration of mobile robots using reaction-diffusion equation on a graph. In: IEEE International Conference on Robotics and Automation, vol. 2 (2003)

    Google Scholar 

  2. Casper, J., Murphy, R.R.: Human–robot interactions during the robot-assisted urban search and rescue response at the world trade centre. IEEE Transactions on Systems, Man, and Cybernetics, Part B 33, 367–385 (2003)

    Article  Google Scholar 

  3. Garrell, A., Sanfeliu, A.: Cooperative social robots to accompany groups of people. International Journal of Robotics Research 31(13), 1675–1701 (2012)

    Article  Google Scholar 

  4. Xu, M., Petrou, M.: 3D Scene interpretation by combining probability theory and logic: The tower of knowledge. Computer Vision and Image Understanding 115(11), 1581–1596 (2011)

    Article  Google Scholar 

  5. Tomasi, C., Kanade, T.: Detection and tracking of point features., Tech. Rep. CMUCS-91-132, Carnegie Mellon University (1991)

    Google Scholar 

  6. Han, W., Brady, M.: Real-time corner detection algorithm for motion estimation. In: Image and Vision Computing, pp. 695–703 (2005)

    Google Scholar 

  7. Rosten, E., Drummond, T.W.: Machine learning for high-speed corner detection. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006, Part I. LNCS, vol. 3951, pp. 430–443. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1615–1630 (2005)

    Article  Google Scholar 

  9. Zhang, Z.: Iterative point matching for registration of free-form curves and surfaces. Int. J. Comput. Vision 13(2), 119–152 (1994)

    Article  Google Scholar 

  10. Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381–395 (1981)

    Article  MathSciNet  Google Scholar 

  11. Sanromà, G., Alquézar, R., Serratosa, F., Herrera, B.: Smooth Point-set Registration using Neighbouring Constraints. Pattern Recognition Letters 33, 2029–2037 (2012)

    Article  Google Scholar 

  12. Sanromà, G., Alquézar, R., Serratosa, F.: A New Graph Matching Method for Point-Set Correspondence using the EM Algorithm and Softassign. Computer Vision and Image Understanding 116(2), 292–304 (2012)

    Article  Google Scholar 

  13. Villamizar, M., Andrade-Cetto, J., Sanfeliu, A., Moreno-Noguer, F.: Bootstrapping Boosted Random Ferns for discriminative and efficient object classification. Pattern Recognition 45(9), 3141–3153 (2012)

    Article  Google Scholar 

  14. Pedhazur, E.J.: Multiple regression in behavioral research: Explanation and prediction, 2nd edn. Holt, Rinehart and Winston, New York (1982) ISBN 0-03-041760-0

    Google Scholar 

  15. Bunch, J.R., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation 28, 231–236 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  16. Harris, C., Stephens, M.: A combined corner and edge detector. In: Proceedings of the 4th Alvey Vision Conference, pp. 147–151 (1988)

    Google Scholar 

  17. Lowe, D.: Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision 60(2), 91 (2004)

    Article  Google Scholar 

  18. Lindeberg, T.: Feature detection with automatic scale selection. International Journal of Computer Vision 30(2) (1998)

    Google Scholar 

  19. Mikolajczyk, K., Schmid, C.: Scale and affine invariant interest point detectors (PDF). International Journal of Computer Vision 60(1), 63–86 (2004)

    Article  Google Scholar 

  20. Zhang, Z.: Iterative point matching for registration of free-form curves and surfaces, pp. 119–152 (1992)

    Google Scholar 

  21. Kuhn, H.W.: The Hungarian method for the assignment problem Export. Naval Research Logistics Quarterly 2(1-2), 83–97 (1955)

    Article  MathSciNet  Google Scholar 

  22. Serratosa, F., Cortés, X., Solé-Ribalta, A.: Interactive graph matching by means of imposing the pairwise costs. In: ICPR 2012, pp. 1298–1301 (2012)

    Google Scholar 

  23. http://deim.urv.cat/~francesc.serratosa/databases/

  24. Caetano, T.S., Caelli, T., Schuurmans, D., Barone, D.A.C.: Graphical Models and Point Pattern Matching. IEEE Trans. on PAMI 28(10), 1646–1663 (2006)

    Article  Google Scholar 

  25. Jesorsky, O., Kirchberg, K.J., Frischholz, R.W.: Robust Face Detection Using the Hausdorff Distance. In: Bigun, J., Smeraldi, F. (eds.) AVBPA 2001. LNCS, vol. 2091, pp. 90–95. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  26. Cortés, X., Serratosa, F.: Active-Learning Query Strategies applied to select a Graph Node given a Graph Labelling. In: GbR 2013, Austria, Vienna, pp. 61–70 (2013)

    Google Scholar 

  27. Cortés, X., Serratosa, F., Solé, A.: Active Graph Matching based on Pairwise Probabilities between nodes. In: SSPR 2012, Hiroshima, Japan, pp. 98–106 (2012)

    Google Scholar 

  28. Serratosa, F., Alquézar, R., Amézquita, N.: A Probabilistic Integrated Object Recognition and Tracking Framework. Expert Systems With Applications 39, 7302–7318 (2012)

    Article  Google Scholar 

  29. Serratosa, F., Cortés, X., Solé, A.: Component Retrieval based on a Database of Graphs for Hand-Written Electronic-Scheme Digitalisation, ESWA 40, pp. 2493–2502 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cortés, X., Moreno, C., Serratosa, F. (2013). Improving the Correspondence Establishment Based on Interactive Homography Estimation. In: Wilson, R., Hancock, E., Bors, A., Smith, W. (eds) Computer Analysis of Images and Patterns. CAIP 2013. Lecture Notes in Computer Science, vol 8048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40246-3_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40246-3_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40245-6

  • Online ISBN: 978-3-642-40246-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics