Sparse Signal Representation using Overlapping Frames

Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames for sparse signal representations may be designed using an iterative method with two main steps: (1) Frame vector selection and expansion coefficient determination for signals in a training set, – selected to be representative of the signals for which compact representations are desired, using the frame designed in the previous iteration. (2) Update of frame vectors with the objective of improving the representation of step (1). In this thesis we solve step (2) of the general frame design problem using the compact notation of linear algebra.This makes the solution both conceptually and computationally easy, especially for the non-block-oriented frames, – for short overlapping frames, that may be viewed as generalizations of critically sampled filter banks. Also, the solution is more general than those presented earlier, facilitating the imposition of constraints, such as symmetry, on the designed frame vectors. We also take a closer look at step (1) in the design method. Some of the available vector selection algorithms are reviewed, and adaptations to some of these are given. These adaptations make the algorithms better suited for both the frame design method and the sparse representation of signals problem, both for block-oriented and overlapping frames.The performances of the improved frame design method are shown in extensive experiments. The sparse representation capabilities are illustrated both for one-dimensional and two-dimensional signals, and in both cases the new possibilities in frame design give better results.Also a new method for texture classification, denoted Frame Texture Classification Method (FTCM), is presented. The main idea is that a frame trained for making sparse representations of a certain class of signals is a model for this signal class. The FTCM is applied to nine test images, yielding excellent overall performance, for many test images the number of wrongly classified pixels is more than halved, in comparison to state of the art texture classification methods presented in [59].Finally, frames are analyzed from a practical viewpoint, rather than in a mathematical theoretic perspective. As a result of this, some new frame properties are suggested. So far, the new insight this has given has been moderate, but we think that this approach may be useful in frame analysis in the future.

[1]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[2]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[3]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[4]  Robert Bregovic,et al.  Multirate Systems and Filter Banks , 2002 .

[5]  Ingrid Daubechies,et al.  The wavelet transform, time-frequency localization and signal analysis , 1990, IEEE Trans. Inf. Theory.

[6]  Avideh Zakhor,et al.  Video compression using matching pursuits , 1999, IEEE Trans. Circuits Syst. Video Technol..

[7]  Bhaskar D. Rao,et al.  Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.

[8]  Chris J. Oliver,et al.  Rain forest classification based on SAR texture , 2000, IEEE Trans. Geosci. Remote. Sens..

[9]  B. Rao,et al.  Forward sequential algorithms for best basis selection , 1999 .

[10]  Martin Vetterli,et al.  Oversampled filter banks , 1998, IEEE Trans. Signal Process..

[11]  Avideh Zakhor,et al.  Modulus quantization for matching-pursuit video coding , 2000, IEEE Trans. Circuits Syst. Video Technol..

[12]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[13]  S. O. Aase,et al.  Subband Compression of Images: Principals and Examples , 1995 .

[14]  M. Gharavi-Aikhansari A model for entropy coding in matching pursuit , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[15]  Rémi Gribonval,et al.  Fast matching pursuit with a multiscale dictionary of Gaussian chirps , 2001, IEEE Trans. Signal Process..

[16]  Mark R. Banham,et al.  A selective update approach to matching pursuits video coding , 1997, IEEE Trans. Circuits Syst. Video Technol..

[17]  Yoshua Bengio,et al.  Convergence Properties of the K-Means Algorithms , 1994, NIPS.

[18]  Teuvo Kohonen,et al.  The self-organizing map , 1990, Neurocomputing.

[19]  Mohammad Gharavi-Alkhansari,et al.  A fast globally optimal algorithm for template matching using low-resolution pruning , 2001, IEEE Trans. Image Process..

[20]  M. Unser Local linear transforms for texture measurements , 1986 .

[21]  A Mahalanobis,et al.  Application of correlation filters for texture recognition. , 1994, Applied optics.

[22]  S. O. Aase,et al.  A simple design of sparse signal representations using overlapping frames , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..

[23]  F. Kruggel,et al.  Three-dimensional texture analysis of MRI brain datasets , 2001, IEEE Transactions on Medical Imaging.

[24]  Rangaraj M. Rangayyan,et al.  Detection of breast masses in mammograms by density slicing and texture flow-field analysis , 2001, IEEE Transactions on Medical Imaging.

[25]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[26]  K. Blekas,et al.  Fuzzy neural network-based texture analysis of ultrasonic images , 2000, IEEE Engineering in Medicine and Biology Magazine.

[27]  Kjersti Engan,et al.  Design of general block oriented expansions for efficient signal representation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[28]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[29]  W. B. Mikhael,et al.  An efficient structure and algorithm for image representation using nonorthogonal basis images , 1997 .

