0 Up votes0 Down votes

3 views24 pagesDiscrete Hadamard Transform

Nov 02, 2016

© © All Rights Reserved

PDF, TXT or read online from Scribd

Discrete Hadamard Transform

© All Rights Reserved

3 views

Discrete Hadamard Transform

© All Rights Reserved

- CDP Process Matrix
- Unity Game Development in 24 Hours, 2nd Edition
- 6701
- RUP_Roles_and_Responsibilities_Matrix
- group8
- TOA Matrix Diagram
- Mtlb Tutorial
- tablica_fourierovi_transformati
- m235-syllabus-2014
- ES26-LE03-Handson
- Math 2280 - Practice Exam 4
- EFS Survey
- SIMPCA_JAS_v5.0_Review3
- 2d software and powerpoint
- Nama1
- Smarandache Star (Stirling) Derived Sequences
- Math 3 Week 4 Lecture Slides [Compatibility Mode]
- bear boosters matrix operations
- Attachment
- Multiple Controls

You are on page 1of 24

Discrete Hadamard Trasform (DHT) in Image Processing

DR TANIA STATHAKI

READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING

IMPERIAL COLLEGE LONDON

This transform is slightly different from the ones

you have met so far!

Suppose we have a function f ( x), x 0,, N 1,

where N 2 n.

We use binary representation for x and u .

We need n bits to represent them.

x10 bn 1 ( x)b0 ( x) 2

Suppose f ( x) has N 8 samples.

In that case n 3 since N 2 n.

Consider f (6) :

x10 6 x2 110 b0 (6) 0, b1 (6) 1, b2 (6) 1

We define now the 1-D Walsh transform as follows:

1 N 1

n1

bi ( x )bn1i ( u )

W (u ) f ( x) (1)

N x 0

i 0

The above is equivalent to:

n1

bi ( x )bn1i (u )

1 N 1

W (u ) f ( x)(1) i1

N x 0

The transform kernel values are obtained from:

1

T (u, x) T ( x, u )

N

n1

bi ( x ) bn1i ( u )

bi ( x ) bn1i ( u )

i 1

(

1

)

1

)

i 0

N

n 1

matrix. It is easily shown that it has orthogonal columns and rows.

We would like to write the Walsh transform in matrix form.

We define the vectors

f f (0)

f (1) f ( N 1)

W W (0) W (1) W ( N 1)

W T f

As mentioned in previous slide, matrix T is a real, symmetric matrix

with orthogonal columns and rows. We can easily show that it is

unitary and therefore:

T 1 N T T N T , N is thesize of thesignal

Base on the last equation of the previous slide we can show that the

Inverse Walsh transform is almost identical to the forward transform!

n1

f ( x) W (u ) (1)bi ( x )bn1i (u )

x 0

i 0

N 1

N 1

n1

bi ( x )bn1i (u )

f ( x) W (u )(1) i1

x 0

The array formed by the inverse Walsh matrix is identical to the one

formed by the forward Walsh matrix apart from a multiplicative factor

N.

We define now the 2-D Walsh transform as a straightforward

extension of the 1-D transform:

1 N 1 N 1

n1

N x 0 y 0

i 0

n1

1 N 1 N 1

W (u, v) f ( x, y )(1) i1

N x 0 y 0

We define now the Inverse 2-D Walsh transform. It is identical to the

forward 2-D Walsh transform!

1 N 1 N 1

n1

bi ( x ) bn1i ( u ) bi ( y ) bn1i ( v )

f ( x, y) W (u, v) (1)

N x 0 y 0

i 0

n1

1 N 1 N 1

f ( x, y ) W (u, v)(1) i1

N x 0 y 0

The 2-D Walsh transform is separable and

symmetric.

Therefore it can be implemented as a sequence of

two 1-D Walsh transforms, in a fashion similar to that

of the 2-D DFT.

Remember that the Fourier transform is based on trigonometric

terms.

The Walsh transform consists of basis functions whose values are

only 1 and -1.

They have the form of square waves.

These functions can be implemented more efficiently in a digital

environment than the exponential basis functions of the Fourier

transform.

For 1-D signals the forward and inverse Walsh kernels

differ only in a constant multiplicative factor of N .

This is because the array formed by the kernels is a

symmetric matrix having orthogonal rows and columns, so

its inverse array is the same as the array itself!

In 2-D signals the forward and inverse Walsh kernels are

identical!

The concept of frequency exists also in Walsh transform

basis functions.

crossings or the number of transitions in a basis vector

and we call this number sequency.

The Walsh transform exhibits the property of energy

compaction as all the transforms that we are currently

studying. (why?)

For the fast computation of the Walsh transform

there exists an algorithm called Fast Walsh

Transform (FWT).

This is a straightforward modification of the FFT.

Advise any introductory book for your own interest.

We define now the 2-D Hadamard transform. It is similar to the 2-D

Walsh transform.

1 N 1 N 1

n1

bi ( x ) bi (u ) bi ( y )bi ( v )

H (u, v) f ( x, y) (1)

N x 0 y 0

i 0

n1

1 N 1 N 1

H (u, v) f ( x, y )(1) i1

N x 0 y 0

We define now the Inverse 2-D Hadamard transform. It is identical to

the forward 2-D Hadamard transform.

1 N 1 N 1

n1

bi ( x ) bi (u ) bi ( y )bi ( v )

f ( x, y) H (u, v) (1)

N x 0 y 0

i 0

n1

1 N 1 N 1

f ( x, y) H (u, v)(1) i1

N x 0 y 0

