2016
DOI: 10.1109/jstars.2016.2540519
|View full text |Cite
|
Sign up to set email alerts
|

A Joint Markov Random Field Approach for SAR Interferogram Filtering and Unwrapping

Abstract: This paper presents a new integrated interferometric synthetic aperture radar (InSAR) phase filtering and unwrapping method based on a Markov random field (MRF) model. This approach aims to estimate a noiseless unwrapped phase from the observed noisy interferogram. The phase image is modeled using a joint MRF with a corresponding energy function related simultaneously to noise filtering and phase unwrapping (PU). This function contains two parts: the first is for interferogram filtering process and the second … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 40 publications
(82 reference statements)
0
5
0
Order By: Relevance
“…Various cost criteria f based on coherence and phase gradients have been discussed at length in the literature [23,24]. For efficiency, we choose the average coherence of three nodes in the edge as the cost element [25].…”
Section: B Lp Mathematical Framework In Modified Spumentioning
confidence: 99%
“…Various cost criteria f based on coherence and phase gradients have been discussed at length in the literature [23,24]. For efficiency, we choose the average coherence of three nodes in the edge as the cost element [25].…”
Section: B Lp Mathematical Framework In Modified Spumentioning
confidence: 99%
“…While ICM is relatively faster than simulated annealing, it can lock at a local minimum. In recent years, some studies have suggested the use of a genetic algorithm to minimize an energy function used for phase unwrapping problem, this is able to converge to a global minimum at a reasonable time [17,18]. In this article a genetic algorithm is used to minimize the cost function f (x) detailed below (Eq.…”
Section: Cost Functionmentioning
confidence: 99%
“…This function is minimized by a genetic algorithm. This algorithm is capable of converg-ing to a global minimum at a reasonable time [17,18].…”
Section: Introductionmentioning
confidence: 99%
“…However, its performance will be undermined when there are not enough homogeneous pixels in the neighborhood or heterogeneous pixels are included. After that, a complex Markov random field (CMRF) filter, which estimates the phase by minimizing the local energy function in the window, was proposed [11], [12]. To adapt to the changes of fringe pattern, Li et al proposed a variable window CMRF filter [13].…”
Section: Introductionmentioning
confidence: 99%