Faculty of Computational Mathematics and Cybernetics, Moscow State University NUS, Singapore, August 14, 2003 Andrey S. Krylov.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

1 A HIGH THROUGHPUT PIPELINED ARCHITECTURE FOR H.264/AVC DEBLOCKING FILTER Kefalas Nikolaos, Theodoridis George VLSI Design Lab. Electrical & Computer.
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 4 – Digital Image Representation Klara Nahrstedt Spring 2009.
Image Processing Lecture 4
Digital Image Processing
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Volodymyr Fedak Artifacts suppression in images and video.
A Matlab Playground for JPEG Andy Pekarske Nikolay Kolev.
Error detection and concealment for Multimedia Communications Senior Design Fall 06 and Spring 07.
1 Outline  Introduction to JEPG2000  Why another image compression technique  Features  Discrete Wavelet Transform  Wavelet transform  Wavelet implementation.
SWE 423: Multimedia Systems
» Copying images is easy » Distributing images is easy » But what if we want to protect our rights to an image?
1 Audio Compression Techniques MUMT 611, January 2005 Assignment 2 Paul Kolesnik.
Computer Graphics Recitation 7. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
Fractal Image Compression
The Frequency Domain : Computational Photography Alexei Efros, CMU, Fall 2008 Somewhere in Cinque Terre, May 2005 Many slides borrowed from Steve.
MSP1 References Jain (a text book?; IP per se; available) Castleman (a real text book ; image analysis; less available) Lim (unavailable?)
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Roger Cheng (JPEG slides courtesy of Brian Bailey) Spring 2007
Laboratory of Mathematical Methods of Image Processing Faculty of Computational Mathematics and Cybernetics Moscow State University Hong-Kong, November.
Lecture 3 Outline Announcements: No class Wednesday Friday lecture (1/17) start at 12:50pm Review of Last Lecture Communication System Block Diagram Performance.
Lossy Compression Based on spatial redundancy Measure of spatial redundancy: 2D covariance Cov X (i,j)=  2 e -  (i*i+j*j) Vertical correlation   
ENG4BF3 Medical Image Processing
Introduction to Image Processing Grass Sky Tree ? ? Review.
IIS for Image Processing Michael J. Watts
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 8 – JPEG Compression (Part 3) Klara Nahrstedt Spring 2012.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
Christopher Mitchell CDA 6938, Spring The Discrete Cosine Transform  In the same family as the Fourier Transform  Converts data to frequency domain.
Klara Nahrstedt Spring 2011
Real-Time Rendering Digital Image Synthesis Yung-Yu Chuang 01/03/2006 with slides by Ravi Ramamoorthi and Robin Green.
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 final project
DCT cs195g: Computational Photography James Hays, Brown, Spring 2010 Somewhere in Cinque Terre, May 2005 Slides from Alexei Efros.
Chapter 7 – End-to-End Data Two main topics Presentation formatting Compression We will go over the main issues in presentation formatting, but not much.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
Recap of Monday linear Filtering convolution differential filters filter types boundary conditions.
FREE-VIEW WATERMARKING FOR FREE VIEW TELEVISION Alper Koz, Cevahir Çığla and A.Aydın Alatan.
JPEG Image Compression Standard Introduction Lossless and Lossy Coding Schemes JPEG Standard Details Summary.
RCC-Mean Subtraction Robust Feature and Compare Various Feature based Methods for Robust Speech Recognition in presence of Telephone Noise Amin Fazel Sharif.
Week 11 – Spectral TV and Convex analysis Guy Gilboa Course
Content Based Color Image Retrieval vi Wavelet Transformations Information Retrieval Class Presentation May 2, 2012 Author: Mrs. Y.M. Latha Presenter:
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 4 – Audio and Digital Image Representation Klara Nahrstedt Spring 2010.
Computer vision. Applications and Algorithms in CV Tutorial 3: Multi scale signal representation Pyramids DFT - Discrete Fourier transform.
Lecture 4-1CS251: Intro to AI/Lisp II Where did that edge go? April 29th, 1999.
EE 7730 Image Enhancement. Bahadir K. Gunturk2 Image Enhancement The objective of image enhancement is to process an image so that the result is more.
1 Faculty of Information Technology Enhanced Generic Fourier Descriptor for Object-Based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Michael Gormish Prepared by:Emin Sinan Mimaroglu
- photometric aspects of image formation gray level images
MATLAB Distributed, and Other Toolboxes
Pulse Code Modulation (PCM)
Digital 2D Image Basic Masaki Hayashi
IIS for Image Processing
Image Pyramids and Applications
Fourier Transform: Real-World Images
Image Acquisition.
Regression-Based Prediction for Artifacts in JPEG-Compressed Images
Tuning JPEG2000 Image Compression for Graphics Regions
Wavelets: Mathematical representation tool
Lecture 3 (2.5.07) Image Enhancement in Spatial Domain
Standards Presentation ECE 8873 – Data Compression and Modeling
Aline Martin ECE738 Project – Spring 2005
Image Compression Techniques
Signal Processing and Data Analysis Simon Godsill Lent 2015
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Govt. Polytechnic Dhangar(Fatehabad)
Topic 1 Three related sub-fields Image processing Computer vision
Signals and Systems Using MATLAB Luis F. Chaparro
Review and Importance CS 111.
Presentation transcript:

