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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. PAMI 6, 721–741 (1984).
Wu, C.-H., Doershuk, P. C.: Tree approximation to Markov random fields. IEEE Trans. Patt. Anal. Mach. Intel. 17, 391–402 (1995).
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).
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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