A (Zernike) moment-based nonlocal-means algorithm for image denoising

Slides:



Advertisements
Similar presentations
Binary Shape Clustering via Zernike Moments
Advertisements

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
3D Geometry for Computer Graphics
Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
電腦視覺 Computer and Robot Vision I
By: Michael Vorobyov. Moments In general, moments are quantitative values that describe a distribution by raising the components to different powers.
Interest points CSE P 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick.
Extended Gaussian Images
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Digital Image Processing
CSE 473/573 Computer Vision and Image Processing (CVIP)
Instructor: Mircea Nicolescu Lecture 15 CS 485 / 685 Computer Vision.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
1 Robust Video Stabilization Based on Particle Filter Tracking of Projected Camera Motion (IEEE 2009) Junlan Yang University of Illinois,Chicago.
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
ON THE IMPROVEMENT OF IMAGE REGISTRATION FOR HIGH ACCURACY SUPER-RESOLUTION Michalis Vrigkas, Christophoros Nikou, Lisimachos P. Kondi University of Ioannina.
Sharif University of Technology A modified algorithm to obtain Translation, Rotation & Scale invariant Zernike Moment shape Descriptors G.R. Amayeh Dr.
Scale Invariant Feature Transform (SIFT)
Blob detection.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Overview Introduction to local features
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
CSCE 441: Computer Graphics Image Filtering Jinxiang Chai.
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Computer vision.
Orthogonal moments Motivation for using OG moments Stable calculation by recurrent relations Easier and stable image reconstruction - set of orthogonal.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Image Enhancement [DVT final project]
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Dengsheng Zhang and Melissa Chen Yi Lim
Local invariant features Cordelia Schmid INRIA, Grenoble.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Harris Corner Detector & Scale Invariant Feature Transform (SIFT)
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Local features: detection and description
CS654: Digital Image Analysis
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
BLOCK BASED MOTION ESTIMATION. Road Map Block Based Motion Estimation Algorithms. Procedure Of 3-Step Search Algorithm. 4-Step Search Algorithm. N-Step.
Aleksey S. Rubel1, Vladimir V. Lukin1,
Interest Points EE/CSE 576 Linda Shapiro.
Lecture 13: Feature Descriptors and Matching
Project 1: hybrid images
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
TP12 - Local features: detection and description
Scale and interest point descriptors
SURF: Speeded-Up Robust Features
Paper Presentation: Shape and Matching
Feature description and matching
Self-similarity and points of interest
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
outline Two region based shape analysis approach
Improving Retrieval Performance of Zernike Moment Descriptor on Affined Shapes Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash.
Histogram Probability distribution of the different grays in an image.
Basic Image Processing
Non-local Means Filtering
第 九 章 影像邊緣偵測 9-.
Fourier Transform of Boundaries
Feature descriptors and matching
Image Registration  Mapping of Evolution
Detecting and analysing motion
Lecture 7 Patch based methods: nonlocal means, BM3D, K- SVD, data-driven (tight) frame.
Presentation transcript:

A (Zernike) moment-based nonlocal-means algorithm for image denoising Michal Kuneš xkunes@utia.cas.cz ZOI UTIA, ASCR, Friday seminar 13.03.2015

Introduction Uses nonlocal (NL) means filter Introduce the Zernike moments (rotation invariant) Zernike moments in small local windows of each pixel are computed (local structure information) similarities are computed (insted of pixel intensity) it can gat much more pixels with higher similarity measure Zexuan Ji, Qiang Chen, Quan-Sen Sun, and De-Shen Xia: A moment-based nonlocal-means algorithm for image denoising. Inf. Process. Lett. 109, 23-24 (November 2009), 1238-1244. DOI=10.1016/j.ipl.2009.09.007 http://dx.doi.org/10.1016/j.ipl.2009.09.007 2

3 a) Noise σ = 20 (PSNR = 22.16) b) PM model (28.83) c) Bilateral f. (29.16) e) NL-means (31.09) e) Exemplar-based method (32.64) f) SIFT based m. (31.26) g) rotationally invariant block matching (31.75) h) Our (32.29) (blockmatching and 3D f. (33.05)) i) real noise component j) – p) corresponding noise component of each method 3

NL-means filter 4 u(j) – intensity value w(i,j) – weight, depends on the similarity between pixels i and j u(Ni) – intensity gray level vector Ni – square neighborhood of fixed size and centered at a pixel i Gρ – Gauss kernel with standard deviation ρ. C(i) – normalizing konstant h – degree of filtering 4

NL-means filter improves image quality high computational cost similarity of patches is only translation invariant Zimmer et al. uses the Hu moments + common, simplest - not efficient for image features representation - certain degree of information redundancy S. Zimmer, S. Didas, J. Weickert, A rotationally invariant block matching strategy improving image denoising with non-local means, in: Proc. 2008 Int. Workshop on Local and Non-Local Approximation in Image Processing, in: LNLA, vol. 2008, 2008. > Zernike moments global shape descriptors particulary robust 5

Main points compute Zernike moments within a small window around each pixel adds orientation invariants for pixels with similarity removes the Gauss kernel used in NL-means algorithm every moment has equal possibility to influence the brightness of the central pixel Result: higher signal-to-noise ratio (on synthetic images) 6

Zernike moments 7 mathematical simplicity and versatility set of orthogonal basis functions mapped over the unit circle Main properties: orthogonality rotation invariance information compaction p – order q – repetition 7

Zernike moments 8 p – order q – repetition Vp*q – complex conjugate of Vpq Rpq – radial polynomial ρ – length of vector from origin to pixel (x,y) θ – angle of ρ from x axis 8

Zernike moments Cartesian moments 9 http://astro.if.ufrgs.br/telesc/aberracao.htm

Zernike moments The Lena image with noise (σ = 20) shown in (a). Radius r = 3. (b)–(g) are the images of Z00, Z11, Z20, Z22, Z31, Z33. 10

Moment-based nonlocal filtering Normalization: Vector for each pixel Intesity values: Similarity measurement: 11

Weight (ω(i,j)) distribution used to estimate the central pixel Original NL-menas proposed 12

13 a) Noise σ = 20 (PSNR = 22.16) b) PM model (28.83) c) Bilateral f. (29.16) e) NL-means (31.09) e) Exemplar-based method (32.64) f) SIFT based m. (31.26) g) rotationally invariant block matching (31.75) h) Our (32.29) (blockmatching and 3D f. (33.05)) i) real noise component j) – p) corresponding noise component of each method 13

PSNR [dB] 14