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

Faculty of Computational Mathematics and Cybernetics, Moscow State University

  • Upload
    plato

  • View
    29

  • Download
    3

Embed Size (px)

DESCRIPTION

Applications of Projection Method of Fourier Transform Inversion in Multimedia Data Treatment. Faculty of Computational Mathematics and Cybernetics, Moscow State University. Andrey S. Krylov. NUS, Singapore, August 14 , 2003. Applications of Projection Method of - PowerPoint PPT Presentation

Citation preview

Page 1: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Faculty of Computational Mathematics and Cybernetics, Moscow State University

NUS, Singapore, August 14NUS, Singapore, August 14, 2003, 2003

Andrey S. KrylovAndrey S. Krylov

Page 2: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Outline:Outline:• Projection Method (Hermite series approach)Projection Method (Hermite series approach)• ApplicationsApplications

1. Image filtering and deblocking by projection filtering

2. Image matching 3. Texture matching4. Low-level methods for audio signal

processing

Page 3: Faculty of Computational Mathematics and Cybernetics, Moscow State University

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 transformHermite transform

0

4 29

Page 4: Faculty of Computational Mathematics and Cybernetics, Moscow State University

nn

n i ˆ

),(2 L

n

xn

n

xn

n dx

ed

n

ex

)(

!2

)1()(

22 2/

B) They derivate a full orthonormal in system of functions.

The Hermite functions are defined as:

A)

Page 5: Faculty of Computational Mathematics and Cybernetics, Moscow State University

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)

Page 6: Faculty of Computational Mathematics and Cybernetics, Moscow State University

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)

Page 7: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image filtering and deblocking by projection filtering

Page 8: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Original lossy JPEG image

Page 9: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Enhanced image

Page 10: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Difference image (Subtracted high frequency information)

Page 11: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Original image

Zoomed in:

Enhanced image

Page 12: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Scanned image

Enhanced image

Page 13: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Zoomed in:

Scanned image

Enhanced image

Page 14: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image matching

Page 15: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Information parameterization for image database retrieval

AlgorithmImage normalizingGraphical information parameterization

Parameterized image retrieval_

Page 16: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Information parameterization for image database retrieval

AlgorithmImage normalizingGraphical information parameterization

Parameterized image retrieval

= +HF component LF component Normalized

image

Recovered image with the recovered image plane

Page 17: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Information parameterization for image database retrieval

AlgorithmImage normalizingGraphical information parameterization

Parameterized image retrieval

Database size Initial images formatNormalized images formatNumber 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)

Page 18: Faculty of Computational Mathematics and Cybernetics, Moscow State University
Page 19: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image matching results

Page 20: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image matching results

Page 21: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Texture matching

Page 22: Faculty of Computational Mathematics and Cybernetics, Moscow State University
Page 23: Faculty of Computational Mathematics and Cybernetics, Moscow State University

A method of obtaining the A method of obtaining the texture feature vectorstexture feature vectors

