Visual reconstruction
Constrained Restoration and the Recovery of Discontinuities
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
The use of the L-curve in the regularization of discrete ill-posed problems
SIAM Journal on Scientific Computing
Oscillating Patterns in Image Processing and Nonlinear Evolution Equations: The Fifteenth Dean Jacqueline B. Lewis Memorial Lectures
The triangle method for finding the corner of the L-curve
Applied Numerical Mathematics
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Variational Approach to Remove Outliers and Impulse Noise
Journal of Mathematical Imaging and Vision
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Mathematical Imaging and Vision
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
Journal of Mathematical Imaging and Vision
An adaptive pruning algorithm for the discrete L-curve criterion
Journal of Computational and Applied Mathematics - Special issue: Applied computational inverse problems
A vectorial self-dual morphological filter based on total variation minimization
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Total variation minimization and a class of binary MRF models
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Exact optimization for Markov random fields with convex priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximate maximum likelihood hyperparameter estimation for Gibbs priors
IEEE Transactions on Image Processing
Multiscale MAP filtering of SAR images
IEEE Transactions on Image Processing
Image restoration subject to a total variation constraint
IEEE Transactions on Image Processing
Phase Unwrapping via Graph Cuts
IEEE Transactions on Image Processing
Iterative weighted maximum likelihood denoising with probabilistic patch-based weights
IEEE Transactions on Image Processing
Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients
Journal of Mathematical Imaging and Vision
A new similarity measure for nonlocal filtering in the presence of multiplicative noise
Computational Statistics & Data Analysis
Review article: Multilabel partition moves for MRF optimization
Image and Vision Computing
Hi-index | 0.01 |
Synthetic aperture radar (SAR) images, like other coherent imaging modalities, suffer from speckle noise. The presence of this noise makes the automatic interpretation of images a challenging task and noise reduction is often a prerequisite for successful use of classical image processing algorithms. Numerous approaches have been proposed to filter speckle noise. Markov random field (MRF) modelization provides a convenient way to express both data fidelity constraints and desirable properties of the filtered image. In this context, total variation minimization has been extensively used to constrain the oscillations in the regularized image while preserving its edges. Speckle noise follows heavy-tailed distributions, and the MRF formulation leads to a minimization problem involving nonconvex log-likelihood terms. Such a minimization can be performed efficiently by computing minimum cuts on weighted graphs. Due to memory constraints, exact minimization, although theoretically possible, is not achievable on large images required by remote sensing applications. The computational burden of the state-of-the-art algorithm for approximate minimization (namely the -expansion) is too heavy specially when considering joint regularization of several images. We show that a satisfying solution can be reached, in few iterations, by performing a graph-cut-based combinatorial exploration of large trial moves. This algorithm is applied to joint regularization of the amplitude and interferometric phase in urban area SAR images.