Are you sure?
This action might not be possible to undo. Are you sure you want to continue?
com
* The Ebook starts from the next page : Enjoy !
Complex Wavelet Based Image Analysis and Synthesis
This dissertation is submitted for the degree of Doctor of Philosophy Peter de Rivaz Trinity College October 2000 University of Cambridge Department of Engineering
de Rivaz, Peter F. C. PhD thesis, University of Cambridge, October 2000. Complex Wavelet Based Image Analysis and Synthesis Key Words Complex wavelets, multiscale, texture segmentation, texture synthesis, interpolation, deconvolution.
Copyright c P.F.C. de Rivaz, 2000. All rights reserved. No part of this work may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without prior permission.
All statements in this work are believed to be true and accurate at the time of its production but neither the author nor the University of Cambridge oﬀer any warranties or representations, nor can they accept any legal liability for errors or omissions.
P.F.C. de Rivaz Signal Processing and Communications Laboratory Department of Engineering Trumpington Street Cambridge, CB2 1PZ, U.K.
To Jenny
Summary
This dissertation investigates the use of complex wavelets in image processing. The limitations of standard real wavelet methods are explained with emphasis on the problem of shift dependence. Complex wavelets can be used for both Bayesian and nonBayesian processing. The complex wavelets are ﬁrst used to perform some nonBayesian processing. We describe how to extract features to characterise textured images and test this characterisation by resynthesizing textures with matching features. We use these features for image segmentation and show how it is possible to extend the feature set to model longerrange correlations in images for better texture synthesis. Second we describe a number of image models from within a common Bayesian framework. This framework reveals the theoretical relations between wavelet and alternative methods. We place complex wavelets into this framework and use the model to address the problems of interpolation and approximation. Finally we show how the model can be extended to cover blurred images and thus perform Bayesian wavelet based image deconvolution. Theoretical results are developed that justify the methods used and show the connections between these methods and alternative techniques. Numerical experiments on the test problems demonstrate the usefulness of the proposed methods, and give examples of the superiority of complex wavelets over the standard forms of both decimated and nondecimated real wavelets.
The dissertation does not exceed 65000 words and does not contain more than 150 ﬁgures. Except where indicated in the text. Acknowledgements I would like to thank my supervisor. Dr. for suggesting this topic and for his guidance during the research. Thanks to my parents for encouraging my curiosity and to my wife for keeping me calm. this dissertation is the result of my own work and includes nothing which is the outcome of work done in collaboration.Declaration The research described in this dissertation was carried out between October 1997 and September 2000. Nick Kingsbury. No part of this dissertation has been submitted to any other university. This work was made possible by an EPSRC grant. .
.
4. . . . . . . . .2 Filter design and the product ﬁlter . . . . . . . .3. . Medium importance contributions . . . . 3 3 4 5 7 7 7 8 9 9 13 13 13 14 17 18 21 23 24 27 28 29 31 33 Organisation of the dissertation . . . 7 Redundant complex wavelets . . . . . . . . . . . . . Bayesian and NonBayesian Approaches . .4 2. . Introduction . . Least important contributions . . . . .2 1. . . . . Single tree complex wavelets . 2. . . . . . . . . .3 Summary . . . . . . . . . .5 Most important contributions . .4. . . . . . . . . . . . .1 2. . .4. Contributions based largely on previous work . . . . . . . . . . . . . . . . . . . . . . The Wavelet Transform . . . . . . . . . . . . . 2 Wavelet transforms 2. . . . . . .4 1.4. . .1 1. . . . . . .3. . . . . . . Nonredundant. . . . .4 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Prolate spheroidal sequences . . . .4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 2. . . . . . .1 1. .3 1. . . . . . . . . . . . . . . . . . . . .3. . Dual tree complex wavelet transform . . . . . . . . . . . . . . .4. . . . . . . . . . . . . . . . . . . . . . .1 2. . . . . . . . .Contents 1 Introduction 1. .2 1. complex wavelets . . . . . . . . . . . . . . . . . . . . Qshift Dual tree complex wavelets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 2. .3 2. . . . . . . . . . . . . . . Terminology .7 2. . . . . Original contributions . . . . . . . . . . . . . . . . . . .3 1. . . . . . . . . . . . . . . . . .3. . . . . . . . . . . . . . . . . . . . . . Justiﬁcation for the research . . . . . . . directionally selective. .2 2. . . . . . . . . . . . . Directionality and Ridgelets .1 2. . 1. . . . . . . . . . . .5 2.3. . . Shift invariance and the Harmonic wavelet . . .3. . . . . . . . . . . . . . . . . . .6 2. . . . . . . . . . . . . . . . . . . . . . . . . . . .3. . . . . . .
. . . . .4 3. . . . . . . .2 4. . . . . . Motion Estimation . . .2 3. . . . . . . . . . . . . . 35 36 37 37 40 41 42 43 45 45 45 46 47 51 53 53 53 54 54 55 56 56 57 57 59 60 60 60 62 65 Noise ampliﬁcation theory . . . . . . . . . . . . . . . . . . . . Results . . . . . . . . . . . . . . . . .5. . . . . . . . . . . .5. . . . . . . . . . .8 4. . . . . . . . . . . . . .1 3. . . . . . . . . . . . . .3 Summary . . . . . . . Gabor based texture synthesis . . . . . . . . . . . . . . . . . . 4. .3 4. . . . . . . . . . . . . . . . . . . . . . . . .9 Method . . . . . . . . . . . . . . . . . . . . . . . . .1 2. . . . . . 4 Complex wavelet texture features 4. . . . . . . . . . . . . . . Preliminaries . . . . . .4 4. . . . . . . .4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .6 4. . .2 4. . . .3 2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Method . . . . .5. . Pyramidbased texture analysis/synthesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Extracted features . . . . . . . . . . . . . . . . . . .5 Summary . . . . . . . . . . . . . . . .4. . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 4. .3. . . . . . . . .1 4. . . Algorithm . . . . .5 2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Conclusions . . Numerical results . . . . . . . . . . . . . . .2 4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Multiwavelets . . . . . . . . . . . . . Results . . . . . Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2. . . . . . . . .4 2. . . . .3 2.1 4. . Denoising . . . . .3. . . . . . . . . . .4 4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Results and applications . . . . . . . . . . .5 4. . . . .4. .4. . . . . . . . Texture features . . . . . . . . .7 4. . . .2 2. . . Discussion .5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4. . . . . . . . . . . . . . Filters . . . . . .3 3. . Conclusions . . . . . Classiﬁcation . . . . . . . . . . . . . . . . . . .4 2. . . . . . . . . . . . . Theoretical results . . . . . . . .4. . . . .6 Steerable transforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Previous applications 3. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . .9. . . . . . . . . . . . . . . Choice of parameter values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Training simpliﬁcation . 109 7. . . . . . . . . . .2 7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 Conclusions . . .3. . . . .4 Filter model . . . . . . . . Original Classiﬁcation Method . . . . . . . . . . . . . . . . . . . . 113 Wavelet generative speciﬁcation .3 5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 Fourier model . . . . . . . . . . .4 Texture features for multiscale segmentation . . . . . .7 6. . . . . . . . Crosscorrelation results and discussion . . . . . 111 Wavelet direct speciﬁcation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3 6. . . . 6 Correlation modelling 6. . . . .2 5. . . . . . . . . . Discussion of DTCWT performance . . . . . . . . . .1 7. . . . . . . . . . . . . Autocorrelation Results . . .1 6. . . . .3. . . .1 5. .6 5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Crosscorrelation method . . . . . . . . 100 Large feature set segmentation . . . . . . . . . . . . . . . . . . . . . . . . 105 107 7 Bayesian modelling in the wavelet domain 7. .5 5. . . . . . . . . . . . . . . . . . . . .5 6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3. . . . . . . . . . . . . . . . . .6 6. . . . . . . . . . . . . . .2 5. . . . . . . . . Discussion of relative performance . . . . . . . . . . .3 5. Autocorrelation Method . . . . . . . . . . . Introduction . . . . . . . . . . . . . . 5. . . Detailed description of method . . Multiscale Segmentation . . . . . . . . . . . . . . . .2 6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 67 68 69 70 71 73 77 83 86 86 87 88 88 89 93 93 93 96 98 99 5. . . . . . . . . . . . . . . . . . . . . . . .2 7. . . . . . . . .9. .3 7.3 Introduction . . . Experiments . Multiscale results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 5. 108 Bayesian image modelling . . . .7 5. Multiscale classiﬁcation . . . .1 7. . . . . . . . . . . . . . . Discussion . . . 107 Introduction to Bayesian inference . . . . . . . .3. . . . . . . . . . . . . . . . . . . .8 Summary . . . . . . . . . . . . . . .10 Conclusions .9. . . . . . . . . . .4 6. . . . . . . . . . . . .4 5. . . . . . . . .9. . . . . . . . .9 Summary . . . . . . . . . . . . . . . . . . .5 Texture segmentation 5. . . . . . . . . . . . . . . . . . . . . . . .8 5. . . . . . . . . . . . . 114 . . . .
. . . . . . . . . . . . . .4. . . . . . . . . . . . . . . . . .7.6 Wavelet posterior distribution . . .2 8. . . . 116 Shift Invariance . . . . . . . . . .4. . . . . . . . . . . . 118 One dimensional approximation . . . . . . . 152 Discussion of the signiﬁcance of shift dependence . . . . . . . . . . . . . . . . . . .6. . . . . . . . .4. . . . . . . . . . . . . . . . . . . .6. . . . . .4 8. . . . . . . . . . . 153 8. . .5 Estimating scale energies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .5 8. . . . 136 Large spatial prediction for nonstationary random ﬁelds . . .6. . . . .8 Extensions . . . . . . . . . . . . . . . . . . . 127 7. . . . . .5 Conclusions . . . . . . . . . . . 127 129 8 Interpolation and Approximation 8.4 Choice of wavelet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 8. . . . . . . . . 147 Shift Invariance . . . 115 7. . . . . . . . . . . . . . . . . . . 140 8. . . . . .4 7. . . . . . . 144 Method for wavelet approximation/interpolation . . . . . . .7. . . . . 156 . .2 8. . 120 Flexibility . . . . . . . . . . . . . . . . . .5 8. . . .7. . . . . . . . . . . . . . . . . . . .6 Kriging . . . . . . . . . . . . . . .4. . . . . . . .4. . 131 Approximation techniques . . . . . . . . . . . . . . . . . . . 140 Comparison with Spline methods .3 8. . . . . . . .7. . . . . . . .6 Possible Basis functions . . . . . . . . . . . . . . . . . . . . . . . 119 Twodimensional shift dependence .4 8. .5 7.3 8. . . . . . . . . . . .4. . . .4. . . . 147 Reconstruct image estimate . . . .2 8. . . . . . . . . . 134 Bandlimited interpolation . . . . .4. . .4. . . 130 Posterior distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3 8. . . . .3 7. . . . . . 148 Experiments on shift dependence .7. . . . . . . . . . . . . . . . . . . . . . . . .4. . . . . . . . . . . . . . . . . . . . . 132 8. . . . . . .1 7. . . . 147 8. . . . . . . . . . . . . . . . . . . . . . 132 Radial Basis Functions . . 123 Summary of results .6. . . . . . . . . . . 147 Speed . . . . . . . . . . .2 7.6. . . . . . . . .3 8. . . . . . . . . . . . . . . . . . . 129 Introduction . . 146 Impulse responses . . . . . . . . . . . . . . . . . . . .4. 147 Solving for wavelet coeﬃcients . . . . . . . . . . . . 135 Minimum smoothness norm interpolation . . . . . . . . . . . . . .2 8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 8. . . . . . . . . . . . . . . . . . .1 8. . . . . . . . .1 8. . 146 Important wavelet coeﬃcients . . . . . . . . . . . . . . . .7 Choice of wavelet . . . . . . . . . . .1 8. . . . . . . . . .4 8. . . .4 Summary . . . . . .4. . .
. 199 201 10 Discussion and Conclusions 10.1 9. . . . . . 156 Proposal . . . . . . . . . . . .5. . . . . . . . . . . . .1. . . . . . . . . . . . . . . . . . . .1 8. . .9 Background . . . . . . . . . . . . .3. . . . . . .3 9. . . . . . . . . . . . . . . . . . . . .3. . . . . . . . . . . . . . . . . . . . . . . . 210 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182 9. . . . . . . . . . . . . . . . . . . .1 Ampliﬁcation of white noise by a transform . . . . . . . . . . . . . 202 10.5 9. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 Trading accuracy for speed . . . . . . . . . . . .4 Other possibilities . . . . . . . . . .1 Discussion . . . 170 Image model . . . . . . . . . . . . . .. . . . . . 182 Comparison experiments . . . . .8. . . . . . . . . . . . . . . . . . . 174 Choice of search direction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172 9. . . . . . . . . . . . . . .2 Implications of the research . . . . . . . . . . . . . . .8. . . . . . .3 8.3 Bayesian framework 165 . . . . . . . . . . . . . . .6 Convergence experiments and discussion . . . . . . .2 Deﬁnition of d1 . . . 207 A Balance and noise gain 209 A. . .1 Segmentation . . . . . . . . . . . . 165 Summary of review . .2 8. . . . . . . 206 11. . . .2 9.3 Variance estimation .3 Deconvolution . . . . . . . . . . . . . . . . . . . . . .3. . .1. . .8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203 11 Future work 205 11. . . . . . . . . . . . . . . . . . . . . . . . .1 9. . . . . . . . . . . . . . .1 Discussion . 161 8. . .1. . . . . . . . . .2 Texture synthesis .1 9. . . . . . . . . . . . . . 167 Introduction . . . . . . . . . . 171 Iterative Solution . . . . . .4 9. . .2 9. . . . . . . . 159 Discussion of model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .10 Conclusions . . . . . . 209 A. . . . . . . . . . . . . . . . . . . . . . . . . 206 11. .. . . . . . . 189 9. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 11. . . 162 9 Deconvolution 9. . . . . 169 Discussion . . . . . . .2 9. . . . . . . . . 197 Conclusions . . . . . . . . . . . . . . . . . . . .dN . . . . .8. . . . . . . . . . . . 178 One dimensional search . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . .5 Reconstruction noise gain bound . . . . . . .3 Projection methods . . . . 228 C. . . 238 C. . . . . . . . .A. . . . . . 217 B. . . . . . . . . . . . . . 212 A. . . . . . . . . . . . . . . . . 234 C. . . . . . . 211 A. . . . . . . . .7 Relation between noise gain and unbalance . . . . . . . . . . . . . . . . . . . . 225 C. . . . . . . . . . . . . . . .9. . . . . . . . . . . . . . . . . . . . . . .3 Determining frame bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 Deconvolution Algorithm . . . . . . . . . . .6 Consequences of a tight frame . . . . . . . . . . . . . . . . . . . . . . .9 Mirror wavelet deconvolution . . . . . . . . 226 C. . . . . 241 . . . . . . . . . . . .7 Total variation and Markov Random Fields . . . . . . . . . . . . . . . . .5 Iterative methods . . . . . . . . . . .2 Maximum Entropy . . . . . . . . . . . . . . . . . . . .2 Bayesian point inference . . .1 Mirror Wavelet Transform . . 239 C. . . . . . . . . . . . . . . 214 B Useful results 217 B. . . . . . . . . . . . . 213 A. . . . . . . . . . . . .1 CLEAN . . . . 234 C. . . . . . 237 C. . . .9. . . . . . . . . . . 223 C. . . .8 Minimax wavelet deconvolution .10 Waveletbased smoothness priors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 Signal energy gain . . . . . .1 Summary . . . . . . . . . . . . 220 C Review of deconvolution techniques 223 C. . . . . . . 227 C. . . . . . . 235 C. . . . 214 A. . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 Wiener ﬁltering . . . . . . . . . . . .6 Constrained Least Squares . . . . . . . . . . . . . . . . . . . .
. .5 Results of using histogram/energy synthesis . Bottom left: DWT results. . .1 4. . . . . . . . . . . . . . .2 2. . . . . . . . . . . . . . . .4 4. . . . . . . The complex wavelet dual tree structure. Bottom middle: DTCWT results. . . . . Contours of 70% peak magnitude of ﬁlters at scales 3 and 4 . . . 13 49 50 62 63 64 65 66 . Top right: Noisy image. Model of wavelet domain processing. . . . . . . . . . . . . This ﬁgure was provided by Dr N. . . . . . . .4 2. . .1 2. . . . . . . . . . . . . . . . . 34 10 14 15 15 17 30 31 2. . . . . . . .2 Top left: Original image. Results of using energy synthesis . . . . .10 Comparison of noise gain for diﬀerent transforms . .3 4. . . Bottom right: NDWT results. . . . . . . . . 4. . . . . . Results of using diﬀerent methods on a strongly diagonal texture . . . . . . . . . . .List of Figures 1.1 2. . . Contours of halfpeak magnitude of ﬁlters at scales 3 and 4 . . . . This ﬁgure was provided by Dr N. . . . . Subband decomposition tree for a 4 level wavelet transform . . . . . . . . . . . . . . . . . . Building block for inverting the wavelet transform . . . . . .5 2. . . . . Building block for wavelet transform . . Results of using histogram/energy synthesis on a wood grain texture. . . . . Energy before rescaling for diﬀerent subbands during the histogram/energy synthesis algorithm. 3. PSNRs in dB of images denoised with the HMT acting on diﬀerent wavelet transforms. . . . . . .6 2. . . . .7 2. . . .1 3. . . . Horizontal lines represent the target energy values. . Kingsbury. .2 4. . .9 Guide to the dissertation . . .3 2. . . . . 32 38 42 The Qshift dual tree structure. .8 2. . . . . . Alternative structure for a subband decomposition tree . The results in normal type are published in the literature [24] while the results in bold come from our replication of the same experiment. . . . . . . . Kingsbury. . . . . . . . . . . . .
. 122 Covariance structure for an orthogonal real wavelet. . . . . . . . .7 5. . . . . . . .6 6. . . . . . . . . . . . Comparison of segmentation results for altered DTCWT . . . . . . . . . .6 5. . . . . 74 75 76 78 79 80 80 82 83 84 85 89 90 91 96 97 97 98 99 5. Results of matching 3 by 3 raw autocorrelation values . . . . . . . . . . . . . . . .2 6. . .1 7. 75%. . . . . . . . . .NDWT.8 5. . . . . 5. . Nondecimated scale 4 wavelet coeﬃcients . . . 103 6. . . . . . . Comparison of segmentation results for diﬀerent transforms . . .1 5. . . . . . . . . . . . . .12 Comparison of segmentation results for multiscale methods . . . . . .5 Comparison of segmentation results for diﬀerent transforms . . . . . . . . . . . . . . . . . . . . .4 7. Performance measure for diﬀerent methods . . . . . . . . . . . . . . . .10 Percentage errors for (HalfCWT. Crosses show location and values of measured data points. . . . . . . . . .9 Mosaics tested . .4 6. . . . . . . . . .2 5. .7 Results of original energy matching synthesis . . . .8 7.13 Percentage errors for single scale DTCWT. . 120 Shift dependence for diﬀerent scales/dB. . . . . . . . . . . . . . . 5. 101 subband is also shown in each plot. .RealCWT. . .3 5. . . . . . . . . . . . Sine wave input . .1 6. . . . . .3 6. . . . . . . . Contours are plotted at 90%. . . . . . . . . . . . . . . . . . . . . . . . . . .4 5. . .5. . . . . . 6. . . . . . . . . . . .3 7. . . Percentage errors for (DWT. . . . . Rectiﬁed decimated scale 4 wavelet coeﬃcients . . . . . . . . . . . . . . . 105 Sequence of operations to reconstruct using a Gaussian Pyramid . . . . multiscale DTCWT. . . . . . Results of matching 5 by 5 raw autocorrelation values . . . 50%. . . . . Results of matching 5 by 5 raw autocorrelation values . . . . . . . . . . .14 Segmentation results for mosaic “f” using the multiscale DTCWT . .5 5. . . . . . . A dashed contour at the 25% peak level for the original 45◦ scale 2 Comparison of diﬀerent synthesis methods. . . . 125 . . . . .2 7. . . . . . . . . . . . . . 5. Results of matching 5 by 5 magnitude autocorrelation values . . . . . Rectiﬁed nondecimated scale 4 wavelet coeﬃcients . . . . . . . . . . . . . . .DTCWT) . . . . . . . . . . . . . . . . . . . 124 Covariance structure for a nondecimated real wavelet. . . . . . . . . . 25% of the peak amplitude. . .5 6. .11 Segmentation results for mosaic “f” using the DTCWT . . . . 117 One dimensional approximation results for diﬀerent origin positions. . . . . . . . . . . .DTCWT) 5. . . . . . . . . . . . . . . . . . 2D frequency responses for the four subbands derived from the level 2 45◦ subband. . multiscale DWT. .
. .6 9. . . . . . . 175 Performance of diﬀerent search directions using the steepest descent (x) or the conjugate gradient algorithm (o). . . . . . . . . . .6 9. .2 8. . 195 9. . . . . . . . . . . . . . . . . .5 9. . . . .1 9. . . . . . . . . . . . . . . . . . . . . . . .3 8. 196 . 187 Value of the energy function over 100 iterations . . . . . . 194 9. . . . 148 Shift dependence for diﬀerent scales. . . . . . . . . .11 Comparison of diﬀerent published ISNR results for a 9 by 9 uniform blur applied to the Cameraman image with 40dB BSNR. .5 8. . . 125 Covariance structure for the W transform. . 160 Prior cost function f (x) expressions for standard deconvolution techniques. . . . . . .9 Covariance structure for the Gaussian pyramid. . . . . . . . . 154 Relative statistical quality for DWT(o) and DTCWT(x) /dB . .7. . . . . . . .12 Deconvolution results for a 9 by 9 uniform blur applied to the Cameraman image with 40dB BSNR using the PRECGDTCWT method with WaRD initialisation. . . . . . . . . . . . . . . . . 169 Flow diagram for the proposed wavelet deconvolution method. . . . . .8 9. . 126 Covariance structure for the DTCWT . . . . . . . . 173 Block diagram of deconvolution estimation process. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 Covariance structure for a translated orthogonal real wavelet. . . .6 7. . . . . . . . . . . . . . . . . . . . . . 186 Performance of diﬀerent search directions over 100 iterations . . . . . . . . . . . . . 191 9. . . . .13 Comparison of diﬀerent published ISNR results for a Gaussian blur applied to the Mandrill image with 30dB BSNR. . . . .4 9. . . . . . . . .8 7. 154 Computation time versus SNR (128 measurements). . . .3 9. . . . . . . . . . . . . . . . . . . . .10 Comparison of ISNR for diﬀerent algorithms and images /dB . . . . . 127 7. . . . . . . . . . . . . . . . . . . .4 8. .1 8. . . . . 160 Computation time versus SNR (256 measurements). . . 184 Performance of diﬀerent search directions using the steepest descent (x) or the conjugate gradient algorithm (o) starting from a WaRD intialisation. . . . 190 9.7 7. . . . . 187 Test images used in the experiments. . . .10 Summary of properties for diﬀerent transforms . .14 Deconvolution results for a Gaussian blur applied to the Mandrill image with 30dB BSNR using the PRECGDTCWT method with WaRD initialisation. . . . . . . . . . . . . . . . . . . . . . .9 Count of important coeﬃcients for diﬀerent transforms . . . 128 8. . . . 151 Aesthetic quality for DWT(o) and DTCWT(x) /dB . .2 9. . . . . . . . . .7 9. . . . . 193 9. . . . . 189 Alternative PSF used in experiments. .
. . . . . . . . 232 C. 197 10. . . . . . . . . . . . . .α = 1). . . . . . . . . . . . . . . . . . . . . . . . . .15 Comparison of the PRECGDTCWT and Wiener ﬁltering with published results of Modiﬁed Hopﬁeld Neural Network algorithms for a 3 × 3 uniform blur applied to the Lenna image with 40dB BSNR. . 231 C. . . . . . . . . . . . . 240 .9. . . . . . . . . .3 The mirror wavelet tree structure . . . . . . . . . . . . . . . . . . . . . . 203 C. . . . . . . . . . . . .1 Eﬀective assumption about SNR levels for Van Cittert restoration (K = 3. .α = 1). . . .1 Summary of useful properties for diﬀerent applications . . . .4 2D frequency responses of the mirror wavelet subbands shown as contours at 75% peak energy amplitude. . . . . . . . . . . . . . . . . . . . . . .2 Eﬀective assumption about SNR levels for Landweber restoration (K = 3. . . . . . . . . . . . . . 238 C.
Power Spectral Density. Discrete Wavelet Transform. Gaussian Pyramid Transform. . Fast Fourier Transform. Inﬁnite Impulse Response. decibels. Perfect Reconstruction. Discrete Time Fourier Transform. W(Wavelet)Transform. Nondecimated Discrete Wavelet Transform. DTCWT Qshift Dual Tree Complex Wavelet Transform. Signal to Noise Ratio.Abbreviations and notation BSNR BW dB DTFT DWT FFT FIR GPT IIR ISNR NDWT pdf PR PSD SNR WWT Blurred Signal to Noise Ratio. Finite Impulse Response. probability density function. Improved Signal to Noise Ratio. Bandwidth.
a diagonal matrix normally containing weights for wavelet coeﬃcients.∀ ↓k ↑k a∈S a a [a]i argmaxa∈S f (a) argmina∈S f (a) A A T ∗ for all. the smallest integer not less than a. upsampling by a factor of k. the expected value of X. the ith element of vector a. C) . the value for a within set S that minimises f (a). multivariate Gaussian distribution with mean µ and covariance C. a vector containing zeros everywhere except for a 1 in position i. Ztransform of a wavelet highpass synthesis ﬁlter. number of wavelet and scaling coeﬃcients produced by a transform. downsampling by a factor of k. the value for a within set S that maximises f (a). number of input samples in a data set. the imaginary part of a. diagonal matrix containing elements of a along the diagonal. Hermitian transpose of A. absolute value of a scalar a. inverse of A. determinant of a matrix A. conjugate of A. a belongs to a set S. Frobenius norm of a. transpose of A. the largest integer not greater than a. Ztransform of a wavelet highpass analysis ﬁlter. kdimensional identity matrix. √ −1. matrix. A AH A−1 a A a diag {a} D ei E {X} G0 (z) G1 (z) H0 (z) H1 (z) {a} Ik j M N N (µ. Ztransform of a wavelet lowpass synthesis ﬁlter. Ztransform of a wavelet lowpass analysis ﬁlter.
p(θφ) pdf for θ. the real part of a. conditioned on φ. M × N matrix representing a wavelet transform. the supremum of set S. RN sup S tr(A) W w x Z . joint pdf for the elements of θ. vector space of N × 1 real vectors. N × 1 vector containing all the input samples. M × 1 vector containing wavelet coeﬃcients. a vector of random variables.P P (z) p(θ) {a} N × M matrix representing an inverse wavelet transform. product ﬁlter. the trace of matrix A.
2 .
fast adaptive contour segmentation [34]. A qualitative feel for the power of the description is given by texture synthesis experiments. we aim to compare complex wavelets with standard decimated and nondecimated real wavelet transforms. We also consider images for which the simple model is inadequate. and edge detection. A recently developed dualtree complex wavelet transform (DTCWT) has solved these two fundamental problems while retaining the properties of shift invariance and additional directionality that complex wavelets provide. The features are then experimentally tested by addressing the problem of image segmentation to show the performance relative to many other feature sets. two Bayesian and two nonBayesian.Chapter 1 Introduction 1. Traditional formulations of complex wavelets are seldom used because they generally suﬀer from either lack of speed or poor inversion properties. In this dissertation we restrict our attention to four main examples of particular interest. The aim of this dissertation is to discover when the DTCWT is a useful tool by developing complex wavelet methods to address a number of image processing problems and performing experiments comparing methods based on the DTCWT to alternative methods. We show how 3 . We ﬁrst consider nonBayesian applications and explain how to use the DTCWT to generate texture features. Complex wavelets can be used for both Bayesian and nonBayesian image processing and we have applied complex wavelet methods to a wide range of problems including image database retrieval [33]. In particular.1 Overview This dissertation investigates the use of complex wavelets in image processing.
2 Justiﬁcation for the research The wavelet transform has become a widely used technique but the fastest and most popular formulation (the fully decimated wavelet transform) suﬀers from aliasing problems. it demonstrates how a wavelet method can be much more eﬃcient than standard methods. Third. We use this Bayesian model to deal with irregularly sampled data points. we can develop theory that relates the wavelet methods to a variety of alternative techniques such as Kriging. The following sections explain the justiﬁcation for the research. It has been claimed that a recently developed complex wavelet transform gives a useful compromise solution that removes almost all of the aliasing problems for only a slight increase in computational cost. describe the original contribution of the dissertation. The wavelets are used to deﬁne a prior probability distribution for images and solution methods are developed based on these models. In this case we assume that the data is a realisation of a stationary Gaussian process. INTRODUCTION the simple model can be enhanced to handle longerrange correlations in images for better texture synthesis.4 CHAPTER 1. Second we demonstrate how complex wavelets can be used for Bayesian image processing. It has also been claimed that the new . and the kind that are too complicated. The usual solution to the aliasing is to eliminate all subsampling from the transform (to give the nondecimated wavelet transform) but this greatly increases the computation and amount of storage required (especially in multiple dimensions). This is of interest for a number of diﬀerent reasons. splines. and radial basis functions. Previous complex wavelet transforms have generally suﬀered from problems with eﬃciency and reconstruction. 1. This is of interest because it demonstrates how wavelet methods give better results than standard approaches such as Wiener ﬁltering and how a Bayesian approach to inference can further increase the accuracy. In this case we develop an enhanced nonstationary wavelet model. give an introduction to the diﬀerence between Bayesian and nonBayesian approaches. This is of interest as it provides information about the kind of images that are well modelled by complex wavelets. it provides information about the kind of images that are too simple for the complex wavelet model – in the sense that although complex wavelets provide a good answer there is a more basic technique that is signiﬁcantly faster. First. and explain the organisation of the work. Second. The ﬁnal extension is concerned with image deconvolution.
It is usually easy to ﬁnd a slow technique that will solve the problem but much more diﬃcult to ﬁnd a fast technique. The ﬁrst problem is that it is often hard to construct an appropriate model for the data. currently the new transform is not generally used: this may be due to doubts about the importance of the diﬀerences.3. BAYESIAN AND NONBAYESIAN APPROACHES 5 transform solves both these problems. Instead numerical techniques such as MCMC (Markov Chain Monte Carlo) must be used. To sharpen the discussion consider restoring an image that has been corrupted in some way. concerns about the complexity of methods based on complex wavelets. However. . The Bayesian approach is to try and construct an accurate prior probability distribution for images that are likely to occur plus a model for the type of image degradation that is believed to have occurred. In a trivial sense nonBayesian approaches are all other approaches. The model consists of specifying ﬁrstly the prior probability distributions for the model parameters and secondly the conditional probability distribution for the data given the parameters (also called the likelihood). or simply because the new transform is relatively unknown. We now list a number of features of the median ﬁlter that are often 1 A median ﬁlter replaces every pixel by the median of a set of pixels from the local neighbourhood. (Chapter 7 explains the terminology used in Bayesian signal processing. There are two main problems with this approach. 1. the best answer is the one that minimises the expected value of the cost function.) Inference is performed by the application of Bayes’ theorem in order to ﬁnd the posterior distribution for the parameters of the model conditional on the observed data. If the model correctly describes the data then the best possible answers can be calculated from the posterior distribution. A typical nonBayesian approach might be to apply a median ﬁlter1 . In this context best is deﬁned in terms of a cost function that measures the penalty for errors in the estimate. Armed with this model an estimate for the original image can be calculated from an inferred posterior distribution.3 Bayesian and NonBayesian Approaches The Bayesian approach to a problem involves constructing a model and then performing inference using the model. By testing these claims on a range of practical tasks we discover the signiﬁcance of the diﬀerences and demonstrate the simplicity of designing and implementing methods based on complex wavelets. This is a very powerful way for performing inference even for complicated models. The second problem is that the inference is usually impossible to perform analytically.1.
A Bayesian approach to segmentation is made diﬃcult by the need to specify a prior for the shapes of segments. INTRODUCTION characteristic of nonBayesian approaches: 1. However. it performs very badly (if the size of the median ﬁlter is large compared to the width of the line then every pixel will be set to the background colour). It is very fast. For these reasons. It requires no knowledge about the type of degradation. The strength is that the method can work reasonably even for the very complicated images that are seen in the real world. the degradation might be that the image is upside down). The beneﬁts consist not only of improved experimental results but additionally the mathematical framework permits a theoretical comparison of many Bayesian and nonBayesian techniques. In practice it is often eﬀective. 2. The fact that the approach works without needing the problem to be accurately speciﬁed is the source of both strength and weakness. It is not obvious what assumptions are implicitly made about the expected structure of images or the degradation.6 CHAPTER 1. 5. . It is therefore crucial that the eﬀectiveness of the method is experimentally determined. This is a large research topic by itself and there are encouraging results based on complex wavelets in the literature [59]. for interpolation and image deconvolution we attempt a Bayesian approach. This requires simplifying assumptions to be made about the problem but the beneﬁts of the Bayesian approach can be seen. The weakness is that it is also possible that the method will be totally inappropriate (for instance. and to facilitate comparison with alternative transforms. 3. we select a nonBayesian approach for segmentation (chapter 5). Currently Bayesian methods are not often used in realworld applications of image processing because of their lack of speed and the problem of modelling images. For images with certain structures. such as line drawings. 4.
of course. 4.3.1.5. 5. The references are to the corresponding sections in the dissertation. 3. We describe how Bayesian interpolation can be implemented with wavelet methods (8. We derive an expression for the noise gain of a transform in terms of the unbalance between analysis and reconstruction (2.5).3.7.4) and identify the autocorrelation of the associated process. subjective and merely represents the author’s current opinion. Medium importance contributions These are the results of interest principally to researchers in a speciﬁc area of image pro 1.4.1 Most important contributions These are the results of the most general interest. We describe shift invariant wavelet models in terms of a Gaussian random process (7. 1. 1.5).4. 2. We calculate theoretical predictions of aesthetic and statistical quality of solutions to interpolation problems (8.7.4).4 Original contributions This section describes the contributions to learning made by this dissertation from most to least important.2 cessing.4. 2.2) and measure the accuracy of these predictions (8.6. 1.5).3.4). We describe how the DTCWT can be used for image deconvolution(9) and provide experimental comparisons with other techniques (9. We explain why it is impossible to have a useful singletree complex wavelet or a shiftinvariant nonredundant wavelet transform based on short support ﬁlters (2. We develop theoretical links between a number of interpolation and approximation techniques for irregularly sampled data (8. We experimentally compare feature sets for segmentation (5. This classiﬁcation is.3). 3. ORIGINAL CONTRIBUTIONS 7 1.2). .9.
and the noise gain in reconstruction (2. We use Fourier transforms to explain why Van Cittert and Landweber methods (without a positivity constraint) will always perform worse than oracle Wiener ﬁltering (C.8 CHAPTER 1.5.5. We experimentally compare the shift dependence of interpolation methods based on the DTCWT and alternative wavelet transforms (8.3). We show how the speed of wavelet interpolation can be signiﬁcantly increased by allowing a small amount of error (8.7.2). We propose and compare a number of methods for calculating search directions within the deconvolution method (9.8. We explain a method for fast conditional simulation for problems of interpolation and approximation (8. We perform segmentation experiments to measure the eﬀect of some additional autocorrelation based features (6.3). 3.2).4.4. 2.2).8. We perform experiments to compare the noise gain performance for certain complex Daubechies wavelets and the DTCWT (2. the frame bounds for the transform.4). 6. .3).3. 4.5). We derive connections between the singular values of a wavelet transform matrix. 5. We characterise minimum smoothness norm interpolations and prove that shift dependence is always expected to decrease the quality (8. We review the main deconvolution techniques from a Bayesian perspective (appendix C). 8.3 Least important contributions These are speciﬁc experimental or theoretical results of less general interest but which give supporting evidence for the thesis. 1. INTRODUCTION 6.7). 7. 7. 1.
During the collaboration we applied the results of chapter 8 to the problem of using seismic measurements to determine subsurface structure.4.5) and multiscale segmentation methods (5.3) and display some experimental results (4. image classiﬁcation. Nevertheless.2) and display some experimental results (6. We show how the DTCWT can be used for texture synthesis (4.1. 1.8).3).4). We explain how the autocorrelation of DTCWT subbands can be used to improve the quality of texture synthesis (6. The author has chosen to use the pronoun “we” to represent himself in order to avoid both the jarring eﬀect of “I” and the awkwardness of the passive tense. 1. ORGANISATION OF THE DISSERTATION 9 1. Chapter 3 reviews some relevant work done in motion estimation. A technical report [35] has been published containing the results of a collaboration with an expert in seismic surveying. Chapter 4 proposes texture features based on complex wavelets . The next three chapters propose and test a number of nonBayesian complex wavelet image processing methods.5.4. The report itself contains contributions from the expert but all the material and results of chapter 8 are the work of the sole author. all the original research presented here is the work of the sole author. The purpose of the ﬁrst two chapters is mainly to provide background information that will be useful in the subsequent chapters.5 Organisation of the dissertation Figure 1. Chapter 2 reviews the principles of standard wavelet transforms from a ﬁlter design viewpoint and describes the properties of complex wavelet transforms. We develop pixel by pixel (5.9) based on complex wavelets. We perform some experiments using the Hidden Markov Tree for image denoising (3.4 Contributions based largely on previous work These are straightforward extensions of existing work to use the complex wavelet transform. 2. 3.1 illustrates the organisation. and image denoising that uses complex wavelets. 4.
INTRODUCTION Background 2: Wavelet transforms 3: Previous applications NonBayesian processing 4: DTCWT texture features Example applications 5: Segmentation 6: Correlation modelling Bayesian processing 7: Bayesian modelling Example applications 8: Interpolation and approximation 9: Image deconvolution Final remarks 10: Conclusions 11: Further possibilities Figure 1.10 CHAPTER 1.1: Guide to the dissertation .
Chapter 11 suggests directions for future research. Chapter 9 uses a similar Bayesian method to address the problem of deconvolution. ORGANISATION OF THE DISSERTATION 11 and examines their properties by means of texture synthesis experiments. The following three chapters propose and test Bayesian approaches to image processing. The ﬁnal two chapters summarise the ﬁndings and discuss future possibilities. Chapter 6 extends the texture set to include longerrange correlations.5.1. Chapter 7 introduces a Bayesian framework for image modelling. Chapter 5 compares a DTCWT segmentation method with the results from alternative schemes for a variety of image mosaics. At the end of the dissertation are the references and appendices. Chapter 10 discusses the impact of the research and summarises the main conclusions of the dissertation. . Chapter 8 describes the application of Bayesian methods to approximation and interpolation.
INTRODUCTION .12 CHAPTER 1.
and mathematics. The principal sources for this chapter are books by Daubechies [30].2 Introduction The concepts behind wavelets have been independently discovered in many ﬁelds including engineering. This importance of this result is demonstrated by an experiment comparing a singletree complex wavelet with a dualtree complex wavelet. 13 .Chapter 2 Wavelet transforms 2. physics. The description of wavelets and complex wavelet systems is based on the material referenced. but the equation 2. We explain why useful singletree complex wavelets will suﬀer from poor balance (we deﬁne balance as a measure of similarity between the ﬁlters in the forward and inverse transforms) and why most nonredundant transforms will suﬀer from aliasing. This dissertation is concerned with the application of wavelets to image processing problems making the engineering perspective the most useful. The chapter ﬁrst gives a short introduction to the terminology and construction of real wavelet transforms and then a review of a number of complex wavelet transforms. Mallat [75].15 mentioned above is original. The main original contribution of the chapter is an equation relating the balance of a transform to the amount of noise ampliﬁcation during reconstruction which shows why a balanced complex wavelet transform is preferred.1 Summary The purpose of this chapter is to introduce and motivate the use of a complex wavelet transform. 2.
1: Building block for wavelet transform This diagram is to be understood as representing the following sequence of operations: 1. Filter the input signal x(n) with the ﬁlter whose Ztransform is H1 (z).3 The Wavelet Transform We will ﬁrst describe the one dimensional dyadic discrete time wavelet transform. say.14 CHAPTER 2.↓ 2 . (2. . .y1 Figure 2.1. 3. This operation converts a sequence of kM coeﬃcients a(0). We assume familiarity with c c the Ztransform. We follow the notation of Vetterli [121]. averaged over all time. a(kM −1) to a sequence of M coeﬃcients b(0). 2. The wavelet transform is based upon the building block shown in ﬁgure 2.y0 x . It is represented by the notation ↓k . a(1). Downsample the ﬁlter output by 2 to give output coeﬃcients y0 (n). WAVELET TRANSFORMS Strang and Nguyen [113]. This is a transform similar to the discrete Fourier transform in that the input is a signal containing N numbers. 2.H1(z) .H0(z) . This block is crucial for both understanding and implementing the wavelet transform. . and the output is a series of M numbers that describe the timefrequency content of the signal. Downsample the ﬁlter output by 2 to give output coeﬃcients y1 (n). . The Fourier transform uses each output number to describe the content of the signal at one particular frequency. and Vetterli and Kova˘evi´ [122]. b(M − 1) by retaining only one of every k coeﬃcients b(n) = a(kn). In contrast. . .1) . Filter an input signal (whose value at time n is x(n)) with the ﬁlter whose Ztransform is H0 (z). . b(1). . 4. the outputs of the wavelet transform are localised in both time and frequency. .↓ 2 . Downsampling by k is a common operation in subband ﬁltering.
A full wavelet transform is constructed by repeating this operation a few times. The downsampling is a way of preventing redundancy in the outputs.↑2  G0 G1 + ?z 6 Figure 2.↓2  H0 H1 . Filter the upsampled signal with G0 .3 shows the building block for the reconstruction. 2. y0 y1 This block represents the .y0000 .↓ 2 . Upsample the lowpass coeﬃcients y0 by 2.y1 .3.↓ 2 .↓ 2 . . and the lowpass ﬁltered coeﬃcients in y0 are known as scaling coeﬃcients.2. the general trends given by y0 . This represents the forward wavelet transform. 3.2 shows an example of a 4level subband decomposition tree.3: Building block for inverting the wavelet transform following operations: 1.↓2  H0 H1 . The idea is to split the original signal into two parts. Upsample the highpass coeﬃcients y1 by 2. and the ﬁne details given by y1 .y0001  .y001 H1 Figure 2. THE WAVELET TRANSFORM 15 For wavelet transforms H0 (z) will be a lowpass ﬁlter and H1 (z) will be a highpass ﬁlter. Each time the basic splitting operation is applied to the scaling coeﬃcients just generated.↓ 2 . Level 3 Level 2 Level 1 y0 y00 Level 4 y000 H0 x H0 H1 .↑2 .2: Subband decomposition tree for a 4 level wavelet transform The ﬁlters are carefully designed in order that the wavelet transform can be inverted.↓ 2 . The detail coeﬃcients (highpass ﬁltered) in y1 are known as wavelet coeﬃcients. Figure 2. Figure 2.↓2  .y01 .
The ﬁlters are usually designed to ensure that when this reconstruction block is applied to the outputs of the analysis block. . For example. . Reconstruct y0 from y00 and y01 . . 4. The structure described above is an eﬃcient way of implementing a wavelet transform. This operation converts a sequence of M coeﬃcients b(0). WAVELET TRANSFORMS 4. . We now describe an alternative structure that is less eﬃcient but often more convenient for theoretical results. The alternative relies on the equivalence of the following two transforms: 1. 2. Use the block to reconstruct y000 from y0000 and y0001 . . . Filter the upsampled signal with G1 . The impulse responses of these combined ﬁlters are called analysis wavelets (for any combination including a highpass ﬁlter) or scaling functions (for a combination of only lowpass ﬁlters). a(1). Downsample by k then ﬁlter by H(z). b(1). Filter by H(z k ) then downsample by k. the y001 coeﬃcients are produced by ﬁltering with W001 (z) = H0 (z)H0 (z 2 )H1 (z 4 ) followed by downsampling by 8. Add the two ﬁltered signals together. This is known as perfect reconstruction (PR). This equivalence allows us to move the downsampling steps in ﬁgure 2. We can use this block repeatedly in order to recover the original sequence from the wavelet transform coeﬃcients: 1. .4 in which all the downsampling operations have been moved to the right. 2. otherwise a(n) = 0. Upsampling by k is represented by the notation ↑k . More precisely: if n is a multiple of k then a(n) = b(n/k). b(M −1) to a sequence of kM coeﬃcients a(0). . the output sequence z(n) is identical to the input sequence x(n).16 CHAPTER 2. . 5. Reconstruct y00 from y000 and y001 . a(kM − 1) by inserting k − 1 zeros after every coeﬃcient. Each subband is now produced by a sequence of ﬁlters followed by a single downsampling step. 3. Reconstruct x from y0 and y1 .2 past the ﬁlters to produce the equivalent structure shown in 2.
4) .y0000 H1(z8) .or simply the scale 3 wavelet.↓ 16 .y1 H1(z2) .↓ 16 .) It can be shown that solutions are given by any FIR ﬁlters that satisfy the following equations H1 (z) = z −1 G0 (−z) (2. The impulse response in this case is called the reconstruction or synthesis wavelet.y0001 . 2. In this case the LHS of the ﬁrst equation is of the form 2z −k for some integer k.2) (2. In a similar way the reconstruction can be represented as an upsampling step followed by a single ﬁltering step. It can be shown [121] that a necessary and suﬃcient condition for perfect reconstruction is that 2 = H0 (z)G0 (z) + H1 (z)G1 (z) 0 = H0 (−z)G0 (z) + H1 (−z)G1 (z) (2.3) (Sometimes the perfect reconstruction condition is relaxed to mean that the reconstructed signal is identical to a shifted version of the original.3.H1(z) . THE WAVELET TRANSFORM 17 Level 4 Level 3 Level 2 Level 1 .↓ 4 .↓ 2 .1 Filter design and the product ﬁlter Vetterli showed that only FIR (Finite Impulse Response) analysis and synthesis ﬁlters lead to perfect reconstruction without implicit pole/zero cancellation [121].↓ 8 .H0(z) x(n) H0(z2) H0(z4) H0(z8) . Suppose that we want to design analysis and reconstruction FIR ﬁlters that can perfectly reconstruct the original sequence.2.y01 H1(z4) .4: Alternative structure for a subband decomposition tree The impulse response of W001 (z) is called the analysis wavelet for scale 3 .y001 Figure 2.3.
Balanced For real ﬁlters we deﬁne the system to be balanced if G0 (z) = H0 (z −1 ) and G1 (z) = H1 (z −1 ). substituting this into equation 2. WAVELET TRANSFORMS G1 (z) = zH0 (−z) P (z) + P (−z) = 2 where P (z) is known as the product ﬁlter and is deﬁned as P (z) = H0 (z)G0 (z). Finally. or adding a time delay to the analysis ﬁlters and a time advance to the reconstruction ﬁlters (or the other way around). If we ignore such trivial changes then it can also be shown that any FIR ﬁlters that achieve perfect reconstruction must also satisfy the design equations given above1 .6) 1.3 shows that H1 (z) = −(1/r)(−z)−k G0 (−z).5) (2. For convenience the important deﬁnitions from the previous sections are repeated here. Perfect reconstruction (PR) A system has the perfect reconstruction property if the combination of a forward and reverse wavelet transform leaves any signal unchanged. A similar argument shows that any nontrivial zeros of G1 (z) belong to H0 (−z) and hence G1 (z) = rz k H0 (−z) where k is an integer delay and r is a scaling factor. If we have a solution then we can produce additional solutions by (2.2 is true then it is clear that H0 (z) and H1 (z) cannot share any nontrivial zeros (we call zeros at the origin trivial). If equation 2. Analysis ﬁlters The ﬁlters used in the forward wavelet transform (H0 (z) and H1 (z)).18 CHAPTER 2.2 Terminology This section deﬁnes a number of terms that will be used in the following discussion. These simple changes do not change the wavelet transform in any signiﬁcant way. either multiplying all the coeﬃcients in an analysis ﬁlter by r and all the coeﬃcients in the corresponding reconstruction ﬁlter by 1/r.3 is true then any nontrivial zeros of H0 (−z) must therefore belong to G1 (z). 1 If the equation 2. . Reconstruction ﬁlters The ﬁlters used in the reverse wavelet transform (G0 (z) and G1 (z)). 2. (For complex ﬁlters balance requires equivalence of the reconstruction ﬁlters with the conjugate time reverse of the analysis ﬁlters. 2.3.) Balanced ﬁlters will therefore have equal magnitude frequency responses Ga (ejθ ) = Ha (ejθ ).
For even length ﬁlters we also allow a time delay. Shift invariant We call a method shift invariant if the results of the method are not aﬀected by the absolute location of data within an image. Nevertheless. Symmetric We say that an odd length ﬁlter with Ztransform H(z) is symmetric with even symmetry if H(z) = H(z −1 ). a method . BiOrthogonal A PR system is biorthogonal if the transform is nonredundant but not balanced. Orthogonal A PR system is orthogonal if the transform is nonredundant and balanced. and in particular that there is no conjugation.2. In fact. even symmetry means H(z) = z −1 H(z −1 ). the concept is crucial and within this dissertation we will exclusively use the deﬁnition given here. Nonredundant A transform is nonredundant if the redundancy is 1. Redundancy The redundancy of the transform is the ratio of the number of outputs to the number of inputs. We will use antisymmetric as another way of saying symmetric with odd symmetry. Near balanced The system is near balanced if the analysis ﬁlters are close to the conjugate timereverse of the reconstruction ﬁlters. Note that these deﬁnitions are for both real and complex signals. Ideal ﬁlter We say a ﬁlter is ideal if its frequency response H(f ) takes the value 1 on a set of frequencies. THE WAVELET TRANSFORM 19 This deﬁnition is not normally used in wavelet analysis because for critically sampled systems it is equivalent to orthogonality. or symmetric with odd symmetry if H(z) = −H(z −1 ). In other words.3. and 0 on all other frequencies. the term balance has been used for other purposes within the wavelet literature (Lebrun and Vetterli use it to measure the preservation of a polynomial signal in the scaling coeﬃcients during reconstruction [70]) and the reader should be aware that our usage is not standard. Product ﬁlter The product ﬁlter P (z) is deﬁned as the product of the lowpass analysis and reconstruction ﬁlters P (z) = H0 (z)G0 (z). A complex coeﬃcient is counted as two outputs. odd symmetry means H(z) = −z −1 H(z −1 ).
Shift dependent We call a method shift dependent if the results of the method are aﬀected by the absolute location of data within an image. When confusion is possible we will use the subscripts R and C to denote the separate and complex forms. We will use x to be a N × 1 column vector containing all the input signal values. We will call a transform shift invariant if it produces subbands such that the total energy of the coeﬃcients in any subband is unaﬀected by translations applied to the original image. Let N be the number of input samples and M the number of output coeﬃcients. As it is often convenient to express algorithms using this matrix notation we adopt the convention that whenever such a multiplication has to be numerically evaluated it is tacitly assumed that a fast ﬁlterbank implementation is used. We also deﬁne a N × M matrix P to represent the inverse wavelet transform such that (for perfect reconstruction wavelet systems) x = P w.20 CHAPTER 2. treating the output as complex coeﬃcients we can write wC = WC x . We call a transform shift dependent if it produces a subband such that translations of an image can alter the total energy in the subband. For example. WAVELET TRANSFORMS that gives the answer b when applied to data a is called shift invariant if it gives a translated version of b when applied to a translated version of a. Let w denote a M × 1 column vector containing the wavelet coeﬃcients and let W denote a M × N matrix representing the wavelet transform such that w = W x. For complex wavelet transforms we will sometimes use complex coeﬃcients but other times it is more useful to consider the real and imaginary parts separately. It is often useful in developing theoretical results to use vector and matrix notation to describe the transform. Matrix multiplication is a very ineﬃcient way of calculating wavelet coeﬃcients and such an operation should always be implemented using the ﬁlter bank form described earlier.
it is convenient to retain the same matrix and vector notation so that a N ×1 vector x represents an image containing N pixels and W x represents computing the two dimensional wavelet transform of x. The explanation has so far been restricted to the wavelet transform of one dimensional signals but we will use the same deﬁnitions and notation for two dimensional wavelet transforms of images. if we want to construct an orthogonal wavelet . Methods diﬀer in whether the edge samples are doubled up. In particular. The eﬃcient implementation of such a two dimensional wavelet transform requires the alternation of row and column ﬁltering steps [113]. The problems occur when a ﬁlter requires samples outside the deﬁned range. Any of these edge treatments still results in an overall linear transform. A sample from just before the beginning is assumed to have the same value as a sample just after the beginning. In actual wavelet implementations the data sets are ﬁnite and care must be taken when processing coeﬃcients near the edges of the data set. The easiest way to treat the edges and preserve the PR property is to assume that the signal is periodic (known as periodic extension). It is this complete transform (including edge eﬀects) that is represented by the matrices W and P . A third method (known as symmetric extension) that avoids discontinuities at the edge is based on reﬂections of the original data. In other words. THE WAVELET TRANSFORM 21 and then use these complex coeﬃcients to deﬁne the separated form wR = {wC } {wC } or equivalently we can calculate the separated form directly by wR = WR x. 2.3.3. This has the drawback that discontinuities are normally created at the edges of the dataset.2. A natural approach is to assume that such values are zero (known as zero extension) but this will not produce a perfect reconstruction system (except for ﬁlters with very short support such as the Haar ﬁlters). For example.3 Single tree complex wavelets Complex wavelets can be produced by using ﬁlters with complex coeﬃcients. a sample from just before the beginning of the data set is assumed to have the same value as a sample just before the end. With a careful design symmetric extension can also result in a perfect reconstruction system. This allows greater freedom in the design.
if complex coeﬃcients are allowed then many possible solutions are allowed.22 CHAPTER 2.5 contains theoretical results linking noise ampliﬁcation to the balance between analysis and . We now explain why it is impossible to get a useful single tree complex wavelet transform (with either orthogonal or biorthogonal ﬁlters) that will both be able to distinguish positive and negative frequencies and have good reconstruction properties. such as certain cases of the complex Daubechies wavelets[73]. From the equation P (z) + P (−z) = 2 we see that any frequency must be contained in the passband of either P (z) or P (−z) and that therefore the passband of P (z) must cover at least half the spectrum. It is of particular interest to construct a (necessarily complex) wavelet transform that is able to distinguish positive and negative frequencies. By removing the negative passband the aliasing can be greatly reduced [63. both positive and negative. The ﬁrst reason only applies to multidimensional data sets. H1 (z) = (1/ (2))(1 − z −1 )) . 64]. Wavelet methods are often shift dependent due to aliasing caused by the downsampling. For a useful transform we want P (z) to be within the low frequency half of the spectrum (more on this assumption later) and hence the passband of P (z) must cover all of the low frequencies. When images are analysed complex ﬁlters can separate the information in the ﬁrst and second quadrants (of 2D frequency space). However. There are two main reasons for this: 1. Any symmetric wavelet (with either even or odd symmetry) will have an equal magnitude response to positive and negative frequencies. Now consider the asymmetric case. This permits methods to distinguish features near 45◦ from those near −45◦ . WAVELET TRANSFORMS transform with symmetric wavelets then the only possible choice with real coeﬃcients is the Haar wavelet (the Haar wavelet has very simple analysis ﬁlters H0 (z) = (1/ (2))(1 + z −1 ). We deﬁne the passband as the frequencies for which the magnitude of the frequency response is above 1. Section 2. Real ﬁlters have both negative and positive frequency passbands and usually an aliased version of the positive passband will have a signiﬁcant overlap with the negative passband. but the second reason is always important. Unfortunately this leads to very bad noise ampliﬁcation: small changes made to the wavelet coeﬃcients result in large changes in the reconstructed signal. Therefore if H(z) is biased towards positive frequencies then G(z) must be biased towards negative frequencies. 2.
A lowpass product ﬁlter. Separable ﬁltering means that we can apply a 2D ﬁlter by ﬁrst ﬁltering all the .6) it is not generally useful. The fundamental conﬂict is that we require narrow passbands in order to reduce shift dependence. for example.3. We will show that the frequency responses of H0 (z) and G0 (z) must be close for the wavelet transform to achieve low noise ampliﬁcation. 2.2. However. By. such an operation will have the scaling coeﬃcients tuned to some nonzero frequency and while this may be appropriate for some specialised application (for example. 3. The last property merits a little further discussion. The ability to distinguish positive and negative frequencies. applying a phase rotation to the ﬁlter coeﬃcients of an orthogonal real wavelet transform hk → hk exp {jθk} (where θ is a real number but not a multiple of π) it is certainly possible to construct a complex wavelet transform with balanced ﬁlters and perfect reconstruction (this operation corresponds to frequency shifting all the ﬁlter frequency responses and hence the product ﬁlter is no longer lowpass). 4. but that the product ﬁlter passband for a single tree complex wavelet transform must necessarily cover half the spectrum. the wavelet transform in section 2. Perfect reconstruction. 2. Complex wavelets only reduce shift dependence problems when the overlap between aliased passbands is reduced [63]. the system will still possess the same aliasing problems of the original real wavelet. Real ﬁlters must respond equally to positive and negative frequencies and hence transforms based on separable ﬁltering with real ﬁlters will not diﬀerentiate between adjacent quadrants in the 2D frequency plane. We conclude that a complex wavelet transform based on a single dyadic tree cannot simultaneously possess the four following properties: 1. More importantly.3.4 Directionality and Ridgelets The previous section attempted to motivate the use of complex wavelets by their ability to give shift invariance and better directionality properties. Balanced ﬁlters leading to low noise ampliﬁcation during reconstruction. THE WAVELET TRANSFORM 23 reconstruction ﬁlters.3.
Another important alternative is known as a Ridgelet transform [19. the transform naturally inherits the aliasing of the 1D DWT. A particular basis function of the ridgelet transform has a constant proﬁle (equal to a 1D wavelet) in some speciﬁc direction depending on the associated angle in the Radon transform.24 CHAPTER 2. Cand`s and Donoho have developed a mathematical framework for a rigorous treate ment of a continuous ridgelet transform[19] and notions of smoothness associated with this transform[20] but we shall only discuss the discrete version. and skewing the frequency content of the image. Unfortunately. as the ridgelet transform is based upon a 1D DWT. This results in a transform that splits the spectrum into a number of fan shaped portions but is shift dependent and does not diﬀerentiate between diﬀerent scales. It would be interesting to construct a complex ridgelet transform by replacing the DWT as this might add shift invariance to the other properties of the ridgelet. A Radon transform computes the projection of the image intensity along a radial line oriented at a speciﬁc angle. The ridgelet transform acting on images can be implemented by a Radon transform followed by the application of a onedimensional wavelet transform to slices of the Radon output. However. WAVELET TRANSFORMS rows with one 1D ﬁlter. 20]. 2. and then ﬁltering all the columns with a second 1D ﬁlter. However. Bamberger and Smith proposed a directional ﬁlter bank [7] that generalises the notion of separability by modulating. For the ridgelet transform. Later in this chapter we discuss examples of useful complex wavelets that do reduce aliasing. angles of the form 2πl2−j are used where j and l are integers. This has a number of advantages including low storage requirements and fast computation. rotating. This leads to eﬃcient computation of wavelet transforms but it is not the only possibility.5 Shift invariance and the Harmonic wavelet The tree structure described for the DWT is nonredundant as it produces the same number of output coeﬃcients as input coeﬃcients.3. in this dissertation we have chosen to extensively test a single representative complex wavelet transform rather than exploring the range of construction options. there is one important disadvantage: any nonredundant wavelet transform based on FIR ﬁlters will produce shift dependent . The large range of angles used means that the ridgelet transform has good directionality properties and is much better suited than the standard real wavelet for analysing straight lines and edges of arbitrary orientations.
This means that a inverse transform followed by the forward transform will give identical wavelet coeﬃcients. Now consider the elementary processing step that reconstructs from just the coeﬃcients in one subband. This shows that no matter what games are played with sampling structures and ﬁlters it is always impossible to avoid shift dependence (for a linear nonredundant PR transform) without constructing ideal band pass ﬁlters. and we conclude that the transform either possesses ideal bandpass ﬁlters or that it results in shift dependent processing. Let T be a diagonal matrix whose diagonal entries select out a chosen subband.7) and we conclude that repeating the ﬁltering does not change the output.3. PR means that P W = IN . Essentially the problem is that the subbands are critically sampled and hence there will always be aliasing unless the ﬁlters have an ideal band pass response. The downsampling introduces aliasing and so the results of processing will depend upon the precise location of the origin. Suppose we have some linear PR nonredundant transform represented by the matrices W for the forward transform and P for the inverse transform. Therefore P = W −1 and W P = IN . This is elementary both in the sense that it is simple and in the sense that more complicated operations can often be viewed as a combination of such steps.2. if we repeat the ﬁltering the output is PTWPTWx = PTTWx = PTWx (2. . It may be thought that by constructing some new tree system with carefully chosen ﬁlters and degrees of downsampling that produce oversampling in some subbands and undersampling in others it may be possible to get round this problem and produce a linear transform with a negligible amount of aliasing while still using short support ﬁlters.8) (2. The ﬁltering can therefore be represented as z = PTWx However. while all the other entries in T are zero. THE WAVELET TRANSFORM 25 methods. if wi is an output coeﬃcient in the chosen subband then Tii = 1. In other words. Any ﬁlter localised in both space and frequency should continue to change a signal when repeated. If the transform is to be shift invariant then this operation must represent a stationary ﬁltering operation. However. As the transform is nonredundant both W and P are square matrices. FIR ﬁlters always have a nonideal response. We now consider the performance of such a system.
However. Therefore one of the aims of the dissertation is to experimentally test the importance of aliasing in diﬀerent applications. The drawback .7 (where T is now deﬁned to preserve the transmitted coeﬃcients). For example.26 CHAPTER 2. It is impossible to strengthen the results because of three important counter examples. it is not true that signiﬁcant aliasing necessarily leads to worse results. WAVELET TRANSFORMS In fact. Compute the N point FFT (Fast Fourier Transform) of the data x. If the reconstructed (degraded) image is now coded again with the same lossy image coder then the result of equation 2. this argument suggests the stronger result that the amount of shift dependence is directly related to the amount the ﬁlters diﬀer from an ideal bandpass response. The easiest way to describe orthogonal harmonic wavelets is to give an account of an eﬃcient algorithm for their construction [86]: 1. Of course. In the discussion above we have always needed to exclude ﬁlters with ideal responses. From this construction it is easy to construct a perfect reconstruction inverse by inverting each step. suppose we wish to implement a very simple lossy image coder by just transmitting a few of the largest coeﬃcients. This results in shift invariant processing in a trivial sense by means of doing nothing. The reconstructed image will be the z of equation 2. In particular. It is also clear that the ﬁlters corresponding to each subband have an ideal bandpass response and hence result in a shift invariant system. 2. Thirdly and most interestingly is the example of orthogonal harmonic wavelets. Subband k is formed from the mk point inverse FFT of mk consecutive Fourier coeﬃcients. the second example is the wellknown Fourier transform that also results in a shift invariant system. in practice there will be quantisation errors and a more sophisticated choice of which coeﬃcients to keep but it is certainly feasible that the aliasing is beneﬁcial. orthogonal harmonic wavelets provide a complete set of complex exponential functions whose spectrum is conﬁned to adjacent nonoverlapping bands of frequency. Less trivially. The ﬁrst example is a transform consisting of the ﬁlter H(z) = 1 that produces a single subband (containing the original data).8 holds and proves that no additional errors are introduced by the repeated coding. There is no restriction on the number mk of coeﬃcients for each subband except that together each coeﬃcient must be associated with exactly one subband. Harmonic wavelets were proposed by Newland [85] and are particularly suitable for vibration and acoustic analysis [86].
The multiple subbands produced by this complex ﬁltering can be recombined to give a perfect reconstruction. This type of complex wavelet transform has increased directionality. Using increased redundancy in this method could reduce this additional shift dependence but will never remove the shift dependence caused by basing the transform on the output of a standard decimated wavelet transform. The complexity of the Fourier transform is order N log N while a wavelet transform is order N but for signals of modest length the harmonic wavelet may well be quicker to compute. complex wavelets Recently a new complex wavelet transform has been proposed [120] that applies ﬁlters diﬀerentiating between positive and negative frequencies to the subbands from a standard wavelet transform. and reduced shift dependence. (Recall that we cannot hope to reconstruct from just a single branch.2.3. The outputs of these ﬁlters are again subsampled so that the complete complex transform is nonredundant. In practice. We have actually selected a diﬀerent form of complex wavelet transform as a representative for the experiments but we would expect the results to be very similar for the harmonic wavelets.3. such as the topright quadrant. for the reasons given in section 2. the additional ﬁltering discriminating between the diﬀerent quadrants of frequency space will cause additional shift dependence errors. THE WAVELET TRANSFORM 27 of an ideal bandpass response is that the associated wavelets have a poor localisation in time. directionally selective. but as it is based on the shift dependent DWT subbands it naturally retains the DWT shift dependence. the boxcar spectrum of the orthogonal harmonic wavelets is smoothed to improve this localisation and the spectra of adjacent wavelet levels are overlapped to give oversampling to improve the resolution of time frequency maps generated from the wavelets.3. From a computational perspective there is not much diﬀerence between this method and a complex wavelet implemented with a tree structure. . increased directionality. 2.3.) We proposed two main reasons for wanting to use complex wavelets.6 Nonredundant. Furthermore. The design freedom of harmonic wavelets makes them well suited for analysis and a careful design would also permit a stable reconstruction transform to be generated. These more practical systems are known as harmonic wavelets. The resulting transform would be a redundant complex wavelet system.
Although this is good for reducing aliasing. We will call these basis wavefunctions the wavelets of this transform. in descending numerical order.e.28 CHAPTER 2. The only design criteria for the wavelets is good timefrequency energy concentration. but errors will be magniﬁed by the tree structure or by iterative techniques. it leads to problems during reconstruction. For perfect reconstruction we need an overall frequency response that sums to unity for . there is no guarantee that it will be possible to have ﬁnite impulse response (FIR) reconstruction ﬁlters.406 [126]. of Q. The main problems with the FPSS occur when we need to reconstruct the signal from the transform coeﬃcients. then the output also contains N complex numbers. Such functions are called ﬁnite prolate spheroidal sequences (FPSSs). The eigenvector corresponding to the largest eigenvalue can then be translated and frequency shifted to construct a set of basis functions that tile the timefrequency plane. There is no direct consideration of the reconstruction ﬁlters or of the eﬀect of constructing a wavelet pyramid from the functions. In this case critically sampled means that if we have an input containing N complex numbers. Wilson has examined the properties of a critically sampled FPSS [126]. It is suggested [126] that truncating the inverse ﬁlters results in an almost perfect reconstruction. These functions are the solutions of a simple energy form of the uncertainty principle.5. WAVELET TRANSFORMS 2. A FPSS can be deﬁned as the eigenvectors of a linear transform that ﬁrst bandlimits a signal and then truncates the signal. The frequency responses of the functions tend to be Gaussian shaped and well separated. The signiﬁcance of the condition number will be seen in section 2.7 Prolate spheroidal sequences Slepian introduced the use of the prolate spheroidal wavefunctions for signal processing [109]. For example.9) where σk is the (k + 1)th eigenvalue.2. He deﬁnes a matrix Q = W H W where W represents the transform (i.348 and 1. calculating the correlation of the signal with each wavelet) and W H represents the Hermitian transpose of W . For practical application it is useful for the functions to be deﬁned on ﬁnite 2D lattices [126]. If the wavelets were orthogonal then Q would be equal to the identity matrix. This means that the ratio of the eigenvalues varies by more than a factor of 1.3. The condition number µ of this matrix is measured. The condition number is deﬁned as µ(Q) = σ0 /σN −1 (2. As this is greater than 1 the reconstruction ﬁlters will not be balanced.8 (the square of the condition number). Wilson found condition numbers ranging between 1.
Manjunath and .4 Redundant complex wavelets We ﬁrst describe the traditional formulation (called Gabor wavelets) and problems of redundant complex wavelets and then explain recently developed solutions. Figure 2. orientations. y) = 1 2πσx σy exp − 1 2 x2 y2 + 2 2 σx σy + 2πjW x (2.13) where θ = nπ/K and K is the total number of orientations.10) where σx and σy are the bandwidths of the ﬁlter and W is the central frequency. This section describes the choice of Gabor wavelets that Manjunath and Ma found to be best in their texture processing experiments [76]. Another problem occurs if we try and use the FPSS wavefunctions as the low and high pass analysis ﬁlters of a wavelet transform.11) (2.2.12) (2. REDUNDANT COMPLEX WAVELETS 29 all frequencies. They were originally proposed in 1980 by Marcelja [77] for 1D and Daugman [31] for 2D in order to model the receptive ﬁeld proﬁles for simple cells in the visual cortex. The low pass ﬁlter does not necessarily have a zero at a frequency of π and therefore the coarse level scaling functions can develop oscillations [30]. 2. The term Gabor wavelets is used for several diﬀerent systems that diﬀer in the choice of positions. A twodimensional Gabor function centred on the horizontal frequency axis can be written as g(x. This function can then be dilated and rotated to get a dictionary of ﬁlters by using the transformation gmn (x. y) = a−m g(x .4.5 shows these halfpeak contours. Given a certain number of scales and orientations. This results in large ampliﬁcation being necessary for some frequencies and hence bad noise ampliﬁcation properties due to the unbalance between analysis and reconstruction ﬁlters. y ) x y = a−m (x cos θ + y sin θ) = a−m (−x sin θ + y cos θ) (2. and scales for the ﬁlters. the scaling factor a and the bandwidths of the ﬁlters are chosen to ensure that the halfpeak magnitude support of the ﬁlter responses in the frequency spectrum touch each other.
30 CHAPTER 2. Such methods have two main problems: 1. Some attempts have been made to reduce the amount of redundancy. He developed a complex wavelet transform based on short 4tap ﬁlters that had responses very close to Gabor . This is a slow process.5: Contours of halfpeak magnitude of ﬁlters at scales 3 and 4 They can be implemented using the Fast Fourier Transform (FFT) to perform the ﬁltering. 2. For example Daugman [32] uses a subsampled set of Gabor wavelets on a regular grid.04 0. This process gives a very high redundancy (equal to the number of subbands) and is therefore slow to compute. They are hard to reconstruct. They are ineﬃcient. The Gabor wavelet coeﬃcients are found by calculating the full transform and discarding the unwanted coeﬃcients.02 −0.05 horizontal frequency (/sample freq) 0. Daugman achieves his reconstruction by a process of gradient descent during analysis that ﬁnds weights for the Gabor wavelets to allow simple reconstruction by ﬁltering [32]. The problem is expressed in terms of a neural network that must be trained for each new image to be processed.06 0.1 0. P¨tzsch et al propose an approximate reconstruction that ignores the interaction o between jets at diﬀerent nodes [95].05 0 0.12 vertical frequency (/sample freq) 0. and the same number of inverse transforms as there are desired subbands in the image. WAVELET TRANSFORMS Ma found that a choice of 4 scales (with a scaling factor of a = 2) and 6 orientations at each scale was best.1 −0. This requires one forward transform.04 −0.08 0.02 0 −0. Their exact reconstruction takes 900 times longer than the approximate method. The main advantage is that the frequency responses can be chosen to achieve perfect reconstruction. while P¨tzsch et al [95] o use sets of Gabor wavelets (that they call jets) centered on a small number of nodes. An alternative approach was developed by Magarey [74]. 0.1 Figure 2.
05 0 0.08 0. The complex wavelet transform attains these properties by replacing the tree structure of the conventional wavelet transform with a dual tree shown in ﬁgure 2. . The frequency responses for the 2D transform are shown in ﬁgure 2. but the number of orientations is built into the method).1 Figure 2.6: Contours of 70% peak magnitude of ﬁlters at scales 3 and 4 The main advantages as compared to the DWT are that the complex wavelets are approximately shift invariant and that the complex wavelets have separate subbands for positive and negative orientations. there are 6 orientations at each of 4 scales (any number of scales can be used. translations cause large changes to the phase of the wavelet coeﬃcients. By using even and odd ﬁlters alternately in the trees it is possible to achieve overall complex impulse responses with symmetric real parts and antisymmetric imaginary parts.12 vertical frequency (/sample freq) 0. but the magnitude.02 0 −0.04 0.02 −0. 0.2.06 0. As for the Gabor wavelets.4. and hence the energy. At each scale one tree produces the real part of the complex wavelet coeﬃcients. This eﬃcient system was successfully used for motion estimation (as described in section 3.2) but did not possess a simple set of reconstruction ﬁlters. while the other produces the imaginary parts.4.1 0. 2.7.04 −0.05 horizontal frequency (/sample freq) 0.1 −0. 63] have similar shapes to Gabor wavelets. The extra redundancy allows a signiﬁcant reduction of aliasing terms and the complex wavelets are approximately shift invariant [63].6. Conventional separable real wavelets only have subbands for three diﬀerent orientations at each level and cannot distinguish lines near 45◦ from those near −45◦ . REDUNDANT COMPLEX WAVELETS 31 wavelets. is much more stable. Note that all the ﬁlters in the dual tree are real. Complex coeﬃcients only appear when the two trees are combined.1 Dual tree complex wavelet transform Kingsbury’s complex wavelets [62.
Kingsbury.H00b .H.H01b .↑ 2 .1 + ?.H0001b . WAVELET TRANSFORMS Level 4 Level 3 Level 2 Level 1 x0a x00a x000a Tree a H0a odd H1a .↓2 . 2band reconstruction block ..H.0 x.↓2 .↓ 2 . .↓ 2 .G.x0001b odd  .↓ 2 .H000a .1 .H01a .32 CHAPTER 2.x01a x00b ..H000b ..x0000a H0001a .↓ 2 even .↓ 2 .↓ 2 odd H0000a .↓ 2 .H00a . 6 Figure 2...x001b .y .↓ 2 ..x1b .G.H001b .↓ 2 .↓ 2 odd .↓ 2 ..H001a .↓ 2 .↓ 2 .x1a x0b .0 .↓ 2 even .x0001a even  .↓ 2 .7: The complex wavelet dual tree structure.. This ﬁgure was provided by Dr N..x01b .H0000b .x0000b .↓ 2 ...↑ 2 .x001a x000b x Tree b H0b odd H1b ..
REDUNDANT COMPLEX WAVELETS 33 The ﬁlters are designed to give a number of desired properties including strong discrimination between positive and negative frequencies. The ﬁlter sets must be biorthogonal because they are linear phase. 2. The main problems with the odd/even ﬁlter approach to achieving this delay are that [65]: 1. the ﬁlters at level 1. There are two sets of ﬁlters used. This tree is shown in ﬁgure 2. The ﬁlters beyond level 1 have even length but are no longer strictly linear phase. There are a number of choices of possible ﬁlter combinations. Note that it is impossible to discriminate positive and negative frequencies when using conventional real wavelets.2. This important property means that in a 2D version of the dual tree separable ﬁlters can be used to ﬁlter an image and still distinguish the information in the ﬁrst and second quadrants of the twodimensional frequency response . Instead they are designed to have a group delay of approximately 1 . The subsampling structure is not very symmetrical. and the ﬁlters at all higher levels. We have . 2. In d dimensions with N samples. These drawbacks have been overcome with a more recent form of the dual tree known as a Qshift dual tree [65].4. The results of inverting both trees are averaged as this achieves approximate shift invariance. For comparison the fully decimated transform has order N and the nondecimated wavelet transform has order N((2d − 1)k + 1) where k is the number of scales. so that the reconstruction ﬁlters are just the time reverse of the equivalent analysis ﬁlters. a delay diﬀerence of 1 2 sample is required between the outputs of the two trees. More precisely. The ﬁlters are nearbalanced and permit perfect reconstruction from either tree.information that allows us to distinguish features at angles near 45◦ from those near −45◦ . the transform has a computational order of N2d . The PR ﬁlters used are chosen to be orthonormal. The required delay diﬀerence of 4 1 2 sample is achieved by using the time reverse of the tree a ﬁlters in tree b.2 Qshift Dual tree complex wavelets In each subband one tree produces the real part and the other the imaginary part of the complex wavelet coeﬃcient and so the ﬁlters in the two trees cannot be identical but must be designed to produce responses that are out of phase. 3.4. The two trees have slightly diﬀerent frequency responses.8.
↓2 .↓ 2 .↓ 2 .x001b Figure 2.H01a .H00b .↓ 2 .x001a x000b x Tree b H0b H1b . Kingsbury. WAVELET TRANSFORMS Level 4 Level 3 Level 2 Level 1 x0a x00a x000a Tree a H0a H1a .x1a x0b .↓ 2 .↓ 2 .x1b .x0001a  .↓ 2 .H00b .H01b .↓2 .↓ 2 .34 CHAPTER 2.↓ 2 .8: The Qshift dual tree structure.x0000b .x01a x00b .H01a .↓ 2 .↓ 2 .↓ 2 . . This ﬁgure was provided by Dr N.H00a .x0000a .x0001b  .↓2 .H01b .H00b .H00a .H01a .↓ 2 .H01b .x01b .H00a .↓ 2 .
The Qshift transform retains the good shift invariance and directionality properties of the original while also improving the sampling structure.2.3 Steerable transforms Simoncelli et al [107] highlighted the problem of translation invariance for orthogonal wavelet transforms and developed a theory of shiftability.4. They developed a twodimensional pyramid transform that was shiftable in both orientation and position which decomposes the image into several spatial frequency bands. At each level four output subband images are produced by using high pass ﬁlters tuned to diﬀerent orientations. REDUNDANT COMPLEX WAVELETS 35 chosen to use the (1319)tap nearorthogonal ﬁlters at level 1 together with the 14tap Qshift ﬁlters at levels ≥ 2 [65]. Note that there is no subsampling in the highpass channels and so a three level decomposition of an N by N image will produce: 1. In addition it divides each frequency band into a set of four orientation bands. When we talk about the complex wavelet transform we shall always be referring to this Qshift version unless explicitly stated otherwise. We will often refer to this transform by the initials DTCWT. The decomposition is called “steerable” because the response of a ﬁlter tuned to any orientation at a particular level can be obtained through a linear combination of the four computed responses at that level. and a ﬁnal low pass image with (N/8)*(N/8) coeﬃcients. 2. Hence we have gone from N 2 numbers to (4(1+1/4+1/16)+1/64)N 2 ≈ 5. A radially symmetric lowpass ﬁlter is also applied and the output is subsampled by a factor of two in each direction to produce the input image for the next level. The steerable pyramid is selfinverting in that the reconstruction ﬁlters are the same as the analysis ﬁlters. This decomposition has the disadvantages of nonseparable ﬁlters. 4 images with (N/2)*(N/2) coeﬃcients 3.4. nonperfect reconstruction and being an overcomplete expansion. 4 images with (N/4)*(N/4) coeﬃcients 4. 4 subband images with N*N coeﬃcients 2. .25N 2 coeﬃcients.
4 Multiwavelets An alternative way of avoiding the limitations of the standard wavelet transform is known as multiwavelets [3. From the ﬁlterbank perspective the diﬀerence is that the signals are now vector valued and the scalar coeﬃcients in the ﬁlter banks are replaced by matrices. This leads to the good shift invariance properties. 2. One way is to see it as part of a multiwavelet structure that uses repeated row preprocessing (giving the redundancy) and has diﬀerent ﬁlters for the ﬁrst scale. The DTCWT processing at scale 1 can be viewed in two ways. and image denoising [107].36 CHAPTER 2. WAVELET TRANSFORMS This transform has been used for a number of applications including stereo matching [107]. . 2. Multiwavelets are closely related to the DTCWT. The absence of signal paths between the two trees (reﬂected in the diagonal structure of the matrices) leads to less computation. For some of these a quadrature pair of steerable ﬁlters was used. Experimental results in the literature indicate that the redundant systems usually give better results for denoising [114] (but are less appropriate for coding applications). The conversion of the original data signal to the vectorised stream is known as preprocessing and there are a number of choices. In either case it is clear that the DTCWT is a special case of a multiwavelet transform. The other way is to interpret the ﬁrst scale as performing the multiwavelet preprocessing while preserving (in the scale 1 subbands) the parts of the signal that are ﬁltered out. 46]. The choice of preprocessing decides the redundancy of the system and it is possible to have both critically sampled and redundant multiwavelet systems. The advantages of this special case are: 1.4. texture synthesis [45]. Using quadrature ﬁlters makes the steerable transform almost equivalent to the DTCWT with the main diﬀerences being that the steerable transform has increased redundancy and worse reconstruction performance. The preprocessing and ﬁlters are carefully designed to allow an interpretation of the output as complex coeﬃcients produced by ﬁlters discriminating between positive and negative frequencies. If we combine the signals from tree a and b to produce a single 2 dimensional signal then it is clear that the DTCWT for scales 2 and above is equivalent to a multiwavelet system of multiplicity 2. The equivalent matrices in the multiwavelet ﬁlterbank are simply 2 by 2 diagonal matrices whose diagonal entries are given by the corresponding coeﬃcients from the DTCWT ﬁlters.
5 Noise ampliﬁcation theory The use of redundant transforms gives a much greater design freedom but there are also extra complications. However.5. This will be the case for (appropriately scaled) orthogonal wavelet transforms. Apply some wavelet domain processing to produce new wavelet coeﬃcients v ∈ R M . 2.15 that gives a formula for the noise gain in terms of the redundancy and unbalance of the transform (the noise gain is a measure of the change in error energy caused by the inverse wavelet transform). If the wavelet transform is associated with an orthogonal matrix then an error in the wavelet coeﬃcients translates directly into an error of the same energy in the signal.1 Preliminaries We consider a simple form of wavelet processing in which we have an observed image (or signal) x ∈ R N that is processed by: 1.1. The model and notation are described in section 2. This section considers the eﬀect of a very simple model of wavelet domain processing. For complex transforms we use the separated form in which w is still a real vector and consists of the real parts of the complex coeﬃcients followed by the imaginary parts. σ 2 IM . v = N w. Invert the wavelet transform to recover a new signal y ∈ R N y = P v.5.5.2. We give results (proved in appendix A) that describe the noise gain during reconstruction and in particular equation 2. 3. 2. for biorthogonal and redundant transforms the energy of the error can change signiﬁcantly during reconstruction. In the mathematical analysis of this model we will model the wavelet domain processing by adding independent white Gaussian noise of mean zero and variance σ 2 to the wavelet coeﬃcients. Calculate the wavelet transform w ∈ R M of x w = Wx This theory applies to both real and complex wavelet transforms. NOISE AMPLIFICATION THEORY 37 2.
2 One exception to this principle is when we use ﬁxed precision numbers to store the coeﬃcients. Suppose we construct a new wavelet transform W = sW that simply scales the values of all the wavelet coeﬃcients by a factor of s and a new reconstruction matrix P = (1/s)P that still achieves PR. In this case we will call the reconstruction robust. The total expected energy of the added noise is E { v − w 2 } = Mσ 2 . The total expected energy of the error after reconstruction is given by E { y − x 2 }.38 CHAPTER 2. WAVELET TRANSFORMS Wavelet Transform x W w + v Inverse Wavelet Transform P y noise Wavelet domain processing Figure 2. In other words.9. In order to get meaningful values for the noise gain we adopt a convention that the scaling factor s is chosen such that the transform preserves the energy of a white noise signal during the forward wavelet transform. We assume that all transforms mentioned in this section satisfy this convention. where σ 2 is the variance of the added noise. The noise gain g is then deﬁned as g= E { y − x 2} E { v − w 2} (2. We shall prove (A. This model is illustrated in ﬁgure 2. However. The quantisation noise will remain at the same level for diﬀerent scaling factors s and the argument is now a valid argument for scaling the coeﬃcients to use the full dynamic range. We deﬁne a normalised transform to be a transform scaled in this manner. We would like to deﬁne the noise gain as the ratio of these two energies but there is a problem due to scaling.14) A low noise gain means that small changes in the wavelet coeﬃcients lead to small changes in the reconstructed signal. During reconstruction all the coeﬃcients are scaled down by a factor of s and hence the noise energy after reconstruction is reduced by s2 . . if we use the transform to analyse a signal containing independent white Gaussian noise of mean 0 and variance α2 (to give a total expected input energy of Nα2 ) then the total expected energy of the wavelet coeﬃcients will be equal to Nα2 .9: Model of wavelet domain processing. in almost all practical applications a scaling factor of s will mean that the noise standard deviation σ is also increased by the same factor2 .1) that this is equivalent to the requirement that tr(W T W ) = N.
This reinterpretation may seem a bit confusing but is worth understanding. in the decoded image for a given level of quantisation error in the wavelet coeﬃcients. Nevertheless. 2. NOISE AMPLIFICATION THEORY 39 We now attempt to motivate this model by giving two examples where it might be appropriate: 1. they are modelled based on the original image. However. Consider an image restoration technique. if we now reinterpret x as representing the original image. . The noise in the model represents the wavelet coeﬃcient estimation error. Better models certainly exist. The theory is equally valid for any linear transforms W and P provided that the system achieves perfect reconstruction (P W = IN ) and the scaling convention (tr(W T W ) = N) is observed. and w as the wavelet coeﬃcients of this original image. In an image coding example the wavelet coeﬃcients are commonly quantised to a number of discrete values. but white Gaussian noise is often a reasonable ﬁrst approximation.5. If these values are equally spaced by a distance dQ then we could attempt to model the errors in the wavelet coeﬃcients as white Gaussian noise of variance d2 /12. x − y. From this new perspective the noise gain of the transform measures the relationship between the wavelet estimation error and the ﬁnal image error and it is clear that a low noise gain will be beneﬁcial in order to produce a low ﬁnal image error. then the same model can be used to represent the belief that v will be noisy estimates of w. The purpose of the technique is to get an enhanced image and initially it may seem inappropriate to use a transform that minimises the eﬀect of the change.2. The estimates v are in reality produced by some estimation technique acting on the observed data. such as denoising. The wavelet domain processing is designed to make the output coeﬃcients v a reasonable estimate of the wavelet coeﬃcients of the original image. for example Q if dQ is very small then a uniform distribution of errors in the range −dQ /2 to dQ /2 is a closer approximation while for large dQ (that quantise most of the coeﬃcients to zero) a Laplacian distribution may give a better ﬁt. The quantisation results in errors in the wavelet coeﬃcients and consequently errors in the decoded image. for which the wavelet coeﬃcients are signiﬁcantly changed. In this case we would want a low noise gain because in a codec we wish to minimise the error.
dN (which are deﬁned in A. used to invert W is given by g= N +U M (2.2 Theoretical results Consider a ﬁnite linear transform represented by the matrix W. .) This results in U taking its minimum value U = 0 . (This result is true regardless of whether we have a real or complex wavelet because we are using the expanded form of the complex wavelets that treat the real and imaginary parts separately.5. WAVELET TRANSFORMS 2. Most of these results come from standard linear algebra and can be found in the literature.40 CHAPTER 2. • The average of these numbers gives the gain in energy when we transform white noise signals and so the average is one for normalised transforms (see A.4 for proof).. P .7 for proof). and this inversion achieves the lower bound on noise gain (see A.2 and are the squares of the singular values of W). We are not aware of this ﬁnal equation (2.3 for proof).15) where U is a nonnegative quantity given by U = tr (P − W T )(P T − W ) (see A. • The frame bounds are given by the largest and smallest of these numbers and so the transform represents a wavelet frame if and only if the smallest is nonzero (see A. • The noise gain of any real linear perfect reconstruction transform.15) appearing in the literature.5 for proof)..6 for proof). The maximum robustness of the transform W can be calculated from the numbers d1 . We present them here for interest and as a route to the ﬁnal simple equation for the noise gain in terms of the unbalance. The equivalent statement for H complex matrices is that PC = WC .. • If the frame is tight then it can be inverted by the matrix W T . • Any linear perfect reconstruction transform that is used to invert W has noise gain bounded below by 1 M i=N 1 i=1 di and this lower bound is achievable (see A. Balanced wavelet transforms use the conjugate timereverse of the analysis ﬁlters for the reconstruction ﬁlters and therefore P T = W . We will call U the unbalance between the analysis and reconstruction transform.
Each transform was designed to produce a 6 level wavelet decomposition of a real signal3 of length 128 and all produced 128 (complexvalued) wavelet output coeﬃcients. This matrix is found by transforming signals e1 .3. The purpose of this section is merely to illustrate the problems that can occur. The frequency response of an analysis ﬁlter will be (for a balanced transform) the conjugate of the frequency response of the corresponding reconstruction ﬁlter. Each factor a + bz −1 corresponds to a zero of the product ﬁlter at z = −b/a. Each choice of ﬁlters corresponds to a linear transform that can be represented by the matrix W . .2. . and so all had a redundancy of 2. Daubechies wavelets of a certain length are designed to have the maximum number of zeros in the product ﬁlter P (z) at z = −1 subject to the constraint of satisfying the conditions necessary for perfect reconstruction [30]. Usually factors are allocated in conjugate pairs in order to produce real ﬁlters but complex wavelets can be produced by alternative factorisations [73]. For our experiment we put all the factors corresponding to zeros with a positive imaginary part into H0 (z) and all those corresponding to negative imaginary parts into G0 (z).3 argued that it was impossible to get a complex tree that diﬀerentiated positive and negative frequencies while maintaining good noise reconstruction properties. This choice gives the greatest possible diﬀerentiation between positive and negative frequencies. 2. . eN where ek is zero everywhere except that at position k the value is 1.5. The product ﬁlter is then factorised into H0 (z) and G0 (z). NOISE AMPLIFICATION THEORY 41 and we deduce from the last result that balanced wavelet transforms will have the least noise gain and hence the greatest robustness. This can also be expressed in terms of the frequency responses. .3 Numerical results Section 2. The wavelet transform of ek gives the 3 The single tree complex wavelets were restricted to produce a real output by taking the real part of the reconstructed signal. The factors corresponding to zeros on the real axis are split equally between H0 (z) and G0 (z). . We tested the robustness of the DTCWT and a variety of single tree complex wavelets.5. Note that this means that the magnitude of the frequency responses will be equal. The transforms were normalised to preserve energy during the forward transform by a single scaling applied to all output coeﬃcients. Therefore a necessary condition for low noise gain is that the frequency responses of H0 (z) and G0 (z) must be close.
4 Discussion The transform labelled STCWT 2 is a special case because the product ﬁlter has no complex zeros. The theoretical minimum reconstruction noise gain would be given if we reconstructed using the pseudoinverse solution.7 211 3430 21000 6.2 9. The matrix P represents one way (that can be eﬃciently implemented with a tree of ﬁlters) but other ways can give a better noise gain.7 ∗ 108 1.6 0.0 ∗ 106 4.5 0. WAVELET TRANSFORMS k th column of W .6 53 225 1570 8370 Reconstruction noise gain 0.42 CHAPTER 2. We characterise the single tree complex wavelets (STCWT) by the number of zeros the H0 (z) ﬁlter has at z = −1.5. There are many ways of designing a perfect reconstruction inverse of W .599 0. Transform name Original dualtree Qshift dualtree STCWT 2 STCWT 3 STCWT 4 STCWT 5 STCWT 6 STCWT 7 STCWT 8 STCWT 9 STCWT 10 Minimum noise gain 0.50032 0.50028 0. Similarly the columns of matrix P are found by reconstructing signals from wavelet coeﬃcients that are all zero except for a single coeﬃcient.93 3.10. The greater this number the smoother the wavelets and so in the table these wavelets are described by the acronym “STCWT” followed by the number of zeros. The numerical results are tabulated in ﬁgure 2.8 ∗ 1010 Figure 2. Recall that we are treating the real and imaginary parts separately and hence W is of size 2N × N.5 1.571 0. The analysis and reconstruction ﬁlters are all real and this transform is identical to a .10: Comparison of noise gain for diﬀerent transforms 2.5 6. The results of appendix A can be used to calculate both the noise gain for P and the minimum noise gain.
The DTCWT achieves a very low noise gain and so will give robust reconstructions. Half of this complex noise is lost when we take the real part at the end of the transform which is why the noise gain is 1/2. Note that this is a very unusual choice of complex Daubechies wavelet. We deﬁne a transform to be balanced if the reconstruction ﬁlters are the conjugate time reverse of the analysis ﬁlters. even this alternative would not be of much practical use as the minimum noise gain is still signiﬁcant. CONCLUSIONS 43 real (and orthogonal) Daubechies wavelet transform (of order 2).6. (b) Reduce aliasing and produce shift invariant methods. however. We note that the Qshift tree has a lower noise gain than the original dual tree.6 Conclusions The main aim of this chapter was to introduce the terminology and construction of wavelet and complex wavelet systems. The transform is therefore balanced and achieves low noise gain but has the problems of large shift dependence and wavelets which are not very smooth. The forms more commonly used are much more balanced and do not suﬀer from these reconstruction problems but consequently have poor discrimination between positive and negative frequencies. Note that the minimum noise gain increases at a much slower rate suggesting that an alternative reconstruction transform could be found with much less noise gain. This is because of the better balanced ﬁlters in the Qshift version. However.2. We want to distinguish positive and negative frequencies in order to: (a) Improve the directional frequency resolution of the 2D transform while still using eﬃcient separable ﬁlters. To allow direct comparison we still treat these real wavelets as having complex outputs and so add complex noise to them. If we attempted to compute a wavelet transform with 1 zero in H0 (z) we would obtain the Haar wavelet transform with a noise gain of 1/2 for the same reasons. We now summarise the principal points relating to this secondary aim: 1. The secondary aim was to explain why we want to use complex wavelets and what form of complex wavelet is appropriate. have a rapidly increasing noise gain for the longer (and smoother) wavelets which is likely to make the wavelets useless. 2. The single tree complex wavelets. We show that the noise gain during reconstruction . 2.
6. lowest) noise gains are given by balanced transforms and are equal to the reciprocal of the redundancy. 3. that the best (i. the Qshift dual tree complex wavelet system. prolate spheroidal sequences. harmonic wavelets. be balanced. . 4. as a representative. steerable transforms. Using an elementary processing example we explain more generally why any nonredundant linear PR transform must use ideal ﬁlters in order to achieve shift invariance. The purpose of this dissertation is not to compare diﬀerent types of complex wavelet. but rather to explore the potential of such a system against more standard approaches. We explain why linear PR complex wavelets based on a single standard tree cannot simultaneously. give shift invariant methods.44 CHAPTER 2. and dual tree complex wavelets. in particular.e. We illustrate numerically the problems of noise gain caused by lack of balance when we use a single tree complex wavelet that strongly diﬀerentiates between positive and negative frequencies. WAVELET TRANSFORMS is closely related to the balance of the transform and. For this reason we have just selected one transform. We introduced several forms of redundant wavelet transforms including Gabor wavelets. multiwavelets. 5. and use short support ﬁlters.
its extra directional frequency resolution) make it appropriate for texture classiﬁcation [47.4. The only original results in this chapter come from the replication of the denoising experiments in section 3. when the DTCWT is used in more sophisticated denoising methods [24] it is found to signiﬁcantly outperform even the equivalent nondecimated methods. 3. The properties of the DTCWT (in particular. Previous work has shown that a nondecimated wavelet transform [82] performs better than decimated transforms for denoising and the DTCWT is able to achieve a performance similar to the nondecimated transforms. The transform used short 4tap complex ﬁlters but did not possess the PR 45 . 43.2 Motion Estimation Magarey [74] developed a motion estimation algorithm based on a complex discrete wavelet transform. The phase of the complex coeﬃcients is closely related to the position of features within an image and this property can be utilised for motion estimation [74]. The complex wavelets are also appropriate for use in denoising images [62].Chapter 3 Previous applications 3. 33] and gives methods that are eﬃcient in terms of computational speed and retrieval accuracy.1 Summary This dissertation aims to explore the potential of the DTCWT in image processing. Interestingly. The purpose of this chapter is to describe applications for which the DTCWT (or a similar transform) has already been evaluated.
A major obstacle in motion estimation is that the reliability of motion estimates depends on image content. we have found such phase based computation beneﬁcial for constructing an adaptive contour segmentation algorithm based on the DTCWT [34]. “In tests on synthetic sequences the optimised CDWTbased algorithm showed superior accuracy under simple perturbations such as additive noise and intensity scaling between frames. Magarey developed a method for incorporating the varying degrees of conﬁdence in the diﬀerent estimates. By measuring the phase changes it is possible to infer the motion of the image. it is easy to detect the motion of a single dot in an image. the author had been unable to ﬁnd simple FIR ﬁlters that could be used to exactly reconstruct the original signal.” Although not included in this dissertation. The fundamental property of wavelets that makes this possible is that translations of an image result in phase changes for the wavelet coeﬃcients. 33]. The idea is to compute a small set of texturedescribing features for each image in a database in order to allow a search of the database for images containing a certain texture. 3. In other words. PREVIOUS APPLICATIONS property. but for the purposes of this dissertation we highlight just a couple of the conclusions. The task is to try and estimate the displacement ﬁeld between successive frames of an image sequence. For example. the eﬃciency of the CDWT structure minimises the usual disadvantage of phasebased schemes– their computational complexity.” “In addition. The ﬁlter shapes were very close to those used in the DTCWT suggesting that the conclusions would also be valid for the DTCWT.46 CHAPTER 3. but it is much harder to detect the motion of a white piece of paper on a white background. 43. The DTCWT has been found by a number of authors to be useful for classiﬁcation [47. Each uses the DTCWT in diﬀerent ways to compute texture features for an entire image: .3 Classiﬁcation Eﬃcient texture representation is important for content based retrieval of image data. Detailed analysis showed that the number of ﬂoating point operations required is comparable to or even less than that of standard intensitybased hierarchical algorithms.
Bull. and Canagarajah report an improvement from 87. 2. instead of using the DTCWT based on a ﬁxed tree structure. However. All authors report signiﬁcant improvements in classiﬁcation performance compared to a standard real wavelet transform. Hatipoglu. The aim is to adapt the transform to have the greatest frequency resolution where there is greatest energy.75% for the DTCWT on a database of 16 images [47]. Mitra. However. Hill. they use features based on either the Fourier transform or the autocorrelation of the 6 energies at each scale. 3. Wavelet denoising techniques work by adjusting the wavelet coeﬃcients of the signal in such a way that the noise is reduced while the signal is preserved. they use an adaptive decomposition that continues to decompose subbands with energy greater than a given threshold. and Kingsbury report an improvement from 69. 3. and Kingsbury [43] use features of the mean and standard deviations of complex wavelet subbands. There are many diﬀerent methods for adjusting the coeﬃcients but the basic principle is to keep large coeﬃcients while reducing small coeﬃcients. The diﬀerent authors used diﬀerent databases so the following results are not directly comparable: 1. 3.35% for the DWT to 93. Hill. DENOISING 47 1. 2. de Rivaz and Kingsbury report an improvement from 58. Hatipoglu. and Canagarajah [47] compute the energies of the subbands at each scale. This adjustion is known as thresholding the coeﬃcients. Bull.3.4. Mitra. de Rivaz and Kingsbury [33] compute features given by the logarithm of the energy in each subband. .8% for the DWT to 63.4 Denoising In many signal or image processing applications the input data is corrupted by some noise which we would like to remove or at least reduce.73% for the DTCWT (with the adaptive decomposition) on a database of 116 images [43].64% for a real wavelet (with an adaptive decomposition) to 79. in order to produce rotationally invariant texture features.5% for the DTCWT on a database of 100 images [33].
Figure 3. orthogonal wavelet transforms (DWT) produce results that substantially vary even for small translations in the input [63] and so a second transform was proposed. In other words. As for the standard techniques. Experiments on test signals show that the NDWT is superior to the DWT.1 shows the results when using a simple soft denoising gain rule. we keep most of the power. Kingsbury has proposed the use of the DTCWT for denoising [62] because this transform not only reduces the amount of shiftvariance but also may achieve better compaction of signal energy due to its increased directionality. 26]. White noise was added to a test image and the denoised rms error was measured for the diﬀerent techniques. However. . at a given scale an object edge in an image may produce signiﬁcant energy in 1 of the 3 standard wavelet subbands. Therefore the reconstruction of the signal from just the large coeﬃcients will tend to contain most of the signal energy but little of the noise energy. where the signal power is low. which produced shift invariant results by eﬀectively averaging the results of a DWTbased method over all possible positions for the origin [69. PREVIOUS APPLICATIONS One rationale for this approach is that often real signals can be represented by a few large wavelet coeﬃcients. The main disadvantage of the NDWT is that even an eﬃcient implementation takes longer to compute than the DWT. It was found that this method produces similar results to the nondecimated wavelet method while being much faster to compute. but only 1 of the 6 complex wavelet subbands. For each piece the optimum denoising method is a Wiener ﬁlter whose frequency response depends on the local power spectrum of the signal.48 CHAPTER 3. Where the signal power is high. the nondecimated wavelet transform (NDWT) [82]. The method is to attenuate the complex coeﬃcients depending on their magnitude. we attenuate the signal. large coeﬃcients are kept while smaller ones are reduced. An alternative rationale comes from considering the signal as being piecewise stationary. while (for standard orthogonal wavelet transforms) white noise signals are represented by white noise of the same variance in the wavelet coeﬃcients. by a factor of the three times the number of levels used in the decomposition. The size of each wavelet coeﬃcient can be interpreted as an estimate of the power in some timefrequency bin and so again we decide to keep the large coeﬃcients and set the small ones to zero in order to approximate adaptive Wiener ﬁltering. The ﬁrst wavelet transform proposed for denoising was the standard orthogonal transform [39].
Bottom left: DWT results.47 12. it is found that large coeﬃcient values cascade along the branches of the wavelet tree. DENOISING 49 Method No denoising DWT NDWT DTCWT RMS error 26.35dB 6. A model known as the Hidden Markov Tree (HMT) proposed by Crouse. This property is known as persistence [104]. and Baraniuk attempts to capture the key features of the joint statistics of the wavelet coeﬃcients (including persistence) [28]. In particular.1: Top left: Original image. Bottom right: NDWT results.3. Bottom middle: DTCWT results. Top right: Noisy image.54 SNR improvement 0dB 5.4.g.43dB Figure 3. This is achieved by means of hidden state variables that describe the likely characteristics of the wavelet coeﬃcients (e.3 14. In this case we can see that the DTCWT has a slightly better SNR than the NDWT method but that the diﬀerence is not visually noticeable.66 12. Nowak.19dB 6. There are often signiﬁcant correlations between the wavelet coeﬃcients in the transforms of real images. whether they are likely to be .
and worse for the bridge image.2: PSNRs in dB of images denoised with the HMT acting on diﬀerent wavelet transforms. Lena. Combining this code with the DTCWT we have attempted to replicate the denoising results.8 28.6 25.50 CHAPTER 3. similar for the boats image.5 20.4 34. Table 3.7 Bridge 10 28. A Markov model is used to describe the relative probability of transitions between diﬀerent states along a branch of the wavelet tree (moving from coarse to ﬁne scales).5 results we see that our results are Image σ Noisy HMT/DWT HMT/NDWT HMT/DTCWT New HMT/DTCWT Boats 10 28. Choi et al have also tested the use of dual tree complex wavelets within the HMT framework [24].9 34.7 25.5 33.3 29.8 25.3 29. but repeating the experiments produces very similar SNR levels.7 29.5). In experiments this HMT shift invariant denoising was shown to outperform a variety of other approaches including Wiener ﬁltering and the shift invariant hard thresholding method mentioned above [24]. and Baraniuk proposed a shiftinvariant denoising model based on the HMT using the nondecimated wavelet transform (NDWT) [104]. or DTCWT. Looking at the σ = 25.9 34. while the DTCWT tends to give an .8 24. The main reason for the diﬀerence is that we are using a slightly diﬀerent version of the dual tree. The table also contains the results of our experiments (shown in bold).8 30. and Bridge) were used with two choices of noise variance (σ = 10 or σ = 25. Choi. The table displays the peak signal to noise ratios (PSNRs) of the denoised images.6 34.5 20.4 25. Diﬀerences are partly caused by diﬀerent noise realisations. Romberg. The main point to notice is that in this case the shift invariance given by the use of the NDWT tends to give a small improvement in results.1 33. Three test images (Boats.1 33. The results were found to be consistently better than even the shift invariant HMT. The results in normal type are published in the literature [24] while the results in bold come from our replication of the same experiment.8 29.2 29.0 29.2 shows their published results for the HMT combined with either the DWT.5 20. PREVIOUS APPLICATIONS large or small).9 30.8 34. Romberg and Choi have made the source code for the HMT available on the internet [103].6 29.6 28. better for the Lena image.7 Lena 10 28.7 Figure 3.2 28.2 25. The initial model was based on a decimated wavelet transform (DWT).4 24. NDWT.
For simple thresholding denoising we see that the DTCWT achieves a similar performance to methods based on the NDWT. . CONCLUSIONS 51 even larger improvement. The magnitude is more robust to translations and hence applications like classiﬁcation and denoising (that should be shift invariant) process just the magnitude.5 Conclusions Treating the coeﬃcients as complex numbers has the result of approximately decoupling the shift dependent information from the shift invariant information.5. However. 3. The phase gives a measure of local translations and therefore permits phasebased motion estimation. for a more complicated HMT denoising the DTCWT is signiﬁcantly better than even the NDWT equivalent.3.
52 CHAPTER 3. PREVIOUS APPLICATIONS .
This chapter reviews two texture synthesis methods based on ﬁlter banks. Section 4. For example. 4.2 Introduction There are many techniques for texture synthesis. We adapt the ﬁrst of these methods to demonstrate the diﬀerence between using real or complex wavelets.8 contains discussion of the experimental results.7 describes the texture synthesis algorithm and section 4. Gradient algorithms 53 .Chapter 4 Complex wavelet texture features 4. We ﬁnd that the complex wavelets are much better at representing diagonally orientated textures. 22]. We describe texture by computing features from the energy of the DTCWT wavelet subbands. there are methods based on autoregressive ﬁlters or autocorrelation and histogram [10. One powerful method for evaluating a choice of texture model is to estimate the model parameters for a given image and then attempt to resynthesize a similar texture based on these parameters. This is of interest because it suggests how complex wavelet texture synthesis might be done and because it illustrates the problems encountered when ﬁlter banks do not have the perfect reconstruction properties of wavelets.1 Summary The purpose of this chapter is to describe how to use the DTCWT to generate texture features and to begin to explore the properties of these features. The main original contributions of this chapter are the synthesis results that give an indication of when the DTCWT texture features will be appropriate.
The indirect motivation is that texture synthesis provides an interesting way to demonstrate visually the relative advantages of diﬀerent sets of texture features. Our main goal in this chapter is to use the DTCWT to produce useful texture features. COMPLEX WAVELET TEXTURE FEATURES are used to simultaneously impose the autocorrelation function and the histogram. Other techniques include models based on reactiondiﬀusion [118.3.54 CHAPTER 4. We will use (in the second half of the chapter) a technique very similar to the one described in section 4. The method makes use of the steerable pyramid transform [107] that was described in section 2.3 and 4. usually by means of Markov Random Fields (often at a variety of scales) [91. Their method synthesizes textures by matching the histograms of ﬁlter outputs. They assume that textures are diﬃcult to discriminate when they produce a similar distribution of responses in a bank of orientation and spatialfrequency selective linear ﬁlters. Sections 4.3. 4. 129] frequency domain [72] or fractal techniques [40. While texture synthesis by itself is an important topic we also have an indirect motivation for studying these methods. This kind of approach can be powerfully extended by a stochastic selection of appropriate sources [16]. while the second method is of interest mainly to show the diﬃculties posed by lack of perfect reconstruction in the ﬁlters. 4. 72]. The steps for iteration n are as follows: .4. 134].3.3 Pyramidbased texture analysis/synthesis Heeger and Bergen [45] describe an automatic method for synthesizing images with a similar texture to a given example.4 describe methods that have been used to synthesize textures based on the output of a ﬁlter bank. Proper Bayesian inference usually requires extensive computation and is consequently extremely slow but has been done. A trivial technique which is practically very useful is to simply copy the texture from a source image (used extensively in computer games).1 Method The method starts with an image x(0) of the desired size that is ﬁlled with white Gaussian noise of variance 1 (the histogram matching step will mean that the results will be the same whatever the choice of initial mean and variance).
First the histogram is matched to the input texture. As the ﬁlters are not perfect. except that at each iteration the original image is composited back into the synthesized texture according to the mask using a multiresolution compositing technique that avoids blurring and aliasing [18].2 Results and applications The algorithm is eﬀective on “stochastic” textures (like granite or sand) but does not work well on “deterministic” textures (like a tile ﬂoor or a brick wall). The output of the algorithm is the last image x(K) . Alter the pyramid representation of y(n) in order that the histogram of each subband matches the histogram of the corresponding subband in the pyramid transform of the input texture. PYRAMIDBASED TEXTURE ANALYSIS/SYNTHESIS 55 1. Igehy and Pereira [51] describe an application of this algorithm to replacing part of an image with a synthesized texture (this might be done to remove stains or scratches or other unsightly objects from an image). The algorithm remains the same as before. the combination is controlled by a mask. Invert the pyramid transform to generate x(n) . Make pyramids from both y(n) and the input texture. Their algorithm extends the original with the goal that the synthesized texture becomes an image which is a combination of an original image and a synthetic texture. The conclusion is that this texture synthesis can be useful in a variety of images which need the replacement of large areas with stochastic textures but that the technique is inappropriate for images that need the replacement of areas with structured texture[45]. 2. Stopping after about K = 5 iterations is suggested.3. . 4. More precisely. we generate a new image y(n) by applying a monotonically increasing transform to x(n−1) such that the histogram of y(n) matches the histogram of the input texture. In order to get both the pixel and pyramid histograms to match.3. 3. these steps are iterated K times. the next image in the sequence. iterating too many times introduces artefacts due to reconstruction error [45]. 4.4.
plus a low pass residual (LPR). (4. 4 complex subimages of size (N/4) ∗ (N/4) 3. 4 complex subimages of size (N/8) ∗ (N/8) 4. y)f. The spectrum is sampled by measuring the energy and equivalent bandwidths of 16 Gabor channels. 4 complex subimages of size (N/2) ∗ (N/2) 2. Only the real part of this function is actually used. 4 complex subimages of size (N/16) ∗ (N/16) . four orientations). The synthesis process consists of mixing 16 Gabor ﬁltered independent noise signals (whose energy and bandwidths are chosen to match the measured values) into a single image.α = exp[−πa2 x2 + y 2 ] exp[j2πf (x cos θ + y sin θ)]. After ﬁltering for the four highest frequency channels the image is ﬁltered with a lowpass ﬁlter and downsampling by a factor of two in both directions. The ﬁltering is applied to shrunk versions of the input image.56 CHAPTER 4. whose LPR power spectrum and histogram are also modiﬁed to match the original features. Each ﬁlter is a separable Gabor function of the form g(x.θ. However.4 Gabor based texture synthesis Navarro and Portilla [83] propose a synthesis method based on sampling both the power spectrum and the histogram of a textured image. COMPLEX WAVELET TEXTURE FEATURES 4. Demodulation is applied to the Gabor channels after ﬁltering thus enabling a reduction in the number of samples by a factor of two in each dimension. This means that only one ﬁlter needs to be deﬁned for each orientation. the resulting channels become complex and so the eﬀective compression ratio is 2. 4.1) where θ speciﬁes the desired orientation. This means that overall a four scale decomposition of a N ∗ N image produces: 1.4.1 Filters The human visual system (HVS) is imitated by using a set of 4 ∗ 4 ﬁlters (four scales. Then the same procedure is repeated for each scale. f gives the radial frequency and a is a weighting factor that makes the function decay to zero as you move away from the origin.
4. These parameters are not particularly crucial but are reported to be necessary for a complete visual description of many real textured images. Gaussian ﬁltering of the noise signals. two are the averages of the modulus of the DTFT along the two frequency axes for low frequencies. The histogram of the original image is also recorded with a resolution of 16 levels. 4.4. The lowest frequencies are extracted separately using the Discrete Time Fourier Transform (DTFT).3 Method The synthesis procedure consists of seven stages. (Both integrations act on the original 2D spectrum and produce a 1D spectrum. 4.4.) The equivalent bandwidths are given by the areas of these 1D spectra. 1.2 Extracted features The energy in each Gabor channel is computed to give information about the main directions in the texture. It is calculated by lowpass ﬁltering and subsampling the full histogram.66N 2 coeﬃcients. . One is the DC component. Modulation of the weighted ﬁltered noise signals to produce the synthetic channels. and the ﬁnal two are averages for low oblique frequencies. and dividing the results by their respective maxima. Noise Generation. Therefore for each channel they compute the equivalent bandwidths along the u and v frequency axes. 3. Finally ﬁve parameters are extracted from the low frequency DTFT coeﬃcients of the original image.4. GABOR BASED TEXTURE SYNTHESIS 57 Therefore we have gone from N 2 numbers to 4 ∗ 2 ∗ N 2 (1/4 + 1/16 + 1/64 + 1/256) ≈ 2. To calculate the equivalent bandwidths they ﬁrst calculate the 2D power spectrum using the DTFT and then convert this into a pair of 1D normalized power spectra. Navarro et al report that the degree of spectral spreading of the spectrum at diﬀerent spectral locations is an essential feature to characterize the texture. Weighting of the ﬁltered noise signals. 4. This conversion is achieved by integrating the power spectrum along the two frequency axes. 2.
This task is made hard due to the overlap between channels. Equalization of the LPR frequencies. the resulting equivalent bandwidths of its Gabor channels have equal values to those measured in the input image. The exact computation is hard due to the overlapping between channels but it is reported that the approximate scheme does not signiﬁcantly aﬀect the visual quality of the results. Gaussian ﬁltering The noise signals are then convolved with separable elliptical Gaussian masks to provide them with an elliptical Gaussian spectral shape. COMPLEX WAVELET TEXTURE FEATURES 5. When the matrix is multiplied by a vector of energies in the synthetic channels the resulting vector contains the energies that would be observed using the Gabor ﬁltering. Noise generation Sixteen independent signals of complex white Gaussian noise are generated. Weighting It is desired to weight the signals so that when the Gabor ﬁlters are applied to the synthesized texture. Since the synthetic channels are statistically independent the energy of a sum is equal to the sum of the energies and so it is possible to calculate a matrix which describes the eﬀect when the channels are added together. Adjustment of the histogram. 7. . The inverse of this matrix can be precomputed and the appropriate weights are given by multiplying this inverse matrix by the vector of the measured energies. the resulting energies will be equal to those measured in the original image.58 CHAPTER 4. y) = bupq bvpq exp[−π(b2 pq x2 + b2pq y 2)] u v (4.2) The factors bupq and bvpq are chosen using an approximate formula so that when the Gabor ﬁltering scheme is applied to the synthetic texture. Merging the synthetic channels. The ﬁlter function for the (p.q) synthetic channel is: gspq (x. 6.
Histogram matching The compressed original histogram is decompressed to its former size by expanding and lowpass ﬁltering it. Merging A pyramid structure is then used to combine the synthetic channels. This means that a texture with a welldeﬁned orientation in the original . The bandwidths of the channels are not so closely matched but it is reported that the consequences of these inaccuracies are not signiﬁcant compared to the inaccuracies due to the limitations of the texture model. 4.4. The resulting square of the spectral moduli is imposed on the lowest frequencies of the synthetic mix obtained before. and so on. Then a standard histogram matching algorithm is used to modify the histogram of the synthesized texture to match the decompressed version of the original one. This means summing the four lowest resolution synthetic channels. by merely replicating them in their respective spectral areas.4. the ﬁve average values of the LPR frequency moduli obtained at the feature extraction stage are decompressed. until the highest frequency channels are added. Equalization The equalization is done in the frequency domain.4. The expansion is performed by upsampling followed by a lowpass ﬁlter. keeping the phase unchanged. LPR channel modulus and channel energies.4 Results The method described above achieves a good match in the histogram. First. GABOR BASED TEXTURE SYNTHESIS 59 Modulation The signals are then expanded by a factor of two in both spatial dimensions and modulated by the appropriate central frequency. Errors occur because the frequency content of each channel is always shifted to the central location. and then adding the result to the four synthetic channels of the next resolution. expanding the image by a factor of two in both spatial dimensions.
s be the k th wavelet coeﬃcient in subband b at scale s. The pyramidbased texture synthesis method achieves a better match for the feature values but is iterative and only works for transforms that can be inverted.5 Discussion We have described two texture synthesis algorithms for producing synthetic textures with certain feature values.6 Texture features We now propose a simple set of texture features based on the DTCWT and then test these features by synthesis experiments.s = k wk. 4. In other words.s for each subband as fb. or at least have a reasonable approximate inversion. The histogram will be calculated using 256 equally spaced bins across the range of intensity values in the image.60 CHAPTER 4. the wavelet texture features are given by the energies of the subbands. This method is fast and can be generalised for alternative ﬁlters but only approximately achieves the goal of producing matching feature values. The principle diﬀerences are that we use the invertible complex wavelet transform and that in the matching stage we match the energy of the subbands rather than their histograms. . Let wk. 4.b.b.7 Algorithm The structure of the algorithm is very similar to the method invented by Heeger and Bergen that was explained in section 4.s2 . We will also compare the results when we augment our feature set with the values of a histogram of the original image. We deﬁne a texture feature fb. The Gabor texture synthesis attempts to model the interaction between signals inserted in diﬀerent subbands. 4.3. COMPLEX WAVELET TEXTURE FEATURES image will only be well reproduced if the orientation is one of the four orientations of the Gabor ﬁlters.
The ﬁrst lookup table is computed from the cumulative histogram of the noise image and eﬀectively gives a transform from pixel intensity to rank order. each pixel in the noise image is transformed once by the ﬁrst lookup table to get its approximate rank. The output of the method is the image x(K) . These steps are then iterated K times where K is a positive integer. The second lookup table is computed once for all iterations and is the inverse to the intensity to rank transform for the example texture. The steps for iteration n are 1. Use the complex wavelet transform to generate a multiresolution decomposition for both y(n) (decomposition A) and the example texture image (decomposition B). . First we describe the algorithm for histogram/energy synthesis. The synthesis starts with an image x(0) of the desired size that contains white Gaussian noise of mean 0 and variance 1. In other words. Once the lookup tables have been constructed. generate a new image y(n) by applying a monotonically increasing function to x(n−1) in order that the histogram of the new image matches the histogram of the input texture. Histogram matching is a relatively quick operation as it can be computed by means of two lookup tables. 2. Match the histogram of x(n−1) to the input texture. The algorithm for energy synthesis is identical except that in step 1 y(n) is a direct copy of x(n−1) . The texture features are measured for this texture and then a new texture is synthesized from these features. ALGORITHM 61 We compare texture synthesis using just the wavelet texture features (called energy synthesis) with texture synthesis using the augmented feature set (called histogram/energy synthesis).7. Scale the contents of each noise subband (those in decomposition A) so that the resulting energy is equal to the corresponding energy for the texture subbands (those in decomposition B). The input to the algorithm is an example texture. If the original energy is EA and the desired energy is EB then the correct scaling factor is EB /EA .4. 4. Invert the complex wavelet transform of decomposition A to produce the next approximation x(n) to the synthesized texture. 3. and then by the second lookup table to discover the intensity in the example image that should have that rank.
COMPLEX WAVELET TEXTURE FEATURES 4.8 Results This section contains a selection of textures synthesized by the algorithm. 5 level transforms and K = 3 iterations are used in the algorithms. Original sand texture Hist/Energy method Original grass texture Hist/Energy method Original water texture Hist/Energy method Figure 4.4 are taken from the Brodatz set and are all 128 by 128 pixels.1: Results of using histogram/energy synthesis First some good results are shown in ﬁgure 4. The original textures are on the left and the synthesized textures are on the right. All the textures other than the ones in ﬁgure 4. sand and water. .1. The same experiment was repeated for energy synthesis and the results are shown in ﬁgure 4. The method used was to match histograms in the image domain and energy in the transform domain (the histogram/energy method).2.62 CHAPTER 4. The images are of grass. These images seem fairly well synthesized. The results appear just as good as for histogram/energy synthesis.
RESULTS 63 Original sand texture Synthesized sand texture Original grass texture Synthesized grass texture Original water texture Synthesized water texture Figure 4.2: Results of using energy synthesis .4.8.
Figure 4.3 shows an example where the results are not as good. and a version of histogram/energy synthesis based on the DWT. COMPLEX WAVELET TEXTURE FEATURES Figure 4. For every subband the energies rapidly converge to the target values. However. for this texture the DTCWT possesses a clear superiority over a comparable algorithm based on a normal Discrete Wavelet Transform (DWT) as the DWT features cannot discriminate between energy near +45◦ from energy near −45◦ . . Although the texture synthesized with histogram/energy synthesis does seem to be biased towards the vertical. The original texture Original Texture Synthesized Texture Figure 4.64 CHAPTER 4.1). Energy synthesis is a very bad choice for this texture as it makes the synthesized image much less piecewise smooth than the original and this diﬀerence is easily perceived. The target texture in this case was the the water texture (bottom left plot of ﬁgure 4. For energy synthesis the convergence is even more rapid. it looks very diﬀerent because the strong orientation has been lost. has a strong vertical orientation. Figure 4.3: Results of using histogram/energy synthesis on a wood grain texture. The energy in each subband was measured just before the subband rescaling.5 demonstrates the good convergence of the histogram/energy synthesis algorithm. histogram/energy synthesis. We tested energy synthesis. Histogram/energy synthesis partly captures the diagonal stripes in the texture but the variation in direction and size of the stripes again give rise to a quite noticeable diﬀerence. These measured energies are plotted against iteration number with one plot for each of the subbands.4 shows an example of a texture where no performance is entirely satisfactory. The texture consists of many diagonal blobs of the same intensity. There is also a horizontal line in each plot corresponding to the target energy value for the corresponding subband.
and histogram/energy synthesis is best. The improvement of the DTCWT relative to the DWT is seen when the texture has diagonal components.4. then energy synthesis gives reasonable performance.9. the DWT synthesis is worst. This occurs if the image contains regions where the intensity is constant.4: Results of using diﬀerent methods on a strongly diagonal texture 4. CONCLUSIONS 65 Original Texture Histogram/Energy synthesis Energy synthesis DWT Histogram/Energy synthesis Figure 4. . the diﬀerences are only noticeable in certain cases.9 Conclusions The methods are not able to adequately synthesize images with either strong directional components or with a regular pattern of elements but for textures without such problems there is a clear order of performance. The improvement of histogram/energy synthesis is seen when the histogram of the original texture has strong peaks. However. The DTCWT can separate features near 45◦ from those near −45◦ while the DWT combines such features.
Level 4 5000 0 Subband 5. Level 3 5000 0 Subband 4. Level 3 5000 0 Subband 3. Level 1 5000 5000 Subband 1. Level 4 5000 0 Subband 6. Level 1 5000 0 Subband 2. Level 2 5000 Subband 1. Level 2 5000 0 Subband 3. Level 1 5000 0 Subband 4. Level 3 5000 0 Subband 5. Level 4 0 Subband 2. Level 2 5000 0 Subband 6. Level 1 5000 0 Subband 6. COMPLEX WAVELET TEXTURE FEATURES Subband 1. Level 2 5000 0 Subband 5. Level 4 5000 0 Subband 4. Level 3 5000 0 Subband 6. . Level 4 5000 0 Subband 3. Level 3 5000 0 Subband 2. Horizontal lines represent the target energy values.66 CHAPTER 4. Level 3 5000 Subband 1. Level 4 5000 0 0 0 0 Figure 4.5: Energy before rescaling for diﬀerent subbands during the histogram/energy synthesis algorithm. Level 2 5000 0 Subband 4. Level 1 5000 0 Subband 3. Level 2 5000 0 Subband 2. Level 1 5000 0 Subband 5.
In a recent comparison of features for texture classiﬁcation [101] no clear winner was found. 67 . This is unreasonable in practice and we propose an alternative simpler method. This simple method gives poor experimental performance for the DWT but is reasonable for the NDWT and when used with the DTCWT the results are better than any one of the schemes used in the original classiﬁcation. We explain the reason for the power of the DTCWT in terms of its directionality and aliasing properties. The algorithms in this chapter are simple extensions to existing methods. The chapter is of interest because it demonstrates that complex wavelets are easy to use in existing algorithms and because the experimental results suggest that the DTCWT provides a powerful feature set for segmentation.1 Summary The purpose of this chapter is to explore the performance of the DTCWT features for nonBayesian texture segmentation. The original scheme used a statistical classiﬁer that required signiﬁcant quantities of reliable training data. The original contribution of this chapter is principally the experimental comparison of DTCWT features with other features. Finally we show how simple multiscale techniques yield a fast algorithm based on the DTCWT with even better results.Chapter 5 Texture segmentation 5. but the fast methods tended to give worse performance and it was concluded that it was important to search for fast eﬀective features.
First the original method used in the comparison is described in section 5. Section 5. An example of this is work by Kam and Fitzgerald who have produced results of using DTCWT features for unsupervised segmentation [59]. Randen and Husøy note that it is important to have disjoint test and training data. Section 5. Care must be taken when comparing results of supervised and unsupervised techniques because they are actually attempting slightly diﬀerent tasks. The supervised method may have a 50% chance of classifying the pixels correctly while the unsupervised method will classify every pixel into the same class and hence be deemed to achieve a 100% accuracy. Now consider a test image whose every pixel intensity is an identical medium brightness.68 CHAPTER 5.3.5 explains in detail the method tested. and a mosaic made up from sections of these textures. rather than being direct copies of a portion of the training texture.2 Introduction Texture segmentation has been studied intensively and many features have been proposed.6 contains the . were clear losers) and that the best choice depended on the application.4 describes how we simplify the training stage of the algorithm to give a more practically useful scheme. The problem is to assign each pixel in the mosaic to the correct texture class. This may seem very similar but suppose that one class contains very bright images. A supervised segmentation is considered perfect when every pixel is classiﬁed into the right class while an unsupervised segmentation is considered perfect when the boundaries are in the correct positions. This means that the textures present in the mosaic are new examples of the same texture as the training data. Recently Randen and Husøy [101] performed an extensive comparison of diﬀerent texture feature sets within a common framework. Section 5. The comparison was performed on a supervised texture segmentation task. They also claimed that computational complexity was one of the biggest problems with the more successful approaches and that therefore research into eﬃcient and powerful classiﬁcation would be very useful. decimated wavelet coeﬃcients for example. This task is called supervised segmentation because of the availability of examples from each texture class. Unsupervised segmentation attempts to solve the same problem without these examples. TEXTURE SEGMENTATION 5. Their study concluded that there was no clear winner among the features (although some feature sets. The input to the algorithm is a set of training images each containing a single texture. while the other contains very dark images.
Smooth the resulting features.8 discuss the reasons for the relative performance. . The comparison used pixel by pixel classiﬁcation in an attempt to isolate the eﬀect of the features. 2. Take the logarithm of the smoothed features.3.7 and 5. Classify each pixel to the closest class. The classiﬁcation method used was “Type One Learning Vector Quantization” (LVQ) [66]. In section 5. Amongst the ﬁlters examined were: 1. Square the ﬁlter outputs.3 Original Classiﬁcation Method This section describes the method used in the comparison paper[101] and brief details of the features tested. Ring and Wedge ﬁlters. This scheme requires time consuming training in order to select class centres that give good classiﬁcation results on the training data. Sections 5. The features were smoothed in step 3 using a Gaussian lowpass ﬁlter with σs = 8. 4. 2.9 we propose and test a multiscale segmentation algorithm in order to show that the beneﬁts of the DTCWT features are retained for these more powerful techniques. 3. 5. Diﬀerent ﬁlters result in diﬀerent feature sets. This scheme results in a classiﬁer that chooses the closest class where the distance is deﬁned as the standard Euclidean metric to the class centre.8. The main steps in the method are: 1. Laws ﬁlter masks. ORIGINAL CLASSIFICATION METHOD 69 results of the proposed method and also the published results using the more advanced training scheme. 5. However. The principal diﬀerence between the compared methods was in the choice of the ﬁlters used in the ﬁrst step.5. We will discuss the eﬀect of this choice later in section 5. Filter the input image. alternative classiﬁcation schemes such as multiscale classiﬁcation can give faster and better results.
Optimized FIR ﬁlter bank Randen and Husøy also tried a few nonﬁltering approaches including: 1. and entropy). AR modelbased features. 5. 10. 11. Eigenﬁlters derived from autocorrelation functions. 5. contrast. 9. The training data is repeatedly classiﬁed and the parts incorrectly classiﬁed are used to update the class centres to give better results. Quadrature Mirror Filters. 6. Prediction error ﬁlter. Nondyadic Gabor ﬁlter bank. Training neural networks using back propagation and median ﬁltering the resulting classiﬁcation. 8. Wavelet transform. . correlation. Optimized representation Gabor ﬁlter bank. This is a very slow procedure and experiments suggested that it gave only slightly improved results. TEXTURE SEGMENTATION 3. and frames based on the Daubechies family of wavelets.4 Training simpliﬁcation The LVQ training method used by Randen and Husøy results in a simple classiﬁcation scheme but makes use of the training data to improve the classiﬁcation accuracy. Dyadic Gabor ﬁlter bank. packets. 7. This is clearly very quick to compute and only a small amount of training data will be needed to obtain a reasonable estimate. In the experiments we have instead used a simpler system that simply sets the class centres to be the average over the training data of the feature vectors. Statistical features (angular second moment. 2. 4. Discrete Cosine Transform. 3.70 CHAPTER 5.
N − 1} X(x. We use a value of K = 24. We ﬁrst describe the generation of the feature vector and then the classiﬁcation scheme. y) are produced by convolving the rectiﬁed subbands with this smoothing ﬁlter. y) = 0 (this is called zero padding). y − u)2 (5. N − 1} as fs (x. DETAILED DESCRIPTION OF METHOD 71 The ﬁrst goal of this chapter is to demonstrate the superiority of the DTCWT features and so we are allowed to alter the comparison technique only if.3) Now suppose that there are C classes and let f (c) (x. As mentioned before a value of σs = 8 was used by Randen and Husøy and we choose the same value. . . As the transform is nondecimated each of these subbands will be the same size as the original image.2) Finally a feature vector f(x. The class centres µc are deﬁned as µc = 1 NM M −1 N −1 (5. . Suppose that we wish to calculate the feature vectors for an image of size M × N. . . . y in the image. y ∈ {0. v)Ws(x − u. y) = u=−K v=−K h(u. . . y) is deﬁned as the value of the pixel at position x. y) = log(Ws (x. . K}. . Let Ws (x. . . . For all other values of x and y we deﬁne X(x. y) for x ∈ {−K. y) ∈ R S is deﬁned for x ∈ {0.5. y) x=0 y=0 (5. . y) be the feature vectors calculated f (c) (x. . y ∈ {0. . . y) for s = 1. y) to represent the image. For x ∈ {0. . We use X(x. . K} as h(x. y)) from the training image for class c. K K Ws (x. the change will not make the results better. . M − 1}.5 Detailed description of method We describe the method for the NDWT and then explain the necessary modiﬁcations for the DWT and the DTCWT. Smoothed subbands Ws (x. 5.1) where σs controls the amount of smoothing and K sets the point at which we truncate the ﬁlter. y) = 1 x2 + y 2 exp − 2 2 2πσs 2σs (5. . . M − 1}. S be the subbands produced by the NDWT acting on X(x. . y ∈ {−K. .5. We deﬁne a smoothing ﬁlter h(x. .4) . . . 2. y). as is the case here. .
The main reason we use this very simple expansion is in order to provide the fairest comparison with the original experiments. y): dc (x. Let Ps (x. C} calculate the class distances dc (x.. y) (5. y as belonging to closest class r(x. y) = Ps ( y x . y) is equal to the value of the wavelet coeﬃcient (of subband k) that is closest to the location x. . k ) k 2 2 (5.. . y) r(x. These are not very compelling reasons.5) 3. 2. y) for the test image. y) = f (x. The expanded DWT subbands at level k are piecewise constant on squares of size 2k × 2k while the NDWT subbands have no such restriction. . M − 1}. . This expansion means that the value of Ws (x.C} dc (x. y. . The feature values will be smoothed in subsequent processing. Classify each pixel at position x. c ∈ {1.usually some form of interpolation such as lowpass ﬁltering is performed during expansion operations. Two possible justiﬁcations for this approach are: 1. The rest of the method is identical.6) For decimated transforms the subbands are reduced in size.72 CHAPTER 5. The subbands at level k are only of size M/2k ×N/2k . . y) − µc 2 (5. y ∈ {0. . . . In order to apply the same method we ﬁrst expand the subbands until they are of size M × N. Note that this expansion of the DWT is not equivalent to the NDWT. A better interpolation might improve the performance .. We deﬁne the expanded subband Ws (x. This may seem a strange way of expanding the subbands . y) be a subband at level k of size M/2k × N/2k . . . TEXTURE SEGMENTATION The classiﬁcation scheme has the following steps 1. y) = argminc∈{1. 2. . In fact. it is quite likely that an alternative expansion will improve the performance. The results of our experiments indicate that even this crude expansion allows the DTCWT to perform better than the alternative features. . Calculate the feature vectors f (x. y) by Ws (x.7) where z represents the largest integer not greater than z. For x ∈ {0. N − 1}.
For each . These results are plotted in ﬁgure 5. All errors are plotted as percentages. For a C class experiment.3. We use 4 levels of decomposition of the biorthogonal (6. and the highpass ﬁlter has 11 taps. The classiﬁcation errors for every mosaic and every feature set were published and we summarise this information in two ways. This measure is called the mean error rate. The ﬁgure contains 4 bar chart plots comparing the diﬀerent feature sets. The ﬁrst measure we extract is the average performance for each feature set averaged over all mosaics.5. The error in an image is deﬁned as the proportion of incorrectly classiﬁed pixels. the centre bar shows the error for the NDWT features. In the published comparison there was no clear winner. The lowpass ﬁlter has 17 taps. 5. and the NDWT does better than the DWT.6. and the right bar shows the error for the DTCWT features. Figure 5. We tested features generated from the DWT. Table 5. Within each plot there is one cluster of bars for each of the mosaics. The error therefore varies between 0 for a perfect classiﬁcation and 1 for a completely wrong classiﬁcation.1 shows the diﬀerent mosaics.6 Experiments The classiﬁcation was tested on the same twelve test images and sets of training data as used in the original comparison [101]. Inspecting the results in ﬁgure 5. random classiﬁcation would get 1 in C pixels correct and would have an expected error of 1 − 1/C. and DTCWT.8) ﬁlters in the DWT and NDWT [30]. Each plot is dedicated to a mosaic with a particular number of textures. In each cluster of bars the left bar shows the error for the DWT features. diﬀerent texture features performed best on diﬀerent textures. Randen and Husøy compared other wavelet types but found that the main diﬀerence was between decimated and nondecimated wavelets rather than the ﬁlters used.3 reveals that for almost all experiments the DTCWT does better than the NDWT. NDWT. The problem with this approach is that the average may be dominated by the performance on the mosaics with a large number of classes (as these will have the largest errors). EXPERIMENTS 73 of the DTCWT method but could also provoke the criticism that the performance gain is caused merely by the additional smoothing rather than the choice of wavelet transform. The second measure is designed to be fairer but is slightly more complicated.2 contains the results of using the diﬀerent features for the diﬀerent mosaics.
1: Mosaics tested .74 CHAPTER 5. TEXTURE SEGMENTATION j k l a b c d e f g h i Figure 5.
Dyadic Gabor ﬁlter bank 4.3 28.2: Comparison of segmentation results for diﬀerent transforms image we rank the diﬀerent methods according to their performance (with a rank of 1 given to the best).2 35.9 25.2 DTCWT error *100% 10.9 21.8 16.2 16.3 Figure 5.5 31 26.9 9. Undecimated Daubechies 4 wavelet 8. Ring/wedge ﬁlters 3.7 43.9 NDWT error *100% 11.8 30. Critically decimated Daubechies 4 wavelet 7.4 1.6 22 20.4 19. and then we average these ranks over all 12 mosaics.3 38.7 10. In addition to the three new methods described above. Undecimated 16 tap quadrature mirror ﬁlters (QMF) 9.3 28.5.3 33.1 9.6 0.6 12.6 1.7 50. Gabor ﬁlter bank 5. the following methods from the published comparison are used in the ranking: 1.8 40.3 24. Cooccurrence features .5 28. Laws ﬁlters 2.6 17. DCT 6.1 0.4 39 44. EXPERIMENTS 75 Mosaic a b c d e f g h i j k l DWT error *100% 12.6.9 12.1 47.
3: Percentage errors for (DWT.DTCWT) . TEXTURE SEGMENTATION Two textures 40 20 0 DWT NDWT DT−CWT 40 20 0 Five textures j k l a b c d e Ten textures 40 20 0 40 20 0 Sixteen textures h i f g Figure 5.76 CHAPTER 5.NDWT.
There are 6 subbands 1 The mean error rates were used as a measure of performance in the comparison [101]. . The results in bold are original while the others are taken from the published study [101]. Table 5.7 Discussion of relative performance The features are calculated from the energy in the wavelet subbands. Autoregressive features 11. the values given here do not quite agree because there was an error in the published results for one mosaic. Back propagation neural network We have omitted some of the badly performing methods and have taken just the best of families of methods (such as all the diﬀerent choices of wavelet transform). Prediction error ﬁlter 13. Table 5.4 tabulates the two measures of performance1 . The next best features are the nondecimated QMF ﬁlters while the worst results are given by the neural network classiﬁer.7. This eﬀectively contributes an extra noise source to the feature values and hence increases the classiﬁcation error. The values given here are based on the corrected experimental results [100]. For a shift dependent transform (the DWT for example) a translation causes the energy to be redistributed between subbands due to aliasing. This gives a total of 17 methods compared in the ranking.5. However. The ﬁrst is the increased directionality of the DTCWT. All the published results make use of the LVQ training algorithm.4 shows that the NDWT features with simple training give a mean error of 23.8%. The biorthogonal ﬁlters we use in the NDWT are similar to the quadrature mirror ﬁlters used in the comparison and therefore it seems that the much simpler training method results in only a small decrease in performance. Optimized FIR ﬁlter 14. 5. There are two main reasons for the improved DTCWT performance compared to the NDWT. the DTCWT features with an average error of 18% outperform all the other methods despite the simpler training. DISCUSSION OF RELATIVE PERFORMANCE 77 10. Eigenﬁlter 12.9% while the nondecimated QMF ﬁlters give a mean error of 20. Nevertheless.
1 26.25 6.5 8.3 30.75 10.6 27.3 3.8 31.5 8.2 29.78 CHAPTER 5.3 26.5 24.9 18.3 10.5 8 10.2 29.25 13.8 23.9 35.7 7. TEXTURE SEGMENTATION Method Laws Ring/wedge Dyadic Gabor ﬁlter bank Gabor ﬁlter bank DCT Critically decimated Daubechies 4 Nondecimated Daubechies 4 Nondecimated 16 tap QMF Cooccurrence Autoregressive Eigenﬁlter Prediction error ﬁlter Optimized FIR ﬁlter Backpropagation neural network DWT with simple training NDWT with simple training DTCWT with simple training mean error *100% 28.42 11.5 9.8 29.4 57.4: Performance measure for diﬀerent methods .08 17 9.75 Figure 5.17 2.17 7.0 Average rank 9.7 20.3 26.3 26.
5: Sine wave input contained in the scale 4 highpass subband. It occurs . In contrast the magnitude of the DTCWT coeﬃcients is expected to be fairly steady and we would expect much less rectiﬁcation noise.5%. Rectiﬁcation will convert these to a series of bumps which are ﬁnally smoothed.2 0 −0.6 −0.7. Consider the sine wave shown in ﬁgure 5. In 1D it is quite easy to see the eﬀect of the aliasing and rectiﬁcation problems.7 shows the rectiﬁed values (before smoothing) that are calculated by squaring the transform coeﬃcients. DISCUSSION OF RELATIVE PERFORMANCE 79 at each scale rather than 3 and the DTCWT is able to distinguish between features near 45◦ from those near −45◦ .8 −1 80 100 120 140 160 180 Figure 5.2 −0. For coarse scales it is possible that the lowpass ﬁlter does not have a narrow enough bandwidth to fully smooth these bumps and so some residual rectiﬁcation noise may remain. These coeﬃcients are shown in ﬁgure 5. We have chosen its frequency so that most of its energy is 1 0. It is certainly plausible that the extra features from these extra subbands should allow better classiﬁcation. Figure 5. The second reason relates to the smoothing step.5.6 (the imaginary part of the complex wavelet coeﬃcients is plotted with a dashed line).6 0.5.8 0. The rectiﬁed real wavelet values show a strong oscillation of 100% of the average value while the rectiﬁed complex wavelet values have only a small variation of about 2.4 0. We compute the scale 4 highpass coeﬃcients for both the nondecimated real wavelet transform and a nondecimated version of the complex wavelet transform. The very low variation of the complex wavelet coeﬃcients is no accident. The NDWT highpass subbands will contain slowly oscillating values.4 −0.
4 −0.6 0.5 0.8 −0.4 0.5 0.8 0.4 −0.6 0.2 0.2 −0.1 0.2 0 0 −0. TEXTURE SEGMENTATION Real wavelet 1 1 Complex wavelet 0.6 −0.7 Complex wavelet 0.1 0 80 100 120 140 160 180 0 80 100 120 140 160 180 Figure 5.2 0.2 0.80 CHAPTER 5.7: Rectiﬁed nondecimated scale 4 wavelet coeﬃcients .6 0.4 0.6: Nondecimated scale 4 wavelet coeﬃcients Real wavelet 0.6 0.3 0.3 0.4 0.7 0.6 −0.4 0.8 −1 80 100 120 140 160 180 −1 80 100 120 140 160 180 Figure 5.2 −0.8 0.
These plots correspond to the rectiﬁed outputs for the decimated transforms (i. We have advanced two eﬀects (directionality and rectiﬁcation noise) to explain the relative performance. These graphs have been plotted for scale 4 coeﬃcients. For σs = 8 the smoothing ﬁlter has a half peak width of σs 2 2 log 2 ≈ 19.8) Standard ﬁlter theory says that the output y(t) of a linear ﬁlter applied to this signal will be y(t) = B A exp {jωt} + exp {−jωt} 2 2 (5. It is natural to ask about the relative signiﬁcance of these eﬀects.11) The low variation for the DTCWT means we can aﬀord to decimate the output.7. one representing a positive frequency component.10) and hence the rectiﬁed signal would be constant and equal to y(t)2 = A2 .8 plots every 16th sample from the nondecimated outputs. the DWT and the DTCWT). DISCUSSION OF RELATIVE PERFORMANCE 81 because the complex wavelets have been designed to diﬀerentiate between positive and negative frequencies.e. There is a huge variation in the DWT rectiﬁed outputs while the DTCWT outputs are almost √ constant. To answer this question we performed two further experiments both using a cut down version of the DTCWT: HalfCWT In the ﬁrst experiment we halved the size of the feature vector by combining the energy in pairs of subbands. The 15◦ . 45◦ . A sine wave can be represented as the combination of two complex exponentials.9) where A is the response of the ﬁlter to frequency ω and B is the response for −ω. At ﬁner scales the coeﬃcients will oscillate faster and we would therefore expect less rectiﬁcation noise. 4 (5.5. and one representing the negative frequency component: cos(ωt) = exp {jωt} + exp {−jωt} 2 (5. This should be about suﬃcient to remove the variation for the NDWT but is clearly insuﬃcient for the DWT. and 75◦ subbands were paired respectively . Figure 5. If the linear ﬁlter had zero response for negative frequencies then (assuming ω > 0) the output would be simply y(t) = A exp {jωt} 2 (5.
7 0.4 0. The results for these new experiments are in table 5. RealCWT In the second experiment we set the imaginary part of all wavelet coeﬃcients to zero before rectiﬁcation. like real wavelet transforms. y)) (5. y) = log(Wa (x. This should introduce rectiﬁcation noise to the features. We conclude that rectiﬁcation noise is not too signiﬁcant because the results for the RealCWT are similar to those for the DTCWT. y) + Wb (x.1 0 80 100 120 140 160 180 0 80 100 120 140 160 180 Figure 5.6 0.2 0. demonstrating that the main reason for the improved DTCWT performance is its improved directional ﬁltering. This reduced the transform to only distinguishing 3 directions. equation 5.5 0.3 0. Note that these two modiﬁcations are intended to be harmful to the performance of the method and such transforms should never be used for a real application. the results for the HalfCWT are signiﬁcantly worse.6 0. .4 0.2 0.7 Complex wavelet 0.5 0. −45◦ . and −75◦ subbands.12) where a and b are the two subbands that are combined to give feature s.3 0.1 0.8: Rectiﬁed decimated scale 4 wavelet coeﬃcients with the −15◦ .10 (compared to the original DTCWT results). However. More precisely.82 CHAPTER 5. TEXTURE SEGMENTATION Real wavelet 0.3 was altered to fs (x.9 and shown in ﬁgure 5.
2 23.7 21.5 17 17.1 8.9 30 1 1.2 37.8 Figure 5.5 36.9 21.9 45.5 17.1 0.7 11. Each colour represents a diﬀerent class. For example on the 16 texture mosaic “f” there is still a 34% error.8 Discussion of DTCWT performance Although the DTCWT gives better results than the other methods.3 41.8. Near the border the smoothing ﬁlter will be averaging rectiﬁed coeﬃcients from both sides of the border to produce some intermediate value. The original is shown on the left.9: Comparison of segmentation results for altered DTCWT 5. This is not surprising because the feature values near the borders will be unreliable for two reasons: 1. Notice also that there are often fairly small groups of pixels assigned to some class. 2. DISCUSSION OF DTCWT PERFORMANCE 83 Mosaic a b c d e f g h i j k l HalfCWT error *100% 11 25.11.8 33. Near the border the impulse response for the coarser wavelets will straddle both sides and hence be unreliable partly because the value will average the response from both textures and partly because there will often be discontinuities at the border giving extra energy to the highpass coeﬃcients.9 5.6 RealCWT error *100% 10.7 39. Notice that there is usually a border of misclassiﬁed pixels around each segment.1 20. These two defects in the classiﬁcation are closely related to the size of the smoothing ﬁlter and place contradictory requirements on its size. The output of the DTCWT method for this mosaic is shown in ﬁgure 5.5. it is not perfect. In order to resolve the position of the bound .6 22. the classiﬁcation results on the right.
RealCWT.DTCWT) .84 CHAPTER 5.10: Percentage errors for (HalfCWT. TEXTURE SEGMENTATION Two textures 40 20 0 HalfCWT RealCWT DT−CWT 40 20 0 Five textures j k l a b c d e Ten textures 40 20 0 40 20 0 Sixteen textures h i f g Figure 5.
The basic concept is to use additional information about the nature of segments. The ﬁnal sections of this chapter test this prediction for a multiscale segmentation method. we may not expect to see very small separate segments.5. However. The author has also used the DTCWT for implementing a level set version of an active contour model [34]. There are several methods that address the issue. DISCUSSION OF DTCWT PERFORMANCE 85 Figure 5. This is a wellknown problem in image segmentation [127].8. . Active contour models [60] are useful for encoding information about the smoothness of boundaries while multiscale methods [128] are useful for describing expectations about the spatial extent of segments. or we may know that the segments should have smooth boundaries. but in order to accurately determine the class the smoothing ﬁlter should be large to give reliable feature estimates. We expect the advantages gained by these methods to be complementary to the advantages of the DTCWT feature set. For example. in the level set paper the emphasis is on using the DTCWT to describe contour shape rather than the texture. Diﬀerent methods make use of diﬀerent types of information.11: Segmentation results for mosaic “f” using the DTCWT aries accurately the smoothing ﬁlter should be small. Methods also diﬀer in whether the information is explicitly contained in a Bayesian image model (such as Markov Random Field approaches [9]) or just implicitly used [128].
l − 1) l > k Suppose the segmentation algorithm is operating at scale L. 5. l). 2. 2.k (x. L)) (L) (5. and then to reﬁne the estimate of the boundary location at more detailed scales. y. where qs. It is useful to index this scale L feature set f (L) (x. 6} (for subband) and k ∈ {1.k (x. This can be thought of as an adaptive smoothing ﬁlter whose size depends on the estimate of boundary position. y) = (L + 1 − k) log (qs. 4.k (x.k (x. . y. This method implicitly assumes that regions will have a reasonably large spatial extent and are unlikely to contain small interior regions of alternative textures. l) = Ws (x. y). 4. The corresponding feature set for position x. . 2. Care must be taken when applying such methods in the real world to ensure that appropriate assumptions are made. y)2 1 4 a∈{0. The basic idea is to ﬁrst calculate an approximate segmentation at a coarse scale. 3. This multiscale segmentation is also faster than the pixel by pixel segmentation described above because the size of the feature set decreases for the more detailed levels. 4} (scale 1 being the most detailed scale.9 Multiscale Segmentation We extend a previous multiscale segmentation method [128] to use the DTCWT features. 2y + b.9. y) be the sth subband (s ∈ {1.9. The features are deﬁned from the quadtrees by: fs.1 deﬁnes the features used and 5.13) .k (2x l=k + a. 2. . For an initial image of size N × M the complex subbands at scale k will be of size N/2k × M/2k for the DTCWT. . scale 4 the coarsest that we shall use). k ≤ l.9. During the reﬁnement the classiﬁcation reduces the importance given to the wavelet coeﬃcients that will be signiﬁcantly aﬀected by the boundary. These assumptions are true for the mosaics tested and consequently the method works well.2 describes the multiscale classiﬁcation procedure. L} (for feature scale).1} b∈{0. y. 5. We form a quadtree from each subband denoted qs. Let Ws.k (x. To deﬁne these sets it is useful to distinguish between the wavelet subbands at diﬀerent scales.1} qs. y is denoted f (L) (x. Section 5. 3. 6}) at scale k ∈ {1.1 Texture features for multiscale segmentation Diﬀerent texture feature sets are used during the multiscale algorithm. TEXTURE SEGMENTATION 5. 5. 3. y) with indices s ∈ {1.86 CHAPTER 5.
s.9.. At more detailed scales a reasonable ﬁrst approximation is ac (x. y) = (L) 1 6L 6 L fs. y): (L) dc (x. y) have been calculated the image is ﬁrst classiﬁed at the coarsest level and then the segmentation is reﬁned by reclassifying at more detailed scales.k (L) 22k = MN M/2k −1 N/2k −1 fs. . For each class c ∈ {1.14) 5.3 explains why we do not try and optimise these factors. y belongs to class c. y) − bc (x.k (x. C} calculate the class distances dc (x. The classiﬁcation at scale L has the following steps 1. . . . . y) = 0. y/2 ) = c (5.. For classiﬁcation at the coarsest scale bc (x.k (L) µc. .16) All that remains is to deﬁne bc (x.k (x. . y) (L) (5. y) deﬁned to be 1 if the corresponding parent block at scale L + 1 belongs to class c or 0 otherwise. .k (x. (L) ac (x. Classify each pixel at position x.17) . Naturally. This represents the information (from higher scales and notions of continuity of regions) about the probability that the scale L block at x. . y) = (L) (4) 1 r (L+1) ( x/2 . N/2L − 1}. . y) (L) (L) r (L) (x.s. . y/2 ) = c 0 r (L+1) ( x/2 . MULTISCALE SEGMENTATION 87 Notice the scaling factor L + 1 − k. Alternative scaling factors may well give better results but section 5. y as belonging to closest class r (L) (x. . c ∈ {1. . .5. y) = argminc∈{1. M/2L − 1}. y) − µc. C} the features are calculated for the corresponding training image and used to calculate feature means µc. . The values in the quadtree can be considered to be local estimates of the average energy in the wavelet subbands. For x ∈ {0. we would expect an estimate formed by averaging many numbers to be more accurate. . The scaling factor provides a simple way of favouring the more reliable estimates. 2.s.2 Multiscale classiﬁcation (L) Once the test image feature vectors fs.k s=1 k=1 (L) (L) 2 (5. y ∈ {0. y). .9..9.15) 2. y) x=0 y=0 (L) (5. .C} dc (x.
5. y) = α u=−K v=−K K exp − (u2 + v 2 ) 2λ2 (L) ac (x − u. The aim of this section on multiscale segmentation is to demonstrate that the DTCWT features are also useful for the more advanced classiﬁcation schemes.88 CHAPTER 5.4 Multiscale results The multiscale algorithm was tested on the 12 test mosaics as before using both the DTCWT features as explained above and using features calculated in an analogous way from the DWT.5%.5.3 Choice of parameter values There are a number of parameters in the method. TEXTURE SEGMENTATION Near the boundaries we should be less conﬁdent in the class assignment and we soften the function to reﬂect this uncertainty. The values were chosen during development of the algorithm to give sensible results on some mosaics (but not the test mosaics used by Randen and Husøy). For our experiments we used α = 1/4. The average for the multiscale DWT method is 16. 5. An analysis of the eﬀect of the parameters would be interesting but is beyond the scope of this dissertation.18) where α is a parameter that controls the amount of information incorporated from previous scales. There is also a danger in an experimental optimisation that the method will work very well on the mosaics used during the optimisation but poorly on alternative mosaics (of diﬀerent shapes or texture content). K (L) bc (x. y − v) (5. These values are certainly not theoretically or experimentally optimal. This aim is satisiﬁed better by using a “typical” multiscale algorithm than by testing a version optimised for a particular dataset.9.9.0% for the nonmultiscale DTCWT method. An approximate treatment of a similar quadtree algorithm for white Gaussian noise ﬁelds is given by Spann and Wilson [111]. . The average error for the DTCWT multiscale method is 9.5%. and α). There is just one case (image l) where the DWT gives better results than the DTCWT and even in this case the diﬀerence is only 0. λ. The softening is done by smoothing with a Gaussian ﬁlter with smoothing parameter λ = 3. On most of the test images the DTCWT performs substantially better than the DWT. (such as the scaling factors.4% as compared to 18. that will aﬀect the performance.
1 6 1. A comparison with published results [101] reveals that the simpler training scheme gives almost as good results as LVQ training and the DTCWT features performed better than any of the feature sets tested in the published study.4 Figure 5.8 23.7 21.8 31.5. Tests on a multiscale algorithm indicated that the superior performance of the DTCWT features is preserved even for more sophisticated classiﬁcation methods.4%.3 17. For the test mosaics used the multiscale classiﬁcation reduced the average error to 9.3 11 3. The main reason for the DTCWT outperforming the NDWT features is the increased number of subbands that allow more accurate orientation discrimination.8 31.9 9.4 21.3 25.8 7. greatly reduced. There are many fewer small segments and the boundary errors are 5.10.4 0.8 15.8% for DWT features. and that the DTCWT features are better than the NDWT features.9 Multiscale DWT error *100% 3. For the pixel by pixel classiﬁcation experiments the average error was 26.5 7. and 18.8 24. 23.3 0.14.7 24.12: Comparison of segmentation results for multiscale methods The diﬀerence in performance of the method can be clearly seen in the results for mosaic “f” in ﬁgure 5.4 13.9% for NDWT features. CONCLUSIONS 89 Mosaic a b c d e f g h i j k l Multiscale DTCWT error *100% 3.4 2. despite the simpler training.3 2.10 Conclusions The experimental results clearly show that the NDWT features are better than the DWT features. .0% for the DTCWT features.
TEXTURE SEGMENTATION Two textures 40 20 0 DT−CWT multiscale DT−CWT multiscale DWT 40 20 0 Five textures j k l a b c d e Ten textures 40 20 0 40 20 0 Sixteen textures h i f g Figure 5. . multiscale DTCWT.13: Percentage errors for single scale DTCWT.90 CHAPTER 5. multiscale DWT.
CONCLUSIONS 91 Figure 5.10.5.14: Segmentation results for mosaic “f” using the multiscale DTCWT .
92 CHAPTER 5. TEXTURE SEGMENTATION .
Chapter 6 Correlation modelling 6. The main parameters came from the autocorrelations of the wavelet coeﬃcients and the crosscorrelations of the magnitudes of subbands at diﬀerent orientations and scales. Simoncelli used over 1000 parameters to describe his textures. This method works well for many stochastic textures but fails when there is more structure in the image such as lines or repeated patterns. We compare the relative eﬀect of these diﬀerent parameters for the DTCWT. The autocorrelation allows better texture synthesis and experiments indicate that sometimes autocorrelation based features can also give improved segmentation performance. The method described is substantially based on a previous algorithm [108] and is not claimed as original.1 Summary The purpose of this chapter is to give an example of the use of the phase of the complex coeﬃcients. Simoncelli has demonstrated good performance with a similar synthesis technique when more parameters are extracted from an image than merely the energy [108].2 Autocorrelation Method The basic method is to repeatedly match both the image statistics and the transform statistics by alternating matching statistics and transforming to and from wavelet space 93 . 6. We described in chapter 4 a synthesis technique that generated textures with matching subband energies. The original contributions of this chapter are the experimental synthesis and segmentation results.
We have tested two method based on autocorrelation based statistics. y) the subband k wavelet coeﬃcient1 at position x. Simoncelli based his synthesis upon the oriented complex ﬁlters of the steerable pyramid described in section 2. 3. The spectrum is a function of both horizontal (ωx ) and vertical (ωy ) frequency. Let H(ω) be the spectrum of the ﬁlter. 2. 6} indexes the 6 orientated subbands at scale 1. 11. ωy ) as shorthand for these two variables. 8. to simply measure and match the image histogram. 10. We ﬁrst describe the raw autocorrelation matching method. k ∈ {1. We use instead the DTCWT.3. 12} indexes the subbands at scale 2. We use ω = (ωx . to avoid mixing changes caused by matching correlation with changes caused by a new set of image statistics we choose. minimum and maximum values [108]. rk (δx. δy) = x y wk (x.4. 4. y) = 0 for any positions that lie outside the subband. Raw Autocorrelation The method generates the statistics rk (δx. as in chapter 4. 5. Simoncelli measured the following image pixels’ statistics. while k ∈ {7. We denote wk (x. mean. δy) based on the autocorrelation of the magnitude of the complex wavelet coeﬃcients. skewness. The DTCWT subbands contain complex coeﬃcients. To make the equations simpler it is also convenient to deﬁne wk (x. Let Pim (ω) and Pref (ω) be the Fourier 1 In this section we use the more compact notation of a single number k to index subbands at diﬀerent scales and orientations. y + δy) Magnitude Autocorrelation The second method reduces the size of the parameter set by calculating real valued statistics rk (δx. We solve for an appropriate ﬁlter to apply to the subbands that will change the autocorrelation by roughly the required amount. y)wk (x + δx. We start by measuring the parameters of a target image and generating a random (white noise) image of the correct size. δy) for subband k directly from the complex valued autocorrelation of the subband. y + δy) In both cases we match the appropriate statistics in essentially the same way. . However.94 CHAPTER 6. For example. y where x and y are integers. rk (δx. variance. CORRELATION MODELLING and image space. 9. These 6 values capture the general shape of the histogram and we would expect them to give results very similar to using the full histogram. kurtosis. δy) = x y wk (x. y)∗wk (x + δx.
2. AUTOCORRELATION METHOD 95 transforms of the autocorrelations respectively of a subband and the corresponding subband from the transform of the target texture. Note that as we only retain a few autocorrelation coeﬃcients the Fourier transforms involved are small and consequently fast. Then the above matching method is applied to a subband consisting of just the magnitudes. a better matched autocorrelation. For the magnitude autocorrelation method we ﬁrst compute the magnitude and phase of each coeﬃcient in the subband.01Pim(0)). After using equation 6.2 to produce the ﬁlter spectrum we use an inverse Fourier transform to produce the actual ﬁlter coeﬃcients. Pim (ω) and Pref (ω) are known as the power spectra of the subbands. hopefully. The form of the autocorrelation is such that r(x. To avoid divisions by small numbers we increase the denominator by a small amount δ (in the experiments we use δ = 0. This results in 5 ∗ 6 = 30 complex subbands plus a real lowpass subband of scaling coeﬃcients. −y)∗ and so for an autocorrelation of size K by K (for odd K) . Although we have not proved that this will always improve the match. y) = r(−x. in practice we found that this scheme converged within a few iterations. We then convolve the subband with the ﬁlter (this is actually done in the Fourier domain by multiplication) in order to produce a new subband with. Throughout this chapter we will always use a 5 scale DTCWT decomposition.6.2) The deﬁnition of the power spectrum ensures that Pim (ω) and Pref (ω) are always real. We only have the central samples of the autocorrelations and so we estimate the power spectra by zeropadding the autocorrelation matrices to twice their size before taking Fourier transforms. Standard ﬁlter theory tells us that the power spectrum of the ﬁltered image is given by: Pf ilt (ω) = H(ω)2 Pim (ω) (6. Finally the new magnitudes are recombined with the original phases to produce the new complex subband.1) We require this output spectrum to be close to the reference spectrum and so the natural ﬁlter to use is given by: H(ω) = Pref (ω) Pim (ω) + δ (6. We only impose correlations on the complex subbands: the scaling coeﬃcients are not changed during the matching of transform statistics. For counting purposes we will treat the real and imaginary parts as separate parameters.
2. and hence we have a total of 30K 2 parameters describing the transform statistics. For the magnitude autocorrelation this is reduced to 15(K 2 + 1).3 where the synthetic texture appears very similar in texture to the original.1: Results of original energy matching synthesis texture and.4 shows the results of using the central 5 by 5 samples of the magnitude autocorrelation (there is no noticeable diﬀerence if we just match a 3 by 3 autocorrelation). For comparison. The diagonal lines are longer and the image is more tightly constrained to one orientation.96 CHAPTER 6. CORRELATION MODELLING there are only (K 2 + 1)/2 independent complex numbers. The improvement is even greater if we use the central 5 by 5 samples as shown in ﬁgure 6. the energy synthesis method of chapter 4 needs only 30 parameters to describe a texture. Recording and matching merely the central 3 by 3 samples of the autocorrelation matrix results in the improved results shown in ﬁgure 6. We conclude that we need to record K 2 numbers to record the raw autocorrelation for a single subband. Moreover. Figure 6. We ﬁrst test the raw autocorrelation method. These results are just as bad as the . the central sample r(0. The problem is the highly correlated lines of grain that cross the Matching size 1x1 mag autocorrelation Target texture Processed picture after 3 iterations Figure 6. 6. Next we test the magnitude autocorrelation method. although the general diagonal orientation of the texture is reproduced.1. the strong correlation is lost. 0) is always real.3 Autocorrelation Results One texture (of wood grain) on which the energy synthesis method performs poorly is shown in ﬁgure 6.
3: Results of matching 5 by 5 raw autocorrelation values .2: Results of matching 3 by 3 raw autocorrelation values Matching size 5x5 raw autocorrelation Target texture Processed picture after 3 iterations Figure 6.3. AUTOCORRELATION RESULTS 97 Matching size 3x3 raw autocorrelation Target texture Processed picture after 3 iterations Figure 6.6.
4 Discussion The raw autocorrelation matching gives a signiﬁcant improvement and so is managing to capture the correlation in the image. if a subimage is responding to lines in the image then the phases of the autocorrelation coeﬃcients encode the relative positions of the line segments. while magnitude matching fails to help. The original texture contains alternating stripes of strongly orientated material and although the synthetic texture does contain some patches of strongly orientated texture. CORRELATION MODELLING original energy synthesis. Therefore when we match the raw autocorrelation we are ensuring that the line segments will be correctly aligned. 6.4: Results of matching 5 by 5 magnitude autocorrelation values were found to converge very quickly. it also contains several places where there seems to be a more checkerboard appearance. There are some textures for which the autocorrelation does not work as well such as the hessian pattern in ﬁgure 6. In a similar way. We described in chapter 3 how complex wavelets can be used for motion estimation because the change in phase of a wavelet coeﬃcient between frames is roughly proportional to the shift of an underlying image. We have shown the results after 3 iterations as these methods Matching size 5x5 mag autocorrelation Target texture Processed picture after 3 iterations Figure 6. More iterations produced negligible changes to the synthesized images. We added measures of crosscorrelation between subbands in an attempt to solve this problem as described in the following sections. This means that signiﬁcant information is contained in the phases of the wavelet coeﬃcients.5.98 CHAPTER 6. . This is because at these places there is energy both at an orientation of 45◦ and of −45◦ .
The translations therefore alter the phase relationship between subbands and hence when the crosscorrelation is averaged across the entire texture the individual correlations will tend to cancel out. CROSSCORRELATION METHOD 99 Target texture Processed picture after 3 iterations Figure 6. will rapidly change if the image is translated at an angle of −45◦ . and between subbands at one scale and those at the next scale. We deﬁne bl. Unfortunately.5 Crosscorrelation method We measure the crosscorrelations between subbands at one scale.6. y). There is no reason for the pattern to have any particular alignment within the subimages and we can interpret the subimages as being a single prototype image distorted by diﬀerent translations.5.5: Results of matching 5 by 5 raw autocorrelation values 6.j. This was not a problem for autocorrelation as the coeﬃcients within a single band all respond in the same way to a translation and hence the relative phase contains useful information. there is not any signiﬁcant raw correlation between subbands. The problem is that the phase of wavelet coeﬃcients gives information about the location of features in a particular direction. y)wk (x. It may seem odd that we use the magnitudes when we have discovered the importance of phase for autocorrelation matching.k (a. Suppose that there is a particular pattern that is repeated many times in a certain texture and suppose we break the original image up into lots of smaller subimages containing examples of this pattern. while the phase of the coeﬃcients in the −45◦ subband will be much less aﬀected by such a translation [74]. The single scale crosscorrelation cjk between subband j and subband k is given by cjk = x y wj (x. The phase of coeﬃcients in the 45◦ subband. b) to be the correlation . The between scales crosscorrelation measures the correlation between a subband at one scale and the subbands at the next coarser scale. say.
The matching procedure ﬁrst matches the raw autocorrelation values in the way described earlier and then attempts to match the crosscorrelations. 2y + b)wl+1(x. . Due to the down sampling in the tree structure each position at scale l + 1 is eﬀectively the parent of 4 positions at scale l.6 Crosscorrelation results and discussion We compare three methods in this section: Energy The subband energy matching method from chapter 4 using 30 parameters to describe the wavelet statistics. 6. Again we use a measure of magnitude correlations as the raw phases will tend to cancel out2 We need 6 ∗ 5/2 = 15 parameters to describe the cross correlations at a single scale. y) where a and b take values 0 or 1. b) = x y wl (2x + a.100 CHAPTER 6. CORRELATION MODELLING between subband j at scale l and subband k at scale l + 1: bl. we do not use a between scales correlation for the coarsest scale subbands as these wavelet coeﬃcients have no parents. We use a and b to measure a separate correlation for each of these 4 choices.j. The details of the crosscorrelation matching method can be found in Simoncelli’s paper [108]. The experiments presented here do not make use of this modiﬁcation but details can be found elsewhere [96]. 2 A way has been proposed to avoid the cancellation when computing the crosscorrelation between two subbands at diﬀerent scales but the same orientation. For the 5 scale decomposition this gives a total of 15∗5+144∗4 = 651 parameters to describe cross correlations in addition to the parameters used to describe the image statistics and autocorrelations. and 6 ∗ 6 ∗ 4 = 144 parameters to describe the cross correlations between subbands at one scale and the next coarser scale. The phases at the coarser scale will change at half the rate of the ﬁner scale and so to make the comparison meaningful the coarser scale coeﬃcients must have their phase doubled.k (a. Raw autocorrelation The 7 by 7 raw autocorrelation matching method from the start of this chapter using 30 ∗ 7 ∗ 7 = 1470 parameters to describe the wavelet statistics. Naturally.
For texture synthesis it is reasonable to expect an increase in quality for each new feature matched. Figure 6.6 displays the results of the diﬀerent methods applied to 4 test images. cluding the crosscorrelation statistics leaves the ﬁrst three textures essentially unaltered. The last hessian texture may be considered to be slightly improved but the improvement is certainly not very large. Original Energy Raw Auto−correlation Cross−correlation In Figure 6. The most obvious drawbacks are that the storage and computation requirements are increased. but there is also a possible decrease in performance.6.6: Comparison of diﬀerent synthesis methods. The main interest is in . CROSSCORRELATION RESULTS AND DISCUSSION 101 Crosscorrelation The 7 by 7 raw autocorrelation matching together with crosscorrelation matching to give a total of 30 ∗ 7 ∗ 7 + 651 = 2121 parameters to describe the wavelet statistics. There are several penalties associated with the increased feature set size. On all of these textures the autocorrelation method gives a clear improvement compared to the original energy synthesis method but it has a signiﬁcant increase in the size of the parameter set.6. but synthesis itself is only of secondary interest.
5. We cannot directly use the autocorrelation to provide features because we just get one autocorrelation value for the entire subband. Filter the subband Hk (u. v). Filter the subband Hk (u. v) vertically with the ﬁlter 1 + z −1 to produce Ck (u. v) vertically with the ﬁlter 1 − z −1 to produce Bk (u. Filter the subband Wk (u. Instead we consider a very simple extension of the DTCWT that performs extra ﬁltering on each subband to determine four features per subband. v) horizontally with the ﬁlter 1 + z −1 to produce Lk (u. large textural regions are needed to reliably estimate the feature values. CORRELATION MODELLING using the features for texture analysis. v). v). The next section examines the performance of a larger feature set for the segmentation task. the features may be modelling variation within a single texture class. Filter the subband Wk (u. 3.7 Large feature set segmentation For the reasons mentioned above it would be inappropriate to try and use the more than 2000 auto and cross correlation parameters for texture segmentation but it would be interesting to see the eﬀect of using features based on the 3 by 3 raw autocorrelation. We ﬁrst describe this algorithm and then explain why it is approximately equivalent to calculating a local autocorrelation estimate. v). v). 2. v). v) is split into four by: 1. v) vertically with the ﬁlter 1 − z −1 to produce Dk (u. v) vertically with the ﬁlter 1 + z −1 to produce Ak (u. 3. 6. Each subband Wk (u. . v) horizontally with the ﬁlter 1 − z −1 to produce Hk (u. We propose using a simple shift invariant extension to the DTCWT based on the Haar wavelet transform. Filter the subband Lk (u. 2. the features may have signiﬁcant correlations – this causes problems if we want to use simple metrics to compare feature sets. The principal problems with extra features are that: 1. 4. 6. while for segmentation we clearly need local estimates of feature values. Filter the subband Lk (u. and for analysis applications extra features can be a disadvantage.102 CHAPTER 6.
2 0.2 0.3 0.2 0.4 Horizontal Frequency Figure 6.3 0.5 0.2 0.4 Horizontal Frequency 0.3 0.6.7 shows contours of the frequency responses for the four subbands derived from the original 45◦ subband at scale 2.1 0 Vertical Frequency 0 0. Dk rather than on the original subbands. A dashed contour at the 25% peak level for the original 45◦ scale 2 subband is also shown in each plot.3 0.3 0.1 0 0. The features are then calculated as before but based on Ak .7. For the very short ﬁlters used here we merely need to repeat the last row (or column) of the image. Bk .2 0. Ck . Now we explain why this is an appropriate measure of local autocorrelation.4 Horizontal Frequency Vertical Frequency 0 0.2 0. 25% of the peak amplitude. Figure 6.1 0. To motivate our choice we consider a one dimensional example. This leads to four times as many features.4 0.3 0.5 0.1 0.2 0.2 0.5 0.1 0.7: 2D frequency responses for the four subbands derived from the level 2 45◦ subband. Contours are plotted at 90%.3 0. Suppose we ﬁlter a signal containing white Gaussian noise of mean zero and variance 1 whose Z transform is X(z) with a ﬁlter H(z) = 1 + az −1 where we assume a is real.5 0. LARGE FEATURE SET SEGMENTATION 103 All the ﬁltering operations are nondecimated and use symmetric edge extension.1 0 0.4 0.1 0. Let {yk } denote the samples of the ﬁltered signal and {xk } the original white .1 0 Vertical Frequency 0 0. but the connection with autocorrelation is not as clear.3 0. 75%. The new subbands approximately quarter the frequency response of the original subband.4 0. 50%.4 0. Edge extension is important when ﬁlters overlap the edge of an image.4 Horizontal Frequency Vertical Frequency 0 0. The short ﬁlters mean that the features will produce local features. 0.
5% worse for mosaic a.104 CHAPTER 6. the ﬁltering introduces correlations between the samples. while the diﬀerence is 4 times the average autocorrelation at lag 1.7% compared to 18. More precisely. This agrees with the argument in the previous section that although extra features can sometimes provide improvements in segmentation. The average of the errors for the extended feature set is 17. as yk = xk + axk−1 and yk+1 = xk+1 + axk we can calculate the following expected correlations: E {yk yk } = E x2 + 2aE {xk xk−1 } + a2 E x2 k k−1 = 1 + a2 E {yk yk+1 } = E {xk xk+1 } + aE x2 + aE {xk−1 xk+1 } + a2 E {xk−1 xk } k = a This means that the average autocorrelation for lag ±1 is a.6.0% for the DTCWT. the average autocorrelation for lag 0 is 1 + a2 and it can easily be shown that the autocorrelation for any other lag is 0. The output samples {yk } will contain coloured noise. this gain is not automatic and great care must be taken in choosing features. The output {fk } of using the 1 + z −1 ﬁlter is equivalent to ﬁltering the original white noise with a combined ﬁlter of (1 + z −1 )H(z) = 1 + (1 + a)z −1 + az −2 This will therefore produce an output with expected energy E fk 2 = 1 + (1 + a)2 + a2 = 2(1 + a + a2 ) If instead we ﬁlter with 1 − z −1 to get {gk } we have an expected energy of E gk 2 = 1 + (−1 + a)2 + a2 = 2(1 − a + a2 ) The sum of these two energies is 4 times the average autocorrelation at lag 0. CORRELATION MODELLING noise samples. This illustrates the close link between the extra ﬁltering and autocorrelation and suggests why the ﬁltering provides an appropriate measure of local autocorrelation statistics. The extended feature set is better for 9 out of the 12 test mosaics but 5. Table 6. Now consider the expected energy after using the Haar ﬁlters. In other words.8 presents the results of using the enlarged feature set for the pixel by pixel segmentation experiment described in section 5.2. Also tabulated are the results for the DTCWT repeated from table 5. .
4 34 39.4 21.1 9.6 15. Numerical experiments using an extended feature set conﬁrmed that autocorrelation related features can sometimes increase segmentation performance but that they can also decrease performance in other cases.4 19.1 0.4 24. Matching crosscorrelation only slightly changed the results. The phase is an important part of the correlation because matching features based solely on the magnitude autocorrelation gave inferior results.5 14.8.3 28.3 Extended DTCWT* 100% 16.6.8: Comparison of segmentation results for diﬀerent transforms 6.4 8.6 17.8 40. These conclusions are all based on the subjective quality of synthesized textures.8 19.9 21. CONCLUSIONS 105 Mosaic a b c d e f g h i j k l DTCWT error *100% 10.4 0.2 Figure 6.8 16.6 0.8 Conclusions The extra features generated by measuring the autocorrelation of the subbands are useful for modelling longerrange correlations and allow good synthesis of strongly directional textures.6 1.1 18.3 33.2 16. .
CORRELATION MODELLING .106 CHAPTER 6.
Note that we are not directly aiming to compare Bayesian and nonBayesian methodologies.1 Introduction The previous chapters have been concerned with nonBayesian image processing techniques. The aim of this dissertation is to explore the use of complex wavelets in image processing.Chapter 7 Bayesian modelling in the wavelet domain 7. Both approaches are commonly used and both approaches have diﬀerent advantages. The remaining chapters have a very diﬀerent ﬂavour. The speciﬁc motivation for using the Bayesian methodology to address the problems in the following chapters is to provide a mathematical framework within which we can place and compare techniques. We consider a number of diﬀerent ways in which we can deﬁne a prior distribution for images and reexpress each model in terms of a multivariate Gaussian. Within this context the choice of wavelet 107 . The concepts of probability distributions and Bayes’ theorem are brieﬂy stated and then used to construct a common framework for a range of diﬀerent texture models. The purpose of this chapter is to introduce a complex wavelet model and compare this with alternative model formulations and alternative wavelet choices. The general approach has been to design what we hope to be an appropriate algorithm for addressing a particular problem and then examine the experimental results. We will now approach image processing from a Bayesian perspective. The previous chapters have illustrated their use within certain nonBayesian methods and now we wish to explore the use within Bayesian processing.
y) = Conditional pdfs are deﬁned as fXY (xy) = ∂P (X ≤ xY = y) ∂x ∂ 2 FX.2 Introduction to Bayesian inference This section gives a brief introduction to the terminology used for Bayesian inference.Y (x. 7. y) ∂x∂y . Basic familiarity with the concepts of probability theory and with the ideas of random processes and their covariance and correlation functions [116] is assumed. Joint cdfs are deﬁned as FX. and the experimental measurements in 1D and 2D of the eﬀects of using a decimated transform. deﬁned by fX (x) = ∂FX (x) ∂x where FX (x) is the cdf for the random variable. The main original contributions are.Y (x. These terms are deﬁned as: Cumulative Distribution Function (cdf) The cdf for a random variable X is a function FX : R → R . deﬁned by FX (x) = P (X ≤ x). BAYESIAN MODELLING IN THE WAVELET DOMAIN transform is considered in section 7. Probability Density Function (pdf) The pdf for a random variable X is a function fX : R → R . the description of shift invariant wavelet models in terms of a Gaussian random process.Y (x. the identiﬁcation of the autocorrelation of the process in terms of wavelet smoothing.4. y) = P (X ≤ x.108 CHAPTER 7. Y ≤ y) and joint pdfs as fX. We will use the terms pdf or cdf to describe the distribution of a random variable.
1. in chapters 8 and 9. This represents the information we have about the model parameters before observing the image data.7. We will use upper case for vectors of random variables and lower case for observations of . (Later. Posterior The posterior distribution is the name for f (xy). a simple prior for an image might be that all pixels have intensity values independently and uniformly distributed between 0 and 1. For example. Generating a sample from f (yx) is equivalent to using our model to generate some typical noisy image data based on some particular values of the parameters x. In equation 7. Likelihood The likelihood is the name for f (yx). we explain how. 7.) In other words. Bayes’ theorem provides a way of estimating the parameters of the model (such as the clean image before noise was added) from the observed data. x represents the unknown parameters and y the observed image data.3 Bayesian image modelling In this chapter we are only concerned with specifying the prior distribution for images. we can proceed to deﬁne the likelihood for a particular problem and ﬁnally infer estimates from observed data. We will make use of Bayes’ theorem when we have a model that generates images based on some unknown parameters. Clearly this will be intimately related with the precise application and the models we describe will have a number of parameters that can be tuned depending on the circumstances.3. For notational simplicity we represent images by placing the pixels into column vectors. we are trying to mathematically express the expectations we have for the images that are likely to occur. once equipped with a suitable prior.1) where we have dropped the subscripts for clarity (this will usually be done within the dissertation when there is little risk of confusion). This represents all the information we have about the model parameters after observing the image data. This represents our knowledge about the model. BAYESIAN IMAGE MODELLING 109 Using these deﬁnitions Bayes’ theorem for pdfs can be written as f (xy) = f (yx)f (x) f (y) (7. There are special words that refer to particular parts of the formula: Prior The prior distribution is the name for f (x).
. One useful standard result is that if Z s N (µ. B) and Y = AZ where A is a real matrix with N columns and S ≤ N rows then Y s N Aµ. We use the notation Z s N (µ. integers. B) p(Z = z) = 1 (2π)N/2 B1/2 1 exp − (z − µ)T B −1 (z − µ) 2 (7. A process is deﬁned to be stationary in the wide sense if 1. for example. B) to denote that the random variables contained in Z are drawn from a multivariate Gaussian distribution with mean µ and covariance matrix B. . Let xa ∈ R 2 be the position of the ath pixel. N} E {Za } = c 2. The multivariate Gaussian is deﬁned to have the following pdf for Z s N (µ. We shall make extensive use of the multivariate Gaussian distribution (also known as a multivariate Normal distribution).b = R(xa − xb ) 1 R such that for all The intensity values are given by continuous random variables. Images generated with a multivariate Gaussian distribution are also known as realisations from a discrete1 Gaussian random process. The ﬁrst condition means that µa = E {Za } = c and for simplicity we shall assume that the data has been shifted to ensure c = 0. The second condition means that the covariance matrix B has a speciﬁc structure: E {Za Zb } = Ba. the correlation of two random variables Za and Zb is a function only of their relative position: there exists a function R : R 2 → R such that for all a. R is called the autocorrelation function for the random process. b E {Za Zb } = R(xa − xb ).110 CHAPTER 7. The process is called discrete because values are only deﬁned on the grid of pixel positions that cover the image. There is no assumption that the intensity values must be. the expectation is independent of position: there exists a c ∈ a ∈ {1. Let N be the number of locations within the image. We are particularly interested in wide sense stationary processes. . BAYESIAN MODELLING IN THE WAVELET DOMAIN such vectors. .2) where N is the length of the vector Z and B is the determinant of B. . ABAT .
1 Filter model A simple example of the generative method is the ﬁlter model. j entry in the covariance matrix is equal to the covariance function of the random process evaluated for the diﬀerence in position between pixel i and pixel j. for example. i. In other cases a method for generating samples from the prior is given. We now consider a number of standard prior models and convert each case to the equivalent multivariate Gaussian form for the distribution. We imagine generating complex white noise in the Fourier domain with variance depending . This relationship is well known [116] and we highlight a couple of standard results (assuming that the ﬁlter is stationary.3. The covariance function of the random process is equal to the autocorrelation function of the ﬁlter impulse response. Let R be a column vector containing all the white noise samples.e. we call this a generative speciﬁcation. The values Z in the ﬁltered image will be distributed as Z s N 0. 7. BAYESIAN IMAGE MODELLING 111 The covariance function of the random process is deﬁned to be E {(Za − E {Za })(Zb − E {Zb })} and is equal to R(xa − xb ) because E {Za } = E {Zb } = c = 0. Many models are special cases of this system including. The signals produced by such a system are examples of wide sense stationary discrete Gaussian random processes. the ARMA (autoregressive moving average) model.3. There are two styles of distribution speciﬁcation that are often encountered. AAT . 2. The i. Sometimes a formula for the pdf is explicitly stated. 7. that the same ﬁlter is used across the entire image): 1.3.2 Fourier model The Fourier model is another generative speciﬁcation closely related to the previous model. This process generates sample images from the prior. we shall call this the direct speciﬁcation. Then let A be a matrix that applies the ﬁltering operation so Z = AR. Imagine that we have an image ﬁlled with random white noise of variance 1 which is then ﬁltered.7.
b = √ exp −2πj √ M M where we assume that the images are square of dimensions of the Fourier transform has the following properties: 1. The images can be expressed as Z = = F H D (RR + jRI ) T FR − jFIT D (RR + jRI ) T = FR DRR + FIT DRI = T FR D FIT D RR RI and we deduce that the prior distribution is T Z s N 0. This is known as Parseval’s theorem: a 2 √ M by √ M . F H F = IM 2. IM ) Denote the real part of F by FR . and ﬁnally taking the real part of the output to generate a sample image. . This deﬁnition = aH a = aH F H F a = F a 2 Let D be the (real) diagonal matrix that scales white noise of variance 1 to give white noise in the Fourier components of the desired variances. then inverting the Fourier transform.112 CHAPTER 7. BAYESIAN MODELLING IN THE WAVELET DOMAIN on the frequency according to some known law. and the imaginary part by FI . The inverse is the Hermitian transpose of F . We deﬁne a matrix F to represent the Fourier transform: 1 xT xb a Fa. The energy of the Fourier coeﬃcients is equal to the energy in the image. IM ) s N (0. FR D 2 FR + FIT D 2 FI . The images generated by the Fourier model can be written as as: RR RI F H D (RR + jRI ) where RR and RI are distributed s N (0.
If we have a complex wavelet transform then it is convenient to treat the real and imaginary parts of the output coeﬃcients as separate real outputs of the transform. BAYESIAN IMAGE MODELLING 113 T again a multivariate Gaussian. and D a diagonal matrix containing the weights we apply to the wavelet coeﬃcients then p(Z = z) ∝ exp − 1 DW z 2 2 1 = exp − zT W T D 2 W z 2 which we can recognise as the form of a multivariate Gaussian. Z s N 0. P the reverse wavelet transform. The entry Bij can be written as Bij = eT Bej i T = eT FR D 2 FR + FIT D 2 FI ej i = eT i F H D 2 (FR + jFI ) ej where ei is the column vector containing all zeros except for a one in the ith place. Invert the Fourier transform of the scaled coeﬃcients. (We also assume that D is a real matrix. This process represents a simple blurring operation and we conclude that the covariance function of the generated random process is given by such a blurred impulse. If we let the (real) matrix W represent the forward wavelet transform. 3.3 Wavelet direct speciﬁcation One way of using a wavelet transform to deﬁne the prior is to specify a pdf deﬁned on a weighted sum of the squares of the wavelet coeﬃcients of the transform of the image. Take the Fourier transform of an impulse at location xj . 2. One way to understand the covariance is via the equation W T D 2 W C = W T D 2 W (W T D 2 W )−1 = IN . Let B = FR D 2 FR + FIT D 2 FI be the covariance matrix. Extract the real part of the entry at location xi .7. (W T D 2 W )−1 The covariance matrix C = (W T D 2 W )−1 has a strange form. 7.3. Multiply the Fourier coeﬃcients by the diagonal entries of D 2 . 4.) This equation represents the following process: 1.3.
However. but not to z itself.3. 2. For a balanced wavelet the wavelet sharpening algorithm consists of the following steps: 1. We deﬁne a new set of ∗ ∗ reconstruction ﬁlters G0 (z) = H0 (z −1 ). the covariance function is such that if we apply a wavelet sharpening process we produce an impulse. In other words.114 CHAPTER 7. Invert the wavelet transform. we use reconstruction ﬁlters given by the conjugate time reverse of the analysis ﬁlters. 7.e. Take the wavelet transform of the image. scaling them by a diagonal matrix D and then . 3. but this is not necessarily true for a redundant balanced wavelet transform. In other words. The mathematics translates to saying that the shape of this covariance function is given by the inverse of the sharpening algorithm applied to an impulse. If we assume that the same weighting is applied to all the coeﬃcients in a particular subband then (for a shift invariant transform) the prior will correspond to a stationary discrete Gaussian random process with some covariance function. BAYESIAN MODELLING IN THE WAVELET DOMAIN This means that the ith column of C is transformed by a wavelet sharpening process W T D 2 W to become ei . Recall that for a standard wavelet transform H0 (z) and H1 (z) deﬁne the analysis ﬁlters while G0 (z) and G1 (z) deﬁne the reconstruction ﬁlters. If we are using an orthogonal wavelet transform (i. a nonredundant balanced transform) then the inverse of a wavelet sharpening process will give the same results as a wavelet smoothing process. These may no longer correspond to a perfect reconstruction system but if we nevertheless use the reconstruction ﬁlter tree with these new ﬁlters then we eﬀectively perform a multiplication by W T . G1 (z) = H1 (z −1 ) where the conjugation operation in these equations is applied only to the coeﬃcients of z.4 Wavelet generative speciﬁcation We can also generate sample images using wavelets by generating white noise samples of variance 1 for each wavelet coeﬃcient. For nonbalanced wavelets W T is not the same as the reconstruction transform P . there is a natural interpretation for W T in terms of the ﬁlter tree used to compute wavelets. Multiply the wavelet coeﬃcients by the diagonal entries of D 2 .
We will assume that the same weighting is used for all the coeﬃcients in a particular subband and that the choice of wavelet transform is such that the sample images are implicitly drawn from a stationary prior. just as for the Fourier method. Consequently. An alternative view of this method for a S subband wavelet transform is to consider the images as being the sum of the S reconstructions. P D 2P T . Lemma 1 in Appendix B shows that the autocovariance function for a sum of two independent images is given by the sum of the individual covariance functions. 3. Invert the wavelet transform. this second assumption is discussed in section 7. CHOICE OF WAVELET 115 inverting the wavelet transform. This is the most important model for our purposes as it is the model that will be used in the next chapter.7. Each subband has a common scaling applied to the wavelet coeﬃcients and so can be viewed as a special case of the ﬁltering method with the ﬁlter being the corresponding reconstruction wavelet. The assumption that this prior is stationary means that the prior is a stationary discrete Gaussian random process. The next sections report on two factors relating to the accuracy of the results: .2. 7. the covariance of the sum of the reconstructions will be the sum of the individual covariances because the scales all have independent noise sources. For a balanced wavelet W = P T and. Scale the wavelet coeﬃcients by D 2 .4 Choice of wavelet There are a number of factors to consider in our choice of wavelet. the covariance function of this process is given by a smoothing procedure applied to an impulse: 1. one from each subband. The images are generated by Z = P DR and the prior distribution will be given by Z s N 0. 2.4. Forward wavelet transform the impulse. The covariance function for images generated from noise in a single subband is therefore given by the autocovariance of this wavelet.4.
The Gaussian pyramid transform (GPT). 5. 3. The WTransform (WWT). Flexibility in prior model The covariance structure of the prior model is determined partly by the choice of scaling factors and partly by the choice of wavelet.1 proposes ﬁve possibilities for the choice and the following two sections estimate the importance of the factors for each of these choices. A real nondecimated wavelet transform (NDWT) based on the Daubechies ﬁlters of order 8. Adelson et al. A real fully decimated wavelet transform (DWT) based on the Daubechies ﬁlters of order 8. We should choose a wavelet that allows us to generate the covariance structure of a given application. .4. We will consider ﬁve waveletlike systems: 1.4. 2. The dual tree complex wavelet transform (DTCWT). 4. BAYESIAN MODELLING IN THE WAVELET DOMAIN Shift invariance the wavelet generative model is only appropriate for transforms with low shift dependence.116 CHAPTER 7. Section 7. [1] suggested using either the Gaussian or Laplacian pyramid to analyse images. The analysis ﬁlters for the Laplacian pyramid are (short FIR approximations to) the diﬀerences between Gaussians of diﬀerent widths. The GPT is one of the oldest waveletlike transforms. Further discussion more tightly linked to the nature of the application can be found in section 8. To reconstruct an image from a Laplacian pyramid we use Gaussian reconstruction ﬁlters. 7. The analysis ﬁlters for the Gaussian pyramid are Gaussians.7.1 Possible Basis functions We based our discussion of the wavelet generative model on wavelet transforms but the discussion is also applicable for any set of ﬁlter coeﬃcients used in the pyramid structure even if the choices do not belong to a wavelet system.
3) gives a close approximation to Gaussian shape and provides good results for very little computation.7.4.1: Sequence of operations to reconstruct using a Gaussian Pyramid 5tap ﬁlter √ G(z) = z −2 + 3z −1 + 4 + 3z + z 2 /6 2 (7. Choosing G(z) to be a simple Wavelet Coefficients at scale 3 Upsample Rows Wavelet Coefficients at scale 2 Filter Rows with G(z) Upsample Columns Filter Columns with G(z) Upsample Rows Wavelet Coefficients at scale 1 Filter Rows with G(z) Upsample Columns Filter Columns with G(z) Upsample Rows Filter Rows with G(z) Upsample Columns Filter Columns with G(z) Output Surface Figure 7. The analysis lowpass ﬁlter is 1 H0 (z) = √ −z −1 + 3 + 3z − z 2 2 2 . Figure 7. CHOICE OF WAVELET 117 We will be using the pyramid to reconstruct surfaces and it can be implemented in the same way as a normal dyadic wavelet transform by a succession of upsampling operations and ﬁltering operations. The WWT (Wwavelet transform) [67] is a biorthogonal wavelet transform.1 shows the sequence of operations involved in reconstructing a surface from wavelet coeﬃcients at 3 scales.
2 Shift Invariance The wavelet generative model produces a stationary random process if the aliasing is assumed to be negligible. However. The energy will be shift invariant if there is no aliasing during the wavelet transform. Standard wavelet transforms (DWT) repeatedly split the spectrum into two halves and downsample by a factor of two. The lowpass ﬁlter is 1 G0 (z) = √ z −1 + 3 + 3z + z 2 2 2 and the reconstruction highpass ﬁlter is 1 G1 (z) = √ z −1 + 3 − 3z − z −2 2 2 Unlike a standard wavelet transform the wavelets at a particular scale are not orthogonal to each other: the orthogonality is sacriﬁced in order to produce smoother reconstruction wavelets. We shall use the WWT in a manner analogous to the pyramid transform with G(z) = z −1 + 3 + 3z + z 2 . The real wavelets in the DWT have both positive and negative passbands.4.118 CHAPTER 7. Similarly for the generative speciﬁcation there will be no aliasing and hence shift invariance as long as this is true. The ﬁnite length of the ﬁlters means that the bandwidth of each channel will be slightly greater than half the spectrum making these transforms shift dependent. for many choices of wavelet the aliasing will be signiﬁcant. BAYESIAN MODELLING IN THE WAVELET DOMAIN and the analysis highpass ﬁlter is 1 H1 (z) = √ −z −1 + 3 − 3z + z −2 2 2 The reconstruction ﬁlters are also very simple. The NDWT will be shift invariant because it has no subsampling. By discriminating between positive and negative frequencies the DTCWT wavelets only have a single . 7. Each time we subsample the output of a wavelet ﬁlter we halve the Nyquist frequency. It is useful to consider when a transform is shift invariant. The direct speciﬁcation will have a shift invariant prior if the energy within each scale is invariant to translations. For the original signal the Nyquist frequency is half the sampling frequency. For shift invariance we require the bandwidth of each wavelet ﬁlter to be less than the Nyquist frequency for the corresponding subband [63].
We chose the positions and values of six points and then used both methods to approximate 128 regularly spaced values. We repeat the experiment 8 times. The NDWT. and the DTCWT all appear very close to being shift invariant. GPT.0.7. the only diﬀerence between repetitions is that each time the origin is slightly shifted. Figure 7. The actual shape of the approximation is not signiﬁcant as it is highly dependent on the scaling factors chosen. We use a ﬁve scale decomposition for each transform.2.01 for the measurement noise2 . The variances for the diﬀerent scales were (from coarsest to ﬁnest) 4.2.2 shows the estimated values. and the standard DWT has a large amount of shift dependence. The method described in chapter 8 is used to perform the approximation.1. The results for diﬀerent origin positions are stacked above one another.5. The WWT has a small amount of shift dependence.0. 7. CHOICE OF WAVELET 119 passband. We demonstrate the eﬀect of shift invariance with two experiments. The diﬀerent transforms produce diﬀerent approximations because 2 For the NDWT the variance for each scale was reduced by the amount of oversampling in order to produce equivalent results. These precise values are not critical because this experiment is just meant to give a feel for the relative performance. We make use of the approximation method that will be developed in chapter 8 and readers unfamiliar with approximation can safely skip this section.1 and we used a variance of 0.4. The ﬁrst gives a qualitative feel for the eﬀect by using a simple one dimensional example. The GPT and WWT reduce aliasing by decreasing the bandwidth of the lowpass reconstruction ﬁlters at the cost of increasing the bandwidth of the lowpass analysis ﬁlters. These are the qualitative results that we wanted to demonstrate with this experiment.3 One dimensional approximation The purpose of this section is merely to give an illustration of the eﬀect of shift dependence. . The ﬁrst experiment compares approximation methods in one dimension using the diﬀerent transforms. and we have marked the original positions and data values with crosses.4. The second gives a quantitative estimate of the amount of variation in the twodimensional case. This reduces the bandwidth to within the Nyquist limit and hence allows the reduction of aliasing [63].0. As the generative speciﬁcation only uses the reconstruction ﬁlters the increased analysis bandwidth does not matter.
This section describes the results of an experiment to measure the variation in such a smoothed impulse.2: One dimensional approximation results for diﬀerent origin positions.3. BAYESIAN MODELLING IN THE WAVELET DOMAIN Gaussian Pyramid 20 10 0 −10 20 10 0 −10 W Transform 20 40 60 80 100 Dual tree complex wavelet transform 20 40 60 80 Orthogonal real wavelet 100 20 10 0 −10 20 10 0 −10 20 40 60 80 100 Nondecimated real wavelet 20 40 60 80 100 20 10 0 −10 20 40 60 80 100 Figure 7. the wavelet smoothing produces the output z = P D2P T d . Using the same notation as in section 7. the associated covariance structures are diﬀerent.4. 7. This is not an important diﬀerence because we could also make the DTCWT and NDWT results smoother by changing the scalings used.4 described the link between a wavelet smoothed impulse and the covariance function of surfaces produced by the wavelet generative model.3.4. The WWT and the GPT use lowpass ﬁlters with a smaller bandwidth than is usually used for wavelets and therefore the results are smoother. Crosses show location and values of measured data points.4 Twodimensional shift dependence Section 7. The basic idea is simple: shift dependence means that smoothing a translated impulse will not be the same as translating a smoothed impulse.120 CHAPTER 7. We measure the amount of shift dependence by examining the energy of the diﬀerence. The associated random process will only be stationary if the result of smoothing is independent of location.
For a particular translation of the data of x.7. By averaging over all translations we can compute a shift invariant estimate that we call zave K 2K −1 2K −1 2 σk k=1 K x=0 y=0 zave = 1/2 2K S(x. The inverse of this transform is S(x. E(x. y). y)T P Ek P T S(x. Suppose that we have a K level transform and that at level k all the scaling factors for the diﬀerent subbands are equal to σk . of the error between the wavelet smoothed image and the shift invariant estimate as K 2 2 σk S(x. CHOICE OF WAVELET 121 where d represents the input image (0 everywhere apart from a single 1 in the centre of the image).4) The output of the wavelet smoothing is z = P D2P T d K = k=1 2 σk P Ek P T d Now deﬁne S(x. The amount of smoothing is determined by the diagonal entries of the matrix D. y) to be a matrix that performs a translation to the data of x pixels horizontally and y pixels vertically. y pixels we deﬁne the energy.4. y)d = k=1 2 σk zk where zk is the average result of reconstructing the data from just the scale k coeﬃcients. 2K −1 2K −1 zk = 1/2 2K x=0 y=0 S(x. This will give approximately circular priors (the quality of the approximation is demonstrated in the next section). y)T P Ek P T S(x. y)d. y)T P Ek P T S(x. y)d k=1 E(x. This allows us to decompose D as K D= k=1 Ek σk (7. y) = − zave . y)T (assuming periodic extension at the edges). Deﬁne diagonal matrices Ek whose entries are (Ek )ii = 1 if the ith wavelet coeﬃcient belongs to a subband at level k and zero otherwise.
1 K=4 6.7 K=2 6. The results of this experiment for the diﬀerent transforms are shown in table 7. y) to be be the error at scale k due to shift invariance. Transform DWT NDWT WWT DTCWT GPT K=1 6. y)d − zk T T 2 ≈ k=1 4 σk S(x.0 35.4 29. Measure the amount of shift dependence f = Eave / zave 2 .8 ∞ 18.8 ∞ 17. BAYESIAN MODELLING IN THE WAVELET DOMAIN K 2 2 σk = k=1 K S(x.5 32. It may seem strange to have the fourth power of σk . y)d − zk we can write the energy Eave of the error averaged over all translations as K 2K −1 2K −1 4 σk 1/22K k=1 x=0 y=0 Eave ≈ ek (x. . Evaluate zK . 3. 2.7 K=3 6.4 32. y)T P Ek P T S(x. ek (x.122 CHAPTER 7. zave . y)T P Ek P T S(x. Set σk = 0 for k = K and σK = 1.8 ∞ 13.8 ∞ 18. and Eave using the above equations. To give a quantitative estimate of the importance of shift dependence for diﬀerent priors we carry out the following procedure for K varying between 1 and 4: 1.3: Shift dependence for diﬀerent scales/dB. The error energy depends on the parameters σk and will tend to be dominated by the level k with the largest σk . This is a consequence of weighting 2 by σk during the smoothing step. y) = S(x. The results are converted to signal to noise ratios given by −10 log10 (f ).6 ∞ 26. If we deﬁne ek (x.7 32.9 35. y) P Ek P S(x. Diﬀerent applications will have diﬀerent priors. y)d − zk where in the last step we have assumed that the errors from each scale will be approximately uncorrelated.3.6 The NDWT has a Figure 7. y) 2.
However. However. CHOICE OF WAVELET 123 SNR of ∞ because this transform has no downsampling and is shift invariant. the ﬁnal solution to a problem is based on the posterior density and the posterior is a combination of the likelihood and the prior. 7dB corresponds to an shift dependence error energy of about 20% of the signal energy. the WWT only manages about 18dB while the DWT has a very poor performance with 7dB.4.7.) . none of the other methods can produce priors that favour images containing correlations at angles near 45◦ without also favouring correlations at angles near −45◦ .4 the covariance is calculated by a wavelet smoothing method applied to an impulse. Each choice of scalings for the subbands implicitly deﬁnes the signal model as a stationary process with a certain covariance function.4. The measurements describe the degree to which the wavelet generative model produces a stationary prior. For example. some directions are allowed more variation than others) then we alter the model so that we can separately vary the scaling factors for each subband.2 which explains the signiﬁcance of these measurements for a particular application (of interpolation). 7.7. The increased directionality of the DTCWT means that it is much more ﬂexible than any of the other methods for modelling anisotropic images.4. Generate a blank image of size 64 × 64. Similarly the multiple trees mean that there is eﬀectively no downsampling in the ﬁrst level of the DTCWT and it also has inﬁnite SNR for K = 1. An quantitative example of the importance of this eﬀect is given in section 8. In some circumstances the information in the likelihood can counteract the deﬁciencies in the prior to produce a good quality posterior. Care must be taken when interpreting the SNR values tabulated. Both the higher scales of the DTCWT and the GPT have very low amounts of shift dependence with SNR levels around 30dB. However. (Here we use blank to mean every pixel value is 0. For each wavelet transform the following process is used: 1. in many applications it will be reasonable to assume that the prior for the images is isotropic and so one way of testing the ﬂexibility is to measure how close the covariance function is to being circularly symmetric.5 Flexibility If a prior is required to be anisotropic (i. As in section 7.e.
. 2 5. Scale the low pass coeﬃcients by σ5 = 49 .6.) The results are shown in ﬁgures 7. Wavelet transform the image using 4 levels. Set the pixel at position (32.8. 3. The DWT has a signiﬁcantly noncircular covariance function. 32) to have value 1.5.4. 40 35 60 30 25 20 15 10 5 0 −5 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 30 20 10 50 40 Figure 7. DTCWT. The ﬁnal image produced is proportional to the covariance function. The W transform. and 7. The Gaussian pyramid produces the most circularly symmetric covariance. The most important part of these diagrams is the section near the centre.7. The exact values used for the scaling factors in this experiment are not crucial and are just chosen to give results large enough for the symmetry to be seen.7.4: Covariance structure for an orthogonal real wavelet.7.124 CHAPTER 7. (The Gaussian pyramid and W transform methods have smoother lowpass ﬁlters and we change the scaling factors slightly in order to give a similar shaped covariance. Invert the wavelet transform. Scale the wavelet coeﬃcients at level l by σl2 = 42l . For large distances the contours are not circular but at such points the correlation is weak and hence not as important. BAYESIAN MODELLING IN THE WAVELET DOMAIN 2. 6. and the NDWT all produce reasonable approximations to circular symmetry. 4.7.
CHOICE OF WAVELET 125 35 30 25 50 20 15 10 5 0 10 −5 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 40 30 20 60 Figure 7.5: Covariance structure for a nondecimated real wavelet.4. .6: Covariance structure for the Gaussian pyramid.7. 35 30 25 20 15 30 10 20 5 10 0 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 60 50 40 Figure 7.
7: Covariance structure for the W transform. 35 30 25 50 20 15 10 5 0 10 −5 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 40 30 20 60 Figure 7.126 CHAPTER 7. . BAYESIAN MODELLING IN THE WAVELET DOMAIN 50 60 50 30 40 20 30 20 10 0 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 40 10 Figure 7.8: Covariance structure for the DTCWT .
A indicates good behaviour with respect to the property. we conclude that each of the four image models . 28). and a ? indicates intermediate behaviour. It is possible to improve the circularity of the wavelet transform results by adjusting the scaling factors for the ±45◦ subbands. these changes will do nothing to alleviate the problems of shift dependence found for the DWT.5. 7.4. CONCLUSIONS 127 Figure 7.9 shows the same experiment (still using the DWT) except that we change step 2 to act on the pixel at position (28. The covariance changes to a diﬀerent (noncircular) 25 20 15 10 5 0 10 −5 80 60 40 40 20 0 0 20 60 80 10 20 30 40 50 60 60 50 40 30 20 Figure 7.6 Summary of results Table 7.10 summarises the ﬂexibility and shift dependence properties of the diﬀerent trans√ forms. a × indicates bad behaviour. However.9: Covariance structure for a translated orthogonal real wavelet. Based on this assumption. These subbands should be treated diﬀerently because their frequency responses have centres (in 2D frequency space) further from the origin than the centres of the other subbands at the same scale. shape.5 Conclusions The ﬁrst part of the chapter is based on the assumption that the chosen wavelet transform is shift invariant.7. 7.
and GPT all possess reasonably isotropic covariance functions even without tuning the scaling for the ±45◦ subbands.10: Summary of properties for diﬀerent transforms discussed are equivalent to a wide sense stationary discrete Gaussian random process. WWT. The experiments in 1D and 2D suggest that these errors are relatively small for the DTCWT but large for the DWT. • The wavelet direct speciﬁcation corresponds to a covariance function that transforms to an impulse when a wavelet sharpening operation is applied. For a shift dependent transform the wavelet generative prior model will be corrupted by aliasing. The NDWT. BAYESIAN MODELLING IN THE WAVELET DOMAIN Transform DWT NDWT WWT DTCWT GPT Shift invariant × √ ? √ √ Isotropic modelling × √ √ √ √ Anisotropic modelling × × × √ × Figure 7. DTCWT. In particular we conclude that: • The Filter model corresponds to a process with covariance function given by the autocovariance function of the ﬁlter impulse response. • The wavelet generative speciﬁcation of the prior corresponds to a process with covariance function given by a wavelet smoothed impulse.128 CHAPTER 7. .
1 Summary The purpose of this chapter is to explore the use of the DTCWT for Bayesian approximation and interpolation in order to illustrate the kind of theoretical results that can be obtained. and the method for trading speed and accuracy. and one that allows eﬃcient Bayesian sampling of approximated surfaces from the posterior distribution. the Bayesian interpretations of spline processing and minimum smoothness norm solutions. This framework reveals the implicit assumptions of the diﬀerent methods. Finally we describe two reﬁnements to the method. We originally developed these methods for the determination of subsurface structure from a combination of seismic recordings and well logs. We assume that a simple stationary process is an adequate prior model for the data but observations are only available for a small number of positions. the theoretical estimates for aesthetic and statistical quality. the proposed wavelet approximation method. the experimental measures of these qualities.Chapter 8 Interpolation and Approximation 8. 129 . one that increases speed at the cost of accuracy. We propose an eﬃcient wavelet approximation scheme and discuss the eﬀect of shift dependence on the results. After a brief description of the problem area we place a number of diﬀerent interpolation and approximation techniques into the Bayesian framework. Further details about the solution of this problem and the performance of the wavelet method can be found in [35]. the method for fast conditional simulation. The main original contributions are.
2) R S be a vector of random variables . The assumption that the process is stationary means that B can be expressed in terms of a covariance function R as Bab = R (xa − xb ) Suppose we have S observations at locations xs(1) . The prior distribution is Z s N (0.g. INTERPOLATION AND APPROXIMATION 8. B) where B is a N × N covariance matrix and. Let Q ∈ representing the measurement noise: Q s N 0. xs(S) . .3) (8. In this chapter we assume that the image is a realisation of a 2D (wide sense) stationary discrete Gaussian random process. we do not assume x1 must be next to x2 ) and so this reordering does not reduce the generality of the analysis. . Section 8. . . The approximation is called an interpolation in the special case when the estimated image is constrained to precisely honour the sample values. σ 2 IS where σ 2 is the variance of the measurement noise. In other words. .9 discusses the implications of the assumptions in this model. This is an example of an approximation problem. the matrix T selects out the values corresponding to the observed locations. xS . . we assume that the image is shifted to have zero mean. The observations are given by Y = TZ + Q (8. . we assume we have observations at the locations x1 . Denote the S observations by Y ∈ R S and deﬁne a S by N matrix T as Tab = 1 a = b and a ≤ S (8. We also assume that the observations are all at distinct locations within the grid. Using the same conventions as in chapter 7 we use Z to represent the (unknown) contents of the image. There is no restriction on the relative positions (e.2 Introduction The task is to estimate the contents of an image from just a few noisy point samples. .1) 0 otherwise When applied to a vector representing an image. as before.130 CHAPTER 8. It is notationally convenient to reorder the locations so that s(a) = a.
Radial Basis Functions [97].8. Let C be the S by S leading submatrix of the covariance matrix B that expresses the correlations between the observation locations. and Wiener ﬁltering. This chapter describes a wavelet based Bayesian method for (approximately) solving the stationary approximation problem and shows how a number of the alternative techniques are solutions to particular cases of the problem. Strictly speaking our methods should be described as empirical Bayes because the prior is based on estimated values. We will deﬁne the basic problem (with known covariance) to be “stationary approximation” (or “stationary interpolation” when σ = 0) but we will usually shorten this to simply “approximation” (or “interpolation”). 8.3. The ﬁrst part of this chapter discusses the alternative techniques from a Bayesian perspective. Let D ∈ R S be the vector of . This problem has been extensively studied and many possible interpolation methods have been proposed.3 Posterior distribution Suppose we wish to obtain a point estimate for the random variable Zk corresponding to location xk (we assume that there is no available observation at this location). POSTERIOR DISTRIBUTION 131 In this chapter we will assume that both the covariance structure of the process and the variance σ 2 of the noise added to the samples are known. and inverse distance that work reasonably when the surfaces are smooth and there is little noise but are inappropriate otherwise. Appendix B proves that the posterior distribution for such a point given observations Y = y is Gaussian and gives an expression for the mean. A completely Bayesian approach would involve treating the parameters of the model as random variables and setting priors for their distributions. Splines [119].3 describes the form of the posterior distribution for the problem. In practical applications it is usually possible to estimate these from the sample values [110]. A description of a fully Bayesian approach to the problem can be found in the literature [12]. As a ﬁrst step towards relating the techniques section 8. A reasonable estimate is the mean of the posterior distribution. this introduces further complications during inference that would distract from the main aim of evaluating complex wavelets. The second part describes the wavelet method and experimental results. There are several crude methods such as nearest neighbour. linear triangulation. However. There are also more advanced methods such as Kriging [13].
4 8. . Da = E Zs(a) Zk = Bs(a). . λS and whose other elements are all zero. Λ represents an image that is blank except at the observation locations. 8.k = R(xs(a) − xk ) = R(xa − xk ) ˆ Appendix B shows that the estimated value Zk is given by ˆ Zk = E {Zk y} = DT σ 2 IS + C If we deﬁne a vector λ ∈ R S as λ = σ 2 IS + C then we can express the estimate as ˆ Zk = DT λ S −1 −1 y (8. . We express the estimate in this form because λ (and hence Λ) does not depend on the location being estimated and therefore point estimates for every location are simultaneously generated by the ﬁltering of Λ.132 CHAPTER 8. considers an estimator Kk for . known as Simple Kriging. . INTERPOLATION AND APPROXIMATION covariances between the observation locations and location xk . Its basic form.4.4) y = a=1 N R(xa − xk )λa R(xa − xk )Λa a=1 = where Λ ∈ R N is a vector whose ﬁrst S elements are given by λ1 . The equation for the estimate can be interpreted as ﬁltering the image Λ with the ﬁlter h(x) = R(−x) and then extracting the value at location xk .1 Approximation techniques Kriging Kriging is a collection of general purpose approximation techniques for irregularly sampled data points [13].
Now consider the approximation problem again. As before we suppose that the data has been preprocessed so that the mean is zero. . The technique is based on the assumption that the mean and covariance structure of the data is known. there is no assumption that the data is necessarily distributed according to a multivariate Gaussian. However. In particular. this is all that is assumed about the prior distribution of the data. . w is chosen to achieve the minimum expected energy of the error between the estimate and the true value. The covariance assumption means that we know E {Zk Ya } and E {Ya Yb } for a. .4.8. However. More precisely. . S}. APPROXIMATION TECHNIQUES 133 the random variable Zk that is a linear combination of the observed data values: Kk = w T Y where w is a S × 1 vector containing the coeﬃcients of the linear combination associated with position xk . We can calculate E {Zk Ya } = E {Zk (Za + Qa )} = E {Zk Za } + E {Zk } E {Qa } = E {Zk Za } = Da S (8. The expected energy of the error F is given by: F = E (Kk − Zk )2 S S S = E a=1 S S wa Y a b=1 wb Y b − 2E a=1 S wa Y a Zk + E {Zk Zk } = a=1 b=1 wa E {Ya Yb } wb − 2 a=1 wa E {Ya Zk } + E {Zk Zk } F is minimised by setting ∇w F = 0 ∂F =2 E {Ya Yb} wb − 2E {Ya Zk } = 0 ∂wa b=1 This gives a set of S linear equations that can be inverted to solve for w. It is impossible to calculate the posterior distribution because the precise prior distribution is unknown. there is suﬃcient information to calculate the estimator with the nicest properties among the resticted choice of purely linear estimators. b ∈ {1.5) .
5 in matrix form as 2 C + σ 2 IS w − 2D = 0 and hence deduce that the solution is w = C + σ 2 IS −1 D The estimator corresponding to this minimising parameters is Kk = DT C + σ 2 IS −1 y This estimator is exactly the same as the Bayesian estimate based on a multivariate Gaussian distribution. in noiseless conditions (i.2 Radial Basis Functions Recall that the Bayesian solution can be implemented by placing weighted impulses (in an otherwise blank image) at the sample locations and then ﬁltering this image with a ﬁlter whose impulse response is given by the covariance function.134 CHAPTER 8. for interpolation) the S weights take precisely the values needed to honour the S known data values (for simplicity we ignore the possibility of these equations being degenerate). Additionally. An interpolated image based on RBFs is assumed to be a linear combination of S functions where the functions . If a = b then similarly E {Ya Yb } = E {(Za + Qa ) (Zb + Qb )} = E {Za Zb } = Ca. The link with Radial Basis Functions (RBFs) is straightforward.e. We have shown the wellknown [4] result that if the random process is a multivariate Gaussian then the simple Kriging estimate is equal to the mean of the posterior distribution. INTERPOLATION AND APPROXIMATION where we have used the fact that Zk and the measurement noise Qa are independent and that the noise has zero mean. 8.b while if a = b E {Ya Yb } = Ca.b + σ 2 Using these results we can rewrite equation 8.4.
8. APPROXIMATION TECHNIQUES 135 are all of the same shape and centered on the S known data points [97].6 can be rewritten as 1 ˆ Z = lim lim argminZ∈RN ZT Z + 2 α→0 σ→0 σ 1 T = lim lim argminZ∈RN Z Z + 2 α→0 σ→0 σ 1 T = lim lim argminZ∈RN Z Z + 2 α→0 σ→0 σ 1 = lim lim argminZ∈RN 1 + 2 α→0 σ→0 α 1 (IN − D) F Z 2 2 α 1 2 T Z − y + 2 ZH F H (IN − D) (IN − D) F Z α 1 1 2 T Z − y + 2 F Z 2 − 2 DF Z 2 α α 1 1 ZT Z + 2 T Z − y 2 − 2 DF Z 2 σ α TZ − y 2 + where we have made use of the identity 2D − D 2 = D 2 . Now consider expanding the following expression (a(IN − D) + D) −1 2 FZ 2 = 1 (IN − D) + D F Z a .4. Let Z denote the estimate produced by this bandlimited interpolation. The weights in the linear combination are chosen to honour the known values. As before let F be a N by N matrix that represents the (2 dimensional) Fourier transform.3 Bandlimited interpolation Another approach is to assume that the image is bandlimited (only contains low frequencies) and then calculate the bandlimited image of minimum energy that goes through the data points [37]. Ω = {Z : T Z = y.4.6) where Ω is the space of images that are both band limited and honour the known observations. Deﬁne D to be a N by N diagonal matrix whose ath diagonal entry Daa is 1 if the ˆ corresponding frequency is within the allowed band. but zero otherwise. In practice exactly the same equations are used to solve RBF and Kriging problems and the equivalence between these techniques is wellknown. 8. Assuming that the limits are well behaved then equation 8. Using this notation we can write: ˆ Z = argminZ∈Ω ZT Z (8. (IN − D) F Z = 0} In order to show the equivalence it is convenient to introduce two additional variables α and σ that represent the degree to which the constraints are imposed.
for a Gaussian density function the MAP estimate is equal to the posterior mean estimate.136 CHAPTER 8.α = argminZ∈RN 2 T Z − y σ 2 −1 2 + α √ (IN − D) + D 1 + α2 FZ is equal to the MAP (Maximum A Posteriori) estimate using the Fourier model.3.3. Section 7.4 Minimum smoothness norm interpolation Choi and Baraniuk [23] have proposed a waveletbased algorithm that ﬁnds the signal that goes through the data points with minimum norm in Besov spaces. INTERPOLATION AND APPROXIMATION 1 (IN − D) F Z 2 + DF Z 2 a2 1 = 2 ZH F H (IN − D) (IN − D) F Z + DF Z a 1 1 = 2 ZT Z + 1 − 2 DF Z 2 a a 1 1 = 1 + 2 ZT Z − 2 DF Z 2 α α = √ where a = α/ 1 + α2 . Additionally. 8. the prior parameters for the Fourier model tend to Dα = D. which in turn is equivalent to the multivariate Gaussian model.2 with a coeﬃcient weighting matrix Dα = a (IN − D) + D. We conclude that the estimate produced by the bandlimited interpolation is equivalent to interpolation for a particular Fourier model prior. If we deﬁne the prior pdf for Z with this Fourier model and assume that we have white measurement noise of variance σ 2 then Bayes’ theorem can be used to show that: −2 log (p(Zy)) + k(y) = 1 TZ − y σ2 2 + Dα F Z 2 where k(y) is a function of y corresponding to a normalisation constant.4. 2 Finally consider the Fourier model from section 7.α becomes the interpolation solution.2 shows that this is equivalent to the multivariate Gaussian with a covariance function given by a lowpass ﬁltered impulse (which will be oscillatory due to the rectangular frequency response). They write that . In the limit σ → 0 the ˆ measurement noise is reduced to zero and Zσ. in the limit as α → 0. Finally. The previous algebra proves that the RHS of this equation is equal to the expression within the earlier minimisation and we conclude that the estimate 1 ˆ Zσ.
It is necessary in order for the wavelet coeﬃcients of Z to match the wavelet coeﬃcients of f (t).8.8) Let Z be a vector of signal samples from the (preﬁltered) continuoustime signal f (t). uj0 . p. 1] is 1/q (8. Preﬁltering is used when converting from continuoustime to discretetime. The scale j0 represents the coarsest scale under consideration.k p = I f (t)p dt.k is the value of the k th scaling coeﬃcient. q are hyperparameters of the norm. wj. The Lp (I) space is the set of all functions on I with bounded norm f 2. We do not consider preﬁltering in this dissertation because we assume that data will always be 1 There are a number of diﬀerent treatments of the scaling coeﬃcients in Besov norm deﬁnitions.4. f α W2 (L2 (I)) = uj0.k is the value of the k th wavelet coeﬃcient at scale j. t ∈ I = [0.k 2 2 + j≥j0 . 5. We choose the given deﬁnition as being the most natural. APPROXIMATION TECHNIQUES 137 “the interpolated signal obtained by minimumsmoothness norm interpolation is diﬃcult to characterize. . This section brieﬂy describes their algorithm and suggests a characterisation of the interpolated signal as the sum of the posterior mean estimate for stationary interpolation (as described in section 8. 4.k  αj 2 (8. We give the deﬁnitions of Besov and Sobolev norms ﬁrst in the notation of the paper [23] and then rewrite the deﬁnitions in the notation of this dissertation. α. The paper concentrates on the special case of p = q = 2. In the original notation1 the Besov norm f deﬁned as f where 1. In practical algorithms the choice is not important because the scaling coeﬃcients are generally preserved.2) and an error term caused by shift dependence. 3.k + j≥j0 k 2αjp 2j(p−2) wj. even if the noise in the signal samples is white Gaussian”.k 2 wj.7) q/p q p = uj0 . In this case the Besov norm is called the Sobolev norm and is written 1/2 p p α Bq (LP (I)) α Bq (LP (I)) for a continuoustime signal f (t).
9) Although we have deﬁned the Sobolev norm in terms of the one dimensional transform. Later we display experiments comparing the performance of the DWT with alternative transforms to show the considerable eﬀect of shift dependence.3. 23]. Also recall from section 7.3 showed that this is equivalent to a stationary Gaussian discrete random process assuming that the wavelet transform is suﬃciently shift invariant. Further details can be found in the literature [113. the same equation describes the norm for two dimensional wavelet transforms if we use the earlier notation for which Z is a vector representing an entire image. It may be thought that this is unfair.3. Armed with this notation the Sobolev norm can be expressed as f α W2 (L2 (I)) = DW Z (8. The algorithm [23] found (using a least squares calculation) the wavelet coeﬃcients with minimum Sobolev norm that interpolated the known points. INTERPOLATION AND APPROXIMATION provided in sampled form. We conclude that the minimum smoothness norm interpolation is equivalent to solving the stationary interpolation problem (with covariance function given by an inverse wavelet sharpened impulse) with the quality of the solution determined by the amount of shift dependence. and W represents a twodimensional transform. Recall that the wavelet direct speciﬁcation deﬁned the prior as p(Z = z) ∝ exp − 1 DW z 2 2 The minimum smoothness norm solution is therefore equivalent to selecting the highest probability image that honours the observations.138 CHAPTER 8. that MSN should really be considered as performing nonGaussian interpolation and that what we have called the “error” due to shift dependence . As before we deﬁne the wavelet coeﬃcients (from a one dimensional wavelet transform) to be given by w = W Z. We now deﬁne a diagonal matrix D to have diagonal entries Daa = 1 if wa is a scaling coeﬃcient and Daa = 2αk if wa is a scale k wavelet coeﬃcient. We have described the minimum smoothness norm (MSN) solution as a Bayesian solution to stationary interpolation plus an error caused by shift dependence. The published paper made use of a fully decimated wavelet transform. We conclude that the solution is equal to the MAP estimate using the wavelet direct speciﬁcation to generate the prior. Section 7.3 that for an orthogonal transform the covariance function can also be expressed in terms of a wavelet smoothed impulse.
This last statement may need a little further support as it could be argued that the average always gives smooth answers while MSN will be able to model discontinuities better.4. In this context we measure the quality of a solution by means of the energy of the error.8. we show that when all the origin positions are considered the average solution will always be a better estimate than using the basic MSN solutions. The average solution Z0 is deﬁned as 1 ˆ Z0 = NO NO ˆ Zi i=1 ˆ Then it is required to prove that the energy of the error for the average solution Z − Z0 2 ˆ is always less than the average energy for the individual solutions 1/NO NO Z − Zi 2 . We ﬁnish this section by proving that the accusation will never hold. Therefore the solution provided by this method should be considered as the average over all positions of the origin. APPROXIMATION TECHNIQUES 139 is actually an additional term that makes the technique superior to standard methods. Our defence to this criticism is that there is no prior information about the absolute location of signal features and shifting the origin location should not aﬀect the output. i=1 The error for the individual solutions can be written as 1 NO NO ˆ Z − Zi i=1 2 = 2 1 NO = 1 NO NO ˆ ˆ ˆ Z − Z0 + Z0 − Zi i=1 NO ˆ Z − Z0 i=1 2 2 ˆ ˆ + Z0 − Zi ˆ ˆ Z0 − Zi 2 2 ˆ + 2 Z − Z0 T ˆ ˆ Z0 − Zi T NO = ˆ Z − Z0 ˆ Z − Z0 ˆ Z − Z0 1 + NO + 1 NO NO i=1 NO 2 ˆ Z − Z0 + NO ˆ ˆ Z0 − Zi i=1 = ≥ 2 ˆ ˆ Z0 − Zi i=1 2 2 . Let Z represent the true values of the signal (or image – this ˆ proof is valid for both signals and images) and let Zi represent the MSN estimate for the ˆ ith origin position (out of a total of NO possible positions). plus an error term due to the particular choice of origin position used in the algorithm. More precisely. The proof is straightforward.
6 Comparison with Spline methods This section discusses the link with Bspline methods. If their method takes K iterations of the conjugate gradient algorithm to converge. [88] have proposed a method for dealing with nonstationarity by using the W transform basis [67]. INTERPOLATION AND APPROXIMATION where the inequality in the last line is strict unless the transform is shift invariant. Equation 8. Bsplines have been proposed for solving both interpolation and approximation problems.4 shows that the 2 solution involves inverting the matrix C + σM IS .1 which requires a Krigingstyle interpolation to be performed for each realisation. and this variation produces nonstationary surfaces. The result is equally valid for good and bad models. It does not claim that the average solution will be a good solution. 8. but it does show that it will always be better than the shift dependent solutions. especially if some preconditioning methods are used. Note that this proof is very general.4. Such an algorithm only uses forward multiplication by C and so can be much more eﬃcient than inverting C. Nychka makes use of this result by solving using a conjugate gradient algorithm.3.5 Large spatial prediction for nonstationary random ﬁelds Nychka et al. Nychka allows the weighting factors to vary within a single scale.4) and so multiplication by C can be eﬃciently calculated using wavelet transform techniques. If C is a square matrix of width S then in the worst case the gradient algorithm takes S steps to converge to the solution. To generate conditional simulations of a surface they use the method described in section 8. then to generate P realisations they will require 2KP wavelet transforms. We have therefore shown that the energy of the error will always be greater (when averaged over all origin positions) if the MSN solution is used rather than the smoothed solution. but usually the convergence is much faster than this. the matrix C can be written as P D 2 P T (using the notation of section 7.8. This matrix can be very large and so is hard to invert. The main source for the description of splines is [119] while the Bayesian interpretation is original. . 8. However.140 CHAPTER 8.4. We ﬁrst give an overview of the technique and then discuss the methods from a Bayesian perspective. in particular note that no assumption had to be made about the true prior distribution of the data.
For interpolation the problem is to choose the spline coeﬃcents so that the reconstructed signal passes through the data points. and we attempt to describe the prior model for the signal that would produce the same estimates. A zero order spline will therefore be the square pulse and a ﬁrst order spline will be a triangular pulse. From a signal processing point of view Bsplines can be produced by repeatedly ﬁltering a centred normalized rectangular pulse of width d with itself. The ﬁrst is called smoothing splines approximation and involves minimising the energy of the error in the approximation plus an additional energy term. This combined ﬁlter is called a cardinal spline (or sometimes the fundamental spline) of order n and converges to a sinc function that eﬀectively performs bandpass ﬁltering of the signal to remove aliased components of the signal. Higher order splines converge to a Gaussian “bell” shape. These coeﬃcents can be calculated by applying a simple IIR ﬁlter to the data. and then solving for the least energy of the error. APPROXIMATION TECHNIQUES 141 Bspline A Bspline is a continuous piecewise polynomial function. For the uniform sampling case the width d is chosen to be the distance between data points and the height so that the spline has total area equal to 1.8. two for approximation) main techniques from a Bayesian perspective. If the coeﬃcients are represented as delta functions (of area equal to the value of the coeﬃcients) at the appropriate locations it is possible to construct the interpolation by ﬁltering with the Bspline function. For high order splines this combination of the IIR ﬁlter with the Bspline ﬁltering can be viewed as a single ﬁltering operation applied to the original data points (also represented as impulses). The Bsplines can be used for either interpolation or approximation. a Bspline of order n can be generated by convolving this rectangular pulse with itself n times. There are two main techniques for approximation.4. . This second energy term is the energy of the r th derivative of the approximation. Each technique produces an estimate for the true signal. More precisely. We discuss each of the three (one for interpolation. The second technique is a least squares approximation and is derived by restricting the number of spline coeﬃcients that are to be used to generate the approximation.
However. Least squares Least squares techniques are equivalent to the Bayesian maximum a posteriori (MAP) estimate when we assume that there is a ﬂat prior for each parameter. it is inappropriate at long distances.3 is clear in that the solution is produced by ﬁltering impulses at the data points with the weights chosen by the requirement of exactly ﬁtting the data. For the least . Smoothing splines Given a set of discrete signal values {g(k)}. while the analogy is reasonable when close to the sample points. Therefore. By analogy with the interpolation case it is tempting to think that smoothing splines will correspond to a random process prior with covariance function equal to a 2r − 1 Bspline and measurement noise depending on λ. This solution will therefore converge to the bandlimited signal and hence the cardinal splines will tend to the sinc interpolator. INTERPOLATION AND APPROXIMATION Interpolation The interpolation solution of order n consists of a spline with knot points at the data points. The similarity to the Bayesian estimate described in section 8. the smoothing spline estimate at long distances will tend to inﬁnity. The Bayesian interpretation is that the prior for the signal is a zero mean wide sense stationary discrete Gaussian random process with covariance function equal to the Bspline function of order n. The problem is that the integral is zero for polynomials of degree less than r and hence there is no prior information about the likely low order shape of the signal. the smoothing spline g (x) of order 2r − 1 is ˆ deﬁned as the function that minimizes +∞ 2 S +∞ −∞ = k=−∞ (g(k) − g (k))2 + λ ˆ ∂ r g (x) ˆ ∂xr 2 dx (8. Schoenberg has proved the result that the minimising function (even for the general case of nonuniform sampling) is a spline of order n = 2r − 1 with simple knots at the data points[105]. except for very careful choices of the data values. Therefore for high orders the high frequencies become less and less likely a priori and the solution will use the lowest frequencies possible that satisfy the data points. Bspline ﬁltering of order n is given by smoothing with a unit pulse n + 1 times.10) where λ is a given positive parameter.142 CHAPTER 8.
If the prior is shift invariant then the model must also include the cases of nonzero coeﬃcients centered on any location.4. If the following is confusing then it can be safely ignored. APPROXIMATION TECHNIQUES 143 squares spline approach we can also roughly interpret the restricted choice of coeﬃcients as indicating that we know a priori that the original image should be smooth and contain only low frequencies.8. if we are allowed to use all N Bspline coeﬃcients then our previous claims show that we can make any image we want. There is an interesting way of seeing that such an estimate cannot be shift invariant. The consequence of the linear independence of Bsplines is that we must be able to model any image if we can choose the values of all N Bspline coeﬃcients. In particular. this “end” Bspline is nonzero at location k. . 2. a Bspline at the end of the set will contain at least one location k such that 1. This contradiction proves that the Bsplines are linearly independent. not all coeﬃcients equal to zero) linear combination that is equal to zero at all locations. First note that the Bsplines are linearly independent. Clearly the coeﬃcient of the “end” Bspline must be zero to avoid having a nonzero value at location k and hence we can construct a smaller set by excluding the “end” Bspline. The least squares approach can be thought of as calculating a MAP estimate based on this prior and the observation model of additive white Gaussian noise. Now suppose we have the smallest nonempty set of Bsplines that possesses a nontrivial (i. Next suppose that we have a discrete grid containing N locations. The explanation is somewhat convoluted and not needed for the rest of this disseratation. note that the model includes the case of an image generated from a single nonzero spline coeﬃcient. However. In other words. The least squares approach models the data using a set of K spline coeﬃcients where K is less than the number of observations. The least squares spline approach is an approximation method and hence we conclude that it must be shift dependent. all the other Bsplines are zero at location k. including an image that interpolates all the observations. This is clear because in any set of Bsplines we can always ﬁnd an “end” Bspline whose support is not covered by the rest of the splines. We have argued that a shift invariant least squares method must interpolate the observations.e.
a rigorous treatment would need to consider edge eﬀects).3. . y2 . We can now use Bayes’ theorem p(wy) = p(yw)p(w) p(y) ∝ p(yw)p(w) The likelihood p(yw) is the pdf that the measurement errors are y − T P w. Instead of modelling the values at every point on the surface.144 CHAPTER 8. Recall that the wavelet generative speciﬁcation uses the prior Z s N 0. Suppose we have measurements y1 . yS which we stack into a column vector y and that the measurement noise is independent and Gaussian of variance σ 2 and mean zero. D 2 where w is a column vector containing all the wavelet coeﬃcients (with the real and imaginary parts treated as separate real coeﬃcients). Now we wish to derive the posterior distribution for the wavelet coeﬃcients. Let T be a matrix of ones and zeros that extracts the values at the S measurement locations. and so we can write the likelihood as p(yw) ∝ exp − 1 (y − T P w)T (y − T P w) 2 2σ . This section derives the posterior distribution for the images using Bayes’ theorem. with the surface indirectly deﬁned as the reconstruction from these wavelet coeﬃcients. it is better to model the wavelet coeﬃcients directly. P D 2P T where P represents the wavelet reconstruction transform and D a diagonal weighting matrix. . discuss the choice of wavelet. The following sections will describe an eﬃcient solution. INTERPOLATION AND APPROXIMATION This argument is included for interest only and is not meant to be a rigorous mathematical argument (for example.4). and show results of some numerical experiments that test our predictions. In wavelet space the wavelet generative speciﬁcation corresponds to the prior w s N 0. . 8.5 Wavelet posterior distribution We now change track and describe an approximation scheme based on the wavelet generative model for images (see 7. .
3. Calculate the responses at the measurement locations to impulses in the wavelet coeﬃcients (matrix T P ). Calculate which wavelet coeﬃcients are important.8. Reconstruct an estimate for the entire image. METHOD FOR WAVELET APPROXIMATION/INTERPOLATION 145 The prior for the wavelet coeﬃcients is a multivariate Gaussian distribution of mean zero and variance D 2 and so the prior pdf can be written as 1 p(w) ∝ exp − wT D −2 w 2 We can then calculate the posterior and use lemma 3 of appendix B to simplify the equations p(wy) ∝ exp − 1 1 (y − T P w)T (y − T P w) exp − wT D −2 w 2 2σ 2 1 ∝ exp − wT D −2 + P T T T T P/σ 2 w + wT P T T T y/σ 2 2 1 ∝ exp − (w − a)T A(w − a) 2 where A = D −2 + P T T T T P/σ 2 a = A−1 P T T T y/σ 2 (8.12) and so we have shown that the posterior distribution for the wavelet coeﬃcients is a multivariate Gaussian with mean a and variance A−1 . Solve for the posterior mean estimates of the wavelet coeﬃcients.6. 2. 4. . 8. Estimate the amount of energy we expect within each scale. The method uses the following ﬁve steps: 1. The following sections describe how each of these steps can be performed eﬃciently.6 Method for wavelet approximation/interpolation This section describes the wavelet method for estimating an image given a set of data points and estimates of the measurement noise and the covariance structure of the image.11) (8. 5.
The choice will depend on the prior information we have available and will therefore depend on the application.8. One very crude method of choosing D would be to generate images according to the wavelet generative model for several choices of D. We can greatly reduce the dimension of the problem by leaving out all such unimportant wavelet coeﬃcients. This threshold is initially 0 but section 8. INTERPOLATION AND APPROXIMATION 8.2 Important wavelet coeﬃcients It is clear that if the support of a wavelet coeﬃcient does not overlap with any of the data points then the wavelet coeﬃcient does not aﬀect the likelihood of the measured data and so it will have a posterior distribution equal to its prior distribution. This is unlikely to happen but can be partially guarded against by transforming another importance map containing random positive numbers between 1 and 2 at the measurement locations. and in particular its mean value will be zero. This process of model ﬁtting and more sophisticated approaches can be found in [110]. The covariance for each subband can be calculated from the autocorrelation of the corresponding reconstruction wavelet and a simple least squares method will allow a good choice of scaling factors to be found. We will deﬁne the important coeﬃcients as those whose absolute value is greater than some threshold.3 describes how alternative values permit a trade between accuracy and results. If the wavelets used in this method have some negative values then it is possible for this method to miss important coeﬃcients if the responses from diﬀerent points cancel out. For example. and select the choice that did best.3. .6. Any additional important coeﬃcients found can be added to the list.6. One quick way to determine the important coeﬃcients is to transform such an importance image containing ones at the measurement locations and zeros elsewhere.146 CHAPTER 8. measure the covariance for each image. We deﬁne an importance image to be an image that is zero except at the measurement locations. Nonzero coeﬃcients mean that the coeﬃcient is important. 8. suppose we have a prior estimate for the covariance structure of the data.4 that proves that the covariance will be given by a simple combination of the covariances from each wavelet subband. A better method uses a result from section 7.1 Estimating scale energies We need to calculate the diagonal matrix D that deﬁnes our prior model for the image.
CHOICE OF WAVELET 147 8.5 Reconstruct image estimate The reconstruction is a straightforward application of the inverse wavelet transform using the values in a to determine the important coeﬃcient values.8. This means that we can generate a single lookup table for each subband which allows us to generate the i. 8.11 and then solve the equations Aa = P T T T y/σ 2 using Gaussian elimination which is fast for sparse matrices [98].7. Section 8.2 contains a theoretical discussion about the probable signiﬁcance of shift dependence.7. 8.4 discussed some general principles concerning the choice of transform in the wavelet generative speciﬁcation. j element of T P by calculating the position of the ith data point relative to the j th wavelet coeﬃcient and accessing the lookup table at this relative position.1 Speed The main computational burden is the solution of the linear equations.6. The number of equations is given by the number of measurement locations plus the number of important .7.6. while section 8. This gives a fast generation of T P . This section examines the eﬀect on the speed of the method and investigates the signiﬁcance of shift dependence.7.6. 8.7.4 discusses the results of these comparisons. Section 8.4 Solving for wavelet coeﬃcients Using sparse matrix methods we can quickly generate the matrix A directly from equation 8.7 Choice of wavelet Section 7. and 0 in all the unimportant coeﬃcients. 8.3 Impulse responses The impulse responses for the reconstruction ﬁlters depend only on which subband is being inverted.3 contains some experimental results that test the predictions of the theory.
Even the shift invariant estimate will only approximate the unknown surface and it may be the case that the errors due to this statistical uncertainty are much .148 CHAPTER 8. but the nondecimated system will have very many more.1: Count of important coeﬃcients for diﬀerent transforms 8. Table 8. measures quality relative to the actual surface being estimated. INTERPOLATION AND APPROXIMATION wavelet coeﬃcients.1 shows the results. If SN DW T is the energy of the shift invariant estimate (we asssume that the mean is 0) and Eshif t is the average energy of the error for a shift dependent estimate (relative to the shift invariant estimate) then the aesthetic quality is deﬁned in decibels as QA = 10 log10 SN DW T Eshif t We call this the aesthetic quality because the shift invariant methods tend to give the nicest looking contours (of constant intensity). Notice that the lack of subsampling in the NDWT produces about ten times more important coeﬃcients than the DTCWT and will therefore be much slower. The ﬁrst type. measures quality relative to the shift invariant solution produced with a nondecimated version of the wavelet transform. the aesthetic quality. To illustrate this we generated 20 random sample locations for a 128 by 128 image and counted the number of important coeﬃcients for a 4 scale decomposition.4 produced by aliasing. All the decimated systems will have a similar number of important coeﬃcients. Transform DWT NDWT WWT DTCWT GPT number of important coeﬃcients 1327 40860 372 4692 540 Figure 8. the statistical quality. The second type. It is important to distinguish two types of quality.7. These contours are nice in the sense that they do not have the artefacts (of arbitrary deviations in the contour) seen in ﬁgure 7.2 Shift Invariance In this section we use simple approximations to predict the eﬀect of shift dependence on the quality of the interpolated results.
8.7. CHOICE OF WAVELET
149
larger than the errors due to shift dependence. If SN DW T is the energy of the shift invariant estimate and EN DW T is the average energy of the error between the shift invariant estimate and the surface being estimated then the statistical quality is deﬁned in decibels as QS = 10 log10 SN DW T EN DW T + Eshif t
To predict these qualities we need to estimate a number of energies. First consider the simple interpolation case when the mean of the data is 0 and the correct value is known at a single point. We have already claimed that: 1. The (posterior mean) estimate will be a scaled version of the covariance function (section 8.3). 2. The covariance function for the wavelet method will be given by smoothed impulses (section 7.3.4). It is therefore reasonable to expect the aesthetic quality (the degradation caused by shift dependence) to be equal to the measured degradation for smoothed impulses given by the values in table 7.3. Now consider the multiple data point case. Widely spaced sample locations will naturally lead to a proportionate increase in the shift dependence error energy. However, there are two main reasons why this may not hold for closer points: 1. The errors may cancel out. 2. There is a correction applied to the size of the impulses so that the interpolated image will honour the known values. The ﬁrst reason may apply when there are two points close together. The aliasing terms could cancel out to give a lower error, but it is just as likely that they will reinforce each other and give an even higher energy error than the sum. In general this eﬀect is not expected to greatly change the shift dependence error. The second reason is more important. The correction ensures that there will be zero error at the sample values. This zero error has two consequences; ﬁrst, that there is no uncertainty in the value at the point and, second, that naturally there is zero shift dependence error at the point. This eﬀect will reduce the amount of shift dependence error as the density of data points increases. In the limit when we have samples at every
150
CHAPTER 8. INTERPOLATION AND APPROXIMATION
location then there will be no shift dependence error at all as the output is equal to the input. Although the precise amount of error will depend on the locations of the sample points and covariance function it is still possible to obtain a rough estimate of the amount of error that reveals the problem. Consider solving an interpolation problem with a standard decimated wavelet transform for a grid of N by N pixels. At level k and above there will be N 2 41−k wavelet coeﬃcients. Now suppose that we have N 2 41−p sample points spread roughly evenly across our grid (for some integer p ≥ 1). For a standard decaying covariance function these points will deﬁne the coarse coeﬃcients (those at scales k > p) fairly accurately but provide only weak information about the more detailed coeﬃcients. The coeﬃcients at scale k = p will have on average about one sample point per coeﬃcient. These coeﬃcients will therefore tend to produce about the same amount of shift dependence as in the single sample case weighted by the proportion of energy at scale p. The statistical uncertainty in the estimates will be roughly the amount of energy that is expected to be found in the coeﬃcients at scale p and the more detailed scales. Let Ep be the expected energy of the coeﬃcients at scale p. Let E≤p be the total expected energy of the coeﬃcients at scales 1 to p. Let r be the ratio Ep /E≤p . This ratio will be close to one for rapidly decaying covariance functions. The discussion above suggests that, approximately, the statistical uncertainty will correspond to a noise energy of E≤p , while the shift dependence will correspond to a noise energy of f Ep where f is the measure of the amount of shift dependence for the transform. An estimate for the aesthetic quality is therefore: QA ≈ 10 log10 SN DW T f Ep SN DW T = 10 log10 f rE≤p ≈ Q0 − 10 log10 f − 10 log10 r
where Q0 ≈ 10 log10 (SN DW T /E≤p ) is the expected statistical quality of the shift invariant estimate. The aesthetic quality is therefore predicted to be the values in table 7.3 with an oﬀset given by the statistical quality of the estimate plus a constant depending on r. The oﬀset is the same whatever the choice of transform and hence the diﬀerent transforms should
8.7. CHOICE OF WAVELET
151
maintain a constant relative aesthetic quality. For example, the table gives a value for −10 log10 f of about 32dB for the DTCWT, but only 6.8dB for the DWT and we would therefore expect the aesthetic quality for the DTCWT to be about 25dB better than for the DWT. As the density of points increases the statistical quality and hence the aesthetic quality will also increase. By using the approximation log(1 + x) ≈ x (valid for small x) we can also write a simple approximation for the statistical quality: QS = 10 log10 SN DW T E≤p + f Ep SN DW T E≤p = 10 log10 E≤p E≤p + f rE≤p = Q0 − 10 log10 (1 + f r) 10 fr ≈ Q0 − log 10
In order to judge the signiﬁcance of this we must know values for f and r. The measure of shift dependence f has been tabulated earlier converted to decibels. This is convenient for the aesthetic quality formula, but for the statistical quality we need to know the precise value of this factor. For convenience, the actual values are shown in table 8.2. Transform DWT NDWT WWT DTCWT GPT K=1 0.21 0 0.044 0 0.0021 K=2 0.21 0 0.018 0.0011 0.0005 K=3 0.21 0 0.015 0.0005 0.0003 K=4 0.21 0 0.014 0.0006 0.0003 Now
Figure 8.2: Shift dependence for diﬀerent scales. suppose that r = 1/2. This is roughly the value for the covariance function plotted in ﬁgure 7.4 because at each coarser level there are four times fewer coeﬃcients, but σl2 is eight times larger. There is therefore approximately twice the energy at the next coarser level than just the previous level, and hence approximately equal energy at the next coarser level to all the previous levels. Substituting for the values in equation 8.13 allows the prediction of the reduction in statistical quality caused by shift dependence. For the DWT the predicted reduction is
152
CHAPTER 8. INTERPOLATION AND APPROXIMATION
−(10/ log(10))(0.21)(0.5) = −0.46dB while for the WWT it is about −0.03dB and for the DTCWT it is only about −0.001dB. These estimates are not very trustworthy due to the large number of approximations used to obtain them, but they do suggest that we should expect shift dependence to cause a signiﬁcant decrease in both statistical and aesthetic quality when the standard wavelet transform is used.
8.7.3
Experiments on shift dependence
We measured the statistical and aesthetic qualities for the DTCWT and the DWT for a variety of sample densities. The wavelet generative model (section 7.3.4) was used to generate the data. In order to produce shift invariant surfaces we use the NDWT transform in the generation. We use equation 7.4 to deﬁne the scaling factors with the same choice of σl values as in section 7.4.5. The sample locations were arranged in a grid with equal horizontal and vertical spacing between samples. Let this spacing be s pixels. The sample locations were at the points {(as + δx, bs + δy)} within the image where a, b ∈
Z. The constants δx, δy ∈ Z
eﬀectively adjust the origin for the transforms. For each realisation of the surface these values were chosen uniformly from the set {0, 1, . . . , 15}. To avoid possible edge eﬀects we measured energies averaged only over a square grid of size 3s by 3s centred on a square of four data points away from the edges. For a range of spacings we performed the following procedure: 1. For i ∈ {1, 2, . . . , 32}: (a) Generate a random surface Zi of size 128 by 128. (b) Generate random values for δx, δy. (c) Sample the surface at the points {(as + δx, bs + δy) : a, b ∈ Z} that are within the image. (d) Interpolate the sampled values using the method described in section 8.6. The interpolation is repeated for three diﬀerent transforms; the NDWT, the DWT, and the DTCWT. (e) Measure the energies needed to calculate the measures of quality:
8.7. CHOICE OF WAVELET
153
• SN DW T,i the energy of the NDWT solution. • EN DW T,i the energy of the error between the NDWT estimate and the original image values. • EDW T,i the energy of the error between the DWT estimate and the NDWT estimate. • EDT −CW T,i the energy of the error between the DTCWT estimate and the NDWT estimate. 2. Average the energies over all values of i. For example, SN DW T 1 = 32
32
SN DW T,i
i=1
3. Calculate the relative statistical and aesthetic qualities based on the averaged energies. The aesthetic quality for the DWT is calculated as QA = 10 log10 (SN DW T /EDW T ) and similarly for the DTCWT. In order to highlight the diﬀerence in the absolute statistical quality we compute a relative quality measure RS deﬁned as the diﬀerence between the statistical quality for the shift dependent estimate and the statistical quality of the shift invariant estimate Q0 : RS = QS − Q0 SN DW T SN DW T − 10 log10 EN DW T + EDW T EN DW T EN DW T = 10 log10 . EN DW T + EDW T RS will be a negative quantity that measures the loss of statistical quality caused by shift = 10 log10 dependence. Figure 8.3 plots the aesthetic quality against the density of points. Figure 8.4 plots the relative statistical qualtity. In both ﬁgures a cross represents the DTCWT estimate while a circle represents the DWT estimate. Results are not shown for the NDWT since the deﬁnitions ensure that this transform will always have an inﬁnite aesthetic quality and a zero relative statistical quality.
8.7.4
Discussion of the signiﬁcance of shift dependence
The simple theory we proposed predicted (in section 8.7.2) that the aesthetic quality for the DTCWT would be about 25dB better than for the DWT. The experimental results shown
6 −0.3: Aesthetic quality for DWT(o) and DTCWT(x) /dB 0 −0.154 CHAPTER 8.7 −4 10 10 −3 10 Samples per pixel −2 10 −1 10 0 Figure 8.4: Relative statistical quality for DWT(o) and DTCWT(x) /dB .1 −0.4 −0.2 Relative statistical quality/dB −0.3 −0. INTERPOLATION AND APPROXIMATION 45 40 35 Aesthetic quality /dB 30 25 20 15 10 5 −4 10 10 −3 10 Samples per pixel −2 10 −1 10 0 Figure 8.5 −0.
the experiments conﬁrm the the qualitative prediction that the DWT has an appreciably lower statistical quality (of around 0.4 suggest that the relative quality is only about −0. The eﬀect of this is to predict that the relative quality will actually be worse (larger in magnitude) than −0. For the most detailed scale E1 = E≤1 and the ratio must be one.46dB for high sample densities. and therefore for low densities the shift dependence will be relatively insigniﬁcant and so the relative quality improves (decreases in magnitude). In practice there will still be some error in these. the shift dependence energy will be proportional to the density. However. Nevertheless.2%) caused by shift dependence.25dB. 1. The estimates will be very uninformative and the statistical error will be roughly constant (and equal to the variance of the original image). For the other scales the ratio will be somewhere between 1 and 1/2. Finally we discuss the expected eﬀect of some of the approximations on the discrepancy between the predicted and observed results for the relative quality. This eﬀect will tend to . Bear in mind that a larger (in magnitude) relative quality means worse results. The estimate that r = 1/2 is very crude. Considering the large number of approximations made in predicting the value this is a reasonable match. The results in ﬁgure 8. This is a fairly poor match with the predicted value.3 suggest that the improvement in aesthetic quality is actually about 20dB for the DTCWT. The absolute value of the aesthetic quality for the DWT varies from about 20dB for high densities to 9dB for low sample densities.5dB for very high sample densities. 2.7. but that for lower densities the relative quality becomes much smaller (in magnitude).01dB.8. We assume that the wavelet coeﬃcients at scales coarser than p are accurately estimated. The theory only applies when the critical level is close to one of these levels. while the DTCWT gives a much improved quality.46dB (this corresponds to an error of about 11%). 3. For densities lower than about 1 in 162 = 256 the sample positions are so widely spaced that they will have little eﬀect on each other.6%) while the DTCWT has almost negligible errors (less than 0.0. These experimental results conﬁrm that aesthetically the quality of the DWT is low. The theory predicted that the relative statistical quality for the DWT would be about −0. CHOICE OF WAVELET 155 in ﬁgure 8. We use 4 level transforms.
8. We assume that the level p coeﬃcients will produce an expected shift dependent energy of f Ep . 2. Therefore this will produce a slight improvement (decrease in magnitude) in the relative quality. We assume that the wavelet coeﬃcients at scales ≤ p are inaccurately estimated.8. . This eﬀect will tend to decrease the statistical error and hence increase the signiﬁcance of the shift dependence.156 CHAPTER 8. It is better to generate a range of sample images from the posterior and average the results. This is because the estimate is given by the mean of the posterior distribution. 5. The most signiﬁcant of these eﬀects are probably the ﬁrst and last. Ep is the expected energy of the level p coeﬃcients in the prior but the actual energy of the coeﬃcients in the interpolated image will tend to be less than this due to the limited information available. The mean of the prior distribution is zero and when there is little information the mean of the posterior will also be close to zero. In the context of Kriging approximation methods this generation is called conditional simulation [36] and works as follows: 1. Remove a point from the queue and use Kriging to estimate the mean and variance of the posterior distribution at that point conditional on all the data values and on all the previous locations for which we have estimated values. INTERPOLATION AND APPROXIMATION increase the statistical error and hence decrease the signiﬁcance of the shift dependence. Construct a queue of locations that cover a grid of positions at which we wish to estimate the intensity values. In practice there will still be some information in these. The eﬀect of this is to predict less shift dependence and hence a better (smaller in magnitude) relative quality.8 8.1 Extensions Background The Kriging mean estimate gives biased results when estimating a nonlinear function of the image [130] (such as the proportion of pixels above a certain threshold). 4. Therefore this will produce a worse (larger in magnitude) relative quality.
and then adds on a Kriged image based on the data values minus the values of the random image at the known locations.2 Proposal In order to eﬃciently calculate image samples we calculate samples of the wavelet coeﬃcients and then apply the wavelet reconstruction transform. 4.8. 8. Generate a sample from the Gaussian distribution with the estimated mean and variance and use this to set the value at the new point. A multiple grid approach has been proposed [41] that ﬁrst simulates the values on a coarse grid using a large data neighbourhood and then the remaining nodes are simulated with a ﬁner neighbourhood. As described. Our approach can be viewed as a multigrid approach. This calculation involves a huge amount of computation for more than a few hundred locations. It is easy to generate samples of the unimportant wavelet coeﬃcients (whose posterior distribution is the same as their prior) by simulating independent Gaussian noise of the correct variance. This will generate a conditional simulation of the surface and the process can be repeated to generate many diﬀerent realisations.8.8. We now describe a similar method that acts in wavelet space. Repeat steps 2 and 3 until the queue is empty. EXTENSIONS 157 3. the estimate for the value at a position is based on all the data points and all the previously calculated points but to increase the speed of the process it is possible to base the estimate just on some of the close points. It is necessary to include points up to the range of the variogram if the results are to be valid and again the computation rapidly becomes prohibitively long. . 89] that ﬁrst generates a random image with the correct covariance function (but that does not depend on the known data values). An eﬃcient simulation method has been proposed [57. This process generates a single sampled image and can be repeated to generate as many samples as are desired. Each step in this process involves inverting a square matrix whose width increases steadily from the number of measurements to the number of locations we wish to know about. with the additional advantage of wavelet ﬁltering to give better decoupling of the diﬀerent resolutions making our method faster and more accurate.
with length equal to the number of measurements plus the number of important wavelet coeﬃcients. ˆ The vector of random variables Z given by T T P/σ ˆ Z = A−1 P T T T y/σ 2 + R D −1 will have a multivariate Gaussian distribution and noting that A is a symmetric matrix we can simplify as follows: T P/σ D −1 T T P/σ D −1 ˆ Z ∼ N A−1 P T T T y/σ 2 .158 CHAPTER 8. We also get a very sparse set of equations which can be solved much faster than the fuller system that Kriging methods produce. Gaussian elimination is equivalent to LU factorisation (the representation of a matrix by the product of a lower triangular matrix L with an upper triangular matrix U) and so we can generate many samples quickly by calculating this ˆ factorisation once and then calculating Z for several values of R. A−1 A−1 ∼ N a. A similar method of LU factorisation has been used to quickly generate many samples for the Kriging Conditional Simulation method [2] but this method can only simulate a few hundred grid nodes before the cost becomes prohibitive. This is fast because triangular matrices can be quickly inverted using back substitution. A−1 This shows that such solutions will be samples from the posterior distribution for the wavelet coeﬃcients.11 that A = D −2 + P T T T T P/σ 2 . The improvement is possible because the wavelet transform achieves a good measure of decorrelation between diﬀerent ranges of the covariance function and so can interpolate each scale with an appropriate number of coeﬃcients. A−1 D −2 + P T T T T P/σ 2 A−1 ∼ N a. Recall from equation 8. INTERPOLATION AND APPROXIMATION To generate samples of the important wavelet coeﬃcients consider solving the equations AZ = P T T T y/σ 2 + T P/σ D −1 T R where R is a vector of random samples from a Gaussian of mean zero and variance 1. The sparsity of A means that Gaussian elimination allows us to quickly solve these equations. We have generated simulated images with a quarter of a million grid nodes using the wavelet method in less than a minute on a single processor. .
13) For example.8. This tradeoﬀ only aﬀects the time for setting up and solving the equations.6.2 and measure the total time taken to produce this image (including the determination of the importance map and the wavelet transforms). but notice that the same threshold gives greater accuracy with more measurements. a threshold of 0.8. For each output image S we deﬁne the signal to noise ratio (SNR) to be SNR = 10 log10 i i j 2 Cij j (Sij − Cij )2 (8. It can be seen that the computation decreases for minor increases in the threshold while producing little additional error. and once with 256 measurements. Figure 8.8dB).3 Trading accuracy for speed We examine the tradeoﬀ between accuracy and speed by adjusting the threshold used to determine the importance map. We use a grid of 512 by 512 and generate a mean posterior estimated image using the wavelet method of section 8.6. We calculate the approximation while adjusting the threshold mentioned in section 8. For some of the points we have also displayed the associated threshold level. once with 128 measurements.3 reduces the time by a factor of 3 while giving a SNR of 27dB. We also timed an interpolation of 512 measurements which took 32 seconds (SNR=33. it takes about 14 seconds (SNR=29. the interpolation takes about 6 seconds (SNR=27. Therefore when we have more measurements we can reduce the computation by using a higher threshold while maintaining the same accuracy. the time for determining the importance map and inverting the wavelet transform depends only on the size of the grid. EXTENSIONS 159 8.2dB). This is not quite linear.3. For example. For 128 measurements. The same computation decrease is evident.3dB). Figure 8. less correlated. There is also a horizontal dashed line drawn at the time taken for a threshold of zero. a SNR of 30dB is equivalent to saying that the energy of the error is only 0. On balance the amount of computation is roughly linear .5 plots the time taken for the interpolation versus the SNR of the results.8.1% of the energy of the surface. Consider the threshold of 0. We perform the experiment twice. and thus easier to solve.6 shows the results of the experiment when we have twice as many data points. An increased threshold makes the equations become sparser. The correct image C is deﬁned to be that produced by the method with zero threshold. For 256 measurements.
1 Threshold=0.5: Computation time versus SNR (128 measurements).3 20 40 60 SNR /dB 80 100 Figure 8.3 5 0 0 20 40 60 SNR /dB 80 100 Figure 8. .04 Time for interpolation 15 10 Threshold=0. 50 Time for interpolation Threshold=0.1 Threshold=0.02 40 30 20 10 0 0 Threshold=0.160 CHAPTER 8.6: Computation time versus SNR (256 measurements).04 Threshold=0.01 Threshold=0.2 Threshold=0. INTERPOLATION AND APPROXIMATION 20 Threshold=0.2 Threshold=0.
the variance of the measurement noise is known. 6. 8. The model assumes that: 1. the image is a realisation of a 2D stationary discrete Gaussian random process. .9. DISCUSSION OF MODEL 161 in the number of measurements for a constant accuracy. in certain circumstances this expectation may not hold. 3. For any problem that is taking a considerable amount of time to solve it will clearly be preferable to use the new wavelet method. Two examples are: 1. The bottleneck in Kriging is the inversion of a matrix. For example.8. Inﬁnite variance noise processes (such as alphastable noise). We would expect an assumption of Gaussian measurement noise to be reasonably accurate in most cases even for nonGaussian noise distributions of zero mean and equal variance.43 seconds. the measurements are at distinct locations. 2. 4. For most applications the original data will only be approximately modelled as a stationary Gaussian random process. In contrast. independent Gaussian noise corrupts the measurements. To solve a system with S measurements involves the inversion of a S by S matrix. inverting a 256 by 256 matrix in Matlab takes 0. Kriging scales very badly with the number of data points. 5. The ﬁrst assumption is the most signiﬁcant. and such an inversion involves computation roughly cubic in the number of points.9 Discussion of model This section discusses the eﬀect of the following assumptions.9 seconds and a 1024 by 1024 matrix takes 50 seconds. Often more information may be known about the likely structure of the data and a more sophisticated model using this information will almost certainly give better results but will probably also require much more computation to solve. However. a 512 by 512 matrix takes 5. the mean and covariance of the random process are known. the measurements lie on grid positions.
The problem is that it is impossible to interpolate two diﬀerent values at the same position. Bandlimited interpolation. INTERPOLATION AND APPROXIMATION 2. The assumption of known mean and covariance of the process will almost never be true. In this case methods that jointly estimate the surface and the reliable measurements should be able to give signiﬁcantly better results. The same argument applies to the variance of the measurement noise. 8. The assumption that the sample locations lie on grid points is another unimportant constraint because approximating sample locations by the nearest grid point should give suﬃciently accurate results for most applications. and spline interpolation can all be viewed as calculating Bayesian posterior mean estimates based on particular assumptions about the prior distribution for the images. The restriction that the measurement locations are at distinct locations is an unimportant constraint that is needed only for interpolation. Results in the literature related to radial basis functions [97] suggest that the precise shape of the covariance function only has a small eﬀect on the results and therefore we do not expect the errors in the parameter estimates to be signiﬁcant. A simple approach to the problem is to replace repeats by a single sample with value given by the average of the repeats. A possible measurement model is that a certain proportion of the measurements are accurate. More precisely. Our method has a number of parameters associated with it and these parameters could be tuned in order that the complex . but there are many methods available for obtaining estimates of these parameters [110].10 Conclusions The ﬁrst part of this chapter considered alternative interpolation and approximation techniques from a Bayesian viewpoint. but that the others are badly corrupted. with the only theoretical diﬀerence between the methods being the assumed covariance function. For approximation all the methods work equally well even with the original samples without this constraint. each method can be viewed as assuming a stationary discrete Gaussian random process for the prior. We argued that Kriging. The reason that this is important for complex wavelets is that our proposed method based on the DTCWT uses a prior of the same form. Radial Basis Functions.162 CHAPTER 8.
the DWT was found to give signiﬁcantly shift dependent results. in practice this is not an appropriate application for any of these wavelet methods. We also prove from a Bayesian perspective that shift dependence will always be an additional source of error in estimates. Using this method to achieve a constant accuracy we found that the time to solve the equations is roughly linear in the number of data points. while the DTCWT produced estimates with statistically insigniﬁcant errors due to shift dependence. Better and faster results (at least for the . Finally we found a simple method that can be used to increase the speed of the method at the cost of a slight decrease in accuracy. These predictions were tested experimentally and found to be rather inaccurate but they did give a reasonable guide to the relative importance of shift dependence for the diﬀerent methods. This chapter has argued that the DTCWT gives much better results than the DWT and much faster results than the NDWT. The minimum smoothness norm interpolation based on a decimated wavelet will suﬀer from shift dependence. However.8. We also developed a method for generating samples from the posterior distribution that can generate large numbers of sample images at a cost of one wavelet reconstruction per sample image. However. while the computation for Kriging is roughly cubic in the number of data points. a comparable method based on the conjugate gradient algorithm [88] requires 2K wavelet transforms per sample image where K is the number of iterations used in the conjugate gradient algorithm. The second part of the chapter proposed a wavelet method for interpolation/approximation. Least squares spline approximation techniques cannot be shift invariant. it is more useful to use the freedom to tune the DTCWT method for a particular application. For contrast. 3. CONCLUSIONS 163 wavelet method is an approximate implementation of any of the previously mentioned interpolation techniques. The ﬁrst part also pointed out problems with some other techniques: 1. We discussed and predicted the eﬀect of shift dependence on measures of aesthetic and statistical quality.10. 2. Smoothing spline estimates tend to inﬁnity when extrapolated away from the data points. even compared to the expected statistical error. In particular.
the next chapter will describe an application for which the DTCWT is not only better than the DWT and the NDWT. . but also superior to the leading alternative methods. INTERPOLATION AND APPROXIMATION isotropic case) could be obtained with the GPT. In contrast.164 CHAPTER 8.
and the experimental comparison with alternative techniques. then the captured images will be blurred. or incorrectly focused. For example. We explain how to use a complex wavelet image model to enhance blurred images. The main original contributions are. the new iterative deconvolution method. if a camera lens is distorted. The background for this chapter is largely contained in appendix C which reviews a number of deconvolution methods from a Bayesian perspective. the experimental results comparing the results for alternative transforms within the method. 9.1 Introduction Images are often distorted by the measurement process. This model can be written as y = Hx + n 165 (9. We construct an empirical Bayes image prior using complex wavelets and experimentally compare a number of diﬀerent techniques for solving the resulting equations.Chapter 9 Deconvolution The purpose of this chapter is to give an example of a Bayesian application that illustrates the performance gains possible with complex wavelets.1) . We will assume that the measurement process can be represented by a known stationary linear ﬁlter followed by the addition of white noise of mean 0 and variance σ 2 . We compare the results with alternative deconvolution algorithms including a Bayesian approach based on decimated wavelets and a leading minimax approach based on a special nondecimated wavelet [58].
166
CHAPTER 9. DECONVOLUTION
where some lexicographic ordering of the original image, x, the observed image, y, and the observation noise, n, is used. The known square matrix H represents the linear distortion. As it is assumed to be stationary we can write it using the Fourier transform matrix F as H = F H MF (9.2)
where M is a diagonal matrix. For an image with P pixels y, x, and n will all be P × 1 column vectors while F , M, and H will be P × P matrices. As both x and n are unknown equation 9.1 therefore represents P linear equations in 2P unknowns and there are many possible solutions. This is known as an illconditioned problem. The best solution method depends on what is known about the likely structure of the images. If the original images are well modelled as a stationary Gaussian random process then it is wellknown that the optimal (in a least squares sense) solution is given by the Wiener ﬁlter. However, for many real world images this model is inappropriate because there is often a signiﬁcant change in image statistics for diﬀerent parts of an image. For example, in a wavelet transform of an image most of the high frequency wavelet coeﬃcients tend to have values close to zero, except near object edges where they have much larger values. There have been many proposed methods for restoring images that have been degraded in this way. We restrict our attention to the more mathematically justiﬁable methods, ignoring the cruder “sharpening” techniques such as using a ﬁxed highpass ﬁlter or some simple modiﬁcation of wavelet coeﬃcients [14]. (These ignored techniques provide a quick, approximate answer but are less scientiﬁcally useful because often they will not provide an accurate reconstruction even in very low noise conditions.) For astronomical imaging deconvolution there are three main strands; the CLEAN method proposed by H¨gbom [44], maximumentropy deconvolution proposed by Jaynes o [54, 29], and iterative reconstruction algorithms such as the RichardsonLucy method [102]. For images containing a few point sources (stars) the CLEAN algorithm can give very accurate reconstructions, but for images of real world scenes these methods are less appropriate. Alternative image models are found to give better results. Constrained least squares methods [15] use a ﬁlter based regularisation, such as a Laplacian ﬁlter, but this tends to give over smoothed results when the image contains sharp edges. More recently there have been attempts to improve the performance near edges. These methods include total variation [123], Markov Random Field (MRF) [56, 132], and wavelet based approaches. There are
9.1. INTRODUCTION
167
two main contrasting methodologies for using wavelets. The ﬁrst group is based on a minimax perspective [38, 52, 58, 84, 87]. The second group is based on a Bayesian perspective using wavelets to represent the prior expectations for the data [8, 11, 94, 124]. We ﬁrst describe a general Bayesian framework for image deconvolution. In appendix C we draw out the connections between the diﬀerent approaches by reviewing the papers mentioned above with reference to the Bayesian framework. Section 9.1.2 summarises the main results from this review. Section 9.1.3 discusses the reasons guiding our choice of prior model based on the material covered in the appendix. This model is detailed in section 9.2 and then we describe the basic minimisation method in section 9.3. We propose a number of alternative choices for minimisation that are experimentally compared in section 9.4. Section 9.5 compares the results to alternative deconvolution methods and section 9.6 presents our conclusions.
9.1.1
Bayesian framework
To treat image deconvolution from the Bayesian perspective we must construct a full model for the problem in which all the images are treated as random variables. We shall use upper case (Y,X,N) to represent the images as random variables, and lower case (y,x,n) to represent speciﬁc values for the variables. To specify a full model requires two probability density functions to be speciﬁed: 1. The prior p(x) encodes our expectations about which images are more likely to occur in the real world. 2. The likelihood p(yx) encodes our knowledge about the observation model. (As before, we use the abbreviation x for the event that the random variable X takes value x.) All the reviewed methods (except for the RichardsonLucy method described in section C.5) use the same observation model and so the likelihood is the same for all of the methods and is given by
P
p(yx) =
i=1
√
1 2πσ 2
exp
− ([Hx]i − yi )2 2σ 2
.
Given observations y, Bayes’ theorem can be used to calculate the a posteriori probability density function (known as the posterior pdf): p(xy) = p(yx)p(x) . p(y) (9.3)
168
CHAPTER 9. DECONVOLUTION
There are several techniques available to construct an estimate from the posterior pdf. ˆ Normally a Bayes estimator is based on a function L(θ, θ) that gives the cost of choosing ˆ the estimate θ when the true value is θ. The corresponding Bayes estimator is the choice of ˆ θ that minimises the expected value of the function based on the posterior pdf. However, for the purposes of the review it is most convenient to consider the MAP (maximum a posteriori) estimate. The MAP estimate is given by the image x that maximises the posterior pdf p(xy). xM AP = argmaxx p(xy) Usually a logarithmic transform is used to convert this minimisation into a more tractable form: xM AP = argmaxx p(yx)p(x) p(y) = argmaxx p(yx)p(x)
= argminx − log (p(yx)p(x)) = argminx − log (p(x)) − log (p(yx))
P
= argminx f (x) +
i=1
([Hx]i − yi )2 2σ 2
2
= argminx f (x) +
1 Hx − y 2σ 2
where f (x) is deﬁned by f (x) = − log (p(x)) . (9.4)
2
In summary, the MAP estimate is given by minimising a cost function 2σ 2 f (x)+ Hx − y where the choice of f (x) corresponds to the expectations about image structure.
This minimisation problem often appears in the regularisation literature in one of two alternative forms. The ﬁrst is known as Tikhonov regularisation [117]. A class of feasible solutions Q is deﬁned as those images for which the norm of the residual image is bounded. The residual image is the diﬀerence between the observed data and the blurred estimate. Q = {x : y − Hx ≤ }
9.1. INTRODUCTION
169
Tikhonov deﬁned the regularised solution as the one which minimises a stabilising functional f (x). xT IKHON OV = argminx∈Q f (x) The second form is known as Miller regularisation [80]. In this approach the energy of the residual is minimised subject to a constraint on the value of f (x). xM ILLER = argmin{x:f (x)≤E} y − Hx Using the method of undetermined Lagrangian multipliers it can be shown [15] that both problems are equivalent to the MAP minimisation (for particular choices of σ).
9.1.2
Summary of review
Appendix C explains the principles behind the standard deconvolution techniques and attempts to explain the diﬀerences from within the Bayesian framework. Several of the methods are equivalent to a particular choice of f (x) (in some cases with additional constraints to ensure the image is positive). These choices are displayed in table 9.1. Explanations of these formulae can be found in the appendix, the numbers in brackets indicate the corresponding section. The Landweber and Van Cittert algorithms are special cases of Wiener Algorithm (section) CLEAN (C.1) Maximum Entropy (C.2) Wiener ﬁltering (C.4) Van Cittert (C.5) Landweber (C.5) Wang (C.10) Starck and Pantin (C.10) Belge (C.10) Pi˜ a and Puetter (C.10) n − Expression for f (x) − log(β) + α
i
Px x
i j
j
log P
i xi xi j xj
1 2 i σ2 SNRi  [F x]i  mi 2 1 − mi 2  [F x]i 2 i σ2 1−(1−αmi )K mi 2 1 − mi 2  [F x]i 2 i σ2 1−(1−αmi 2 )K 2 i λi  [W x]i  [W x]i  i λi [W x]i − mi −  [W x]i  log mi i
λi  [W x]i p
i
≈
wi p
Figure 9.1: Prior cost function f (x) expressions for standard deconvolution techniques. ﬁltering (if we remove the positivity constraint). In appendix C we also explain why we
170
CHAPTER 9. DECONVOLUTION
can approximate both constrained least squares (section C.6) and the RichardsonLucy algorithm (section C.5) as alternative special cases of the Wiener ﬁlter. The reason for making these connections is because we can predict an upper bound for the performance of all these methods by evaluating just the best case of Wiener ﬁltering (the oracle Wiener ﬁlter). Expressions for f (x) for the total variation (section C.7), Markov Random Field (section C.7), and Banham and Katsagellos’ methods (section C.10) can also be written down1 but the projection (section C.3) and minimax (section C.8) methods are more diﬃcult to ﬁt into the framework. The minimax methods are an alternative approach motivated by the belief that Bayesian methods are inappropriate for use on natural images. Section C.8 discusses the two approaches and explains why we prefer the Bayesian method.
9.1.3
Discussion
This section discusses the reasons guiding the choice of prior based on the review presented in appendix C. The main issue is to identify the nature of the dependence between the pixels in the original image. For astronomical images of sparsely distributed stars an independence assumption may be reasonable, while for many other kinds of images (including astronomical images of galaxies) such an assumption is inappropriate. If independence is a reasonable assumption then the CLEAN, maximum entropy, and maximally sparse methods are appropriate and the choice largely depends on the desired balance between accuracy and speed. For example, the CLEAN method is fast but can make mistakes for images containing clustered stars. For images that are expected to be relatively smooth then the Wiener ﬁlter and iterative methods are appropriate. If the images are known to satisfy some additional constraints (for example, the intensities are often known to be nonnegative for physical reasons) or if the blurring function is space varying then the iterative methods such as RichardsonLucy or constrained least squares are appropriate. Otherwise it is better to use the Wiener ﬁlter because it is fast and approximately includes the iterative methods as special cases.
1
We have not included these expressions because, ﬁrstly, they require a considerable amount of spe
cialised notation to be deﬁned and, secondly, these expressions can easily be found in the literature [8, 56, 90].
9. white Gaussian noise model means that the likelihood p(yw) is proportional to exp − 1 HP w − y 2σ 2 2 (9. we use a generative speciﬁcation in which the real and imaginary parts of the wavelet coeﬃcients are independently distributed according to Gaussian distribution laws of zero mean and known variance. The previous section described several ways of constructing a prior with wavelets. we choose to use a simple prior model based on an adaptive quadratic cost function [124]. We are interested in examining the potential of the DTCWT within deconvolution and therefore we choose to study the restoration of realworld images rather than sparse starﬁelds. For simplicity we choose to use the quadratic cost function proposed by Wang et al [124].2 Image model We will assume that we have a balanced wavelet transform so that P H = W where P H represents the Hermitian transpose of P .5) As mentioned in the previous section. The wavelet methods tend to give a good compromise for images containing such a mixture of discontinuities and texture. Speciﬁcally. We can write that the prior pdf p(w) for the wavelet coeﬃcients is proportional to 1 exp − wH Aw 2 (9. Realisations from the ii prior pdf for images could be calculated by generating wavelet coeﬃcients according to this . We will assume that the real and imaginary parts of the transform’s outputs are treated as separate coeﬃcients so that W and P are real matrices.2. but for many natural images this model is only correct for certain parts of the image while in other parts there may be textured or smoothly varying intensities. The assumption of a linear.9. This can be considered as a simple extension to the model of chapter 7.6) where A is a diagonal matrix with A−1 being the variance of wi . The Markov Random Field and total variation methods are good for images that are wellmodelled as being piecewise ﬂat. IMAGE MODEL 171 For images of scenes containing discontinuities then the total variation and wavelet methods are appropriate. This choice means that our proposed method will be an empirical Bayes approach based on the nonstationary Gaussian random process model. additive.
However. 9. 5. DECONVOLUTION distribution and then inverting the wavelet transform x = P w. the number of pixels in such problems will mean that the pseudoinverse will take a very long time to evaluate and a much quicker approach is needed. The only diﬀerence to the previous model is that the variances are allowed to vary between coeﬃcients rather than being the same for all coeﬃcients in a given subband. Initialise the wavelet coeﬃcients. The 1 HP w − y 2 2 1 + wH Aw 2 (9. During the estimation we compute a ﬁrst estimate x0 of the original image.5 and 9. 6. We assume that each coeﬃcient has an equal variance in its real and imaginary parts. Section 9.172 CHAPTER 9.1 explains the estimation steps.2 contains a ﬂow diagram of this method.7) .3. 3. We deﬁne an energy E to be the negative logarithm of the likelihood times the prior (ignoring any constant oﬀsets). For this problem the MAP estimate will be identical to the Bayesian posterior mean estimate because the posterior pdf is a multivariate Gaussian. Minimise the energy along a line deﬁned by the search direction. Estimate the variances of the wavelet coeﬃcients.6: E= The steps in our method are: 1. Estimate the PSD of the image. For simplicity we assume that the image has been scaled so that σ = 1. 4. With this scaling the energy function is given by combining equations 9.3 Iterative Solution The simple assumptions made mean that it is possible to write down the solution to the problem using a matrix pseudoinverse. 2. The MAP (maximum a posteriori) answer is given by minimising this energy. Figure 9. We will attempt to minimise the energy by repeating low dimensional searches in sensible search directions. Repeat steps 4 and 5 ten times. Calculate a search direction.
3. .9. ITERATIVE SOLUTION 173 Start Estimate model parameters Image Initialisation Calculate Search Direction Minimise Energy along search direction Have we done enough iterations? Yes Stop No Figure 9.2: Flow diagram for the proposed wavelet deconvolution method.
We initialise the wavelet coeﬃcients to zero. but also contain more noise and thus produce overestimates of the variances. However. Figure 9. Section 9. Full regularisation (α = 1) corresponds to using a Wiener denoised estimate. and I(i) the index of the imaginary part of the complex wavelet coeﬃcient corresponding to index i.3 contains a block diagram of the estimation process. for a typical blurring operation this would underestimate the variances of the coeﬃcients at detailed scales.3 by the Estimate Wavelet Variances block.3.174 CHAPTER 9. Their method for variance estimation was to perform an edge detection operation on the original image and then increase the variances of coeﬃcients near edges. Estimate the variances Aii = 2 wR(i) 1 2 + wI(i) where R(i) is the index of the real part. In other words. Our . Later in section 9.4 we will propose a better initialisation.5. ˆ A simple estimate for the original image would be the observed data x = y.3.3. DECONVOLUTION detail of this image will probably be unreliable but the lowpass information should be fairly accurate.2 explains how the search direction is chosen. and the scaling coeﬃcients to the scaling coeﬃcients in the transform of the image x0 .1 Variance estimation The method of Wang et al [124] used a similar prior model (based on a real wavelet transform). Section 9. Smaller values of α will preserve the signal more. Compute the wavelet transform w = W x of this image.2. Wiener estimates tend to have smoothed edges and will therefore tend to produce underestimates of the variances near edges. The variance estimates are given by the energy of the wavelet coeﬃcients of the wavelet transform of an estimate of the original image. Alternatively we could compute a deconvolved image via the ﬁlter of equation C. ˆ 2. 3. These steps are represented in ﬁgure 9. 9. Details of this process were not given and so we use an alternative estimation technique. This process corresponds to the step Estimate Model Parameters in the ﬂow diagram of ﬁgure 9. we need to: ˆ 1.3 explains how to minimise the energy within a one dimensional subspace. Obtain an estimate x of the original image.
3: Block diagram of deconvolution estimation process. . ITERATIVE SOLUTION 175 Observed Image y Estimate PSD Under−regularized Deconvolution Initial estimate of x Wavelet denoising Second estimate of x Estimate wavelet variances A Figure 9.9.3.
Autoregressive and Markov image models have been used to estimate image statistics [21] but it is reported that the method only works well in noise reduction and not in blur removal [48]. the comparisons of the DTCWT method with other published results will never cheat by using an oracle estimate. This is called an oracle estimate because it requires knowledge of the original image but this information will naturally not be available in any real application. ˆ 2. By Fourier transforming the observation equation 9. This kind of estimate is often required in deconvolution [84. . We will always make it clear when we are using such an oracle estimate2 In a real application we need a diﬀerent estimation technique. 48]. Hillery and Chin propose an iterative Wiener ﬁlter which successively uses the Wienerﬁltered signal as an improved prototype to update the power spectrum estimate [48]. 3. The ﬁlter of equation C.1 it is straightforward to show that the expected value of this estimate is given by ˆ E py = M H Mpx + σ 2 1N where 1N is a N × 1 vector of ones. Calculate the Fourier transform of the observed data F y. We estimate the power spectrum of the original image by ˆ ˆ px = py − σ 2 1N 2 M H M + βIN −1 In particular. such an estimate is useful in testing methods as it removes the errors caused by bad spectrum estimates. The constrained least squares method is a variant in which the autocorrelation is assumed to be of a known form [5]. 1.1) followed by soft thresholding wavelet denoising. Within this dissertation we are more concerned with the performance of wavelet methods than classical estimation theory and we use a fast and simple alternative estimation technique. DECONVOLUTION chosen approach is to use the under regularised inverse (with α = 0. In some experiments we will use the oracle estimate given by the square of the power spectrum of the original image (before convolution). Nevertheless. Square to get an estimate of the observed power spectrum py i = [F y]i 2 .176 CHAPTER 9.5 requires (for α = 0) an estimate of the power spectrum of the original image.
A similar approach is used to perform the initial wavelet denoising. 2.9. The details of this algorithm are: ˆ 1. We use β = 0. The value of σi will be the same for all coeﬃcients within the same subband (because the ﬁltering is a stationary ﬁlter and diﬀerent coeﬃcients in a subband correspond to translated impulse responses). In practice it is easier to estimate these values by calculating the DTCWT of an image containing white noise of variance σ 2 that has been ﬁltered according to equation . the estimate of the original image is given by the under regularised ﬁlter. but here it is more convenient to use the complex form.01 in the experiments. Calculate an estimate ai of the signal power in these coeﬃcients.9) 2 where σi is the variance of the noise in the wavelet coeﬃcient and γ takes some constant value. ˆ 2 ai = wi 2 − γσi ˆ (9. This gives the ˆ underregularised image estimate x0 that is further denoised using wavelets.3. Let wi be the ith complex wavelet coeﬃcient in the output of this transform.8) ˆ ˆ where Px is a diagonal matrix whose diagonal entries are given by px . First the signal strengths are estimated for each wavelet coeﬃcient and then a Wienerstyle gain is applied to each coeﬃcient. The original white noise of variance σ 2 is coloured by both the wavelet transform and the inverse ﬁltering. ITERATIVE SOLUTION 177 where β is a parameter used to avoid over ampliﬁcation near zeros of the blurring ﬁlter. This represents the Estimate PSD block in ﬁgure 9. It is important that wi is complexvalued here.3. Any negative elements in the estimated power spectrum are set to zero. This ﬁltering can be expressed in matrix form as ˆ ˆ x0 = F H M H M H M Px + ασ 2 IN −1 Fy (9. This ﬁltering is represented by the Underregularized Deconvolution block in ﬁgure 9. Calculate the complex wavelet transform of the image estimate x0 . In the rest of this chapter except for the four steps of this algorithm we use the separated real form of the transform.3. Once we have the power spectrum. The parameters of both these processes are known which 2 in theory allows the exact calculation of σi .
3. However.e. The average energy of the wavelet coeﬃcients in the corresponding subbands 2 provide estimates of σi . Both algorithms work best for wellconditioned Hessians. for Hessians close to a multiple of the identity matrix. h(1) .3. . Let g(i) be the preconditioned descent direction at the ith step of the algorithm. with this choice there is a signiﬁcant probability that a low power coeﬃcient will be incorrectly estimated as having a high energy. DECONVOLUTION 9. The inverse DTCWT is applied to the new wavelet coeﬃcients to give an image x.10) ˆ 4. . As before negative values of ai are set to zero. These steps are represented by the Wavelet Denoising block of ﬁgure 9. The choice of search direction will only aﬀect the speed of convergence but not the ﬁnal result.8.178 CHAPTER 9. Convergence can be improved for a badly conditioned system via a preconditioner.2. In the experiments we will always use γ = 3. either by the steepest descent algorithm h(i) = g(i) . In practice we ﬁnd it is better to use a larger value to avoid this problem. One obvious choice is the gradient but better search directions are usually produced by the conjugate gradient algorithm [98]. We will test three types of preconditioning in both gradient and conjugate gradient algorithms for a total of six alternatives. . This is because the noise only 2 corrupts the coeﬃcients with an average energy of σi . ˆ 3. A choice of γ = 1 would seem to give a good estimate of the original signal power. wi = ˆ ai ˆ w 2 i ai + σi ˆ (9. i. New wavelet coeﬃcients are generated using a Wiener style gain law.2 Choice of search direction This section describes the contents of the Calculate Search Direction step in ﬁgure 9. 9. We ﬁrst describe the conjugate gradient algorithm and then our preconditioning choices. We construct a sequence of search directions h(0) .
. For the ﬁrst pass. g(i−1) 2 This formula is valid for i > 0. The required scaling is √ therefore si = 1/ ti . g(i) = −∇w E = P H H H y − P H H H HP w − Aw. Instead for the second type we choose a simpler type of preconditioning that scales the energy function gradient in order to produce a Hessian with diagonal entries equal to 1. We compare three types of preconditioning. The Hessian for our system is P H H H HP + A and so the ideal preconditioner would be P H H H HP + A −1 which would transform the Hessian to the identity matrix but this matrix inversion is far too large to be numerically calculated. ITERATIVE SOLUTION 179 or by the conjugate gradient algorithm h(i) = g(i) + g(i) 2 (i−1) h . i = 0. the search direction for the conjugate gradient algorithm is given by h(0) = g(0) . Appropriate directions for changes to the original coeﬃcients w are therefore given by g(i) = S∇v E = S 2 ∇w E.9. The ﬁrst type corresponds to no preconditioning and g(i) is given by the negative gradient of the energy function (E was deﬁned in equation 9.7). Deﬁne scaled wavelet coeﬃcients as v = S −1 w where S = diag {s} for some vector of scaling coeﬃcients s.3. This deﬁnes appropriate directions for changes in the preconditioned coeﬃcients v. The Hessian of the energy expressed as a function of v is ∇2 E = S H P H H H HP S + S H AS v The ith diagonal entry of this equation is ∇2 E v ii = s2 ti i where ti is the ith diagonal entry of the matrix P H H H HP + A. The gradient is given by ∇v E = S H ∇w E.
we can also reverse . However. A negative way of looking at this is to say that calculating a good preconditioner involves the same eﬀort as solving the original equations directly. Calculate ti .7) is a quadratic function of w and hence the optimum can be found by setting the gradient equal to zero. Apply the blurring ﬁlter H to get HP ei . 2. wopt . 7. Also note that because these values (for pi ) depend on the choice of blurring ﬁlter and wavelet transform but not on the observed data they can be computed once and used for many diﬀerent test images. 4. Pick out the value of the ith coeﬃcient pi = P H H H HP ei i . Apply the spatially reversed blurring ﬁlter to get H H HP ei . To explain the analogy we ﬁrst derive the analytic solution to the energy minimisation problem. The diagonal entries of A are known (these are the inverses of the variance estimates) so consider the matrix P H H H HP . Invert the wavelet transform to get P ei . is given by wopt = P H H H HP + A Note that the factor P H H H HP + A −1 −1 P HHHy (9. ti = Aii + pi . The entry ti can be calculated by: 1. 5. The vector gradient of the energy is ∇E(w) = −P H H H y + P H H H HP w + Aw therefore the solution to the problem. The third type of preconditioning is based on analogy with the WaRD method [84]. 6.180 CHAPTER 9. We can therefore compute all the pi by applying this process once for each subband. DECONVOLUTION This method requires the precomputation of ti . Set all wavelet coeﬃcients to zero. The expression for energy (equation 9. to get a unit vector ei . except for the ith coeﬃcient which is set to 1. The value of pi depends only on which subband contains the nonzero coeﬃcient. 3.11) is exactly the same as the ideal preconditioner. Apply the wavelet transform to get P H H H HP ei .
The WaRD search direction is therefore given by ˆ g(i) = w. We now give the details of how this idea is applied. Wavelet transform the image xα . Invert the wavelet transform of the image.12) The denoising strategy used by the WaRD estimate is as follows: 1. On the basis of this analogy we will choose a search direction that is the wavelet denoised version of the image xα = F H M H MP Px F P (−∇Ew ) 2 x + ασ IN (9. On the basis of this logic we propose using the WaRD method as a preconditioner because ee have found that it gives a good ﬁrst approximation to solving the original equations.3. We can write the regularised linear ﬁltering used in the WaRD method as xα = F H Px F HHy 2I x + ασ N Px F P P HHHy = FH H M MPx + ασ 2 IN M H MP where Px is a diagonal matrix containing the estimated PSD of the image along the diagonal entries. 2. We deduce that in the WaRD method the rest of the terms together with the wavelet denoising should provide an approximation to the ideal preconditioner. . If we compare this equation with equation 9. The WaRD method consists of a linear ﬁltering stage followed by a wavelet denoising stage. Modify each wavelet coeﬃcient by wi = ˆ βi2 βi2 + γi2 wi (9.13) where βi2 is the estimated variance of the wavelet coeﬃcients due to our image model and γi2 is the estimated variance of the wavelets due to the noise (ampliﬁed by the inverse ﬁlter). We use the same strategy except that we are calculating a search direction in wavelet space and so we can omit the ﬁnal step. ITERATIVE SOLUTION 181 the logic to say that a reasonable method for solving the original equations will probably also give a reasonable preconditioning method.9.11 we spot the term P H H H y on the right of both equation. 3.
2. Multiplication by P is performed by an inverse wavelet transform. Multiplication by H is performed by the original blurring ﬁlter. 3.3 One dimensional search This section describes the contents of the Minimise Energy along search direction step in ﬁgure 9. Suppose we have an estimate w0 and a search direction δw . Multiplication by P H = W is performed by a forward wavelet transform. We compare the performance of the six diﬀerent search direction choices. These will be called . DECONVOLUTION 9. 9. The blurred signal to noise ratio (BSNR) is deﬁned as 10 log 10 ( y 2 /(256 ∗ 256)σ 2 ) and noise is added to make this 40dB (we assume that images have been scaled to have zero mean).4 Convergence experiments and discussion We consider the same problem studied by Neelamani et al [84] of the 256 × 256 Cameraman image blurred by a square 9 × 9point smoother. 4. Then if we add on a times the search direction w = w0 + aδw and we can express the energy as a function of a as 2E(a) = HP w0 + aHP δw − y 2 + wH + aδw H A (w0 + aδw ) 0 (9. For large blurring ﬁlters it is quicker to implement the linear ﬁlters using a Fourier transform.182 CHAPTER 9.14) We can minimise this expression by setting the derivative with respect to a equal to zero d(E(a)) = a HP δw 2 + aδw H Aδw da − δw H P H H H (y − HP w0 ) + therefore a= δw H P H H H (y − HP w0 ) − HP δw 2 δw H Aw0 = 0 δw H Aw0 + δw H Aδw When we want to evaluate this expression we never need to do any matrix multiplications because: 1.3. Multiplication by H H is performed by a reversed version h(−x. −y) of the blurring ﬁlter.2.
4. We use the oracle estimate for the power spectrum of the original image in order that the SNR will be a measure of the convergence of the algorithm rather than of the quality of the power spectrum estimate. 3. . The same initialisation is used for all methods and therefore all methods have the same performance at the start of iteration 1. CONVERGENCE EXPERIMENTS AND DISCUSSION 183 NOPRESD for the steepest descent method with no preconditioning. The ISNR actually decreases on several of the steps when the WaRD direction is used. 6.4. The CG algorithm gives better results than the SD algorithm for the PRE and NOPRE methods but not for the WaRD iterations. PRESD for the steepest descent preconditioned to have ones along the diagonal of the Hessian matrix. . Convegence is very slow without preconditioning (NOPRE). .9. x(10) } of restored images x ˆ produced by these algorithms. PRECG for the conjugate gradient algorithm used with the preconditioned system. The ﬁrst pass of the conjugate gradient algorithm uses a steepest descent search direction and therefore the CG and SD methods give the same performance at the start of iteration 2. 5. . 7. WaRDCG for search directions deﬁned by the conjugate gradient algorithm acting on the WaRD directions. NOPRECG for the conjugate gradient algorithm with no preconditioning. 2. Figure 9. x(2) . We observe the following characteristics of the plot: 1. The results from the preconditioned method (PRE) start at a low ISNR but steadily improve (a later experiment will show the performance over many more iterations).4 plots the improvement in SNR (ISNR) deﬁned by 10 log 10 ˆ x − y 2 / x − x(n) 2 ˆ for the sequence {ˆ (1) . The WaRD method achieves a high ISNR after the ﬁrst pass. but there is little subsequent improvement. WaRDSD for search directions deﬁned by the WaRD method. .
4: Performance of diﬀerent search directions using the steepest descent (x) or the conjugate gradient algorithm (o).184 CHAPTER 9. . DECONVOLUTION 12 11 10 9 WaRD ISNR/dB 8 7 6 5 4 3 1 PRE NOPRE 2 3 4 5 6 7 8 9 10 Iteration Figure 9.
05dB from using the conjugate gradient algorithm rather than the steepest descent algorithm.6 compares the performance for the PRECG. Figure 9. We will call this “WaRD initialisation”.4.5 plots the results of this experiment.05dB from using the preconditioned direction rather than the WaRD direction after 10 iterations. However. In the second experiment we use the WaRD method to initialise the wavelet coeﬃcients (step Initialisation of ﬁgure 9. The ISNR is still improving after ten iterations and the third experiment examines the improvement over 100 iterations. Note that this is the same as using a single pass of the algorithm with a WaRD direction based on an intialisation of both scaling and wavelet coeﬃcients to zero. as suggested by the ISNR results. for subsequent iterations we expect the oﬀdiagonal elements to become more signiﬁcant and therefore it is not surprising that the WaRD direction is less eﬀective. More precisely. ﬁnally settling around 11. In all of the ISNR plots of this section we have seen that . It can be seen that the PRECG method reaches the lowest energy. and another 0. Figure 9. We will discuss the unusual performance of the WaRD direction more at the end of this section. reaching its peak of 11.7 at the start of each iteration. We compare diﬀerent choices for the second search direction. WaRDCG. The preconditioned conjugate gradient search direction gives the best ﬁnal results. Figure 9. CONVERGENCE EXPERIMENTS AND DISCUSSION 185 The WaRD direction is designed to give an estimate of the deconvolved image based on the assumption that the signal and noise are diagonalised in wavelet space [58]. This again supports the argument that the WaRD method works best when used as it was originally designed rather than to construct search directions.13 to generate our initial wavelet coeﬃcient estimates.8) and then use the WaRD modiﬁcation step of equation 9.4.95dB within about 20 iterations.2). There is an improvement of about 0.8dB in ﬁgure 9. while the PRESD method requires about 100 iterations to reach the same ISNR level.5 that the WaRD intialisation means that the ISNR is about 11. while a single iteration of the WaRD direction (starting from the original initialisation of just the scaling coeﬃcients) only reached about 10. and PRESD methods on the same image.9dB. Note from ﬁgure 9. we calculate the wavelet transform of the image x0 (deﬁned in equation 9.9.3dB at the start of the start of the ﬁrst iteration. The WaRDCG method displays an oscillation of INSR with increasing iteration. The PRECG method performs best initially.7 plots the value of the energy function E(w) of equation 9. This is a reasonable initial approximation and consequently the WaRD direction works well the ﬁrst time. Note that we have a much narrower vertical axis range in this ﬁgure than before.
5 PRECG PRESD WaRDSD ISNR/dB NOPRE 11.7 11.6 11. .3 11.1 11 1 WaRDCG 2 3 4 5 6 7 8 9 10 Iteration Figure 9.4 11.5: Performance of diﬀerent search directions using the steepest descent (x) or the conjugate gradient algorithm (o) starting from a WaRD intialisation.9 11.2 11.8 11.186 CHAPTER 9. DECONVOLUTION 12 11.
5 11.6 11.6: Performance of diﬀerent search directions over 100 iterations 0.4.4 11.3 11.24 Energy /pixel 0.21 0.7: Value of the energy function over 100 iterations .9.18 0.23 0.25 0.26 0.17 0 PRECG 20 40 Iteration 60 80 100 WaRDCG Figure 9.1 11 0 20 40 Iteration 60 80 100 WaRDCG Figure 9.27 0.8 11.19 PRESD 0.7 ISNR/dB 11.9 PRECG PRESD 11. CONVERGENCE EXPERIMENTS AND DISCUSSION 187 12 11.2 11.22 0.2 0.
The poor choice of search direction means that some wavelet coeﬃcients are made large during these initial stages despite having an expected low variance according to the prior distribution. The observation energy is high. 3. This will tend to reduce the quality of the estimate. We choose ten iterations of the PRECG search direction with a WaRD initialisation as a reasonably fast and robust choice for the comparisons with alternative methods. We now suggest an explanation for how bad directions can cause such problems: 1. The observation energy decreases and the prior energy increases. The ﬁrst few search directions correct for the most signiﬁcant places where the observations disagree with the current estimate at the cost of increasing the size of some wavelet coeﬃcients. In our model the matrix A that deﬁnes the prior for a particular image has been generated from the image itself. and a “prior energy” that measures how well the wavelet coeﬃcients match our prior expectations3 . 2. Nevertheless. The poor choice of search direction means that the direction also introduces errors elsewhere in the image. This tends to improve the quality of the estimate. DECONVOLUTION the WaRDCG method behaves strangely in that the ISNR often decreases with increasing iterations. ﬁgure 9.188 CHAPTER 9. a “observation energy” that measures the degree to which the current estimate matches the observations. 3 Note that we are using the word “prior” in a very loose sense. At the start of the method the wavelet coeﬃcients are all zero and the estimated image is a relatively poor ﬁt to the observations. In each iteration the total energy (observation energy plus prior energy) decreases but the internal redistribution of energy between the two terms can cause a corresponding ﬂuctuation in the ISNR. Recall that the energy function of equation 9. . Subsequent directions attempt to correct for these incorrectly large wavelet coeﬃcients. The prior energy decreases but now at the cost of increasing the observation energy.7 has two terms. We have already argued that the WaRD direction should not be expected to produce sensible search directions except for the ﬁrst pass (for which it was designed) but it may still seem strange that the ISNR decreases. and the prior energy is zero.7 conﬁrms that the energy function decreases with every iteration. 4.
CMST for the cameraman image blurred with the satellitelike PSF. COMPARISON EXPERIMENTS 189 9. the cameraman image used in the previous section and an aerial image of size 256 by 256.5. .9.5 Comparison experiments We will compare the performance of algorithms on two images. This PSF is plotted in ﬁgure 9. sets which we will call This gives a product of four test data CMSQ for the cameraman image blurred with the square PSF.8. This alternative PSF is deﬁned as h(x.9. and an alternative 15 by 15 PSF more like a satellite blurring ﬁlter. IGNST for the satellite image blurred with the satellitelike PSF. the 9 by 9 smoother 50 50 100 100 150 150 200 200 250 50 100 150 200 250 250 50 100 150 200 250 Figure 9. IGNSQ for the satellite image blurred with the square PSF. The two test images (before blurring) are shown in ﬁgure 9. We compare two point spread functions (PSF). We will test the following algorithms Landweber 235 iterations of the Landweber method. The aerial image is provided by the French Geographical institute (IGN). y ≤ 7. used above. y) = 1 (1 + x2 ) (1 + y 2) for x. The number of iterations was chosen to maximise the ISNR for the CMSQ image.8: Test images used in the experiments.
8 tap ﬁlter set.02 6 4 2 0 −2 −4 −6 −6 −4 0 −2 2 4 6 Figure 9. The operation of each step is equivalent to averaging the operation of a DWT step over all possible translations.8 tap ﬁlter set. PRECGDWT The same algorithm as described in the earlier sections for complex wavelets.190 CHAPTER 9.9: Alternative PSF used in experiments. but using a real nondecimated wavelet formed from a biorthogonal 6.08 0. DECONVOLUTION 0. This algorithm is described in detail in appendix C.1 0.04 0. Oracle Wiener A Wiener ﬁlter using the (unrealisable) oracle power spectrum estimate. but using a real decimated wavelet formed from a biorthogonal 6.06 0. . Mirror The nondecimated form of mirror wavelet deconvolution. Wiener A Wiener ﬁlter using a power spectrum estimated from the observed data[48]. PRECGNDWT The same algorithm as described in the earlier sections for complex wavelets. PRECGDTCWT Ten iterations of the PRECG search direction starting from a WaRD estimate (using the standard DTCWT ﬁlters of the (1319) tap near orthogonal ﬁlters at level 1 together with the 14tap Qshift ﬁlters at level ≥ 2).
9.5. COMPARISON EXPERIMENTS
191
In each experiment we use a variance of σ 2 = 2. (For the convergence experiments the variance was about 1.7). Except for the Oracle Wiener method we will use realisable estimates of the power spectrum. In other words, all of the algorithms (apart from Oracle Wiener) could be performed on real data. The results of these experiments are tabulated in ﬁgure 9.10. Notice the following features of these results: Algorithm Landweber Wiener Oracle Wiener Mirror PRECGDTCWT PRECGDWT PRECGNDWT CMSQ 7.48 7.31 8.51 3.88 9.36 8.36 8.64 CMST 3.53 2.70 6.38 5.28 7.3 5.43 5.59 IGNSQ 7.49 8.00 9.11 4.71 9.83 8.84 9.28 IGNST 0.489 3.14 6.07 4.61 6.72 4.89 5.09
Figure 9.10: Comparison of ISNR for diﬀerent algorithms and images /dB 1. The realisable Wiener ﬁlter always performs worse than the oracle Wiener by at least 1dB. 2. The Landweber method always performs worse than the Oracle Wiener, but sometimes beats the standard Wiener ﬁlter. 3. The Landweber method has a very poor performance on the IGNST image. This illustrates the problems of an incorrect choice for the number of iterations. Further tests reveal that for the IGNST image the optimum performance is reached after 36 iterations, reaching a ISNR of 5.4dB. 4. The Mirror wavelet algorithm beats the standard Wiener ﬁlter for the satellite like blurring function (ST), but not for the square blur (SQ). 5. The nondecimated wavelet always performs better than the decimated wavelet. 6. The DTCWT always performs at least 0.5dB better than any of the other tested algorithms. It is possible to rank these performances into three groups:
192
CHAPTER 9. DECONVOLUTION
1. The Landweber, Mirror, and standard Wiener method. 2. The PRECGDWT, PRECGNDWT, and oracle Wiener method. 3. The PRECGDTCWT method. The methods in the second group are always better (in these experiments) than those in the ﬁrst group, and the method in the third group is always better than any other. Finally we attempt to duplicate the experimental setups of published results. Some authors [124] only present results as images and thus it is hard to compare directly but usually a measure of mean squared error (MSE) or improved signal to noise ratio (ISNR) is reported. The cameraman image with a uniform 9 by 9 blur and a blurred signal to noise ratio (BSNR) of 40dB was originally used by Banham and Katsaggelos [8] who report an ISNR of 3.58dB for Wiener restoration, 1.71dB for CLS restoration, and 6.68dB for their adaptive multiscale waveletbased restoration (Constrained Least Squares, CLS, restoration was described in section C.6 and is another deterministic restoration algorithm whose performance on this task will always be worse than the Oracle Wiener solution). Neelamani et al claim [84] that they use the same experimental setup and quote an ISNR of 8.8dB for the Wiener ﬁlter and 10.6dB for the WaRD method. There is a large discrepancy in the Wiener ﬁlter results. A small discrepancy is expected as diﬀerent power spectrum estimates result in diﬀerent estimates; Banham and Katsaggelos [8] explicitly state that that high frequency components of the spectrum are often lost or inaccurately estimated while Neelamani et al add a small positive constant to the estimate to boost the estimate at high frequencies. A close examination of the published ﬁgures reveals that in fact the setup is slightly diﬀerent for the two cases. Banham and Katsaggelos use a ﬁlter that averages the contents in a square neighbourhood centred on each pixel, while Neelamani et al use a ﬁlter that averages the contents in a square neighbourhood whose corner is at the pixel. This change in setup does not aﬀect the amount of noise added as the BSNR is insensitive to shifts, nor does it aﬀect the generated estimates. However, it does aﬀect the ISNR because the starting SNR (for the blurred image) is considerably lowered by a translation. Fortunately, the diﬀerence merely results in a constant oﬀset to the ISNR values. This oﬀset is given by the ISNR that results from using the centred blurred image rather than the displaced one. Let H represent the oﬀset ﬁlter and S the translation that centres the impulse response. The blurred image produced by Neelamani et al is given by Hx + n1 ,
9.5. COMPARISON EXPERIMENTS
193
while Banham and Katsaggelos produce an image of SHx+n2 where n1 and n2 are vectors of the noise added to the images. The diﬀerence ISNRof f set in the ISNR values for an ˆ image estimate x is therefore ISNRof f set = 10 log10 = 10 log10 = 10 log10 x − Hx − n1 2 − 10 log10 ˆ x−x 2 ˆ x − Hx − n1 2 x − x 2 2 x − SHx − n 2 ˆ x−x 2 2 x − Hx − n1 x − SHx − n2 2 x − SHx − n2 ˆ x−x 2
2
For the Cameraman image the value of this oﬀset is ISNRof f set = 3.4260dB when there is no noise added. Using a typical noise realisation reduces this to ISNRof f set = 3.4257dB. We see that the noise levels are very low compared to the errors caused by blurring. In our experiments we have followed the setup of Neelamani et al in using the displaced ﬁlter. For comparison we have calculated the results of the PRECGDTCWT and our version of standard Wiener on the same image. The results from the literature (including the adjusted results of Banham and Katsaggelos) are shown in table 9.11, our original results are printed in bold. In these results the CLS method gives the worst results while Algorithm CLS Wiener (Banham and Katsaggelos) Multiscale Kalman ﬁlter Wiener (Neelamani et al) WaRD Wiener (our version) PRECGDTCWT ISNR /dB 5.14 (1.71+3.43) 7.01 (3.58+3.43) 10.11 (6.68+3.43) 8.8 10.6 8.96 11.32
Figure 9.11: Comparison of diﬀerent published ISNR results for a 9 by 9 uniform blur applied to the Cameraman image with 40dB BSNR. the PRECGDTCWT method gives the best. The adjustment for the oﬀset ﬁlter shows that the WaRD method is 0.5dB better than the multiscale Kalman ﬁlter (instead of the claimed 4dB improvement), while the PRECGDTCWT method is 0.7dB better than the WaRD method (and 1.2dB better than the multiscale Kalman ﬁlter).
194
CHAPTER 9. DECONVOLUTION
Figure 9.12 displays the deconvolved images for our Wiener and PRECGDTCWT approaches. This setup is exactly the same as for the initial experiments in section 9.4.
Original image Observed image
Wiener denoised image (ISNR=8.96)
Restored image after 10 iterations (ISNR=11.32)
Figure 9.12: Deconvolution results for a 9 by 9 uniform blur applied to the Cameraman image with 40dB BSNR using the PRECGDTCWT method with WaRD initialisation. The results for our method are slightly worse here (11.32dB instead of 11.9dB) because we are now using a realisable estimate of the power spectrum. From ﬁgure 9.12 we can see that the results of the PRECGDTCWT method are considerably sharper and possess less residual noise than the results of the Wiener ﬁlter. Belge et al use a Gaussian convolutional kernel [11] h(x, y) = 1 exp −(x2 + y 2 )/(2σx σy ) 4σx σy
with σx = σy = 2 to blur the standard 256 × 256 Mandrill image and add zero mean white Gaussian noise to achieve a BSNR of 30dB. This is an unusual way of writing the kernel
9.5. COMPARISON EXPERIMENTS
195
2 2 (normally there would be a factor of π for normalisation and σx σy would be used to divide
x2 + y 2 ) but this is the kernel speciﬁed in the paper [11]. Their results are presented in root mean square error ( RMSE = ˆ (1/N 2 ) x − x 2 ) which we have converted to ISNR values (ISNR = −20 log10 (RMSE/R0 ) where R0 is the RMSE of the blurred image). They compare their method to CLS and a total variation algorithm. Table 9.13 compares these results with the PRECGDTCWT method (using a realisable power spectrum estimate). Our original results are written in bold. We see that in this experiment the PRECGDT
Algorithm CLS TV Adaptive edgepreserving regularization PRECGDTCWT
ISNR /dB 0.716 0.854 0.862 1.326
Figure 9.13: Comparison of diﬀerent published ISNR results for a Gaussian blur applied to the Mandrill image with 30dB BSNR. CWT method improves the results by 0.46dB compared to the adaptive edgepreserving regularization method. The original, blurred, and restored images using our method are shown in ﬁgure 9.14. One warning should be attached to these results: the deﬁnition of SNR is not explicitly stated in the reference, we assume the deﬁnition (based on the variance of the image) given in section 9.4. Sun [115] used a uniform 3 by 3 blur and 40dB BSNR acting on a 128 by 128 version of Lenna to test a variety of Modiﬁed Hopﬁeld Neural Network methods for solving the Constrained Least Squares formulation. Sun tested three new algorithms (“Alg. 1”, ”Alg. 2”, ”Alg. 3”) proposed in the paper [115] plus three algorithms from other sources (the “SA” and “ZCVJ” algorithms [133], and the “PK” algorithm [92]). We claim in section C.6 that the converged solution must be worse than the Oracle Wiener estimate, but acknowledge that intermediate results may be better. We tested the PRECGDTCWT method (using a realisable power spectrum estimate) and two choices of Wiener ﬁlter (the oracle Wiener ﬁlter, and a Wiener ﬁlter based on the same power spectrum estimate as used in the PRECGDTCWT method) on this problem. The results of all these comparisons is shown in ﬁgure 9.15. Our original results are written in bold.
196 CHAPTER 9. DECONVOLUTION Original Blurred Restored Figure 9. .14: Deconvolution results for a Gaussian blur applied to the Mandrill image with 30dB BSNR using the PRECGDTCWT method with WaRD initialisation.
91 6.41 8. in order to achieve a bounded variation in the ampliﬁcation for a particular subband.84 6. the subbands have a tight frequency localisation for high frequencies.13 6. The PRECGDTCWT method does particularly well in this case4 .38 5.15: Comparison of the PRECGDTCWT and Wiener ﬁltering with published results of Modiﬁed Hopﬁeld Neural Network algorithms for a 3 × 3 uniform blur applied to the Lenna image with 40dB BSNR.19dB. 9. 1 Alg. However. In contrast.5. while a second term (the likelihood) is used to describe the observation model and makes explicit use of the PSF.85 7.5.1 Discussion Mirror wavelets are designed for hyperbolic deconvolution. but almost 1dB worse than the Oracle Wiener estimate. The best of the previously published results is the “SA” algorithm which attains an ISNR of 7.9.19 5. This is an appropriate model for the satellitelike PSF. outperforming the “SA” algorithm by 2. the 9 by 9 smoothing ﬁlter (SQ) has many zeros in its frequency response and consequently the mirror wavelets are inappropriate and give poor results. A change in PSF requires a change in the likelihood term but the same 4 In this method we use a centred blurring ﬁlter to avoid the artiﬁcial BSNR improvement described earlier. A better performance could be achieved by designing a more appropriate wavelet transform but no single wavelet transform will be best for all blurring functions. 2 Alg. This is better than the realisable Wiener ﬁlter results. 3 SA ZCVJ PK Oracle Wiener Realisable Wiener PRECGDTCWT ISNR /dB 6. COMPARISON EXPERIMENTS 197 Algorithm Alg. .90 Figure 9. The inverse ﬁltering produces large noise ampliﬁcation for high frequencies and.37 9.7dB. the Bayesian approach uses one term (the prior) to encode the information about the image using wavelets.
In real world applications the following isses would need to be addressed: 1. The most promising direction for further research is by taking account of the correlations between wavelet coeﬃcients. This approach has already been shown to be promising for standard denoising when there is no blur (as described in chapter 3). including the Landweber or Van Cittert iterative techniques. The signal energy near diagonal edges will therefore tend to be concentrated in a smaller proportion of the wavelet coeﬃcients than for a real wavelet transform and hence will be easier to detect.15dB better than the NDWT. DECONVOLUTION prior wavelet model should remain appropriate. the worst errors occur near edges and the DTCWT is able to distinuish edges near 45◦ from those near −45◦ . Therefore the same wavelet method gives good performance for both of the blurring functions. It may be possible to use the HMT (Hidden Markov Tree [24]) to deduce the likely presence of large wavelet coeﬃcients (at a ﬁne detail scale) from the presence of large coeﬃcients at coarser scales and hence improve the estimation. The nondecimated wavelet transform outperforms the decimated wavelet transform. The decimated wavelet gives shift dependent results.4). Deconvolution methods tend to produce rather blurred estimates near edges in the original image that signiﬁcantly aﬀect both the SNR and the perceived quality of the restoration. All the results here are based on simulated data in order to allow the performance to be objectively measured. Note in particular that the PRECGDTCWT method outperforms even the Oracle Wiener method and consequently will perform better than any version of standard Wiener ﬁltering. The estimation of the noise variance and the Point Spread Function (PSF) of the blurring ﬁlter. If we now look at the relative performance of diﬀerent wavelets we see a familiar result. .4. However. We have achieved our goal of comparing the performance of complex wavelets with decimated and nondecimated real wavelets in a practical deconvolution method but we have certainly not “solved” deconvolution or even fully exploited the potential of complex wavelets in this application. 2. The degree to which the PSF is linear and stationary.2dB. the improvement is only about 0. It is not hard to see a plausible reason for this. and shift dependence will always tend to cause worse performance for estimation tasks like this one (as discussed in section 8.198 CHAPTER 9. A much larger improvement is gained from using the DTCWT which is an average of 1.
6. The WaRD algorithm gives a good starting point for the method but provides inadequate subsequent directions. Shift dependence therefore has a small eﬀect on performance. . 3. including methods based on the Landweber or Van Cittert iteration. The NDWT outperformed the DWT in this approach by about 0. 2. 5.15dB. CONCLUSIONS 199 3.9. The DTCWT outperformed the NDWT by an average of 1. In summary. 7. complex wavelets appear to provide a useful Bayesian image model that is both powerful and requires relatively little computation. Such minimax algorithms must be tuned to the particular blurring case. 4.6 Conclusions We conclude that 1. The method based on the DTCWT performed better than all the other methods tested and better than the published results on similar deconvolution experiments. The Mirror wavelet method performed badly on the 9 by 9 uniform blur due to the presence of extra zeros in the response. The degree to which a Gaussian noise model is appropriate. 8. and hence are worse than Oracle Wiener ﬁltering.2dB. The DTCWT method performed better than the Oracle Wiener and hence better than all versions of standard Wiener ﬁltering. 6. 9. The Landweber and Van Cittert iterative algorithms are special cases of Wiener ﬁltering. The preconditioned conjugate gradient algorithm provides sensible search directions that achieve good results within ten iterations.
DECONVOLUTION .200 CHAPTER 9.
and 9. The exception is chapter 8 on interpolation. we aim to compare complex wavelets with alternative wavelet transforms. The complex wavelet models were found to be particularly good for segmentation of diﬀerently textured regions and image deconvolution. Nevertheless this application still supports the thesis because the new method is much faster than the nondecimated method. Many peripheral results have already been mentioned in the conclusions section at the end of each chapter and we will not repeat them here.Chapter 10 Discussion and Conclusions The aim of the dissertation is to investigate the use of complex wavelets for image processing. There are two main reasons 201 . In this chapter we explain how the contents of the dissertation support the thesis that complex wavelets are a useful tool and then discuss the wider implications of the research. 6. These improvements can be seen qualitatively in the synthesized textures of chapter 4 and most clearly quantitatively in chapter 9. For most of the applications the complex wavelet method also gives better results than the nondecimated wavelet transform. For this application the complex wavelet method produces almost exactly the same results as the nondecimated transform. For every application the experimental results for the complex wavelet methods display an improvement in accuracy over the standard decimated wavelet methods. We have examined four main image processing tasks that are described in chapters 5. These cases provide the main experimental justiﬁcation that complex wavelets are useful for image processing. Now we describe the theoretical support for the thesis. In particular. First we describe the experimental support for the thesis. 8. For each application we have compared wavelet methods with alternative methods to determine when the wavelets are useful.
The ﬁrst is increased directionality. DISCUSSION AND CONCLUSIONS why the complex wavelets are expected to give better results. Approximate shift invariance 5. The extra subbands also give a better model for the object edges that commonly appear in images and this results in the improved deconvolution performance of chapter 9. In this case a solution based on the Gaussian Pyramid transform would be both faster and less shift dependent. The models were found to be too simple for synthesizing more regular textures like brickwork. Near balanced transform 4. In chapter 4 we explain why the extra subbands are necessary for synthesizing texture with a diagonal orientation. As a natural corollary we explain in chapter 5 why the extra features are useful for segmentating textures with diagonal features. Six directional subbands at each scale (when used to analyse images) 3.1 Discussion The experimental comparisons did not always favour a complex wavelet model. Complex outputs . 10. Chapter 8 calculates an approximation for the reduction in SNR caused by shift dependence for interpolation that predicts that complex wavelets should achieve a signiﬁcant increase in quality compared to a typical real decimated wavelet. It is usually clear why this should increase performance although the precise amount of improvement will be strongly dependent on the nature of the input images. Chapter 2 proves that any nonredundant wavelet system based on short ﬁlters will have signiﬁcant shift dependence. The DTCWT has a number of properties that are beneﬁcial in diﬀerent circumstances: 1. The second main reason for improved results is the reduction in shift dependence as compared to the standard fully decimated wavelet transform.202 CHAPTER 10. Therefore qualitative explanations are given rather than mathematical proofs. The models were also found to be unnecessarily complicated for interpolating a stationary random process with an isotropic autocorrelation function. Perfect reconstruction 2.
10. It is the author’s hope that this . The experimental results of this dissertation conﬁrm this connection.1: Summary of useful properties for diﬀerent applications We would expect complex wavelets to be most useful for the applications (such as deconvolution) that require all of the properties.1 summarises the importance of these properties for a number of applications.2 Implications of the research It is well known that shift dependence often causes a signiﬁcant degradation in performance. This dissertation provides evidence that the beneﬁts of such a nondecimated transform can usually be achieved with only a minor increase in redundancy and computational time by means of a decimated complex wavelet transform. B The applications we have tested that are not described in this dissertation but have been published elsewhere [33. C Applications in the literature described in chapter 3. IMPLICATIONS OF THE RESEARCH 203 Table 10. 34]. A √ indicates that the property is useful for the corresponding application.C) Levelset segmentation (B) Motion Estimation (C) Denoising (C) Perfect reconstruction √ √ √ √ √ Six subbands √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ Near balanced √ Shift invariance √ √ √ √ √ √ √ Complex outputs Figure 10.10. We include three types of application: A The applications we have tested that are described in the main body of the dissertation. Application Texture synthesis (A) Texture segmentation (A) Autocorrelation synthesis (A) Interpolation (A) Deconvolution (A) Texture database (B. Consequently many wavelet based methods rely on the nondecimated form of the wavelet transform.2.
but on the stronger claim that the DTCWT often improves the results over even nondecimated real transforms. . DISCUSSION AND CONCLUSIONS dissertation will help to add complex wavelets to the list of good general purpose transforms that are automatically considered for a new problem. This is not only on the grounds that the DTCWT provides an eﬃcient substitute for the NDWT.204 CHAPTER 10.
This chapter discusses possible future research directions for these tasks and suggests some additional applications. A single complex wavelet transform could be used for detecting both texture and the object edges. In some preliminary work along these lines we have found that it is possible to signiﬁcantly improve the coarse estimates from this simple scheme using a reassignment technique [6]. Texturebased segmentation will not always be appropriate and it may be possible to combine the segmentation method described here with more traditional edgebased segmentation algorithms. We have proposed a number of simple methods based on the DTCWT that produce good results. Large complex wavelet coeﬃcients correspond to edges in an image and a simple edge detector can be built by simply detecting such large coeﬃcients.1 Segmentation We have demonstrated the power of the complex wavelet features for supervised texture segmentation. This method is appropriate for the task of classifying satellite imagery into urban and nonurban regions but images taken at more moderate distances of real world objects will contain a mixture of image types. At each position we have responses in the six bandpass subbands which allow the orientation to be estimated.Chapter 11 Future work In this dissertation we have shown how complex wavelets can be used on a small selection of image processing tasks. 11. Another possibility is to extend the Hidden Markov Tree (HMT) model [28] to unify texture and edge based segmentation by adding extra hidden states that encode a form of 205 .
11.2 Texture synthesis It would be interesting to determine additional features that can be used to improve the synthesis performance. For example. FUTURE WORK image grammar. Superresolution is the name for the process of constructing a single high . or even a combination of these. There has been a large amount of research into how the human visual system detects and processes structure in images. by the presence of large wavelet coeﬃcients near their boundaries.3 Deconvolution We mentioned in chapter 9 that the most promising direction for future research in deconvolution is taking account of the correlations between wavelet coeﬃcients. Such Gabor functions have shapes similar to complex wavelets. Marr [78] proposed the concept of the “full primal sketch”. It may be possible to encode measures of persistence that will tend to group large valued wavelet coeﬃcients together. 11. It may even be possible to use the HMT directly for object recognition if a suﬃciently sophisticated grammar is used. For example. This grammar could be used to generate regions that can be recognised by their texture content. An alternative direction is the possibility of using the method for a “superresolution” application. the texture synthesis method performs poorly on piecewise smooth images. In the synthesized images the energy tends to be spread more uniformly across the image. 50].206 CHAPTER 11. By using models such as the HMT to give a better prior model for images we hope that the results will also improve. A piecewise smooth image has large valued wavelet coeﬃcients at the edges of regions while the wavelet coeﬃcients inside the regions have small values. It may be possible to connect the low level features provided by complex wavelets with higher level structure extraction processes in order to achieve better texture synthesis or better image understanding. Hubel and Wiesel performed a famous study into the responses of single neurons at an early stage in the visual system and discovered responses that were frequency and orientation selective and were similar to Gabor functions [49. In the full primal sketch groups between similar items are made and information about their spatial arrangement is extracted.
For real numbers the 1D DTCWT only needs to possess 1 high frequency subband for each scale as the spectrum of real signals is the same for positive and negative frequencies. However. For example. An alternative approach to shape modelling is to represent each point (x. Using such an extended DTCWT on the sequence of complex numbers mentioned above will produce (complex valued) wavelet coeﬃcients with the following properties: 1.4 Other possibilities We have been using the complex wavelet transform for image processing but it can also be used in spaces of both greater and smaller dimension. Anticlockwise curves will be represented by wavelet coeﬃcients corresponding to positive frequencies. For these data sets analogous segmentation techniques can be used to identify diﬀerent biological structures. the author is also investigating the application of the DTCWT to 3D data sets (such as from medical imaging techniques). A translation of the contour will only alter the lowpass coeﬃcients. the 1D DTCWT can easily be extended to produce subbands for both positive and negative frequency.11. if a low resolution video camera is used to ﬁlm a document then. A rotation by θ of the contour will alter the phase of every coeﬃcient by θ. 11. . The basic mathematics is very similar but there is the added complication of having to estimate an appropriate transformation to place all of the images onto a common reference grid. 2.4. while individual frames may be unreadable. 3. it may be possible to construct a readable estimate by combining the information from several frames. For example. Clockwise curves will be represented by wavelet coeﬃcients corresponding to negative frequencies. 4. y) along a contour by the complex number x + jy to produce a onedimensional sequence of complex numbers. The DTCWT can also be used for 1D applications. We have used the DTCWT to represent regions with smooth boundaries via a levelset approach [34]. OTHER POSSIBILITIES 207 quality image from multiple low quality views of the same image.
Such a model should be useful for recognition or coding of contours. A rescaling by a factor of r of the contour will change the magnitude of every coeﬃcient by a factor of r. FUTURE WORK 5.208 CHAPTER 11. .
3) Now consider the trace of W T W (given by the sum of the diagonal elements) j=N tr(W W ) = j=1 T WTW j=N i=M jj (A.Appendix A Balance and noise gain A. E(wi ) is given by the variance because E(wi ) = 0 and so the expected energy in the wavelet coeﬃcients is i=M i=M 2 wi i=1 E = i=1 2 E wi i=M j=N (A.5) . .4) = j=1 i=1 WT 209 ji Wij (A.1 Ampliﬁcation of white noise by a transform Consider applying independent white noise of variance σ 2 to each of the inputs {x1 . .1) and so wi has a N(0. xN } of a real transform represented by w = W x where x ∈ R N . M and N are positive integers. . w ∈ R M . σ 2 j=N j=1 2 2 Wij ) distribution. and W is a real M ×N matrix but there is no restriction on the relative sizes of M and N.2) 2 Wij = σ2 i=1 j=1 (A. . We ﬁrst calculate an expression for the expected energy in the wavelet coeﬃcients. The ith wavelet coeﬃcient wi is given by j=N wi = j=1 Wij xj (A.
210 Appendix A. If W has size M by N and now M ≥ N then we can take the singular value decomposition to give three real matrices . .14 we are now in a position to write down a ﬁrst expression for the noise gain g. Suppose now we consider the model described in section 2.dN Consider a real linear transform represented by w = W x.7 and A.. In words. the energy of the error is given by the energy of the output of the linear transform P applied to a vector of white noise. = M i=1 j=1 ij A. Using the ﬁrst result of this section we can write that the expected energy of the error is given by tr(P T P )σ 2 .7) Putting equations A.3 together we get the desired result that the expected total output energy is tr(W T W )σ 2 .6) = (A.1. We have wavelet coeﬃcients v consisting of the original wavelet coeﬃcients w = W x plus a vector n containing independent white Gaussian noise of mean zero and variance σ 2 . v =w+n If P is a matrix representing reconstrution ﬁltering (that satisﬁes PR so that P W = IN ) then the expected energy of the error is given by E x−y 2 = E = E = E x − Pv 2 2 2 P W x − P (w + n) Pn .2 j=N i=M = j=1 i=1 i=M j=N Wij Wij 2 Wij i=1 j=1 (A.5.2 Deﬁnition of d1.. Using deﬁnition 2. g = E { y − x 2} E { v − w 2} tr(P T P )σ 2 = Mσ 2 tr(P T P ) = M N M 1 P 2.
10) = xT W T W x = xT V S T U T USV T x = xT V S T SV T x = yT S T Sy i=N (A. For a matrix of size n × n this is equivalent [17] to saying that the rows form an orthonormal basis of be the square of the ith singular value: 2 di = Si.i . then the deﬁnition of a frame [30] says that a set of wavelets give a frame if and only if there exists real values for A and B such that 0 < A ≤ B < ∞ and ∀x ∈ R N A x Consider W x 2 . Note that . A. (A. S.1 . .8) R n . • S has size M by N and is zero except for entries on the main diagonal S1.3 211 U. ≥ dN .9) Without loss of generality we can order these such that d1 ≥ d2 ≥ .14) (A.15) i=N i=1 2 di yi varies = i=1 2 di y i where y = V T x..Appendix A. All the di are real and nonnegative and so clearly between dN y 2 and d1 y 2 as dN and d1 are the smallest and largest of the di .13) (A..) di is deﬁned to (A...3 Determining frame bounds If we write a set of wavelets operating on a ﬁnite number of input samples in matrix form.N .12) (A. SN.11) (A. • V has size N by N and is an orthogonal matrix. V such that W = USV T where • U has size M by M and is an orthogonal matrix.. (A matrix is deﬁned to be orthogonal if U T = U −1 . Wx 2 2 ≤ Wx 2 ≤B x 2 (A.
x = xT x = xT V V T x = V T x 2 = y 2.17) (A.212 Appendix A. Putting these last results together we discover that ∀x ∈ R N dN x 2 ≤ Wx 2 ≤ d1 x 2 (A.19) (A. (A.23) (A. This means that the tightest possible frame bounds for the transform are dN and d1 and that the wavelets associated with the transform form a frame if and only if dN > 0.18) (A.5 by writing ek for the vector in R N with a 1 in the kth place and zeros elsewhere. Also note that because V T V = V V T = I. A.20) (A. we can 2 attain these bounds by y = eN or y = e1 .24) . From A.16) with the bounds attainable by x = V eN or x = V e1 . The input energy is σ 2 for each of the N inputs and so the signal energy gain is tr(W T W )σ 2 1 tr(W T W ) = 2 Nσ N 1 tr(V S T U T USV T ) = N 1 tr(V S T SV T ) = N 1 tr (SV T )T SV T = N 1 = tr SV T (SV T )T N 1 = tr SV T V S T N 1 = tr(SS T ) N i=N 1 di = N i=1 where we have made use of the result tr(AT A) = tr(AAT ).1 we know that the expected energy in the wavelet coeﬃcients is given by tr(W T W )σ 2 .22) (A. Therefore the gain in signal energy is given by the average of the di .21) (A.4 Signal energy gain The deﬁnition of a frame says that (except for tight frames) the energy of a signal can change as it is transformed (within certain bounds) and so we deﬁne the signal energy gain as the gain in energy for a theoretical white noise input.
. Suppose that the inversion matrix P has rows qT . We can solve for the minimum noise gain reconstruction by separately solving the problem of inverting to get each of the xi .29) (A. qT .. Section A.31) . W T W will be invertible if and only if all the singular values are nonzero which will be true if and only if the associated wavelets form a frame. This is i subject to (qT W )T = W T qi = ei where ei is deﬁned as in i A.25) (A.5 Reconstruction noise gain bound Consider the problem of inverting w = W x.28) 2 2 subject to qT W x = xi . i Putting all the separate solutions together we discover that the minimum noise gain perfect reconstruction matrix Q is given by Q = (W T W )−1 W T .26) (A. If M > N then the transform is redundant and there are many choices for the reconstruction matrix.1 shows that the noise gain is given by the sum of the squares of the entries in the inversion matrix P ..3. Note that W T W must be invertible for this solution to exist.5 213 A.Appendix A. This is a standard problem whose solution is given by qi = W (W T W )−1 ei and so S T S is the diagonal N by N matrix with diagonal entries of di and so S T S is always invertible as these di are all nonzero.27) (A. Putting white noise of variance σ 2 in each wavelet we have a total expected energy of Mσ 2 in the wavelets.30) (A. We seek the solution with minimum noise gain. We assume that the wavelets form a frame in order for a PR system to be achievable.. The ith row qT is involved 1 N i only in producing xi and so we need to minimise qi equivalent to minimising qi qT = ei (W T W )−1 W T . We can now substitute the singular value decomposition for W to get Q = (V S T U T USV T )−1 V S T U T = (V S T SV T )−1 V S T U T = (V T )−1 (S T S)−1 V −1 V S T U T = V (S T S)−1 S T U T (A.1 we expect an energy of tr(QT Q)σ 2 after reconstruction and so we can now calculate the expected noise gain: tr(QT Q)σ 2 1 = tr(QT Q) Mσ 2 M 1 = tr((V (S T S)−1 S T U T )T V (S T S)−1 S T U T ) M 1 = tr((US(S T S)−1 V T )V (S T S)−1 S T U T ) M (A. From A.
7 we ﬁnd that the unbalance is tr (P T − W )T (P T − W ) .36) Q represents the transform with minimum noise gain and we conclude that any linear perfect reconstruction transform that is used to invert W has noise gain bounded below by 1 M i=N 1 i=1 di and this lower bound is achievable. A.1 we know that the noise gain of any linear perfect reconstruction transform.7 = = = = = 1 tr(US(S T S)−1 (S T S)−1 S T U T ) M 1 tr((S T S)−1 S T U T US(S T S)−1 ) M 1 tr((S T S)−1 S T S(S T S)−1 ) M 1 tr((S T S)−1 ) M i=N 1 1 M i=1 di (A.35) (A.40) . used to invert W is given by Consider the unbalance between P T and W.37) = tr(P P T ) − tr(W T P T ) − tr(P W ) + tr(W T W )(A.214 Appendix A. We deﬁne the unbalance to be the sum of the squares of the diﬀerences between the two matrices and so from equation A.7 Relation between noise gain and unbalance tr(P T P ) . P .6 Consequences of a tight frame If the frame is tight then d1 = dN and so all the singular values are equal. A.32) (A.38) (A. M From section A. We can write S T S = IN and so the matrix Q representing a reconstruction with the least noise gain becomes Q = V (S T S)−1 S T U T = V S T U T = W T .39) (A. From before we know that the sum of the singular values is N and so d = 1.34) (A. and this inversion achieves the lower bound on noise gain. Therefore for a tight frame the transform can be inverted by the matrix W T . We can expand this expression to get: tr (P T − W )T (P T − W ) = tr P P T − W T P T − P W + W T W = tr(P T P ) − 2tr(P W ) + tr(W T W ) = tr(P T P ) − 2N + N (A.33) (A.
.41) where we have used that P W = IN (as P is a perfect reconstruction transform) and that tr(W T W ) = N (from the normalisation condition). We can rearrange this last result to ﬁnd that: g = (N + U)/M where g = tr(P T P ) M (A.Appendix A.42) is the noise gain of the reconstruction and U = tr (P − W T )(P T − W ) is the unbalance.7 215 = tr(P T P ) − N (A.
7 .216 Appendix A.
Lemma 1 If Z and Y are independent zero mean wide sense stationary discrete Gaussian random processes. The results are not original but are included (expressed in the notation of this dissertation) for the sake of completion. Proof. Although some of the proofs are long. they are all relatively straightforward. and that E {Za } = E {Zb } = 0 as the processes are zero mean. then the covariance of Z + Y is given by the sum of the covariances of Z and Y. The covariance RZ+Y of the sum of the random processes is given by RZ+Y = E {(Za + Ya ) (Zb + Yb)  b − a = d} = E {Za Zb + Za Yb + Ya Zb + Ya Yb  b − a = d} = E {Za Zb  b − a = d} + E {Za Yb  b − a = d} +E {Ya Zb  b − a = d} + E {Ya Yb  b − a = d} = RZ (d) + E {Za  b − a = d} E {Yb  b − a = d} +E {Ya  b − a = d} E {Zb  b − a = d} + RY (d) = RZ (d) + RY (d) where we have made use of E {AB} = E {A} E {B} for independent random variables. We have also made use of 217 .Appendix B Useful results B.1 Summary This appendix contains a number of useful mathematical results. Let RZ (d) be the covariance of Z for vector displacement d and similarly let RY (d) be the covariance of Y.
218 Appendix B. If f (0) = A then it is easy to show the ﬁlter is of the form f (r) = A exp{kr 2 }. Proof. Lemma 3 1 1 exp − (z − a)T A (z − a) exp − (z − b)T B (z − b) 2 2 ∝ exp − 1 2 z − (A + B)−1 (Aa + Bb) T (A + B) z − (A + B)−1 (Aa + Bb) . Then as the ﬁlter is separable we know that f (r) = g(x)h(y) and if we assume f (0) = 1 we can adjust the scaling of g and h such that g(0) = h(0) = f (0) = 1. Therefore w(a) = ka for some constant k and we can write the ﬁlter as f (r) = exp{w(r 2)} = exp{kr 2 } thus showing that the ﬁlter must be a Gaussian.1 the equivalence between correlation and covariance for zero mean processes. Then we can set y = 0 to ﬁnd f (x) = g(x)h(0) = g(x) and similarly x = 0 to ﬁnd h=g=f This means that we have the following relationship f (r) = f (x)f (y) Taking logarithms and deﬁning w(x2 ) = log f (x) we ﬁnd w(x2 + y 2 ) = w(x2 ) + w(y 2) and so w(a) is a linear function with w(0) = log f (0) = log 1 = 0. Suppose the ﬁlter is given by f (r) where r is the radius. Lemma 2 The only separable circularly symmetric ﬁlter is a Gaussian. noting that Z + Y will also have zero mean.
−1 2 C D I/σM 0 + DT σ 2 0T 0 C D = − − T D σ 2 − C C D T 2 IσM +C −1 C D D −1 2 I/σM 0 D 0T T 0 DT σ 2 C D −1 T + C C D DT σ 2 −1 DT σ 2 C D 2 I/σM 0 0 C D 0 D σ 2 2 IσM +C C D T T 2 IσM +C −1 C D . D is a S × 1 vector. This is a special case of the matrix inversion lemma. 1 1 exp − (z − a)T A (z − a) exp − (z − b)T B (z − b) 2 2 1 = exp − (z − a)T A (z − a) + (z − b)T B (z − b) 2 1 = exp − z T Az − 2z T Aa + aT Aa + z T Bz − 2z T Bb + bT Bb 2 1 = exp − z T (A + B) z − 2z T (Aa + Bb) + aT Aa + bT Bb 2 1 T z − (A + B)−1 (Aa + Bb) (A + B) z − (A + B)−1 (Aa + Bb) = k exp − 2 where k = exp − 1 − (Aa + Bb)T (A + B)−1 (Aa + Bb) + aT Aa + bT Bb 2 Lemma 4 If C is a S × S symmetric matrix. but we shall prove it directly by multiplying the RHS by the inverse of the LHS. I is the S × S identity matrix.Appendix B.1 219 Proof. 0 is a S × 1 zero vector. then −1 −1 2 C D I/σM 0 + = T T 2 0 D σ 0 C D T D σ 2 − C D T 2 IσM +C −1 C D Proof.
2 DT σk (B.220 Appendix B. Z2 . This is a multivariate Gaussian distribution that can be written in the following form: Γ Zk C D s N 0. Consider the a priori joint distribution of this random variable with the random variables Z1 .2 = − = 2 2 C/σM D/σM 0 T 0 D −1 +I− C D 2 C/σM + I − I 0 T −1 2 IσM +C −1 C D C 2 (IσM +C) DT σ 2 2 2 C/σM D/σM T DT σ 2 +I− 2 C + IσM T 0T 2 IσM +C 2 (IσM +C) −1 C D −1 2 /σM 0 + 0 0 C D I 0T −1 2 IσM +C C D − 0T C D = 2 2 C/σM D/σM 0 + T 0 −1 +I− C D +I− 2 C + IσM 0 − I 0 T T 2 IσM +C −1 −1 C D 2 /σM 2 (IσM +C) 2 (IσM +C) 0T 2 2 C/σM D/σM T 0T C D 2 /σM C D = = I 0 0 B. Suppose we wish to obtain a point estimate for the random variable Zk corresponding to location xk (we assume k > S). The observation model has been described in section 8.2 and we use the same notation as in chapter 8. . . ZS corresponding to the sample locations.1) . .2 Bayesian point inference This section describes the construction of the posterior distribution for the value at a point in the case of noisy irregular sampled data from a wide sense stationary discrete Gaussian random process. .
C is the covariance between the values at the ﬁrst S locations. Γ = γ) is deﬁned by equation B. Γ = γ  Y = y) = k exp − y − γ 2 1 2 /2σ 2 exp − T γ z T C D γ −y z T D 2 σk −1 z z IS σ 2 0 1 γ−y = k exp − 2 z 0T 0 T −1 C D γ 1 γ exp − T 2 2 D σk z z where k is a normalisation constant that ensures that the expression is a valid pdf.2 and so we can expand this equation to p(Zk = z.Appendix B. and σk is the variance of Zk . Γ = γ  Y = y) ∝ exp − where γ z −a A−1 γ z −1 −a A = IS /σ 0T 2 0 0 + C D −1 2 DT σk a = A IS /σ 2 0 0T 0 −y 0 . Γ = γ) is deﬁned by the distribution in equation B. Γ = γ  Y = y) = p(Y = y  Zk = z. Γ = γ)p(Zk = z. Using Bayes’ theorem we can write p(Zk = z.2 221 where we have stacked the ﬁrst S random variables into a column vector Γ.3 can be expressed as Y s N Γ. σ2 IN (B. D is the covariance between Zk and 2 the random variables for the ﬁrst S locations.1 and the likelihood pdf p(Y = y  Zk = z. Γ = γ) p(Y = y) The prior pdf p(Zk = z.2) where σ 2 is the (known) variance of the measurement noise. Using lemma 3 we can write that 1 2 T p(Zk = z. The measurement equation 8.
If we write Zk as Zk = 0 1 T Γ Zk we can use the algebraic identity proved in lemma 4 to simplify A and calculate that Zk has a normal distribution with mean 0 1 T T a = 0 1 0 1 A − T y/σ 2 0 C D T = − D 2 σk − C D T σ 2 IS + C −1 C D −y/σ 2 = − 0 D 2 σk T − DT σ 2 IS + C −1 −1 C D −y/σ 2 0 −1 = DT y/σ 2 − DT σ 2 IS + C = DT σ 2 IS + C = DT σ 2 IS + C −1 −1 Cy/σ 2 Cy/σ 2 σ 2 IS + C y/σ 2 − DT σ 2 IS + C y.2 = A −y/σ 2 0 and so we have proved that the joint posterior distribution is a multivariate Gaussian distribution with mean a and covariance matrix A. .222 Appendix B. We are now able to compute the posterior distribution for Zk alone.
2. Add a point to the restored image at the peak position of strength s multiplied by a damping factor γ known as the loop gain.1. The steps at the k th iteration are 1.Appendix C Review of deconvolution techniques This appendix reviews a number of deconvolution methods from a Bayesian perspective. The emphasis in this review is on the estimates produced by the diﬀerent approaches rather than on the methods used to solve the minimisation problem. Find the strength s and position of the greatest intensity in the residual image y − Hx(k−1) . . the last restored image (for cosmetic reasons this output is often smoothed with a 223 .1 CLEAN The CLEAN algorithm [44] consists of two steps that are repeated until the energy of the residual is below a certain level (Tikhonov regularisation). . . [x(k) ]i = [x(k−1) ]i + sγ i = m(k) [x(k−1) ]i i = m(k) Let K be the number of iterations before convergence. The algorithm starts with a blank image x(0) and produces a sequence of restored images x(1) .1. Let m(k) be the index of this greatest intensity. . x(k) . We attempt to relate each deconvolution technique to the Bayesian framework described in section 9. C. The output of the algorithm is x(K) .
1 Gaussian after this restoration process). Marsh and Richardson have proved [79] that under certain conditions the CLEAN estimate is equivalent to the MAP maximisation described in section 9. This corresponds to a model in which the prior distribution for each pixel’s intensity is an independent and identically distributed. two examples are the Clark algorithm [25] and the CottonSchwab algorithm [106]. under certain conditions the CLEAN algorithm uses a prior assumption that all the pixels are independently identically distributed with an exponential distribution.1 (and the additional constraint that xi ≥ 0 for all i) with the choice of f (x) = − log(β) + α i xi where α is chosen to make the algorithm terminate with K nonzero point sources in the estimate and β is a constant chosen so that the prior corresponds to a valid pdf (with total integral equal to one). Jeﬀs and Gunsay provide a counter example [55] of two close point sources that are restored by the CLEAN algorithm to three sources (including a false one half way between the two true sources) whereas the corresponding Bayesian MAP estimate correctly restores the two original sources.1.224 Appendix C. . More eﬃcient implementations of this method exist. and one otherwise. As the MAP estimate seems to perform better the authors proposed a maximally sparse restoration technique [55] that explicitly uses the following image prior: p(x) ∝ i I(xi ) exp {−αxp } i where p is a shape parameter that is normally in the range 0 < p < 1 for astronomical denoising. In summary. This choice of f (x) corresponds to a prior pdf of p(x) = β exp −α i xi I(X) = β i I(xi ) exp {−αxi } where we deﬁne I(x) to be an indicator function that is zero if any component of x is negative. The conditions for the proof to hold are essentially that the original image consists of suﬃciently wellseparated point sources. This equivalence does not always hold. one sided generalised p Gaussian.
we should draw them from that probability distribution that has the maximum entropy permitted by the information we do have. p → ∞ for uniform). This default image is often chosen to be a low resolution image of the object and will be the maximum entropy estimate in the limit as the measurement noise increases to inﬁnity. For this choice of entropy the prior pdf can be factorised as p(x) ∝ I(x) i exp xi xi log λ mi e . One way of applying this principle to image deconvolution [29] results in the following deﬁnition of prior probability: p(x) ∝ exp {S(x)/λ} I(x) where S(x) = − i xi log j xj xi j xj and λ is an undetermined parameter.g. C. p = 2 for Gaussian.Appendix C.2 Maximum Entropy Brieﬂy stated. 54] when we make inferences based on incomplete information. p = 1 for exponential. There is some variation in the choice of entropy deﬁnition [125] and another common deﬁnition used for image deconvolution is S(x) = − i xi log xi mi e where mi is the ith component of a default image m. the maximumentropy principle (MAXENT) is [53. The maximum entropy method ﬁts naturally into our common Bayesian framework with the choice of f (x) = −S(x). S(x) is known as the conﬁgurational entropy of the image.2 225 The generalised p Gaussian distribution is also known as the BoxTiao distribution and includes many other distributions for speciﬁc choices of the shape parameter (e.
∀λ ∈ [0. we have argued that real world images contain signiﬁcant correlations and that therefore such a maximum entropy deconvolution is less appropriate. (These known values are taken from the DFT of the observed image divided by the gain of the blurring ﬁlter at the corresponding frequencies. 1]. In mathematics.3 = i xi mi e xi /λ I(xi ).10 gives an example of using the MAXENT principle together with a wavelet transform to give a more appropriate algorithm. A factorised joint pdf means that the distribution of each pixel is independent. The simplest method for this is to sequentially project an estimate onto each of the sets in turn and then repeat until all the constraints are satisﬁed. The convex sets specify required properties for the restored image and then some algorithm is used to ﬁnd a solution that is in the intersection of all of the sets. 2. 71. a set S is convex if and only if ∀x1 ∈ S. λx1 + (1 − λ)x2 ∈ S Combettes uses this method for the problem of restoring an image blurred with a 9 × 9 uniform kernel by means of the following constraints (that each correspond to convex sets) [27]: 1. 131] to perform image recovery by the method of projection onto convex sets. Section C. The image x should contain nonnegative pixel values.) . While this may be appropriate for astronomical images. A convex set is a set for which any linear interpolation between two points in the set will also be in the set. C.226 Appendix C. ∀x2 ∈ S. Note that such a conclusion rejects merely the precise application rather than the MAXENT principle itself.3 Projection methods There have been several attempts [42. It is assumed that the DFT of the image x is known on one fourth of its support for low frequencies in both directions. The grounds for the rejection are that these methods do not make use of all the available information about the nature of real images.
if ρ is reduced until the intersection of the constraint sets contains a single point then the method becomes equivalent to Miller regularisation. Invert the Fourier transform of the new coeﬃcients gi fi . For a general value of ρ this scheme does not naturally ﬁt into the Bayesian framework. The assumption of Gaussian noise means that. 2. It can be easily shown that the best gain (in terms of minimising the expected energy of the error) for a given image x is given by SNRi =  [F x]i 2 .Appendix C. However. Compute the Fourier transform coeﬃcients fi = [F y]i of the data. . In other words. the prior takes some constant value within the intersection. The problem with Wiener ﬁltering is the estimation of signal to noise ratios. 3. It is assumed that the above constraint will be satisﬁed by the restored image. partly because the ﬁnal solution can depend on the starting conditions (normally chosen to be the observed image). but is zero outside. Multiply each coeﬃcient fi by a gain gi given by m∗ i gi = 2 + 1/SNR mi  i where SNRi is the estimated ratio of signal energy to noise energy for this coeﬃcient and m∗ represents the complex conjugate of mi . The corresponding prior is proportional to the characteristic function of the intersection of the ﬁrst two constraints described above. We call the corresponding gain the Oracle gain but this cannot be used in practice because it requires access to the original image. the image satisﬁes the constraint y − Hx 2 ≤ρ where ρ takes some value that can be calculated from statistical tables based on the variance σ 2 of the measurement noise and the number of pixels. with a 95% conﬁdence coeﬃcient. C. i 4. Compute the Fourier transform coeﬃcients mi of the blurring ﬁlter.4 227 3.4 Wiener ﬁltering Wiener ﬁltering [5] can be implemented by the following algorithm: 1.
but misleading. way of viewing these methods within the Bayesian framework. the above cost function cannot be factorised in the same way. Instead it is the Fourier components of the image that are assumed independent.5 In terms of our Bayesian viewpoint the cost function that corresponds to Wiener ﬁltering is f (x) = i 1 σ 2 SNR i  [F x]i 2 (C.1) The previous methods were equivalent to assuming that the pixel intensity values were independent and indentically distributed. .2) where α is a convergence parameter generally taken as 1.5 Iterative methods The three most common iterative deconvolution methods are the Van Cittert [112]. Landweber [68]. . and RichardsonLucy [102] methods. Van Cittert proposed the following iteration: x(n+1) = x(n) + α y − Hx(n) (C. Landweber proposed the iteration x(n+1) = x(n) + αH T y − Hx(n) The RichardsonLucy method uses x(n+1) = diag x(n) H T diag Hx(n) We use the notation diag {a} for a ∈ −1 (C. C. but with diﬀerent Gaussian distributions for each component. Consider the Van Cittert and Landweber methods. In contrast. If these algorithms converge then the converged solution can be either considered as the MAP estimate corresponding to a ﬂat (improper) prior p(x) ∝ 1 . We ﬁrst describe the usual [81]. x(K) of restored images evolving according to some equation [112].3) y (C.228 Appendix C. When these algorithms are used for astronomical images there is also a step that after each iteration sets all the negative entries in xk to zero. The restored solution is taken to be the restored image at a particular iteration. These iterative algorithms deﬁne a sequence x(0) .4) R N to represent a diagonal matrix of size N by N with the entries of a along the diagonal. and then a better way. . .
The likelihood function is p(yx) = i [F x]yi i exp {− [F x]i } yi ! Although the iterative methods are sometimes justiﬁed [81] by these choices of prior and likelihood the converged estimates can be severely corrupted due to the large ampliﬁcation of noise [15] while the intermediate restorations are better. We can write the iteration separately for each Fourier coeﬃcient as oi (0) (n+1) = oi (1 − αmi ) + αfi (n) Using the initialisation of oi = 0 we can solve this equation to ﬁnd K−1 (K) oi = αfi n=0 (1 − αmi )n .Appendix C. Based on the idea of random photon arrival times the observations are modelled as independent samples from Poisson distributions where the parameters of the Poisson processes are the unknown source intensities x. The eﬀect has been explained [15] with an eigenvector analysis but here we give an alternative treatment based on the Fourier transform. In this model the observations in y consist of nonnegative integer counts of the number of photons detected. The RichardsonLucy method can be viewed in the same way except that it uses a diﬀerent observation model. To explain the eﬀect of early convergence we assume that we are deconvolving images without using the positivity constraint. (If the nonnegativity constraint is used then the solution is the MAP estimate for a prior of p(x) ∝ I(x)). Recall that the blurring ﬁlter can be expressed as F H MF . Let o(n) be the Fourier transform coeﬃcients of the restored images: o(n) = F x(n) Taking the Fourier transform of the Van Cittert iteration we ﬁnd F x(n+1) = F x(n) + α y − Hx(n) o(n+1) = F x(n) + α F y − F F H MF x(n) = o(n) + α f − Mo(n) = o(n) (IN − αM) + αf This is a very simple expression because all the matrices are diagonal. The methods are therefore unusual in that it is crucial to terminate the algorithm before convergence is reached.5 229 or the maximum likelihood estimate.
for small gains the assumed SNR actually increases. The only diﬀerence is the multiplication by H T . Figure C. As this is a real matrix we can write HT = HH = F H MF H = F HMHF Using this result we can rewrite the Landweber method in terms of Fourier coeﬃcients as oi (n+1) = oi (n) 1 − αmi 2 + αm∗ fi i . and the level of blurring mi for that coeﬃcient. However. This may lead to high frequency noise artefacts in reconstructed images. K. Similarly we can also take the Fourier transform of the Landweber method.5 1 − (1 − αmi )K αmi 1 − (1 − αmi )K = fi mi = αfi The restored image produced by the Van Cittert iteration is given by x(K) = F H o(K) and by comparison with the algorithm for Wiener ﬁltering above we conclude that Van Cittert restoration is equivalent to Wiener ﬁltering with a gain gi given by 1 − (1 − αmi )K gi = .1 shows the assumed SNR values for gains mi varying between 0 and 1 if K = 3 and α = 1. mi The corresponding assumption about the signal to noise ratio is SNRi = = 1 m∗ i gi − mi 2 1 − mi 2 mi 2 1−(1−αmi )K Assuming that α is small enough for the algorithm to converge then it is clear that gi → 1/mi in the limit as K → ∞ but the algorithm is designed to terminate long before convergence. For a typical blurring function that decays with increasing frequency the Van Cittert method eﬀectively assumes that the data has a power spectrum that also decays with increasing frequency.230 Appendix C. The assumption about the SNR level of a Fourier coeﬃcient is a function of α.
.4 0.Appendix C.6 Filter gain 0.2 0.α = 1).8 1 Figure C.5 231 70 60 Assumed SNR/dB 50 40 30 20 10 0 0.1: Eﬀective assumption about SNR levels for Van Cittert restoration (K = 3.
.2 shows this assumed SNR values for gains mi varying between 0 and 1 if K = 3 and α = 1.2 0.2: Eﬀective assumption about SNR levels for Landweber restoration (K = 3. assumed SNR levels even for low gains and therefore the restored results should avoid the high frequency artifacts of the Van Cittert method.5 = fi m∗ i 1 − (1 − αmi 2 ) mi 2 n+1 1 − (1 − αmi 2 ) = fi mi following assumption about the SNR SNRi = = 1 m∗ i gi n+1 Again we conclude that the Landweber method is equivalent to Wiener ﬁltering with the − mi 2 1 − mi 2 mi 2 1−(1−αmi 2 )K Figure C.4 0. 60 The ﬁgure shows that the Landweber method has a smooth decrease in 50 Assumed SNR/dB 40 30 20 10 0 0 0.6 Filter gain 0.α = 1).8 1 Figure C.232 Appendix C.
An explicit deﬁnition of the assumed cost function is given by substituting the above expressenions for the assumned SNR levels into equation C.6 233 The RicharsonLucy method is not as simple to express in the Fourier domain due to the presence of multiplications and divisions that are implemented pixelwise on images. In particular. To demonstrate this claim we imagine applying the RichardsonLucy method to an image after increasing all the intensity values (in the data and the intermediate restorations) by a constant 1/ . We use the notation O( a ) to represent terms that are of order a . However. we claim that early termination corresponds to making approximately the same assumption (of a stationary Gaussian random process) about image structure as in the Landweber method and consequently that early termination of the RichardsonLucy method is approximately a particular case of Wiener ﬁltering.3 we conclude that (if the algorithm is initialised to have x(0) = 0) then the shifted RichardsonLucy method (with removed positivity constraints) is within order of the Landweber method. The iteration becomes x(n+1) + 1/ = diag x(n) + 1/ H T diag H x(n) + 1/ −1 (y + 1/ ) We perform this shift in order to be able to approximate multiplications and divisions by additions and subtractions. We have described the link between the iterative methods and Wiener ﬁltering. −y) rather than h(x. We will assume that the image has been rescaled such that the blurring ﬁlter has unity response at zero frequency and thus H1 = H T 1 = 1 (H T corresponds to ﬁltering with a ﬁlter h(−x.Appendix C. O( a ) represents a polynomial function of in which every exponent of is at least a. y) and so will also have unity response at zero frequency). .1. For suﬃciently small values of x(n+1) = −1/ + diag x(n) + 1/ = −1/ + diag x(n) + 1/ H T diag HT IN − this expression can be written as 1 − Hx(n) + O( 2 ) 2 (y + 1/ ) diag Hx(n) + O( 3 ) (y + 1/ ) = diag x(n) H T 1 + H T y − H T diag Hx(n) 1 + O( ) = diag x(n) 1 + H T y − H T Hx(n) + O( ) = x(n) + H T y − Hx(n) + O( ) Comparing this with equation C. the restored image from this shifted RichardsonLucy method will tend to the Landweber solution in the limit as → 0. In other words.
7 Total variation and Markov Random Fields The total variation functional JT V (u) is deﬁned on a continuous function u(x. 1}. This operator is chosen to apply little regularisation where the signal energy is expected to be high. spaceinvariant ﬁlters then the energy function can be eﬃciently represented in terms of the Fourier coeﬃcients of the image x. This proves that the performance of the Oracle Wiener ﬁlter is an upper bound on the performance of such methods unless stopping before convergence gives improved results. If both the blurring operator H and the regularising operator C represent linear.7 Recent attempts to solve this problem have been based on Hopﬁeld neural networks [133. 92] where the idea is to perform gradient descent minimisation of the energy function with the restriction that the change to each intensity value must always belong to the set {−1. 115.7 1 0. but signiﬁcant regularisation where the noise energy dominates the signal. y) as [90] JT V (u) = y x ∇udxdy . One common choice for the coeﬃcients is a discrete approximation to a 2D Laplacian ﬁlter such as [115] 0. 61].6 Constrained Least Squares Constrained least squares methods use f (x) = Cx 2 for some square matrix C known as the regularising operator [15.7 C.7 1 0. 0. C.234 Appendix C. In this case it is straightforward to show that the estimate that minimises the energy function is given by a Wiener ﬁlter (with the estimated SNR values inversely proportional to the squares of the Fourier coeﬃcients of the regularising operator). For many images the signal energy is concentrated at low frequencies and so the operator is chosen to act like a high pass ﬁlter.8 1 0.7 1 −6.
Appendix C. Kalifa and Mallat [58] use α = 0 together with a mirror wavelet basis. Several choices for the amount of regularisation and the wavelet denoising method have been proposed. Both the inverse ﬁlter and the wavelet denoising can be used to reduce the level of noise. This algorithm and the mirror wavelet basis are described in detail in section C. Their mirror wavelet transform is similar to a standard real . The prior pdf corresponding to total variation denoising therefore penalises oscillations in an image as this increases the total variation.8 235 JT V (u) is used as the stabilising functional within Tikhonov regularisation and therefore the corresponding f (x) is equal to a discretized version of the above integration.8 Minimax wavelet deconvolution The minimax wavelet methods generally work via a two stage process that uses a stationary inverse ﬁlter followed by a wavelet denoising technique. To avoid diﬃculties with the nondiﬀerentiability the functional Jβ (u) is often used instead [123] Jβ (u) = y x ∇u2 + β 2 dxdy. An algorithm of this type is used in the production channel of CNES satellite images[58]. Wiener ﬁltering corresponds to α = 1 with no wavelet denoising.25 usually gave good results [84]. The frequency response Gα (f) of the inverse ﬁlter is given by Gα (f ) = 1 H(f) H(f)2 Px (f ) H(f)2 Px (f) + ασ 2 (C. C. and α is a parameter that controls the amount of regularisation.5) where Px (f) is the power spectral density of the signal.9. and instead favours edges and tends to produce piecewise constant images. This approach is known as WaRD standing for Waveletbased Regularized Deconvolution. σ 2 is the amount of noise added after blurring. 132] provide a more general way of constructing a prior pdf based on local neighbourhoods that again aims to favour smooth regions while permitting occasional discontinuities. Markov Random Fields [56. H(f) is the Fourier transform of the linear blurring ﬁlter. Donoho [38] uses α = 0 so that all the noise removal must be done by the wavelet denoising. Nowak and Thul used an underregularized linear ﬁlter (0 < α < 1) [87] and Neelamani et al studied the eﬀect of the amount of regularization and found α ≈ 0.
It is claimed [58] that there is no “good” stochastic model for natural images. . Suppose that we have obserˆ vations y ∈ R N from which we wish to construct an estimator F(y) of the original signal x ∈ R N . This approach is standard in the theory of games. deﬁned as ˆ r(F. Suppose that after A has designed the algorithm 1 The idea is that B chooses the test image x. The estimator is then designed by trying to minimise the maximum risk over Θ. Note that this is a function of the original signal x. the minimax approach avoids using the prior pdf on the grounds that the prior is not a suﬃciently “good” model. Extra ﬁltering can also be applied to the DTCWT to produce a complex wavelet packet transform [52]. Such a transform has been found to give slightly better performance than the nondecimated version of the mirror wavelet algorithm (and much superior performance to the decimated version) [52].1 before being given to A. The original signal is ﬁxed and the expectation is taken over all possible values for the noise in the observation model. The risk of the estimator is deﬁned to be [58] ˆ r(F. x) = EN ˆ F(y) − x 2 . However. This test image is then blurred and degraded according to equation 9.236 Appendix C. Θ) = sup E x∈Θ ˆ F(y) − x 2 . Player A has to design a deconvolution algorithm to maximise the SNR of deconvolved images. These methods are harder to place within our common framework because they are motivated by the belief that such a framework is fundamentally ﬂawed and that minimax methods oﬀer an alternative solution. In the Bayesian approach we have an estimate for the relative probability of diﬀerent signals (the prior) and we can compute the total expected risk for an estimator with the expectation taken over all possile signals. Consider the following game. The extra ﬁltering produces greater frequency localisation for high frequencies. Player B has to choose the test images1 . The estimator is designed to minimise this maximum risk.8 wavelet transform except that additional ﬁltering steps are performed on the highpass subbands. Instead minimax estimation makes use of a prior set Θ where the signal is guaranteed to be. Bayesian techniques require stochastic models of the expected signals. Instead the estimator is based on the maximum risk. A standard result is that this total risk is minimised by using the posterior mean estimate.
9 237 B is allowed to see the program and construct a test image deliberately designed to produce the algorithm’s worst possible performance. the values used in the published experiments were not given. Furthermore. but when the model used to produce images is unknown. The performance of the method depends on the choice of parameter values. what is not agreed is an appropriate approach for the case when player B is not malicious. The conclusions in these two cases are widely accepted. For example. Later results will show that the Bayesian model is good in this sense. for commercial reasons. the minimax approach gives results with a known worst case performance. It can easily be shown that the best approach for A (in terms of maximising SNR) is to use the minimax approach to design the algorithm. As we are interested in getting good results on typical images we select the Bayesian method. The problem with this claim is that it is not clear what “good” means.9 Mirror wavelet deconvolution This section describes the algorithm for deconvolution using mirror wavelets proposed by Kalifa and Mallat [58]. if player B is not so malicious and simply decides to produce test images according to some stochastic model then the best approach for A is to use a Bayesian posterior mean estimate. Bayesian methods attempt to model the prior information about likely image structures and thus give results whose quality depends on the accuracy of the model. . In summary. This is the case for most real world images.Appendix C. Unfortunately. We agree that realisations from typical Bayesian models do not produce realistic images. The methods tend to be robust but take no advantage of the probable structure within the data (other than limiting the data to the set Θ). We make use of what we believe to be a reasonable choice but it is possible that other choices could give better performance. but models can often give a reasonable guide to the relative probability of small deviations from a real world image. However. wavelet models will prefer a priori a portion of the image being smooth rather than containing high frequency noise. using B’s stochastic model for the prior pdf. C. The Bayesian method has the potential to give better reconstructions but it is possible that certain images will be very badly restored. We mentioned earlier the claim that there is no “good” model for natural images. if “good” is taken to mean that the resulting algorithms give high accuracy results then the claim can be experimentally tested.
238
Appendix C.9
We ﬁrst give a brief description of the mirror wavelet transform and then explain how this transform is used for deconvolution.
C.9.1
Mirror Wavelet Transform
Figure 2.2 of chapter 2 shows the subband decomposition tree for a standard wavelet transform. Such a tree produces some very short wavelets whose frequency response covers the upper half of the spectrum. For some blurring functions there can be a considerable diﬀerence in ampliﬁcation across this range of frequencies. Consequently, at the lower end there may be a high SNR, while for the highest frequencies the SNR may be very low. It therefore seems inappropriate to group all these frequencies within a single subband. The mirror wavelet decomposition addresses this problem by performing recursive ﬁltering on the most detailed subband [58]. Figure C.3 shows the subband decomposition structure for the mirror wavelet. The ﬁlters are given by the symlet wavelets of order 4. These Level 4 Level 3 Level 2 Level 1 x0a x00a x000a
Standard Tree x
H0a
 ↓2

H0a H1a
 ↓2

H0a H1a
 ↓2

H0a H1a
 ↓ 2  x0000a  ↓ 2  x0001a
 ↓ 2  x01a
x00b
 ↓ 2  x001a
x000b
x0b
Mirror Tree

H1a
 ↓2

H0b H1b
 ↓2

H0b H1b
 ↓2

H0b H1b
 ↓ 2  x0000b  ↓ 2  x0001b
 ↓ 2  x01b
 ↓ 2  x001b
Figure C.3: The mirror wavelet tree structure
Appendix C.9
239
orthogonal wavelets possess the least asymmetry and highest number of vanishing moments for a given support width [30]. The ﬁlters in the mirror tree (for levels above 1) are given by the time reverse of the ﬁlters in the standard tree: H0a (z) = H0b (z −1 ) = −0.0758z 3 − 0.0296z 2 + 0.4976z 1 + 0.8037z 0 +0.2979z −1 − 0.0992−2 − 0.0126z −3 + 0.0322z −4 H1a (z) = H1b (z −1 ) = −0.0322z 3 − 0.0126z 2 + 0.0992z 1 + 0.2979z 0 − 0.8037z −1 +0.4976z −2 + 0.0296z −3 − 0.0758z −4 The tree can be inverted by repeated application of the reconstruction block. The mirror wavelets are extended to 2D in such a way as to achieve a ﬁne frequency resolution for increasing frequency. Details of the 2D basis and a fast 2D transform can be found in [58]. Figure C.4 shows the frequency response contours that are given by a three level 2D mirror wavelet transform. The frequencies are normalised so that a frequency of 32 corresponds to half the sampling rate.
C.9.2
Deconvolution Algorithm
The deconvolution algorithm consists of inverse ﬁltering followed by wavelet denoising. As in chapter 9 suppose that the blurring operator is represented by the matrix F H MF where M is a diagonal matrix with diagonal entries m. Deﬁne a new vector u (representing the inverse ﬁlter) by ui = 1/mi if mi  > 0 otherwise
We choose = 0.01 in our experiments. The inverse ﬁltering step produces a new image x0 given by x0 = F H diag {u} F d (this, of course, is implemented using the Fourier transform rather than matrix multiplication).
2 The wavelet denoising is based on estimates σk of the variance of the (inverse ﬁltered)
noise in the subbands of the mirror wavelet transform of x0 . The inverse ﬁltering step tends to considerably amplify the noise for high frequencies for typical blurring functions. These variances can be precisely computed from the Fourier transform of the ﬁlter [58] but in practice it is easier to estimate these values by calculating the mirror wavelet transform of an image containing white noise of variance σ 2 that has been inverse ﬁltered. The average
2 energy of the wavelet coeﬃcients in the corresponding subbands provide estimates of σk .
240
Appendix C.9
30
25
20
15
10
5
5
75% peak energy amplitude.
10
15
20
25
30
Figure C.4: 2D frequency responses of the mirror wavelet subbands shown as contours at
Appendix C.10
241
We deﬁne a “noise subband” to be a subband for which σk > T where T is some threshold level. We choose T = 30 in our experiments. These subbands contain very little useful information. The wavelet denoising process consists of the following steps: 1. Compute the mirror wavelet transform of x0 . 2. Set all wavelet coeﬃcients in noise subbands to zero. 3. Apply a soft thresholding rule to all the wavelet coeﬃcients. For a coeﬃcient wi belonging to subband k the new value wi is given by ˆ wi − βσk wi > βσk wi = ˆ w + βσk wi < βσk i 0 otherwise where we choose β = 1.6 in our experiments. ˆ 4. Invert the mirror wavelet transform to compute the deconvolved estimate x. This is a single pass algorithm involving only one forward and one inverse wavelet transform and hence is fast. In practice (and in our experiments) the shift invariant version of the mirror wavelet transform is always used as it gives better results. This can be viewed theoretically as averaging the results of the decimated version over all possible translations. This averaging is implemented by using the much slower nondecimated form of the mirror wavelet.
C.10
Waveletbased smoothness priors
A second group of methods use wavelet transforms to construct a prior pdf for images. We have shown that the basic model described in chapter 7 (using a common prior variance for every coeﬃcient in a given subband) is approximately equivalent to a stationary Gaussian random process model but there are many alternative priors that can be constructed using wavelets. Some examples of priors that have been used for deconvolution are: 1. Wang et al [124] used the output of an edge detector applied to the noisy data to alter the degree of regularisation in a multiscale smoothness constraint. This algorithm
242
Appendix C.10
used the cost function f (x) =
i
λi  [W x]i 2
where W represents a forward real wavelet transform (Daubechies’ ﬁfth order compactly supported wavelet [30]) and {λi } are scaling parameters chosen using the output of the edge detector. 2. Starck and Pantin have proposed [93] a multiscale maximum entropy method that uses the cost function2 f (x) = −
i
λi [W x]i − mi −  [W x]i  log
 [W x]i  mi
where W represents a nondecimated forward transform (a form of Laplacian pyramid is used where the lowpass ﬁltering is performed with a 5 × 5 mask based on a cubic B spline), {mi } are some constant reference values given by mi = σ/100, and {λi } are weighting factors that alter the degree of regularisation. These factors are chosen based on the size of the wavelet coeﬃcients of the observed image. If the coeﬃcient is below a threshold of 3σ then it is deemed to be in the multiresolution support and the factor is set to some constant value σj that depends only on the scale j of the wavelet coeﬃcient. These coeﬃcients are allowed to vary in order to match the observations. However, if the coeﬃcient is large then the factor is set to zero and it is not allowed to vary. A constraint is added to the problem that requires all coeﬃcients not in the multiresolution support to be equal to the value in the observed image. 3. Banham and Katsaggelos [8] use an autoregressive prior model which evolves from coarse to ﬁne scales. The parameters of the model are based on the output of an edge detector applied to a preﬁltered version of the noisy data. A multiscale Kalman ﬁlter is then used to estimate the original image. 4. Belge et al [11] use a nonGaussian random process model for which the wavelet coeﬃcients are modelled as being independently distributed according to generalised Gaussian distribution laws. The resulting energy function is minimised in a doubly
2
This cost function appears strange because it is not a symmetric function of the wavelet coeﬃcients.
This is probably a mistake but we have chosen to keep the form as given in the reference.
The ﬁrst three methods use a prior that is a function of the noisy image and are therefore known as empirical Bayes methods. for a particular position in the image there will be. There are many other choices for the image prior that have been used in other applications. . and p is a parameter chosen near 1. Using this interpretation of the kernel functions suggests that the Pixon method is approximately equivalent to using a sparseness prior (of the sort seen in section C. These kernel functions are deﬁned at a number of diﬀerent scales (typically 4 per octave) and orientations and can be regarded as the reconstruction wavelets corresponding to some redundant wavelet transform.Appendix C. Note that an estimate based on this objective function would only approximate the true Pixon estimate as it neglects certain features of the method (for example.10 243 iterative algorithm. 5. In other words. say. This algorithm corresponds to the cost function f (x) = i λi  [W x]i p where W represents a forward real wavelet transform (Daubechies’ 8 tap most symmetric wavelets were used [30]). Pi˜ a and Puetter use a Pixon method [94.1) for the wavelet coeﬃcients: f (x) = i wip where p is a real scalar parameter controlling the degree of sparseness and {wi } is the set of parameters (wavelet coeﬃcients) that specify the image via the relation x = Pw where P is a reconstruction matrix built out of the kernel functions used in the Pixon method. which itself requires wavelet and Fourier transforms to evaluate. 99] that adapts the number of parameters n describing the image to the smallest number consistent with the observed data. One example that has already been mentioned in this dissertation is the Hidden Markov Tree (HMT) model discussed in chapter 3. The parameters in the Pixon method are coeﬃcients of certain kernel functions. {λi } are scaling parameters for the diﬀerent wavelet coeﬃcients. K parameters corresponding to the K diﬀerent subbands but the Pixon method only allows at most one of these parameters to be nonzero). the iterative minimisation algorithm is based upon another iterative algorithm.
244 Bibliography .
Proc. Pelillo and E. 1993.. Smith. J. A. May 1995.. 1987. 43(5):1068–1089. [7] R. 29(6):33–41. IEEE Trans. [6] F. Flandrin. Katsaggelos. J. M. Auger and P. A ﬁlter bank for the directional decomposition of images. [4] T. IEEE Trans. [2] F. Barker and P. Alpert. Adelson. An Introduction to Multivariate Statistical Analysis. Pyramid methods in Image processing. on Sig. Bamberger and M. P. NJ: PrenticeHall. Image Proc. H. 1977. [9] S. The practice of fast conditional simulations through the LU decomposition of the covariance matrix. 1958. J. Englewood Cliﬀs. SpringerVerlag. Hancock). Rayner. H. on Signal Proc. W. R. R. Math Analysis. SIAM J. in Lecture Notes in Computer Science Vol. A class of bases in L2 for the sparse representation of integral operators. Anderson. chapter Unsupervised image segmentation using markov random ﬁeld models. [8] M. 1997. Anderson. Apr 1996. 1223. 245 . IEEE Trans. 5:619–633. R. April 1992. 40(4):882–893. H. C.. 1984. K. Banham and A. M. John Wiley & Sons. Burt. [5] H. Alabert. Hunt. Bergen. Math Geology. R. (Eds. Spatially adaptive waveletbased multiscale image restoration. Andrews and B. RCA Engineer. Improving the Readability of TimeFrequency and TimeScale Representations by the Reassignment Method. and J. Ogden. T. [3] B. J. C. Digital Image Restoration. 19(5):369–386.Bibliography [1] E.
Mersereau. Harmonic analysis of neural networks. Conf. Cand`s and D. [17] I. 1999. IEEE Trans. and R.. 1999. 1958. Burt and E. E. on Image Proc.. [18] P. and M. [16] J. [15] J. and B. 78(5):856–883. Miller.. Gormish. 6(2):197–218. . Biemond. Report 200005. Berger. Wavelet domain image restoration with adaptive edgepreserving regularization. The Microsoft Advanced Technology Vision Research Group. E. Applied and Computational e Harmonic Analysis. R.246 Bibliography [10] C. Statistical Decision Theory and Bayesian Analysis. 357. S. J. Centro de Estadstica y Software Matemtico Universidad Simn Bolvar. Adelson. Springer series in statistics. [13] J. Donoho.N. 1985. 2000. J. Proc. Binomial linear predictive approach to texture modelling. M. Lagendijk. Campisi. Bronshtein and K. [19] E. Trans. 1983. and Recognition. ACM Transactions on Graphics. Kilmer. V. L. Berger. Discrimination. De Bonet. Master’s thesis. 9(4):597–608. Boliek. Objective Bayesian Analysis of Spatially Correlated Data Tech. Ridgelets: a key to higherdimensional intermite tency? Phil. Belge. L. and E. [14] K. May 1990. 1997. volume 2. L. [20] E. Technical report. Novel Statistical Multiresolution Techniques for Image Synthesis. [11] M. Verlag Harri Deutsch. IEEE. O. [12] J. L. Proc. 1997. M. A. Handbook of Mathematics. Royal Society London A. 2000. on Im. Thun and Frankfurt/Main. New York. In 2000 IEEE Int. J. Schwartz. Apr 2000. Semendyayev. pages 1111–1114. SpringerVerlag Inc. In International Conference on Digital Signal Processing 97. Iterative methods for image deblurring. Cand`s. M. 2:217–236. De Oliveira. Berkner. A new waveletbased approach to sharpening and smoothing of images in Besov spaces with applications to deblurring. A Multiresolution Spline with Application to Image Mosaics. Sans. Becchetti and P.
J.L. and Signal Proc. Romberg. Chellappa and R. SpringerVerlag.. L. Daugman. S. R. Acoust. Istanbul. Speech and Signal Processing . June 1982. D. Nowak. J. Convex Set Theoretic Image Recovery by Extrapolated Iterations of Parallel Subgradient Projections. 1980. G. Speech. Signal Processing. In Proceedings of IEEE International Conference on Acoustics. IEEE Trans. 33(1):194–203. [32] J. L. Lecture Notes in Statistics. and R. 6(4):493–506.G. Speech. [26] R. [22] R. Combettes. Crouse. Gull. 36(7):1169–1179. [23] H. March 1997. 1992.. Twodimensional spectral analysis of cortical receptive ﬁeld proﬁles. IEEE Transactions on Signal Processing (Special Issue on Wavelets and Filterbanks). Chellappa and R. Digital image restoration using spatial interaction models. Kashyap. part E. F. chapter Translationinvariant denoising. Donoho. Daniell and S. Complete Discrete 2D Gabor Transforms by Neural Networks for Image Analysis and Compression. Interpolation and denoising of nonuniformly sampled data using waveletdomain processing. Kingsbury. IEEE Trans. [25] B. 1980. An eﬃcient implementation of the algorithm ‘CLEAN’ . Daugman. Baraniuk. on Acoustics. Clark. [28] M. September 1980. 1995. IEEE Trans. Choi. IEEE Trans. 89:377–378. Astrophys.ICASSP’00. G. July 1988. April 1998. Baraniuk. . [30] I. Daubechies. Signal Processing. Speech. WaveletBased Signal Processing Using Hidden Markov Models.. 1985. Maximum entropy algorithm applied to image enhancement. and N. Coifman and D. Acoust.L. K. 30:461–472. [27] P. Texture synthesis using 2D noncausal autoregressive models. on Image Processing.. [24] H. Ten Lectures on Wavelets.Bibliography 247 [21] R. 127(5):170–172. IEE Proceedings. Choi and R. June 2000. [31] J. Vision Research. Turkey. Hidden Markov Tree Modeling of Complex Wavelet Transforms. Astron. 20:847–856. R. In ICASSP 99. Baraniuk. G. Kashyap. SIAM. [29] G. 1999.
and N. Stanford University. [43] S. and L. Journel. C. [42] R. 1994. 1995. Signal Proc. Oxford University Press. S. F. [37] E. Jr. Munson. 39:55–68. Hatipoglu. C. July 1999. Diethorn and D. Donoho. Stanford. Manchester. 29:471–481. 1991. J. de Rivaz.. J.. Jan 1991. Deutsch and A. Communications of the ACM. G. IEEE Trans. Texture classiﬁcation using dualtree complex wavelet transform. Comp. Johnstone. In ICIP 99. Carpenter. de Rivaz and N. Moﬀatt. Algebraic reconstruction techniques (ART) for threedimensional electron microscopy and Xray photography. App. [34] P. [40] A. and G. 2:101–126. Fussel. Department of Engineering. Computer Rendering of Stochastic Models. [36] C. Gordon. Kingsbury. Mitra. Herman. 81:425–455. In Proceedings of the IEE conference on Image Processing and its Applications. T. M. Biol. D. Biometrika. G.248 Bibliography [33] P. 2000. July 1999. [39] D. de Rivaz and N. Harmonic Anal. Kingsbury. Fast segmentation using level set curves of complex wavelet surfaces. R. Technical report. Complex wavelet features for Fast Texture Image Retrieval. and J. G´mezHern´ndez. A stochastic approach to the simulation of block conductivo a ity ﬁelds conditioned upon data measured at a smaller scale. L. PhD thesis. Bender. F. 1999. pages 344–347. Fournier.. [38] D. G. N. Kingsbury. In ICIP 2000. timevarying system framework for noniterative discretetime bandlimited signal extrapolation. . 1982. L. Kingsbury. [41] J. C. Wavelets for Fast Bayesian Geophysical Interpolation CUED/FINFENG/TR. December 1970. V. Nonlinear solution of linear inverse problems by WaveletVaguelette Decomposition. GSLIB Geostatistical Software Library and User’s Guide. CA. Donoho and I.354. Theoret. [35] P. F. Ideal spatial adaptation by wavelet shrinkage. University of Cambridge. C. 1992. G. A linear.
N. J. Astron. Image Replacement through Texture Synthesis. T. [45] D. Zerubia. N. 1994. H. [47] P. Rev. Bull. J. Aug. D. Igehy and L. Signal Processing. volume 3.. A. June 2000. The rationale of maximum entropy methods. Rotationally invariant texture classiﬁcation. BlancF´raud. 1991. 2(2):202–211. Receptive ﬁelds and functional architecture of monkey striate cortex. Jeﬀs and M. 195:215–243. Gunsay. April 1993. .Bibliography 249 [44] J. London. Herv´. D. [52] A. Multiresolution analysis of multiplicity d. Hubel and T. pages 299–315. Chin. Jalobeanu.). Comput. 106(4):620– 630. May 1957. Harmonic Anal. 166:106–154. [54] E.. and J. [51] H. [46] L. L. Pyramidbased texture analysis/synthesis. Jaynes. H. In ICIP 97. Information theory and statistical mechanics. T. volume 3. 1962. 1997.). Suppl. [50] D. Oct 1995. Aperture synthesis with a nonregular distribution of interferometer o baselines. Hillery and R. In ICIP 95. INRIA Research Report 3955. Receptive ﬁelds. 1968. IEEE Trans. [53] E. Application to dyadic interpoe lation. H¨gbom. Satellite image deconvolution using e complex wavelet packets. Ser. Iterative Wiener Filters for Image Restoration. Canagarajah. Heeger and J. In IEE seminar on timescale and timefrequency analysis and applications. IEEE. J. Wiesel. Bergen. Wiesel. [48] A. Physiol. 1974. Hubel and T. February 2000. Jaynes. T. Hill. N. R. 15:417–426. Proc. IEEE transactions on image processing. and C. pages 186–189. 39(8):1892–1899. 70:939–952. Phys. binocular interaction and functional architecture in the cat’s visual cortex. 1982. [49] D. Restoration of blurred star ﬁeld images by maximally sparse optimization. R. D. (Lond. [55] B.. Pereira. (Lond. R. Physiol. pages 648–651. Astrophys.
Acoust. J. Huijbregts. [64] N. Vis. pages 319–322. 39:914–929. In Proceedings of the 3rd International Conference on Computer Vision. In Proc. February 2000.. Woods. 39:914–929. Springer. Kohonen. G. Phoenix. [60] M. [62] N.250 Bibliography [56] F.. Mallat. and D. Kingsbury. Snakes: Active contour models. [66] T. [61] A. . In Proc IEE Colloquium on TimeScale and TimeFrequency Analysis and Applications. G. Kam and W. Sep 1990. R. and R. In Proc. Schafer. pages 54–57. June 2000. April 1991. Complex wavelets and shift invariance. [57] A. 29 Feb.. Speech and Signal Processing. M. Complex wavelets for shift invariant analysis and ﬁltering of signals. Submitted by invitation to Applied Computational and Harmonic Analysis. 1978. Compound GaussMarkov random ﬁelds for image estimation. A regularization iterative image restoration algorithm. [63] N. London: Academic Press. Terzopoulos. J. H. London. W. IEEE Conf. 1999. In Proc. Bayesian inference in wavelet based methods. volume II. Comput. G. K. The SelfOrganizing Map. 2000. chapter Minimax restoration and deconvolution.. G. IEEE Trans. Kalifa and S. IEEE Trans.. J. Witkin. W. Signal Processing. European Signal Processing Conf. C. 1999. Biemond. J. Speech. The dualtree complex wavelet transform: a new eﬃcient tool for image restoration and enhancement. [59] A. Jeng and J. Acoust. Mining Geostatistics. AZ. IEE. Journel and C. pages 1464–1480. April 1991. Shift invariant properties of the DualTree Complex Wavelet Transform. [65] N. Signal Proc. IEEE. Kingsbury. Mersereau. 1988. Pattern Recognition and Image Processing (CVPRIP 2000). on Acoustics. Speech. 1:321–332. Kass. [58] J. volume 78. Int. Fitzgerald. G. Sep 1998. Kingsbury. Image segmentation: An unsupervised multiscale approach. Kingsbury. A. Katsaggelos.
83:554–565. Math. 1982. [69] M. [74] J. and Comput. In Proceedings of SIGGRAPH 84. Anal. and R. Special Issue on Digital Libraries. Academic Press. A Computational Investigation into the Human Representation and Processing of Visual Information. Tuy. [73] J. Texture features for browsing and retrieval of image data. 3(1):10–12. [76] B. An iterative method for the extrapolation of bandlimited functions. Marcelja. Mach. 1995. Freeman and Company.. In Proceedings of IEEE ICASSP. WMatrices. J.H. Ma. Anal. 1980. M. Mathematical description of the responses of simple cortical cells. pages 219–229. Marr. Vision. Odegard. O. [71] A. E. 70:1297–1300. Lang. An iteration formula for fredholm integral equations of the ﬁrst kind. [68] L. A Wavelet Tour Of Signal Processing. J. S.. Nonorthogonal Multiresolution Analysis. IEEE Trans. Noise reduction using an undecimated discrete wavelet transform. P. Lent and H. Y. Mayrand. Guo. Complex Daubechies wavelets. Opt. [78] D. 1998. Mallat. [70] J. [77] S. IEEE Signal Processing Letters. Lebrun and M. Aug 1996. Magarey. Amer. H. October 1981. [72] J. Seattle. J. Tang. Texture Synthesis for Digital Painting. Am. W. High Order Balanced MultiWavelets. P. Lina and M. C. Math. [75] S. Manjunath and W.Bibliography 251 [67] M. PhD thesis. May 1998.. 1997. Lewis. Argonne National Laboratory. 1951. Harmonic Analysis. S. T. of Appl. Kwong and P. . Technical report. Vetterli. 1984. pages 1529–1532. Landweber. 73:615–624. J. Burrus. Cambridge University. J. 1994. Soc. 1996. Patt. 18(8):837–842. Appl. and Finite Signals of Arbitrary Length MCSP4490794. K. Motion Estimation using Complex Wavelets. Int. Wells Jr.
Prior Models and the RichardsonLucy Restoration Method. Soc. [83] R. A.edu/pub/papers/theses/who. Soc. Navarro and J. Miller.ps. Phil.ps.The International Society for Optical Engineering. 1999. Mateos. A. Newland. R. [85] D. 1996. Astrophys. R.edu/stats/nychka/manuscripts/large5. Oppenheim). E. WaveletVaguelette restoration in photonlimited imaging. volume 2657. Molina. In The Restoration of HST Images and Spectra II. tial Nychka.. [86] D. M. Lond. J. [87] R. 1987. Springer Lecture Notes in Statistics. E. Kobe. Neelamani. [88] D.. 1993. Astron. Signal Processing – ICASSP 98. Acoust. 1994. IEEE Int. nonstationary http://goldhill. pages 118–122. Dec 1998. Conf.A. In ICIP 99. 1:52–74. Nowak and M.252 Bibliography [79] K. Least Squares methods for illposed problems with a prescribed bound. Richardson. 1970. A. prediction C. Thul. In Proceedings of SPIE . Abad. A. Random Field Simulation and an Application of Kriging to Image Thresholding. J. D. Portilla. The Stationary wavelet transform and some statistical applications . eds. . J. Harmonic wavelets in vibrations and acoustics. H.gz . 103:281–300.. 1998. problems and and J. 443:203–225. and J. Silverman. Large random spaﬁelds. B. Speech. L. Nason and B. pages 2869–2872. Hanisch and R. In Proc. and R. P. 1999. [84] R. Harmonic Wavelet Analysis. Proc. Choi. R.sunysb. Baraniuk. pages 86–97. Marsh and J. [80] K. Lond. 1998. Royle. Math. White.cgd. Newland. 182:174–178. 1995. The objective function implicit in the CLEAN algorithm.. in Wavelets and Statistics (ed. [82] G. 357(1760):2607–2625.ucar. Anal. [81] R. [89] Wonho Oh. WaveletDomain Regularized Deconvolution for IllConditioned Systems. Antoniadis & G. SIAM J. Wikle. Robust method for texture synthesisbyanalysis based on a multiscale Gabor scheme. ftp://ams. W. Trans. Seattle.
[92] J. Oxford: Clarendon Press. Powell. 1996. M. In Proceedings of the International Symposium on Signal Processing and its Applications. Yahil. Image restoration using a modiﬁed Hopﬁeld network. Astron. and B. Flannery. ISSPA 96. L. 1992. J. T. Simoncelli. S. P¨tzsch. pages 744–747. Eds. Ser. L. A. Cox (Eds). In Proc. 105:630–637. Puetter and A. 1988. [96] J. and C. Pi˜a and R. ASP Conference Series. C. Roberts. To appear. P. Puetter. 60:259–268. Image Processing. Portilla and E. T. Fatemi.G. Teukolsky. [93] E. K. [91] R. Vetterling. Paget and D. September 1996. 1996. Mehringer. Maurer. and Astrophys.Bibliography 253 [90] S. K. pages 143– 167. Deconvolution of astronomical images using the multiscale maximum entropy method. Katsaggelos. Press. 2000. Cambridge University Press. L. Malsburg. Numerical Recipes in C. 118:575–585. Pantin and J. Longstaﬀ.D. Mason and M. January 1992. 1993. The Pixon Method of Image Reconstruction. Starck. Plante. Nonlinear Total Variation based noise removal techniques. Algorithms for Approximation. 1987. Publications of the Astronomical Society of the Paciﬁc.d. Bayesian Image Reconstruction: The Pixon and n Optimal Image Modeling. C. K. 1998. chapter Radial basis functions for multivariable interpolation: a review. D. Osher. ICANN 1996. A parametric texture model based on joint statistics of complex wavelet coeﬃcients. P. R. L. Rudin. Reconstruction from o graphs labeled with responses of Gabor ﬁlters. Phys. volume 2. I. . [95] M. Suppl. pages 49–63. v. W. and E. IEEE Trans. In Proc. P. [99] R. [97] M.C. ADASS ’98 in Astronomical Data Analysis Software and Systems VIII. [94] R. Wiskott. D. International Journal of Computer Vision. pages 307–316. [98] W.. and D. H. A. in J. Nonparametric multiscale Markov random ﬁeld mode for synthesizing natural textures. Paik and A.
62(1):55–59. H. Environmental Statistics.unc. J. W. ShiftInvariant Denoising using WaveletDomain Hidden Markov Trees. Texture Characterization via Joint Statistics of Wavelet Coeﬃcient Magnitudes. http://www. Journal of the Optical Society of America. 38:587–607. T. and Mach. 18:257–269. Slepian.his. Proc. 1984. http://www. J. Fourier analysis and uncertainty I.. Acad. J. CA. 33rd Asilomar Conference. [105] I. Wilson. Shiftable MultiScale Transforms. IEEE Trans. Schwab. Richardson. Relaxing the isoplanatism assumption in selfcalibration. K. R. Smith. H. G. Freeman. April 1999. 1961. L. PAMI Article. 40:43–64.. IEEE Transactions on Information Theory. Portilla. A quadtree approach to image segmentation which combines statistical and spatial information. Astron. In ICIP 98. 1985. Anal. Filtering for Texture Classiﬁcation: A Comparative Study.edu/faculty/rs/papers/RLS Papers. Husøy. H. 1999. Nat. and R. [106] F. Int. [110] R. [109] D. Spline Functions and the problem of graduation.stat. Romberg. [107] E. Bell. Software for Image Denoising using Waveletdomain Hidden Markov Tree Models. applications to lowfrequency radio interferometry. 1998. BayesianBased Iterative Method of Image Restoration. Simoncelli and J. Adelson. H. [111] M. [103] J. In Proc. Prolate spheroidal wavefunctions. Romberg and H. Randen. October 1999.html. Simoncelli. on Patt. K. Choi. and D. [108] E. 89:1076–1081. Baraniuk. J. Paciﬁc Grove. 1998. [102] W. Schoenberg. Spann and R.. 1964. Pattern Recognition. Special Issue . 1992. P. Choi.edu/software/WHMT/. Randen and J. [104] J. 21(4). P. http://www. Apr 1999. [101] T.html .dsp. E. on Wavelets.ux. Tech.no/∼tranden/comments.rice.254 Bibliography Comments regarding the Trans.. Heeger. 52:947–950. [100] T. Sci. January 1972. Syst.
1994. Strela and A. [119] Michael Unser. and Murray Eden. Proc. Prentice Hall. BSpline Signal Processing:Part I–Theory. [122] M. 1991. 1998. IEEE Trans. In 2000 IEEE International Conference on Image Processing. M. 41(2):821–833. Technical report. [117] A. [114] V. IEEE Transactions on Signal Processing. 2000. 1997. Walden. Vetterli. Image restoration with noise suppression using the wavelet transform. C. 1986. New York: Wiley. Therrien. [115] Yi Sun. W. Akram Aldroubi.L.. of Mathematics. [120] R. Strang and T. [118] G. 288:342–348. Signal Processing. Kova˘evi´. F. Turk. 1992. 1977. [121] M. van Spaendonck. Technology & Medicine. Starck and F. Wavelets and Filter Banks. Nonredundant. Fernandes. [113] G. [116] C. Burrus. N. July 2000. . Astronomy and Astrophysics. Wavelets and Subband Coding. In Proceedings of SIGGRAPH 91. Nguyen. on Sig. Discrete random signals and statistical signal processing. S. Prentice Hall. 10(3):219–244. 1995. Tikhonov and V. Dept. WellesleyCambridge Press. Coates. 1993.Bibliography 255 [112] J. Imperial College of Science. Generating Textures on Arbitrary Surfaces Using ReactionDiﬀusion. Englec c wood Cliﬀs:NJ. Hopﬁeld Neural Network Based Algorithms for Image Restoration and Reconstruction–Part I: Algorithms and Simulations. Vetterli and J. directionally selective complex wavelets. and C. Scalar and Multiple Wavelet Transforms TR9801. A. Murtagh. 48(7):2105–2118. Arsenin. Signal and Image denoising via Wavelet Thresholding: Orthogonal and Biorthogonal. Filter Banks allowing perfect reconstruction. T. Y. Solutions of IllPosed Problems.
[131] D. Granlund. Wilson and G. on Patt. Finite Prolate Spheroidal Sequences and Their Applications I: Generation and Properties. K. IEEE Trans. July 1988. Image restoration using a neural network. J. [126] R. K. [132] J. and B.. Webb. IEEE Trans. IEEE Trans. W. pages 177–199. Image Processing. and Mach. R. 6(6):758–767. June 1998. Solution of inverse problems in image processing by wavelet expansions. Kass. Jenkins. Anal. 1994. H. IEEE Transactions on Computers. . 9(6):787–795. IEEE Trans. Spann. Wang. Zhang. Speech. J. 7(6):813–824. [127] R. IEEE transactions on image processing. [128] R. D. Signal Processing. 1:1982. May 1995. Burnaman. 1991. [133] Y. [129] A. AAPG Computer Applications in Geology. Int. Vogel and M. C26(4):351–364. Wolf. Vaid. Image restoration by the method of convex projections: Part 1. Acoust. 10(2):193–203. D’Addario. April 1976. Anal. Finite Prolate Spheroidal Sequences and Their Applications II: Image Feature Description and Segmentation. pages 27–40. A. Wernecke and L. Zhang. 36(7):1141–1151. D. R. R. Imaging. Oman.. In Proceedings of SIGGRAPH 91. robust total variationbased reconstruction of noisy. [125] S. 1984. Integration of Well and Seismic Data Using Geostatistics. [124] G. Nov. March 1988. Int. and M. Zhou. C. [130] D. October 1982. The uncertainty principle in image processing. and Mach. Wilson. T. blurred images.. Witkin and M. January 1993. Image Proc.. Fast. and Mach. IEEE Trans. The mean ﬁeld theory for EM procedures in blind MRF image restoration. Youla and H. and G. Anal.256 Bibliography [123] C. J. Med. Pan. Int. E. Wilson and M. on Patt. ReactionDiﬀusion Textures. 1987. Chellappa.. IEEE Trans. IEEE Trans. Maximum entropy image reconstruction. theory. on Patt. Withers. 4:579–593.
Zhu.Bibliography 257 [134] S. and minimax entropy towards a uniﬁed theory for texture modelling. and D. 1996. Wu. C. pages 686–693. Mumford. FRAME: ﬁlters. random ﬁelds. . Y. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
This action might not be possible to undo. Are you sure you want to continue?