Spatial Processes and Image Analysis

Slides:



Advertisements
Similar presentations
Wavelets: a versatile tool
Advertisements

Compressive Sensing IT530, Lecture Notes.
Spatial Filtering (Chapter 3)
Applications in Signal and Image Processing
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference. many slides from David Jacobs.
Computer Vision Group Digital Image Filters 26 th November 2012.
Chapter 9: Morphological Image Processing
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 9 Morphological Image Processing Chapter 9 Morphological.
Lecture 3: Markov processes, master equation
ECE 472/572 - Digital Image Processing Lecture 8 - Image Restoration – Linear, Position-Invariant Degradations 10/10/11.
6/9/2015Digital Image Processing1. 2 Example Histogram.
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
Wavelet Transform 國立交通大學電子工程學系 陳奕安 Outline Comparison of Transformations Multiresolution Analysis Discrete Wavelet Transform Fast Wavelet Transform.
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
2007Theo Schouten1 Morphology Set theory is the mathematical basis for morphology. Sets in Euclidic space E 2 (or rather Z 2 : the set of pairs of integers)
Linear Filtering About modifying pixels based on neighborhood. Local methods simplest. Linear means linear combination of neighbors. Linear methods simplest.
Multiscale transforms : wavelets, ridgelets, curvelets, etc.
(1) A probability model respecting those covariance observations: Gaussian Maximum entropy probability distribution for a given covariance observation.
Multidimensional Data Analysis : the Blind Source Separation problem. Outline : Blind Source Separation Linear mixture model Principal Component Analysis.
Linear Algebra and Image Processing
ENG4BF3 Medical Image Processing
Image Representation Gaussian pyramids Laplacian Pyramids
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
1 Prepared by: Precise Object Tracking under Deformation Eng. Mohamed Hassan, EAEA Supervised by: Prof. Dr. Hussien Konber, Al Azhar University Prof. Dr.
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Presentation Image Filters
Wavelets, ridgelets, curvelets on the sphere and applications Y. Moudden, J.-L. Starck & P. Abrial Service d’Astrophysique CEA Saclay, France.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
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.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Multiresolution analysis and wavelet bases Outline : Multiresolution analysis The scaling function and scaling equation Orthogonal wavelets Biorthogonal.
Blending recap Visible seams – edges that should not exist, should be avoided. People are fairly insensitive to uniform intensity shifts or gradual intensity.
DCT.
14 October, 2010LRI Seminar 2010 (Univ. Paris-Sud)1 Statistical performance analysis by loopy belief propagation in probabilistic image processing Kazuyuki.
Chapter 5: Neighborhood Processing
Ch5 Image Restoration CS446 Instructor: Nada ALZaben.
Image Subtraction Mask mode radiography h(x,y) is the mask.
Course 2 Image Filtering. Image filtering is often required prior any other vision processes to remove image noise, overcome image corruption and change.
1 Methods in Image Analysis – Lecture 3 Fourier CMU Robotics Institute U. Pitt Bioengineering 2630 Spring Term, 2004 George Stetten, M.D., Ph.D.
1 LES of Turbulent Flows: Lecture 7 (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Fall 2014.
Fourier Transform.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
 Mathematical morphology is a tool for extracting image components that are useful in the representation and description of region shape, such as boundaries,
Air Systems Division Definition of anisotropic denoising operators via sectional curvature Stanley Durrleman September 19, 2006.
Morphology Morphology deals with form and structure Mathematical morphology is a tool for extracting image components useful in: –representation and description.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Morphological Image Processing (Chapter 9) CSC 446 Lecturer: Nada ALZaben.
Proposed Courses. Important Notes State-of-the-art challenges in TV Broadcasting o New technologies in TV o Multi-view broadcasting o HDR imaging.
Lecture 11+x+1 Chapter 9 Morphological Image Processing.
Biointelligence Laboratory, Seoul National University
Image Subtraction Mask mode radiography h(x,y) is the mask.
- photometric aspects of image formation gray level images
Digital Image Processing CP-7008 Lecture # 09 Morphological Image Processing Fall 2011.
… Sampling … … Filtering … … Reconstruction …
The Chinese University of Hong Kong
- photometric aspects of image formation gray level images
Outline Linear Shift-invariant system Linear filters
Outline Linear Shift-invariant system Linear filters
CS Digital Image Processing Lecture 5
Texture.
Blending recap Visible seams – edges that should not exist, should be avoided. People are fairly insensitive to uniform intensity shifts or gradual intensity.
Basic Image Processing
Morphological Operation
Lecture 2: Image filtering
Review and Importance CS 111.
Image restoration, noise models, detection, deconvolution
Presentation transcript:

Spatial Processes and Image Analysis Yassir Moudden & Sandrine Pires CEA/DAPNIA/SEDI-SAP Lectures : Basic models and tools in signal and image processing. Multiscale transforms : wavelets, ridgelets, curvelets, etc. Multiresolution analysis and wavelet bases. Noise modeling and image restoration. Problems and methods in multispectral data analysis.

Basic models and tools in signal and image processing Outline : Different types of images Sampling and quantification Fourier transform, Power spectrum Linear Filtering, convolution Non-linear operators mathematical morphology Statistical properties of images

Signals, Images, etc. Quantitative data Organized in time or space

Different types of signals and images (1) Continuous or Discrete index. Continuous or Quantized values. Finite energy, finite power, etc. Computer processing requires finite energy, discrete, quantized data.

Different types of signals and images (2) Signals and images grouped in terms of regularity properties : Continuous and global order of differentiability Local regularity Fractal dimension Statistical properties : Marginal distributions, moments, etc. Coherence, correlations and non linear dependencies Stationarity Different formal environment for handling indexed data sets.

Periodic signals and images Fourier series expansion : where : Plancherel-Parceval formula :

Signals and images as energy distributions in time or space … Localization : Spread : More detailed characterization : higher order moments of the energy distribuition.

… and in Fourier space : Fourier transform : Parceval : Localization : Spread : Heisenberg Uncertainty Principle :

A few properties of the Fourier transform examples : (Poisson Sommation Formula)

Sampling : from continuous to discrete time (1) Ideal sampling : multiplication by a Dirac comb with rate Fs = 1/T. Properties : Linear oprator. Not shift invariant.. Shannon-Nyquist sampling theorem : Given a uniform sampling rate of Fs = 1/T, the highest frequency that can be unambiguously represented is Fs/2. Reconstruction (interpolation) formula : where

Sampling : from continuous to discrete time (2) Sampling in time “periodizes” in frequency space resulting in aliasing. In higher dimensions, separable sampling schemes are most commonly used. But there are other non trivial possibilities.

Linear operators - Filtering Simplest possible operators are linear. Shift invariant linear operators = convolutive systems : Harmonic signals are eigenvectors of linear filters : with

Example (1) : low pass spatial filter Used for smoothing (removal of small details prior to large object extraction, bridging small gaps in lines) and noise reduction. Low-pass (smoothing) spatial filtering Neighborhood averaging Results in spatial blurring

Example (2) : median filter (non-linear) Replace the current pixel value by the median pixel value in a given neighborhood. Achieves effective noise supression. Preserves the sharpness of real boundaries.

Mathematical morphology Two basic non-linear operators: Dilation Erosion Several composite operators : Closing Opening Conditionnal closing, etc. A strucutring element is used in each of these operations:

Dilation Principle : takes the binary image B, places the origin of structuring element S over each pixel of value 1, and ORs the structuring element S into the output image at the corresponding position. It is typically applied to binary image, but there are versions that work on gray scale image. The basic effect of the operator on a binary image is to gradually enlarge the boundaries of regions of foreground pixels (i.e. white pixels, typically). Thus areas of foreground pixels grow in size while holes within those regions become smaller. example : dilation using a 3 by 3 square structuring element for gap bridging.

Erosion Principle : takes the binary image B, places the origin of structuring element S over each pixel of value 1, and ANDs the structuring element S into the output image at the corresponding position. It is typically applied to binary image, but there are versions that work on gray scale image. The basic effect of the operator on a binary image is to gradually eliminate small objects. origin 0 0 0 0 0 0 0 1 1 0 0 0 1 1 0 1 1 1 1 1 1 erode B S B S

Closing and opening Closing is a dilation followed by an erosion (with the same structuring element). Closing also produces the smoothing of sections of contours but fuses narrow breaks, fills gaps in the contour and eliminates small holes. Opening is an erosion followed by dilation (with the same structuring element). Opening smoothes the contours of objects, breaks narrow isthmuses and eliminates thin protrusions. Effect of closing using a 3 by 3 square structuring element

Closing and opening Closing is a dilation followed by an erosion (with the same structuring element). Closing also produces the smoothing of sections of contours but fuses narrow breaks, fills gaps in the contour and eliminates small holes. Opening is an erosion followed by dilation (with the same structuring element). Opening smoothes the contours of objects, breaks narrow isthmuses and eliminates thin protrusions.

Statistical signal and image processing Another way to build classes of signal and image data. Doesn’t mean the signal or image data are stochastic. Means that our incomplete prior knowledge of what is noise and what is information requires a probabilistic framework for bayesian inference or maximum likelihood estimation. Many algorithms for image denoising, restoration etc. are in this general framework : MEM, Wiener, shrinkage, detection. Prior probabilities express our knowledge of noise and signal. NOISE = NOT STRUCTURED SIGNAL = STRUCTURED

Statistical properties of signals and images A stochastic process/field is completely defined by its probability law Simplest model considers IID processes, isotropic, stationary How to account for coherent behaviour of neighboring (or not) samples or pixels, in a generic way? Different priors for differents classes of images. Gibbs-Markov fields New representations of structured image data.

Gibbs-Markov field models for images The probability distribution of the value of pixel s does not depend on all the other pixels but only on those pixels in the considered neighborhood : sort range local interactions. example : Monte-Carlo simulations of an Ising model for different values of coupling.

Gibbs-Markov random fields in segmentation Segmentation of satelite images of urban areas using MRF.

Multiscale transforms : wavelets, ridgelets, curvelets, etc. Outline : The Fourier transform Transient world and singularities : Gibbs effect, regularity Time-frequency analysis and the Heisenberg principle Optimal spatiospectral localization Wavelets, the continuous transform :coherence, sparsity, redundancy Cauchy Schwartz inequality Approximation theory : vanishing moments Non-linear operators mathematical morphology Markov random fields Problems in Astronomical data analysis Frames, radon, ridgelets, curvelets Parceval plancherel 2D wavelets

Multiresolution analysis and wavelet bases Outline : Multiresolution analysis The scaling function and scaling equation Examples Fast algorithms Orthogonal and biorthogonal wavelets Building wavelet bases Vanishing moments Applications in compression, approximation Trees Wavelet packets A trous algorithm Pyramidal algorithm

Image restoration, noise models, detection, deconvolution Outline : Image fornation model, Inverse problems in image processing Algorithms for deconvolution : Richardson-Lucy, CLEAN, Wiener filtering, Gaussian filter, Maximumentropy methode Spike processes Application of multiresolution methods Shrinkage, Sparsity, bayesesian approaches Inpainting Again Cauchy-Schwartz Pierpaoli Complex models : accounting for coherent behaviour of wavelet coefficients

Multi-dimensional data analysis Outline : What is multidimensional data Where does it come from Gaussianity Representations ans sparsity Projection pusuit Principal Component Analysis : Karhunen-Loeve Basis Standard mainstream ICA Diversity and separability Non gaussianity, Non stationarity Linear mixture model Applications