Advertisement

International Journal of Computer Vision

, Volume 1, Issue 2, pp 133–144 | Cite as

Signal matching through scale space

  • Andrew Witkin
  • Demetri Terzopoulos
  • Michael Kass
Article

Abstract

Given a collection of similar signals that have been deformed with respect to each other, the general signal-matching problem is to recover the deformation. We formulate the problem as the minimization of an energy measure that combines a smoothness term and a similarity term. The minimization reduces to a dynamic system governed by a set of coupled, first-order differential equations. The dynamic system finds an optimal solution at a coarse scale and then tracks it continuously to a fine scale. Among the major themes in recent work on visual signal matching have been the notions of matching as constrained optimization, of variational surface reconstruction, and of coarse-to-fine matching. Our solution captures these in a precise, succinct, and unified form. Results are presented for one-dimensional signals, a motion sequence, and a stereo pair.

Keywords

Dynamic System Computer Vision Computer Image Fine Scale Similar Signal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Witkin, “Scale Space Filtering,” in PROC. INT. JOINT CONF. ARTIF. INTELL., Karlsruhe, FRG, 1983, pp. 1019–1021.Google Scholar
  2. 2.
    L.R. Rabiner and R.W. Schafer, DIGITAL PROCESSING OF SPEECH SIGNALS. Prentice-Hall: Englewood Cliffs, NJ, 1978.Google Scholar
  3. 3.
    D. Sankoff and J.B. Kruskal (eds.), TIME WARPS, STRING EDITS AND MACROMOLECULES: THE THEORY AND PRACTICE OF SEQUENCE COMPARISON. Addison-Wesley: Reading, MA, 1983.Google Scholar
  4. 4.
    W.E.L. Grimson, “An implementation of a computational theory of visual surface interpolation,” COMPUT. VISION, GRAPHICS, IMAGE PROCESSING vol. 22, pp. 39–69, 1983.Google Scholar
  5. 5.
    D. Terzopoulos, “Multilevel computational processes for visual surface reconstruction,” COMPUT. VISION, GRAPHICS, IMAGE PROCESSING vol. 24 pp. 52–96, 1983.Google Scholar
  6. 6.
    D. Terzopoulos, “The role of constraints and discontinuities in visible-surface reconstruction,” in PROC. 8TH INT. JOINT CONF. ARTIF. INTELL., Karlsruhe, FRG, 1983, pp. 1073–1077.Google Scholar
  7. 7.
    D. Terzopoulos, “Regularization of inverse visual problems involving discontinuities,” IEEE TRANS. PAMI vol. PAMI-8, pp. 413–424, 1986.Google Scholar
  8. 8.
    C. Broit, “Optimal registration of deformed images,” PhD thesis, Computer and Information Science Department, University of Pennsylvania, Philadelphia, PA, 1981.Google Scholar
  9. 9.
    M.A. Fischler, and R.A. Elschlager, “The representation and matching of pictorial structures,” IEEE TRANS. COMPUT. vol. C-22, pp. 67–92, 1973.Google Scholar
  10. 10.
    D.J. Burr, “A dynamic model for image registration,” COMPUT. GRAPHICS IMAGE PROCESSING vol. 15, pp. 102–112, 1981.Google Scholar
  11. 11.
    B.K.P. Horn, ROBOT VISION. M.I.T. Press: Cambridge, MA, 1986.Google Scholar
  12. 12.
    T. Poggio, V. Torre, and C. Koch, “Computational vision and regularization theory,” NATURE vol. 317, pp. 314–319, 1985.Google Scholar
  13. 13.
    J.L. Marroquin, “Probabilistic solution of inverse problems,” M.I.T. Artif. Intell. Lab., Cambridge, MA, A.I.-TR 860, 1985.Google Scholar
  14. 14.
    S.T. Barnard, “A stochastic approach to stereo vision,” in PROC. NATL. CONF. ARTIF. INTELL. AAAI-86, Philadelphia, PA, 1976, pp. 676–680.Google Scholar
  15. 15.
    K. Mori, M. Kidodi, and H. Asada, “An iterative prediction and correction method for automatic stereo comparison,” COMPUT. GRAPHICS IMAGE PROCESSING vol. 2, pp. 393–401, 1973.Google Scholar
  16. 16.
    M.J. Hannah, “Computer matching of areas in stereo images,” Stanford Artif. Intell. Lab., A.I. Memo. AIM-239, July 1974.Google Scholar
  17. 17.
    H.P. Moravec, “Towards automatic visual obstacle avoidance,” in PROC. FIFTH INT. JOINT CONF. ARTIF. INTELL. Cambridge, MA. 1977, p. 584.Google Scholar
  18. 18.
    D. Marr and T. Poggio, “A theory of human stereo vision,” PROC. R. SOC. LOND. [B] vol. 204, pp. 301–328, 1979.Google Scholar
  19. 19.
    D.B. Gennery, “Modeling the environment of an exploring vehicle by means of stereo vision,” PhD thesis, Stanford Artif. Intell. Lab., A.I. Memo. 339, 1980.Google Scholar
  20. 20.
    20.L.H. Quam, “Hierarchical warp stereo,” in PROC. IMAGE UNDERSTANDING WORKSHOP, New Orleans, LA, October 1984, pp. 149–155.Google Scholar
  21. 21.
    N.S. Bakhvalov, NUMERICAL METHODS. Mir: Moscow, 1977.Google Scholar
  22. 22.
    G. Dahlquist and A. Björck, NUMERICAL METHODS, N. Anderson (trans.). Prentice-Hall: Englewood Cliffs, NJ, 1974.Google Scholar

Copyright information

© Kluwer Academic Publishers 1987

Authors and Affiliations

  • Andrew Witkin
    • 1
  • Demetri Terzopoulos
    • 1
  • Michael Kass
    • 1
  1. 1.Schlumberger Palo Alto ResearchPalo AltoUSA

Personalised recommendations