Skip to main content

Advertisement

SpringerLink
Log in

An Interactive Approach to Solving Correspondence Problems

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

Finding correspondences among objects in different images is a critical problem in computer vision. Even good correspondence procedures can fail, however, when faced with deformations, occlusions, and differences in lighting and zoom levels across images. We present a methodology for augmenting correspondence matching algorithms with a means for triaging the focus of attention and effort in assisting the automated matching. For guiding the mix of human and automated initiatives, we introduce a measure of the expected value of resolving correspondence uncertainties. We explore the value of the approach with experiments on benchmark data.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Caetano, T., McAuley, J., Cheng, L., Le, Q., & Smola, A. (2009). Learning graph matching. In IEEE Trans. on Pattern Analysis and Machine Intelligence (pp. 2349–2374).

  • Chegireddy, C. R., & Hamacher, H. W. (1987). Algorithms for finding \(k\)-best perfect matchings. Discrete Applied Mathematics, 18, 155–165.

    Article  MATH  MathSciNet  Google Scholar 

  • Chli, M., & Davison, A. J. (2008). Active matching. In European Conference on Computer Vision (ECCV) 2008, Part I. Lecture Note in Computer Science (Vol. 5302, pp. 72–85). Heidelberg: Springer.

  • Cho, Y., Lee, J., & Lee, K. M. (2010). Reweighted random walks for graph matching. In European Conference on Computer Vision (ECCV).

  • Chvatal, V. (1979). A greedy heuristic for the set covering problem. Math of Operations Research, 4(3), 233–235.

    Article  MATH  MathSciNet  Google Scholar 

  • Cour, T., Srinivasan, P., & Shi, J. (2006). Balanced graph matching. In Advances in Neural Information Processing Systems (NIPS).

  • Dasgupta, S. (2004). Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems (NIPS).

  • Debevec, P., Taylor, C., & Malik, J. (1996). Modeling and rendering architecture from photographs: A hybrid geometry- and image-based approach. In Computer Graphics SIGGRAPH 1996 Proceedings.

  • Duchenne, O., Bach, F., Kweon, I., & Ponce, J. (2009). A tensor-based algorithm for high-order graph matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Escolano, F., Hancock, E., & Lozano, M. (2011). Graph matching through entropic manifold alignment. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28(2—-3), 133–168.

    Article  MATH  Google Scholar 

  • Goodrich, M., & Mitchell, J. (1999). Approximate geometric pattern matching under rigid motions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(4), 371–379.

    Article  Google Scholar 

  • Handa, A., Chli, M., Strasdat, H., & Davison, A. J. (2010). Scalable active matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Heckerman, D., Horvitz, E., & Nathwani, B. N. (1992). Toward normative expert systems: Part i the pathfinder project. Methods of Information in Medicine, 31, 90–105.

    Google Scholar 

  • Howard, R. (1967). Value of information lotteries. IEEE Transaction on Systems, Science and, Cybernetics, SSC–3(1), 54–60.

    Article  Google Scholar 

  • Joshi, A. J., & Porikli, F. N. P. (2009). Multi-class active learning for image classification. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Kamar, E. , & Horvitz, E. (2013). A Monte-Carlo approach to computing value of information: Procedure and experiments. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).

  • Kamar, E., Hacker, S., & Horvitz, E. (2012). Combining human and machine intelligence in large-scale crowdsourcing. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).

  • Kapoor, A., Horvitz, E., & Basu, S. (2007). Selective supervision: Guiding supervised learning with decision-theoretic active learning. In International Joint Conference on Artificial Intelligence.

  • Kapoor, A., Grauman, K., Urtasun, R., & Darrell, T. (2009). Gaussian processes for object categorization. International Journal of Computer Vision, 88(2), 169–188.

    Article  Google Scholar 

  • Kowdle, A., Chang, Y., Gallagher, A., & Chen, T. (2011). In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Krause, A., Singh, A., & Guestrin, C. (2008). Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9, 235–284.

    MATH  Google Scholar 

  • Lawrence, N., Seeger, M., Herbrich, R. (2002). Fast sparse Gaussian process method: Informative vector machines. In Advances in Neural Information Processing Systems (NIPS) (Vol. 15). Cambridge: MIT Press

  • Lee, J., Cho, M., & Lee, K. (2011). Hyper-graph matching via reweighted random walks. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Lordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. In International Conference on Computer Vision (ICCV).

  • Lovász, L. (1993). Random walks on graphs: a survey. Combinatorics: Paul Erdös is Eighty, 2, 1–46.

    Google Scholar 

  • MacKay, D. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 589.

    Article  Google Scholar 

  • Maji, S., Shakhnarovich, G. (2012). Part annotations via pairwise correspondence. In 4th Workshop on Human Computation, AAAI.

  • Mateus, D., Horaud, R., Knossow, D., Cuzzolin, F., & Boyer, E. (2008). Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • McAuley, J., & Caetano, T. (2012). Fast matching of large point sets under occlusion. Pattern recognition, 45, 563–569.

    Google Scholar 

  • McAuley, J., Caetano, T., & Barbosa, M. S. (2008). Graph rigidity, cyclic belief propagation and point pattern matching. In IEEE Trans. on Pattern Analysis and Machine Intelligence, 30(11), 2047–2054.

    Google Scholar 

  • Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32–38.

    Article  MATH  MathSciNet  Google Scholar 

  • Sharma, A., Horaud, R. P., Cech, J., & Boyer, E. (2011). Topologically-robust 3d shape matching based on diffusion geometry and seed growing. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • Starck, J., & Hilton, A. (2007). Correspondence labelling for wide-timeframe free-form surface matching. In International Conference on Computer Vision (ICCV).

  • Tong, S., & Koller, D. (2000). Support vector machine active learning with applications to text classification. In International Conference on Machine Learning (ICML).

  • Torresani, L., & Kolmogorov, V. (2008). Rother, C. Feature correspondence via graph matching: Models and global optimization. In European Conference on Computer Vision (ECCV).

  • Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. In IEEE Trans. on Pattern Analysis and Machine Intelligence, 10(5), 695–703.

  • Vijayanarasimhan, S. (2011). Active visual category learning. PhD Thesis, UT Austin.

  • Vijayanarasimhan, S., & Kapoor, A. (2010). Visual recognition and detection under bounded computational resources. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

  • von Ahn, L., & Dabbish, L. (2004). Labeling images with a computer game. In CHI: SIGCHI Conference on Human Factors in Computing Systems. New York: ACM.

  • Zass, R., & Shashua, A. (2008). Probabilistic graph and hypergraph matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

Download references

Author information

Authors and Affiliations

  1. UC Berkeley, Berkeley, CA, USA

    Stefanie Jegelka

  2. Microsoft Research Redmond, Redmond, WA, USA

    Ashish Kapoor & Eric Horvitz

Authors
  1. Stefanie Jegelka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashish Kapoor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric Horvitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefanie Jegelka.

Additional information

Work done during an internship of S.J. at Microsoft Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jegelka, S., Kapoor, A. & Horvitz, E. An Interactive Approach to Solving Correspondence Problems. Int J Comput Vis 108, 49–58 (2014). https://doi.org/10.1007/s11263-013-0657-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11263-013-0657-5

Keywords

Search

Navigation