Hypercomplex Wavelets

From MMVLWiki
(Difference between revisions)
Jump to: navigation, search
m (External Links)
m (Implementation)
 
(One intermediate revision by one user not shown)
Line 9: Line 9:
 
=Implementation=
 
=Implementation=
 
[[Image:Dhwt circle.png|thumb|right|400px|High- and low-frequency decomposition using the dual-tree complex wavelet transform. The approximate shift-invariance leads to reduced aliasing]]
 
[[Image:Dhwt circle.png|thumb|right|400px|High- and low-frequency decomposition using the dual-tree complex wavelet transform. The approximate shift-invariance leads to reduced aliasing]]
[[HornetsEye]] now contains an implementation of the Dual-Tree Complex Wavelet Transform. The implementation makes use of [[Complex Wavelet Filters|Hilbert transform pairs of wavelet bases]]. The wavelet transform was implemented with [[HornetsEye]]'s [http://www.wedesoft.demon.co.uk/hornetseye-api/files/MultiArray-rb.html MultiArray] class. Have a look at the
+
[[HornetsEye]] now contains an implementation of the Dual-Tree Complex Wavelet Transform. The implementation makes use of [[Complex Wavelet Filters|Hilbert transform pairs of wavelet bases]]. The wavelet transform was implemented with [[HornetsEye]]'s **MultiArray** class.
[http://www.wedesoft.demon.co.uk/hornetseye-api/files/hypercomplex-txt.html hypercomplex wavelet example] for more information.
+
  
 
=Wavelet Editor=
 
=Wavelet Editor=
Line 33: Line 32:
 
** J Fauqueur, N Kingsbury and R Anderson: [http://www-sigproc.eng.cam.ac.uk/~ngk/publications/fauqueur_icip06.pdf Multiscale keypoint detection using the dual-tree complex wavelet transform], Proc. IEEE Conference on Image Processing, Atlanta, GA, 8-11 Oct 2006
 
** J Fauqueur, N Kingsbury and R Anderson: [http://www-sigproc.eng.cam.ac.uk/~ngk/publications/fauqueur_icip06.pdf Multiscale keypoint detection using the dual-tree complex wavelet transform], Proc. IEEE Conference on Image Processing, Atlanta, GA, 8-11 Oct 2006
 
* Thomas Bülow: [http://www.ks.informatik.uni-kiel.de/~vision/doc/Dissertationen/Thomas_Buelow/diss.ps.gz Hypercomplex Spectral Signal Representations for Image Processing and Analysis], PhD thesis, 1999
 
* Thomas Bülow: [http://www.ks.informatik.uni-kiel.de/~vision/doc/Dissertationen/Thomas_Buelow/diss.ps.gz Hypercomplex Spectral Signal Representations for Image Processing and Analysis], PhD thesis, 1999
* J. Wedekind, B. Amavasai, K. Dutton: [http://digitalcommons.shu.ac.uk/mmvl_papers/1/ Steerable Filters Generated With The Hypercomplex Dual-Tree Wavelet Transform], ICSPC07 proceedings (also see [http://vision.eng.shu.ac.uk/jan/icspc07-foils.pdf foils (PDF)]) (I think there's a bug in the paper. I need to use <math>H_1(z)=(-z)^{-M}\,H_0(z^{-1})</math> (see Selesnicks paper) where <math>M</math> is odd. Maybe this explains the trouble I have with choosing the sampling offsets in some cases)
+
* J. Wedekind, B. Amavasai, K. Dutton: [http://shura.shu.ac.uk/953/ Steerable Filters Generated With The Hypercomplex Dual-Tree Wavelet Transform], ICSPC07 proceedings (also see [http://vision.eng.shu.ac.uk/jan/icspc07-foils.pdf foils (PDF)]) (I think there's a bug in the paper. I need to use <math>H_1(z)=(-z)^{-M}\,H_0(z^{-1})</math> (see Selesnicks paper) where <math>M</math> is odd. Maybe this explains the trouble I have with choosing the sampling offsets in some cases)
 
* [http://www.wedesoft.demon.co.uk/hornetseye-api/files/hypercomplex-txt.html Hypercomplex wavelet example]
 
* [http://www.wedesoft.demon.co.uk/hornetseye-api/files/hypercomplex-txt.html Hypercomplex wavelet example]
 
* [http://www.walterpfeifer.ch/liealgebra/ The Lie Algebras su(N), an Introduction] by Walter Pfeifer
 
* [http://www.walterpfeifer.ch/liealgebra/ The Lie Algebras su(N), an Introduction] by Walter Pfeifer

Latest revision as of 12:08, 16 March 2011

Contents

[edit] Introduction

Complex wavelets are superior to real-valued wavelets because they are nearly shift-invariant. Complex wavelets yield amplitude-phase information in a similar way as the Fourier transform does. In contrast to the Fourier transform, wavelets allow to analyse the signal locally and thus can be applied to signals with a non-stationary statistic (such as images of a natural scene). In the same way as a one-dimensional signal requires complex numbers to represent the local structure of the signal, two-dimensional signals require hypercomplex numbers. Kingsbury has developed the Dual-Tree Complex Wavelet Transform which allows to recursively compute complex wavelet transforms. Analogous to one-dimensional analysis requiring complex values, two-dimensional analysis requires 4-valued complex numbers (hypercomplex values). Bülow, Kingsbury, and others already have successfully used hypercomplex numbers for analysing two-dimensional signals.

[edit] Implementation

High- and low-frequency decomposition using the dual-tree complex wavelet transform. The approximate shift-invariance leads to reduced aliasing

HornetsEye now contains an implementation of the Dual-Tree Complex Wavelet Transform. The implementation makes use of Hilbert transform pairs of wavelet bases. The wavelet transform was implemented with HornetsEye's **MultiArray** class.

[edit] Wavelet Editor

Wavelet editor

An editor for visualising linear combinations of wavelets was implemented. The code requires qt4-qtruby, and HornetsEye. The source code is part of the HornetsEye source package. You may need to compile the user interface design file using rbuic4 like this:

rbuic4 waveletEdit.ui > ui_waveletEdit.rb

You can view the source files in their current state at http://bazaar.launchpad.net/~wedesoft/hornetseye/trunk/files in the subdirectory samples/hypercomplex.

[edit] See Also

[edit] External Links

Bookmark and Share

Personal tools
Namespaces
Variants
Actions
Navigation
Toolbox