New Results in Image Processing based on Sparse and Redundant Representations Michael Elad The Computer Science Department The Technion – Israel Institute.

Slides:



Advertisements
Similar presentations
MMSE Estimation for Sparse Representation Modeling
Advertisements

Joint work with Irad Yavneh
Learning Measurement Matrices for Redundant Dictionaries Richard Baraniuk Rice University Chinmay Hegde MIT Aswin Sankaranarayanan CMU.
K-SVD Dictionary-Learning for Analysis Sparse Models
Discriminative Approach for Transform Based Image Restoration
Learning sparse representations to restore, classify, and sense images and videos Guillermo Sapiro University of Minnesota Supported by NSF, NGA, NIH,
Extensions of wavelets
* * Joint work with Michal Aharon Freddy Bruckstein Michael Elad
1 Micha Feigin, Danny Feldman, Nir Sochen
Ilias Theodorakopoulos PhD Candidate
Image Processing Via Pixel Permutations 1 Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000, Israel.
* *Joint work with Idan Ram Israel Cohen
1 Active Random Fields Adrian Barbu. FSU 2 The MAP Estimation Problem Estimation problem: Given input data y, solve Example: Image denoising Given noisy.
Sparse & Redundant Signal Representation, and its Role in Image Processing Michael Elad The CS Department The Technion – Israel Institute of technology.
Dictionary-Learning for the Analysis Sparse Model Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000,
Image Super-Resolution Using Sparse Representation By: Michael Elad Single Image Super-Resolution Using Sparse Representation Michael Elad The Computer.
Advanced Topics in Signal and Image Processing: Sparse & Redundant Representations CS Course – Winter 2011 Michael Elad The Computer Science Department.
Oriented Wavelet 國立交通大學電子工程學系 陳奕安 Outline Background Background Beyond Wavelet Beyond Wavelet Simulation Result Simulation Result Conclusion.
Sparse and Overcomplete Data Representation
SRINKAGE FOR REDUNDANT REPRESENTATIONS ? Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000, Israel.
Application of Generalized Representations for Image Compression Application of Generalized Representations for Image Compression using Vector Quantization.
Mathematics and Image Analysis, MIA'06
1 Preprocessing for JPEG Compression Elad Davidson & Lilach Schwartz Project Supervisor: Ari Shenhar SPRING 2000 TECHNION - ISRAEL INSTITUTE of TECHNOLOGY.
Image Denoising via Learned Dictionaries and Sparse Representations
Image Denoising and Beyond via Learned Dictionaries and Sparse Representations Michael Elad The Computer Science Department The Technion – Israel Institute.
An Introduction to Sparse Representation and the K-SVD Algorithm
Optimized Projection Directions for Compressed Sensing Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa.
Image Denoising with K-SVD Priyam Chatterjee EE 264 – Image Processing & Reconstruction Instructor : Prof. Peyman Milanfar Spring 2007.
* *Joint work with Ron Rubinstein Tomer Faktor Remi Gribonval and
* Joint work with Michal Aharon Guillermo Sapiro
Super-Resolution Reconstruction of Images -
SUSAN: structure-preserving noise reduction EE264: Image Processing Final Presentation by Luke Johnson 6/7/2007.
Super-Resolution With Fuzzy Motion Estimation
Recent Trends in Signal Representations and Their Role in Image Processing Michael Elad The CS Department The Technion – Israel Institute of technology.
Image Decomposition and Inpainting By Sparse & Redundant Representations Michael Elad The Computer Science Department The Technion – Israel Institute of.
SOS Boosting of Image Denoising Algorithms
A Weighted Average of Sparse Several Representations is Better than the Sparsest One Alone Michael Elad The Computer Science Department The Technion –
A Sparse Solution of is Necessarily Unique !! Alfred M. Bruckstein, Michael Elad & Michael Zibulevsky The Computer Science Department The Technion – Israel.
Sparse and Redundant Representation Modeling for Image Processing Michael Elad The Computer Science Department The Technion – Israel Institute of technology.
Topics in MMSE Estimation for Sparse Approximation Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000,
Retinex by Two Bilateral Filters Michael Elad The CS Department The Technion – Israel Institute of technology Haifa 32000, Israel Scale-Space 2005 The.
Under the guidance of Dr. K R. Rao Ramsanjeev Thota( )
CAP5415: Computer Vision Lecture 4: Image Pyramids, Image Statistics, Denoising Fall 2006.
Iterated Denoising for Image Recovery Onur G. Guleryuz To see the animations and movies please use full-screen mode. Clicking on.
INDEPENDENT COMPONENT ANALYSIS OF TEXTURES based on the article R.Manduchi, J. Portilla, ICA of Textures, The Proc. of the 7 th IEEE Int. Conf. On Comp.
 Karthik Gurumoorthy  Ajit Rajwade  Arunava Banerjee  Anand Rangarajan Department of CISE University of Florida 1.
