1989
DOI: 10.1109/31.90410
|View full text |Cite
|
Sign up to set email alerts
|

Restoration of noisy images modeled by Markov random fields with Gibbs distribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1991
1991
2012
2012

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Instead we can use the local dependencies between bits to do a local optimization along the lines of the PDFE in [9], [10] or the partial binary segmentation algorithm of [12]. It is apparent that when V(x) is expressed as in (15), we can always choose the value of x i so that each term in the sum becomes positive, and thus the sum is non-decreasing.…”
Section: Optimization Of V(x)mentioning
confidence: 99%
See 1 more Smart Citation
“…Instead we can use the local dependencies between bits to do a local optimization along the lines of the PDFE in [9], [10] or the partial binary segmentation algorithm of [12]. It is apparent that when V(x) is expressed as in (15), we can always choose the value of x i so that each term in the sum becomes positive, and thus the sum is non-decreasing.…”
Section: Optimization Of V(x)mentioning
confidence: 99%
“…In this paper, we will study systems where the information is disrupted by two dimensional bursts or clusters of bidirectional errors. Using techniques known from statistical physics [13] and digital image processing [12] combined with an iterative decoder, we develop a new method for correcting two dimensional cluster errors.…”
Section: Introductionmentioning
confidence: 99%
“…Instead we can use the local dependencies between bits to do a local optimization along the lines of the PDFE in Neifeld & King (1998);Neifield et al (1996) or the partial binary segmentation algorithm of Shridhar et al (1989). It is apparent that when V (x) is expressed as in (14), we can always choose the value of x i so that each term in the sum becomes positive, and thus the sum is non-decreasing.…”
Section: Optimization Of V (X)mentioning
confidence: 99%
“…One technique for describing such properties is the use of Markov random field theory which uses conditional probabilities to describe spatial dependencies in an n-dimensional system. This approach is based on the results of Shridhar, Ahmadi and El-Gabali who developed the applied techniques in Shridhar et al (1989), El-Gabali et al (1987), El-Gabali et al (1988) and El-Gabali et al (1990) but similar techniques are also presented in Geman & Geman (1993), Zhang (1993), Jeng & Woods (1991) and Chalmond (1988). The basis for all of these image restoration techniques is that simulated annealing is used to produce an estimate of the maximum a posteriori probability of the original image and the techniques has been extensively used for different purposes within the field of image processing, including image restoration, image segmentation, object identification and texture analysis.…”
Section: General Overview Over Relevant Image Restoration Techniquesmentioning
confidence: 99%
See 1 more Smart Citation