skip to main content
Local feature extraction and its applications using a library of bases
Publisher:
  • Yale University
  • Computer Science Dept. 51 Prospect St. New Haven, CT
  • United States
Order Number:AAI9523225
Pages:
226
Bibliometrics
Skip Abstract Section
Abstract

Extracting relevant features from signals is important for signal analysis such as compression, noise removal, classification, or regression (prediction). Often, important features for these problems, such as edges, spikes, or transients, are characterized by local information in the time (space) domain and the frequency (wave number) domain.

The conventional techniques are not efficient to extract features localized simultaneously in the time and frequency domains. These methods include: the Fourier transform for signal/noise separation, the Karhunen-Loeve transform for compression, and the linear discriminant analysis for classification. The features extracted by these methods are of global nature either in time or in frequency domain so that the interpretation of the results may not be straightforward. Moreover, some of them require solving the eigenvalue systems so that they are fragile to outliers or perturbations and are computationally expensive, i.e., $O(n\sp3$), where n is a dimensionality of a signal.

The approach explored here is guided by the best-basis paradigm which consists of three steps: (1) select a "best" basis (or coordinate system) for the problem at hand from a library of bases (a fixed yet flexible set of bases consisting of wavelets, wavelet packets, local trigonometric bases, and the autocorrelation functions of wavelets), (2) sort the coordinates (features) by "importance" for the problem at hand and discard "unimportant" coordinates, and (3) use these survived coordinates to solve the problem at hand. What is "best" and "important" clearly depends on the problem: for example, minimizing a description length (or entropy) is important for signal compression whereas maximizing class separation (or relative entropy among classes) is important for classification.

These bases "fill the gap" between the standard Euclidean basis and the Fourier basis so that they can capture the local features and provide an array of tools unifying the conventional techniques. Moreover, these tools provide efficient numerical algorithms, e.g., $O(n$ (log n) $\sp{p}),$ where p = 0, 1, 2, depending on the basis.

In present thesis, these methods have been applied usefully to a variety of problems: simultaneous noise suppression and signal compression, classification, regression, multiscale edge detection and representation, and extraction of geological information from acoustic waveforms.

Cited By

  1. Li X, Lin J and Zhao L Linear time complexity time series clustering with symbolic pattern forest Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2930-2936)
  2. Marteau P (2019). Times Series Averaging and Denoising from a Probabilistic Perspective on Time–Elastic Kernels, International Journal of Applied Mathematics and Computer Science, 29:2, (375-392), Online publication date: 1-Jun-2019.
  3. ACM
    Paparrizos J and Gravano L (2017). Fast and Accurate Time-Series Clustering, ACM Transactions on Database Systems, 42:2, (1-49), Online publication date: 1-Jun-2017.
  4. Harvill J, Kohli P and Ravishanker N (2017). Clustering Nonlinear, Nonstationary Time Series Using BSLEX, Methodology and Computing in Applied Probability, 19:3, (935-955), Online publication date: 1-Sep-2017.
  5. ACM
    Huy V and Anh D An efficient implementation of anytime k-medoids clustering for time series under dynamic time warping Proceedings of the 7th Symposium on Information and Communication Technology, (22-29)
  6. ACM
    Paparrizos J and Gravano L k-Shape Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, (1855-1870)
  7. Vignolo L, Milone D and Rufiner H (2013). Genetic wavelet packets for speech recognition, Expert Systems with Applications: An International Journal, 40:6, (2350-2359), Online publication date: 1-May-2013.
  8. Bernecker T, Houle M, Kriegel H, Kröger P, Renz M, Schubert E and Zimek A Quality of similarity rankings in time series Proceedings of the 12th international conference on Advances in spatial and temporal databases, (422-440)
  9. Ince N, Kao C, Kaveh M, Tewfik A and Labuz J (2010). A machine learning approach for locating acoustic emission, EURASIP Journal on Advances in Signal Processing, 2010, (1-14), Online publication date: 1-Feb-2010.
  10. ACM
    Arazy O and Croitoru A (2010). The sustainability of corporate wikis, ACM Transactions on Management Information Systems, 1:1, (1-24), Online publication date: 1-Dec-2010.
  11. Chen L and Kamel M (2009). A generalized adaptive ensemble generation and aggregation approach for multiple classifier systems, Pattern Recognition, 42:5, (629-644), Online publication date: 1-May-2009.
  12. Glock S, Gillich E, Schaede J and Lohweg V Feature Extraction Algorithm for Banknote Textures Based on Incomplete Shift Invariant Wavelet Packet Transform Proceedings of the 31st DAGM Symposium on Pattern Recognition - Volume 5748, (422-431)
  13. Avci D (2009). An expert system for speaker identification using adaptive wavelet sure entropy, Expert Systems with Applications: An International Journal, 36:3, (6295-6300), Online publication date: 1-Apr-2009.
  14. El-Wakdy M, El-Sehely E, El-Tokhy M and El-Hennawy A Speech recognition using a wavelet transform to establish fuzzy inference system through subtractive clustering and neural network (ANFIS) Proceedings of the 12th WSEAS international conference on Systems, (381-386)
  15. Aßfalg J, Kats M, Kriegel H, Kunath P and Pryakhin A Index-supported similarity search using multiple representations Proceedings of the 13th international conference on Database systems for advanced applications, (504-511)
  16. Boudraa A, Cexus J, Groussat M and Brunagel P (2008). An energy-based similarity measure for time series, EURASIP Journal on Advances in Signal Processing, 2008, (1), Online publication date: 1-Jan-2008.
  17. Yeh M, Dai B and Chen M (2007). Clustering over Multiple Evolving Streams by Events and Correlations, IEEE Transactions on Knowledge and Data Engineering, 19:10, (1349-1362), Online publication date: 1-Oct-2007.
  18. Niennattrakul V and Ratanamahatana C Inaccuracies of Shape Averaging Method Using Dynamic Time Warping for Time Series Data Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007, (513-520)
  19. Chen L and Kamel M Design of multiple classifier systems for time series data Proceedings of the 6th international conference on Multiple Classifier Systems, (216-225)
  20. Hirano S and Tsumoto S Clustering time-series medical databases based on the improved multiscale matching Proceedings of the 15th international conference on Foundations of Intelligent Systems, (612-621)
  21. Rodríguez J, Alonso C and Maestro J (2005). Support vector machines of interval-based features for time series classification, Knowledge-Based Systems, 18:4-5, (171-178), Online publication date: 1-Aug-2005.
  22. Kadous M and Sammut C (2005). Classification of Multivariate Time Series and Structured Data Using Constructive Induction, Machine Language, 58:2-3, (179-216), Online publication date: 1-Feb-2005.
  23. ACM
    Rodríguez J and Alonso C Interval and dynamic time warping-based decision trees Proceedings of the 2004 ACM symposium on Applied computing, (548-552)
  24. Asdornwised W and Jitapunkul S Automatic target recognition using multiple description coding models for multiple classifier systems Proceedings of the 4th international conference on Multiple classifier systems, (336-345)
  25. ACM
    Keogh E and Pazzani M Scaling up dynamic time warping for datamining applications Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, (285-289)
Contributors
  • University of California, Davis
  • Yale University

Recommendations