* *Joint work with Ron Rubinstein Tomer Peleg Remi Gribonval and
Real-Time Exemplar-Based Face Sketch Synthesis Pipeline illustration Note: containing animations Yibing Song 1 Linchao Bao 1 Qingxiong Yang 1 Ming-Hsuan.
Non-local Sparse Models for Image Restoration Julien Mairal, Francis Bach, Jean Ponce, Guillermo Sapiro and Andrew Zisserman ICCV 2009 Presented by: Mingyuan.
Patch-based Image Interpolation: Algorithms and Applications
Sparse & Redundant Representation Modeling of Images Problem Solving Session 1: Greedy Pursuit Algorithms By: Matan Protter Sparse & Redundant Representation.
Image Decomposition, Inpainting, and Impulse Noise Removal by Sparse & Redundant Representations Michael Elad The Computer Science Department The Technion.
A Weighted Average of Sparse Representations is Better than the Sparsest One Alone Michael Elad and Irad Yavneh SIAM Conference on Imaging Science ’08.
Image Priors and the Sparse-Land Model
Bilateral Mesh Denoising Shachar Fleishman Iddo Drori Daniel Cohen-Or Tel Aviv University.
Sparse & Redundant Representations and Their Applications in Signal and Image Processing CS Course – Winter 2015/6 Michael Elad The Computer.
Single Image Interpolation via Adaptive Non-Local Sparsity-Based Modeling The research leading to these results has received funding from the European.
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images Alfred M. Bruckstein (Technion), David L. Donoho (Stanford), Michael.
My Research in a Nut-Shell Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000, Israel Meeting with.
Sparsity Based Poisson Denoising and Inpainting

Sparse and Redundant Representations and Their Applications in
Sparse and Redundant Representations and Their Applications in
Improving K-SVD Denoising by Post-Processing its Method-Noise
* * Joint work with Michal Aharon Freddy Bruckstein Michael Elad
Sparse and Redundant Representations and Their Applications in
Sparse and Redundant Representations and Their Applications in
Lecture 7 Patch based methods: nonlocal means, BM3D, K- SVD, data-driven (tight) frame.
Presentation transcript:

New Results in Image Processing based on Sparse and Redundant Representations Michael Elad The Computer Science Department The Technion – Israel Institute of technology Haifa 32000, Israel Medical Imaging Workshop RAMBAM Hospital

Michael Elad The Computer-Science Department The Technion 2 Model? Effective removal of noise (and many other applications) relies on an proper modeling of the signal

Michael Elad The Computer-Science Department The Technion 3 Which Model to Choose?  There are many different ways to model signals and images with varying degrees of success.  The following is a partial list of such models for images:  Good models should be simple while matching the signals: Principal-Component-Analysis Anisotropic diffusion Markov Random Field Wienner Filtering DCT and JPEG Wavelet & JPEG-2000 Piece-Wise-Smooth C2-smoothness Besov-Spaces Total-Variation Beltrami-Flow Simplicity Reliability

Michael Elad The Computer-Science Department The Technion 4 Sparseland Sparseland A new Model for Signals / Images Wavelet Theory Signal Transforms Multi-Scale Analysis Approximation Theory Linear Algebra Optimization Theory Denoising Compression Inpainting Blind Source Separation Demosaicing Super- Resolution

Michael Elad The Computer-Science Department The Technion 5 The Sparseland Model for Images  Task: model image patches of size 10×10 pixels.  We assume that a dictionary of such image patches is given, containing 256 atom images.  The Model: every image patch can be described as a linear combination of few atoms.  This model describes every image patch as a sparse combination over a redundant dictionary. α1α1 α2α2 α3α3 α4α4 Σ

Michael Elad The Computer-Science Department The Technion 6 Difficulties With Sparseland  Problem 1: Given an image patch, how can we find its atom decomposition ?  Problem 2: Given a family of signals, how do we find the dictionary to represent it well?  Problem 3: Is this model flexible enough to describe various sources? ALL ANSWERED POSITIVELY AND CONSTRUCTIVELY α1α1 α2α2 α3α3 α4α4 Σ

Michael Elad The Computer-Science Department The Technion 7 Initial dictionary (overcomplete DCT) 64×256 Image Denoising (Gray) [Elad & Aharon (`06)] Source Result dB The obtained dictionary after 10 iterations Noisy image The results of this algorithm compete favorably with the state-of-the-art: E.g.,  We get ~1dB better results compared to GSM+steerable wavelets [Portilla, Strela, Wainwright, & Simoncelli (‘03)].  Competitive works are [Hel-Or & Shaked (`06)] and [Rusanovskyy, Dabov, & Egiazarian (’07)]. Both also lean on Sparseland.

Michael Elad The Computer-Science Department The Technion 8 Original Noisy (12.77dB) Result (29.87dB) Our experiments lead to state-of-the-art denoising results, giving ~1dB better results compared to [Mcauley et. al. (‘06)] which implements a learned MRF model (Field-of-Experts) Denoising (Color) [Mairal, Elad & Sapiro, (‘06)]

Michael Elad The Computer-Science Department The Technion 9 Result Our experiments lead to state-of-the-art inpainting results. Original 80% missing Inpainting [Mairal, Elad & Sapiro, (‘06)]

Michael Elad The Computer-Science Department The Technion 10 Original Noisy (σ=25) Denoised Original Noisy (σ=50) Denoised Video Denoising [Protter & Elad (‘06)] Our experiments lead to state-of-the-art video denoising results, giving ~0.5dB better results on average, compared to [Boades, Coll & Morel (‘05)] and [Rusanovskyy, Dabov, & Egiazarian (’06)]

Michael Elad The Computer-Science Department The Technion 11 Results for 550 Bytes per each file Facial Image Compression [Brytt and Elad (`07)]

Michael Elad The Computer-Science Department The Technion 12 Results for 400 Bytes per each file ? ? ? Facial Image Compression [Brytt and Elad (`07)]

Michael Elad The Computer-Science Department The Technion 13 Is it working well? To Conclude Sparseland is an emerging model with high potential. It is based on sparse and redundant representations of signals, and learned dictionaries Which model to choose? It has been deployed to many applications, in all leading to state-of-the-art results. More work is required to extend its usability to other domains. Effective (yet simple) model for signals/images is key in getting better algorithms for various applications