[30]  Mohammad Gharavi-Alkhansari A Model for Entropy Coding in Matching Pursuit , 1998, ICIP.

[31]  Soo-Chang Pei,et al.  An introduction to discrete finite frames , 1997, IEEE Signal Process. Mag..

[32]  Vivek K. Goyal,et al.  Filter bank frame expansions with erasures , 2002, IEEE Trans. Inf. Theory.

[33]  Yehoshua Y. Zeevi,et al.  Frame analysis of wavelet-type filter banks , 1998, Signal Process..

[34]  R. Duffin,et al.  A class of nonharmonic Fourier series , 1952 .

[35]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[36]  Kjersti Engan,et al.  Optimized signal expansions for sparse representation , 2001, IEEE Trans. Signal Process..

[37]  Michael Unser,et al.  Nonlinear operators for improving texture segmentation based on features extracted by spatial filtering , 1990, IEEE Trans. Syst. Man Cybern..

[38]  Bhaskar D. Rao,et al.  Signal processing with the sparseness constraint , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[39]  Henrique S. Malvar Extended lapped transforms: fast algorithms and applications , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[40]  Gerard F. McLean Vector quantization for texture classification , 1993, IEEE Trans. Syst. Man Cybern..

[41]  Vassili A. Kovalev,et al.  3D Texture Analysis of MRI Brain Datasets , 2001, IEEE Trans. Medical Imaging.

[42]  Zhifeng Zhang,et al.  Adaptive Nonlinear Approximations , 1994 .

[43]  Kjersti Engan,et al.  Design of signal expansions for sparse representation , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[44]  Helmut Bölcskei,et al.  Frame-theoretic analysis of oversampled filter banks , 1998, IEEE Trans. Signal Process..

[45]  Kjersti Engan,et al.  Frame based signal representation and compression , 2000 .

[46]  Stéphane Mallat,et al.  Matching pursuit of images , 1995, Proceedings., International Conference on Image Processing.

[47]  Martin Vetterli,et al.  Matching pursuit for compression and application to motion compensated video coding , 1994, Proceedings of 1st International Conference on Image Processing.

[48]  F. Girosi,et al.  Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification , 1993 .

[49]  Avideh Zakhor,et al.  Very low bit-rate video coding based on matching pursuits , 1997, IEEE Trans. Circuits Syst. Video Technol..

[50]  Christopher Heil,et al.  Continuous and Discrete Wavelet Transforms , 1989, SIAM Rev..

[51]  Dengru Wu,et al.  A new texture approach to discrimination of forest clearcut, canopy, and burned area using airborne C-band SAR , 1999, IEEE Trans. Geosci. Remote. Sens..

[52]  Stefan M. Luthi,et al.  Textural segmentation of digital rock images into bedding units using texture energy and cluster labels , 1994 .

[53]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[54]  Chung-Lin Huang,et al.  Matching Pursuit Low-Bit Rate Video Coding with a Dictionary Optimized by Gain-Shape Vector Quantizer , 2003 .

[55]  Nick C. Fox,et al.  MR image texture analysis applied to the diagnosis and tracking of Alzheimer's disease , 1998, IEEE Transactions on Medical Imaging.

[56]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[57]  Kjersti Engan,et al.  Multi-frame compression: theory and design , 2000, Signal Process..

[58]  Thomas S. Huang,et al.  A fast orthogonal matching pursuit algorithm , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[59]  S. O. Aase,et al.  SPARSE REPRESENTATION OF IMAGES USING OVERLAPPING FRAMES , 2000 .

[60]  Hui Li,et al.  Multiscale matching pursuit for image coding , 1999, ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359).

[61]  Chung-Lin Huang,et al.  Road sign interpretation using matching pursuit method , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[62]  Trygve Randen,et al.  Filtering for Texture Classification: A Comparative Study , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[63]  Christophe De Vleeschouwer,et al.  Subband dictionaries for low-cost matching pursuits of video residues , 1999, IEEE Trans. Circuits Syst. Video Technol..

[64]  Piotr J. Durka,et al.  Stochastic time-frequency dictionaries for matching pursuit , 2001, IEEE Trans. Signal Process..

[65]  J. Wade Davis,et al.  Statistical Pattern Recognition , 2003, Technometrics.

[66]  Anil K. Jain,et al.  Texture Analysis , 2018, Handbook of Image Processing and Computer Vision.

[67]  P. Casazza THE ART OF FRAME THEORY , 1999, math/9910168.

[68]  Trygve Randen,et al.  Texture segmentation using filters with optimized energy separation , 1999, IEEE Trans. Image Process..

[69]  Henrique S. Malvar,et al.  The LOT: transform coding without blocking effects , 1989, IEEE Trans. Acoust. Speech Signal Process..