0

)()(i

ii xxf

dxxfxii )()(

),()(),(2121

yxyx nnnn

1)(),( xyx nn

Input function

Fourier coefficients

1-D to 2-Dexpansion

Page 24: Faculty of Computational Mathematics and Cybernetics, Moscow State University

A method of obtaining the A method of obtaining the texture feature vectorstexture feature vectors

1-D Hermite functions:1-D Hermite functions:1-D to 2-D expanded 1-D to 2-D expanded

Hermite functions:Hermite functions:

Page 25: Faculty of Computational Mathematics and Cybernetics, Moscow State University

OrientationsOrientations

Page 26: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Localization problemLocalization problem

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

Page 27: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Feature vectorsFeature 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:E1 = (0)

2 + (1)2 ,

E2 = (2)2+(3)

2 + (4)2,

E3= (5)2 +(6)

2+(7)2+(8)

2,

…E6 = (33)

2+(34)2 + … + (63)

2 +(64)2 ,

f(x,y) is the source image.

Standard codingStandard coding

Page 28: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Feature vectorsFeature vectors

E1 = (0(1))2 + (1

(1))2 ,

E2 = (0(2))2+(1

(2))2 + (2(2))2 +(3

(2))2 ,

…E6 = (0

(6))2+(1(6))2 + … + (62

(6))2 +(63(6))2 ,

 

dxyxfyxdyA

i

j

i ),(),(1)1(

1,)),(),((),(1

2

)1()(

jdxyxfyxfyxdyA

j

l

li

j

ji

f(x,y) is the source image.

Hierarchical codingHierarchical coding

Page 29: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Feature vectorsFeature vectors

E1 = (0(1))2 + (1

(1))2 ,

E2 = (0(2))2+(1

(2))2 + (2(2))2 +(3

(2))2 ,

…E6 = (0

(6))2+(1(6))2 + … + (62

(6))2 +(63(6))2 , 

 

dxyxfyxdyA

i

j

i ),(),(1)1(

1,),(),(1)(

jdxyxfyxdyA

i

j

ji

f(x,y) is the source image.

Hierarchical coding without subtractionsHierarchical coding without subtractions

Page 30: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Feature vectorsFeature vectors Texture

sample Standard coding

Hierarchical coding

Hierarchical coding without

subtractions A1

A2

A3

A4

B1

B2

B3

B4

C1

C2

C3

C4

Page 31: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Feature vectorsFeature vectors

a b Standard coding

Hierarchical coding

Hierarchical coding without

subtractions

a1 a2 0.004505 0.005349 0.003739

b1 b2 0.009905 0.008160 0.007742

c1 c2 0.017778 0.011848 0.009946

a3 a4 0.008807 0.006047 0.002422

b3 b4 0.020075 0.010667 0.006275

c3 c4 0.128322 0.101591 0.080176

a1 b1 0.488420 0.492238 0.491653

b1 c1 0.315644 0.304597 0.305442

Page 32: Faculty of Computational Mathematics and Cybernetics, Moscow State University
Page 33: Faculty of Computational Mathematics and Cybernetics, Moscow State University
Page 34: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image segmentation taskImage segmentation task::Brodatz texturesBrodatz textures

Page 35: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image segmentation taskImage segmentation task

 

Page 36: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image segmentation taskImage segmentation task

Page 37: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Image segmentation taskImage segmentation task

Page 38: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Texture parameterization Texture parameterization using 2-D Hermite functionsusing 2-D Hermite functions

),(),,(),,(),,(),,(),,(),,( 4,35,27,00,31,22,13,0 yxyxyxyxyxyxyx

Page 39: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Quasiperiod’s waveforms

Page 40: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Signal filteringSpeaker indexingSpeaker recognition using databaseSource separation

Areas of Hermite transform application:Areas of Hermite transform application:

Page 41: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Music Speaker 1 Speaker 2 2 speakers

Audio sample

Page 42: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Quasiperiod waveform Hermite histogram

Page 43: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Speaker indexingSpeaker indexing

Page 44: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Speech/music separationSpeech/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:

Page 45: Faculty of Computational Mathematics and Cybernetics, Moscow State University

Mix detectionMix detection

One speaker Mix

Page 46: Faculty of Computational Mathematics and Cybernetics, Moscow State University

ReferencesReferences1.1. Krylov A.S., Liakishev A.N.,Krylov A.S., Liakishev A.N., Numerical Projection Method For Numerical Projection Method For

Inverse Fourier Transform and its Application,Inverse Fourier Transform and its Application, Numerical Numerical Functional Analysis and optimization, vol. 21 (2000) p. 205-216.Functional Analysis and optimization, vol. 21 (2000) p. 205-216.

2.2. Krylov A.S., Kortchagine D.N.,Krylov A.S., Kortchagine D.N., Projection filtering in image Projection filtering in image processingprocessing, , Graphicon’2000 Conf. proceedings, p. 42-45, 2000.Graphicon’2000 Conf. proceedings, p. 42-45, 2000.

3.3. Krylov A.S., Kortchagine D.N., Lukin A.S., Krylov A.S., Kortchagine D.N., Lukin A.S., Streaming Waveform Streaming Waveform Data Processing by Hermite Expansion for Text-Independent Data Processing by Hermite Expansion for Text-Independent Speaker Indexing from Continuous SpeechSpeaker Indexing from Continuous Speech, , Graphicon’2002 Conf. Graphicon’2002 Conf. proceedings, p. 91-98, 2002. proceedings, p. 91-98, 2002.

4.4. Krylov A.S., Kutovoi A.V., Wee Kheng Leow, Krylov A.S., Kutovoi A.V., Wee Kheng Leow, Texture Texture Parameterization With Hermite Functions,Parameterization With Hermite Functions, Graphicon’2002 Conf. Graphicon’2002 Conf. proceedings, p. 190-194, 2002.proceedings, p. 190-194, 2002.

5.5. Mohsen Najafi, Andrey Krylov, Danil Kortchagine Mohsen Najafi, Andrey Krylov, Danil Kortchagine Image Image Deblocking With 2-D Hermite Transform, Deblocking With 2-D Hermite Transform, Graphicon’2003 Conf. Graphicon’2003 Conf. proceedings. proceedings.