Yves Meyer’s models for image decomposition and computational approaches Luminita Vese Department of Mathematics, UCLA Triet Le (Yale University), Linh.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Istituto per le Applicazioni del Calcolo "M. Picone" Multigrid Computation for Variational Image Segmentation Problems: Euler equations and approximation.
Professor Horst Cerjak, Thomas Pock A Duality Based Approach for Realtime TV-L 1 Optical Flow ICG A Duality Based Approach for Realtime TV-L.
A Transform-based Variational Framework Guy Gilboa Pixel Club, November, 2013.
Johann Radon Institute for Computational and Applied Mathematics: 1/25 Signal- und Bildverarbeitung, Image Analysis and Processing.
Improving resolution and depth of astronomical observations (via modern mathematical methods for image analysis) M. Castellano, D. Ottaviani, A. Fontana,
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Edge Preserving Image Restoration using L1 norm
L1 sparse reconstruction of sharp point set surfaces
TVL1 Models for Imaging: Global Optimization & Geometric Properties Part I Tony F. Chan Math Dept, UCLA S. Esedoglu Math Dept, Univ. Michigan Other Collaborators:
Bregman Iterative Algorithms for L1 Minimization with
SVM - Support Vector Machines A new classification method for both linear and nonlinear data It uses a nonlinear mapping to transform the original training.
MRI Brain Extraction using a Graph Cut based Active Contour Model Noha Youssry El-Zehiry Noha Youssry El-Zehiry and Adel S. Elmaghraby Computer Engineering.
MMSE Estimation for Sparse Representation Modeling
Joint work with Irad Yavneh
1 Low-Dose Dual-Energy CT for PET Attenuation Correction with Statistical Sinogram Restoration Joonki Noh, Jeffrey A. Fessler EECS Department, The University.
Sparse Approximation by Wavelet Frames and Applications
Variational Pairing of Image Segmentation and Blind Restoration Leah Bar Nir Sochen* Nahum Kiryati School of Electrical Engineering *Dept. of Applied Mathematics.
2013 SIAM Great Lakes Section From PDEs to Information Science and Back Russel Caflisch IPAM Mathematics Department, UCLA 1.
Introduction to Variational Methods and Applications
Martin Burger Total Variation 1 Cetraro, September 2008 Variational Methods and their Analysis Questions: - Existence - Uniqueness - Optimality conditions.
IMI HARMONIC ANALYSIS OF BV Ronald A. DeVore Industrial Mathematics Institute Department of Mathematics University of South Carolina HARMONIC ANALYSIS.
Extensions of wavelets
Steepest Decent and Conjugate Gradients (CG). Solving of the linear equation system.
ECE 472/572 - Digital Image Processing Lecture 8 - Image Restoration – Linear, Position-Invariant Degradations 10/10/11.
SRINKAGE FOR REDUNDANT REPRESENTATIONS ? Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000, Israel.
Prénom Nom Document Analysis: Linear Discrimination Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Image Denoising via Learned Dictionaries and Sparse Representations
Variational Image Restoration Leah Bar PhD. thesis supervised by: Prof. Nahum Kiryati and Dr. Nir Sochen* School of Electrical Engineering *Department.
Over-Complete & Sparse Representations for Image Decomposition and Inpainting Michael Elad The Computer Science Department The Technion – Israel Institute.
1 Total variation minimization Numerical Analysis, Error Estimation, and Extensions Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods Numerical.
1 Regularization with Singular Energies: Error Estimation and Numerics Martin Burger Institut für Numerische und Angewandte Mathematik Westfälische Wilhelms.
Error Estimation in TV Imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging (EIMI) Center.
Reformulated - SVR as a Constrained Minimization Problem subject to n+1+2m variables and 2m constrains minimization problem Enlarge the problem size and.
Simultaneous Structure and Texture Image Inpainting by: Bertalmio, Sapiro, Vese, Osher Presented by: Shane Brennan June 7, 2007 EE 264 – Spring 2007.
Background vs. foreground segmentation of video sequences = +
Support Vector Machines
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Recent Trends in Signal Representations and Their Role in Image Processing Michael Elad The CS Department The Technion – Israel Institute of technology.
Optical Flow Estimation using Variational Techniques Darya Frolova.
Image Decomposition and Inpainting By Sparse & Redundant Representations Michael Elad The Computer Science Department The Technion – Israel Institute of.
Sparse Representations of Signals: Theory and Applications *
1 Regularisierung mir Singulären Energien Martin Burger Institut für Numerische und Angewandte Mathematik Westfälische Wilhelms Universität Münster
Lecture 10: Support Vector Machines
Martin Burger Total Variation 1 Cetraro, September 2008 Numerical Schemes Wrap up approximate formulations of subgradient relation.
EE565 Advanced Image Processing Copyright Xin Li Different Frameworks for Image Processing Statistical/Stochastic Models: Wiener’s MMSE estimation.
Over-Complete & Sparse Representations for Image Decomposition*
Unitary Extension Principle: Ten Years After Zuowei Shen Department of Mathematics National University of Singapore.
Motivation from Real-World Applications EE565 Advanced Image Processing Copyright Xin Li Noisy Photos Noisy ultrasound data.
Adaptive Regularization of the NL-Means : Application to Image and Video Denoising IEEE TRANSACTION ON IMAGE PROCESSING , VOL , 23 , NO,8 , AUGUST 2014.
PDE-based Methods for Image and Shape Processing Applications Alexander Belyaev School of Engineering & Physical Sciences Heriot-Watt University, Edinburgh.
Nonlinear least squares Given m data points (t i, y i ) i=1,2,…m, we wish to find a vector x of n parameters that gives a best fit in the least squares.
Total Variation and Euler's Elastica for Supervised Learning
Probabilistic Graphical Models
Eran Treister and Irad Yavneh Computer Science, Technion (with thanks to Michael Elad)
Parametric Max-Flow Algorithms for Total Variation Minimization W.Yin (Rice University) joint with D.Goldfarb (Columbia), Y.Zhang (Rice), Y.Wang (Rice)
1 Lecture #4 Calculus of Variation and Euler-Lagrange Equation Lecture #4 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
Image Decomposition, Inpainting, and Impulse Noise Removal by Sparse & Redundant Representations Michael Elad The Computer Science Department The Technion.
Mathematical Analysis of MaxEnt for Mixed Pixel Decomposition
October 31, 2006Thesis Defense, UTK1/30 Variational and Partial Differential Equation Models for Color Image Denoising and Their Numerical Approximation.
Introduction to Medical Imaging Week 6: Introduction to Medical Imaging Week 6: Denoising (part II) – Variational Methods and Evolutions Guy Gilboa Course.
L ECTURE 3 PDE Methods for Image Restoration. O VERVIEW Generic 2 nd order nonlinear evolution PDE Classification: Forward parabolic (smoothing): heat.
Lecture 16: Image alignment
Multiscale Likelihood Analysis and Inverse Problems in Imaging
PDE Methods for Image Restoration
Multiplicative updates for L1-regularized regression
Optimal sparse representations in general overcomplete bases
Presentation transcript:

Yves Meyer’s models for image decomposition and computational approaches Luminita Vese Department of Mathematics, UCLA Triet Le (Yale University), Linh Lieu (UC Davis), John Garnett (UCLA), Yves Meyer (CMLA E.N.S. Cachan) Mathematics and Image Analysis 2006 Supported by NSF, NIH, Sloan Foundation

Problem

Examples of image decompositions f = u + v I: Image denoising u = true image, v = additive noise of zero mean = + f u v

II: Cartoon + texture u = cartoon, v = texture = + f

III: Structure + clutter decomposition (Zhu-Mumford ’97) f = u + v, u = buildings, v = trees f u f u Applications: image restoration, image inpainting, separation of scales, image simplification, etc

Starting point: canonical variational models for image restoration f = u + noise References: Geman-Geman, Blake-Zisserman, Mumford-Shah, Geman-McClure, Geman-Reynolds, Rudin-Osher-Fatemi, Osher-Lions-Rudin, Acar-Vogel, Shah, Chambolle-Lions, Nikolova, Vese, Mumford-Zhu, Shah-Braides, etc

Particular case: total variation minimization Rudin-Osher-Fatemi model for restoration ‘92 Equivalent decomposition model formulation

An explicit ROF decomposition f = u + v (Y. Meyer) Remark (drawback of the model): The model can be improved by some refinements Explicit solutions: Meyer, Chan-Strong, Caselles et al.

TV model (ROF) f = u + v We see the square in the residual v. The model always decreases too much the total variation of u

Thus the residual v = f - u could be expressed as Therefore, the residual v could be characterized by another norm, instead of the norm. Remark about ROF model

Cartoon + Texture Decomposition, Y. Meyer ‘01 Y. Meyer suggested a program where weaker norms are used instead of for the oscillatory component v, while keeping u in BV: where the *-norm is the norm in one of the following spaces:

More motivations and remarks

First approximations to Meyer’s (BV,G) model Difficulty: how to solve these models in practice ? There is no simple derivation of the Euler-Lagrange equation For p=2, we can obtain an exact decomposition f=u+v, with u in BV and v in Osher – Solé - Vese, ‘02 Vese - Osher, ’02 (talk at MIA 2002)

Related work - Aujol, Aubert, Blanc-Feraud, Chambolle (G) - Aujol-Aubert (G, theory), Aujol, Chambolle (duality, E) - Elad, Starck, Donoho (curvelets) - Daubechies-Teschke (wavelets) - Scherzer (G-norms and taut string methods) - Ali Haddad, Yves Meyer, Jerome Gilles - Osher-Goldfarb-Yin (SOCP), Osher-Kindermann-Xu - Levine (duality), - Le-V (F), Lieu-V, Schnor, (for restoration Malgouyres)

(BV, G) Le, Lieu and Vese (2005) (BV, F) Le and Vese (2005) (BV, E) Le, Garnett, Meyer and Vese (2005) Some computational approaches to Oscillatory component v expressed by

(BV,G) decomposition model (Le, Lieu, Vese) Remark: (see also Caselles et al.)

Denoising, deblurring, cartoon + texture separation. Minimization algorithm:

f = cartoon + texture Decomposition into cartoon & texture Deblurring Original Blurred Restored Denoising Original Noisy f Restored Residual

Original Noisy Denoised Remark: Dual general functional model

(BV, F) decomposition (Le, Vese) F = div(BMO), where

Numerical computation of the BMO norm Optimization with an artificial time t and gradient ascent.

Computation of BMO norm for synthetic image Numerical maximization process to obtain optimal square Result as in theory Optimal square Q “Energy” versus iterations

(BV,F) algorithm (main iteration) Standard energy minimization problem (we can compute the Euler-Lagrange equation directly)

Theoretical results - existence of minimizers for (BV,F), (BV,G) models - existence (and uniqueness) for our approximations to (BV,F) model - convergence of our approximate model to the (BV,F) model - we no longer have the drawback of ROF (of decreasing too much the TV ) - characterization of minimizers by dual texture norm

(BV, F)

(BV,L2) Rudin-Osher- Fatemi RMSE:

(BV,F) RMSE:

A more isotropic v - Mathematically almost equivalent - Numerically better and fewer unknowns f v u

(BV,E) decomposition model (Le, Garnett, Meyer, Vese) We use kernel formulation to define Besov spaces Standard approach: wavelets to define the equivalent norm