Faculty of Computational Mathematics and Cybernetics, Moscow State University NUS, Singapore, August 14, 2003 Andrey S. Krylov

Outline: Projection Method (Hermite series approach)Projection Method (Hermite series approach) ApplicationsApplications 1. 1.Image filtering and deblocking by projection filtering 2. 2.Image matching 3. 3.Texture matching 4. 4.Low-level methods for audio signal processing

The proposed methods is based on the features of Hermite functions. An expansion of signal information into a series of these functions enables one to perform information analysis of the signal and its Fourier transform at the same time. Hermite transform

B) They derivate a full orthonormal in system of functions. The Hermite functions are defined as: A)

Original image 2D decoded image by 45 Hermite functions at the first pass and 30 Hermite functions at the second pass Difference image (+50% intensity)

Original image 2D decoded image by 90 Hermite functions at the first pass and 60 Hermite functions at the second pass Difference image (+50% intensity)

Image filtering and deblocking by projection filtering

Original lossy JPEG image

Enhanced image

Difference image (Subtracted high frequency information)

Original image Zoomed in: Enhanced image

Scanned image Enhanced image

Zoomed in: Scanned image Enhanced image

Image matching

Information parameterization for image database retrieval Algorithm Image normalizing Graphical information parameterization Parameterized image retrieval _

Information parameterization for image database retrieval Algorithm Image normalizing Graphical information parameterization Parameterized image retrieval =+ HF componentLF component Normalized image Recovered image with the recovered image plane

Information parameterization for image database retrieval Algorithm Image normalizing Graphical information parameterization Parameterized image retrieval Database size Initial images format Normalized images format Number of parameterization coefficients Error rate Search time – 768 images (4.12Gb) – 1600x1200x24bit (5.5Mb) – 512x512x24bit (0.75Mb) – 32x32x3 – <0.14% – 4 sec. (for K7-750)

Image matching results

Texture matching

A method of obtaining the texture feature vectors Input function Fourier coefficients 1-D to 2-D expansion

A method of obtaining the texture feature vectors 1-D Hermite functions: 1-D to 2-D expanded Hermite functions:

Orientations

Localization problem Decomposition process is optimal, if localization segments of the input function and filtering functions are equal.

Feature vectors In this approach to get the feature vectors we consider the functions  n (x,y) where n1=0..64, and 6 energy coefficients are calculated as: E 1 = (  0 ) 2 + (  1 ) 2, E 2 = (  2 ) 2 +(  3 ) 2 + (  4 ) 2, E 3 = (  5 ) 2 +(  6 ) 2 +(  7 ) 2 +(  8 ) 2, … E 6 = (  33 ) 2 +(  34 ) 2 + … + (  63 ) 2 +(  64 ) 2, f(x,y) is the source image. Standard coding

Feature vectors E 1 = (  0 (1) ) 2 + (  1 (1) ) 2, E 2 = (  0 (2) ) 2 +(  1 (2) ) 2 + (  2 (2) ) 2 +(  3 (2) ) 2, … E 6 = (  0 (6) ) 2 +(  1 (6) ) 2 + … + (  62 (6) ) 2 +(  63 (6) ) 2, f(x,y) is the source image. Hierarchical coding

Feature vectors E 1 = (  0 (1) ) 2 + (  1 (1) ) 2, E 2 = (  0 (2) ) 2 +(  1 (2) ) 2 + (  2 (2) ) 2 +(  3 (2) ) 2, … E 6 = (  0 (6) ) 2 +(  1 (6) ) 2 + … + (  62 (6) ) 2 +(  63 (6) ) 2, f(x,y) is the source image. Hierarchical coding without subtractions

Feature vectors

abStandard coding Hierarchical coding Hierarchical coding without subtractions a1a b1b c1c a3a b3b c3c a1b b1c

Image segmentation task: Brodatz textures

Image segmentation task

Texture parameterization using 2-D Hermite functions

Quasiperiod’s waveforms

Signal filtering Speaker indexing Speaker recognition using database Source separation Areas of Hermite transform application:

MusicSpeaker 1Speaker 22 speakers Audio sample

Quasiperiod waveform Hermite histogram

Speaker indexing

Speech/music separation Analysis of signal dynamics (distribution of amplitudes in time) Analysis of base tone distribution in time Currently implemented criterions: Result of speech/music separation:

Mix detection One speakerMix

References 1.Krylov A.S., Liakishev A.N., Numerical Projection Method For Inverse Fourier Transform and its Application, Numerical Functional Analysis and optimization, vol. 21 (2000) p Krylov A.S., Kortchagine D.N., Projection filtering in image processing, Graphicon’2000 Conf. proceedings, p , Krylov A.S., Kortchagine D.N., Lukin A.S., Streaming Waveform Data Processing by Hermite Expansion for Text-Independent Speaker Indexing from Continuous Speech, Graphicon’2002 Conf. proceedings, p , Krylov A.S., Kutovoi A.V., Wee Kheng Leow, Texture Parameterization With Hermite Functions, Graphicon’2002 Conf. proceedings, p , Mohsen Najafi, Andrey Krylov, Danil Kortchagine Image Deblocking With 2-D Hermite Transform, Graphicon’2003 Conf. proceedings.