Skip to main content

Optimization Techniques on Pixel Neighborhood Graphs for Image Processing

  • Conference paper

Part of the book series: Computing Supplement ((COMPUTING,volume 12))

Abstract

A class of image processing problems is considered from the standpoint of treating them as those of co-ordinating the local image-dependent information and a priori smoothness constraints. Such a generalized problem is set as the formal problem of minimization of a separable objective function defined on an appropriate pixel neighborhood graph. For attaining a higher computation speed, the full pixel lattice is replaced by a succession of partial identical neighborhood trees. Two versions of a high-speed minimization procedure are proposed for, respectively, discretely defined and quadratic objective functions.

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. Mottl, V. V., Muchnik, I. B., Blinov, A. B., Kopylov, A. V.: Hidden tree-like quasi-Markov model and generalized technique for a class of image processing problems. 13th International Conference on Pattern Recognition. Vienna, Austria, August 25–29, 1996. Track B, pp. 715–719.

    Google Scholar 

  2. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. PAMI 6, 721–741 (1984).

    Article  MATH  Google Scholar 

  3. Wu, C.-H., Doershuk, P. C.: Tree approximation to Markov random fields. IEEE Trans. Patt. Anal. Mach. Intel. 17, 391–402 (1995).

    Article  Google Scholar 

  4. Luettgen, M. R., Karl, W. C., Willsky, A. S., Tenney, R. R.: Multiscale representation of Markov random fields. IEEE Trans. Sign. Proc. 41, 3377–3396 (1993).

    Article  MATH  Google Scholar 

  5. Mottl, V. V., Kopylov, A. V., Blinov, A. B., Zheltov, S. Yu.: Quasi-statistical approach to the problem of stereo image matching. Proc. SPIE 2363, 50–61 (1994).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Wien

About this paper

Cite this paper

Mottl, V.V., Blinov, A.B., Kopylov, A.V., Kostin, A.A. (1998). Optimization Techniques on Pixel Neighborhood Graphs for Image Processing. In: Jolion, JM., Kropatsch, W.G. (eds) Graph Based Representations in Pattern Recognition. Computing Supplement, vol 12. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6487-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6487-7_14

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83121-2

  • Online ISBN: 978-3-7091-6487-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics