[1988 Proceedings] 9th International Conference on Pattern Recognition
DOI: 10.1109/icpr.1988.28466
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming approach for context classification using the Markov random field

Abstract: In this paper, we develop set of multispectral image context classification techniques which are based on a recursive algorithm for optimal estimation of the state of a two-dimensional discrete Markov Random Field.The three recursive algorithms are forms of dynamic programming. Because the estimation equations of the recursive algorithm are quite simple, the computation complexity of the approach is low. It is shown that recursive contextual classifications can improve classification performance, as compared t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Markov random field modeling is a powerful approach to representation and analysis of images, A variety of such models have been proposed and explored for specific image processing problems ( [7], [8], 111, and [SI). In this paper we represent an image by the addition of a coarsely discretized array of pixels (pixel-classes) and an array of Gaussian random field to compensate for the coarse discretization.…”
Section: Introductionmentioning
confidence: 99%
“…Markov random field modeling is a powerful approach to representation and analysis of images, A variety of such models have been proposed and explored for specific image processing problems ( [7], [8], 111, and [SI). In this paper we represent an image by the addition of a coarsely discretized array of pixels (pixel-classes) and an array of Gaussian random field to compensate for the coarse discretization.…”
Section: Introductionmentioning
confidence: 99%