Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
International Journal of Computer Vision
Erschienen in: International Journal of Computer Vision 1-2/2014

01.05.2014

An Interactive Approach to Solving Correspondence Problems

verfasst von: Stefanie Jegelka, Ashish Kapoor, Eric Horvitz

Erschienen in: International Journal of Computer Vision | Ausgabe 1-2/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.
Vorheriger Artikel Putting the User in the Loop for Image-Based Modeling
Nächster Artikel The SUN Attribute Database: Beyond Categories for Deeper Scene Understanding

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
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.CrossRefMATHMathSciNet
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).
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.CrossRefMATH
Goodrich, M., & Mitchell, J. (1999). Approximate geometric pattern matching under rigid motions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(4), 371–379.CrossRef
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.
Howard, R. (1967). Value of information lotteries. IEEE Transaction on Systems, Science and, Cybernetics, SSC–3(1), 54–60.CrossRef
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.CrossRef
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
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.
MacKay, D. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 589.CrossRef
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.
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.
Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32–38.CrossRefMATHMathSciNet
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).
Metadaten
Titel
An Interactive Approach to Solving Correspondence Problems
verfasst von
Stefanie Jegelka
Ashish Kapoor
Eric Horvitz
Publikationsdatum
01.05.2014
Verlag
Springer US
Erschienen in
International Journal of Computer Vision / Ausgabe 1-2/2014
Print ISSN: 0920-5691
Elektronische ISSN: 1573-1405
DOI
https://doi.org/10.1007/s11263-013-0657-5

Weitere Artikel der Ausgabe 1-2/2014

International Journal of Computer Vision 1-2/2014 Zur Ausgabe

OriginalPaper

Iterative Category Discovery via Multiple Kernel Metric Learning

OriginalPaper

Active Image Clustering with Pairwise Constraints from Humans

OriginalPaper

Collaborative Personalization of Image Enhancement

OriginalPaper

The Ignorant Led by the Blind: A Hybrid Human–Machine Vision System for Fine-Grained Categorization

EditorialNotes

Editorial: Special Issue on Active and Interactive Methods in Computer Vision

OriginalPaper

Putting the User in the Loop for Image-Based Modeling

Premium Partner

    Bildnachweise