Most of the comments made for Walsh transform are valid here.

The Hadamard transform differs from the Walsh transform only in the

order of basis functions. The order of basis functions of the Hadamard

transform does not allow the fast computation of it by using a

straightforward modification of the FFT.

The Hadamard transform does not posses the property of energy

compaction!

Based on the above, WHY USE IT THEN???

An important property of Hadamard transform is that,

letting H N represent the Hadamard matrix of order N

the recursive relationsh ip holds :

H 2N

H N

H N

HN

H N

we can compute a Hadamard matrix of any size.

This is a good reason to use the Hadamard transform!

ordered Hadamard transform for which a fast algorithm

called Fast Hadamard Transform (FHT) can be applied.

The ordered Hadamard transform DOES exhibit the

property of energy compaction!

8x8 Hadamard matrix (non-ordered)

32x32 Hadamard matrix (non-ordered)

Experiment

The 256x256 DCT matrix

of the DCT of cameraman

energy sequences

The ordered Hadamard Transform

of cameraman

of cameraman

as a function of the sample index

Question: In the bottom figures which of the two transforms is related to each curve?

0

functions for 4x4

images.

x,y,u,v are between 0

and 3.

plot the 4x4 functions

T(x,y,u,v)

- CDP Process MatrixUploaded byruss8diko
- Unity Game Development in 24 Hours, 2nd EditionUploaded byCláudio António
- 6701Uploaded byJayaswal Rajeev
- RUP_Roles_and_Responsibilities_MatrixUploaded byLuis Rocholl
- group8Uploaded byapi-347889427
- TOA Matrix DiagramUploaded byScarlet Speedster
- Mtlb TutorialUploaded byapi-3693527
- tablica_fourierovi_transformatiUploaded byAbir Hadžić
- m235-syllabus-2014Uploaded byn4alpaca
- ES26-LE03-HandsonUploaded byWilmarc
- Math 2280 - Practice Exam 4Uploaded byHelbert Paat
- EFS SurveyUploaded byIndrit Bulica
- SIMPCA_JAS_v5.0_Review3Uploaded bygiunghi
- 2d software and powerpointUploaded byapi-272806063
- Nama1Uploaded byArrel Andrawan
- Smarandache Star (Stirling) Derived SequencesUploaded byMia Amalia
- Math 3 Week 4 Lecture Slides [Compatibility Mode]Uploaded byReeve Seah
- bear boosters matrix operationsUploaded byapi-255155256
- AttachmentUploaded byDaksh Oswal
- Multiple ControlsUploaded bySparśa Roychowdhury
- Ansys CommandsUploaded byMarin Kralj
- 40377707.PDFUploaded bymichealram
- Further-Mathematics-3-4-Curriculum-grid.docxUploaded byfdfdsfsdfdsf
- or FUploaded byBobi Mathew
- Matlab LMI Toolbox Erkus_lee_2004aUploaded byAnonymous rTRz30f
- Matlab PrimerUploaded byMelih Tok
- Telequipment_D1010 - D1011Uploaded byAdrian Bratescu
- Future Events Timing ProbabilityUploaded bywoojer
- 002 LS 2 Spectral TheoryUploaded byHitesh Rangra
- PhD Seminar BcUploaded bymgheryani

- Redefining_Islamic_Economics.pdfUploaded byKhairil Fuadi
- Connecting Brands and Consumers at the Intersection of Technology and Story: Storyscaping | By Gaston Legorburu, Darren "Daz" McCollUploaded bySapientNitro
- 73256023 VTU Dsp Lab Manual 5th Sem E C Matlab Programs and CCS Studio ProgramsUploaded bySona Uttappa
- Actix Cel FileUploaded byMuhammad Kalim
- ResolutionsUploaded byaxel_turner-5qe5ygt
- ID ProcessUploaded bySuhaila Sazali
- SaintGabrielUploaded byapi-26629270
- HAAA ScholarshipFundBrochureUploaded byibrahem keratah
- Mechanical EngineerUploaded byAlam
- EccentricityUploaded bysamanta_jsg
- 3.14 GL for Erection Testing and Commissioning of SHPUploaded byoctatheweel
- Derailment Detection DeviceUploaded byAbdulhmeed Mutalat
- Sedimenrty StructureUploaded byManoj Kumar
- Media_Composer_Effects_and_CC_Guide_8.3.pdfUploaded bymxpablomx
- GeneratorUploaded byabdullah_hadi9647
- dbms_practicals_2010Uploaded bycomputerstudent
- Chapter 4 SeparatorsUploaded bydinesh_hsenid
- SAP OptimizationUploaded bymanish1612
- Electrostatic Sensitive DevicesUploaded byEgor85
- eeg tutorialUploaded byfivalen1_443898619
- Probability Concepts, Models and AxiomsUploaded bySam Okpeh
- Occult experiments in the home.pdfUploaded byGeorge Marian
- Android Based Autonomous Coloured Line Follower RobotUploaded byInternational Journal of Research in Engineering and Technology
- Review of NASA's Evidence Reports on Human Health RisksReview of NASA's EvidenceUploaded bykyle
- TES_1210_Mobily_CS-0.pdfUploaded byrajni
- CPM322E CH1 Planning.pdfUploaded byRamesh Babu
- Sub Politics on BeckUploaded bym_y_tanatus
- Sp 75852Uploaded bySasuke Uchia
- Installation Qualification Sample ProtocolUploaded byRashel Hasan
- Eriksons-Theor-WPS-Office.docUploaded byHaidee Tinay

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.