Page 195 |
Save page Remove page | Previous | 195 of 196 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
[53] M. Padmanabhan, S. Dharanipragada, Maximizing information content in feature
extraction, IEEE Transactions on Speech and Audio Processing 13 (4) (2005) 512–
519.
[54] H. V. Poor, J. B. Thomas, Applications of ali-silvey distance measures in the design
of generalized quantizers for binary decision problems, IEEE Trans. on Commu-nications
COM-25 (9) (1977) 893–900.
[55] T. F. Quatieri, Discrete-time Speech Signal Processing principles and practice,
Prentice Hall, 2002.
[56] L. R. Rabiner, A tutorial on hidden Markov models and selected applications in
speech recognition, Proceedings of the IEEE 77 (2) (1989) 257–286.
[57] K. Ramchandran, M. Vetterli, C. Herley, Wavelet, subband coding, and best bases,
Proceedings of the IEEE 84 (4) (1996) 541–560.
[58] B. D. Ripley, Patten Recognition and Neural Networks, Cambridge Univ Press,
1996.
[59] N. Saito, R. R. Coifman, Local discriminant basis, in Proc. SPIE 2303, Mathemat-ical
Imaging: Wavelet Applications in Signal and Image Processing (1994) 2–14.
[60] N. A. Schmid, J. A. O’Sullivan, Thresholding method for dimensionality reduction
in recognition system, IEEE Transactions on Information Theory 47 (7) (2001)
2903–2920.
[61] C. Scott, Tree pruning with subadditive penalties, IEEE Transactions on Signal
Processing 53 (12) (2005) 4518–4525.
[62] C. Scott, R. D. Nowak, Minimax-optimal classification with dyadic decision trees,
IEEE Transactions on Information Theory 52 (4) (2006) 1335–1353.
[63] J. Silva, S. Narayanan, Minimum probability of error signal representation,, in:
IEEE International Workshop on Machine Learning for Signal Processing, 2007.
[64] J. Silva, S. Narayanan, Optimal wavelet packets decomposition based on a rate-distortion
optimality criterion, in: IEEE International Conference on Acoustics,
Speech, and Signal Processing, IEEE, 2007.
[65] J. Silva, S. Narayanan, Optimal wavelet packets decomposition based on a rate-distortion
optimality criterion, in: IEEE International Conference on Acoustics,
Speech, and Signal Processing ICASSP, IEEE, 2007.
[66] J. Silva, S. Narayanan, Universal consistency of data-driven partitions for diver-gence
estimation, in: IEEE International Symposium on Information Theory,
2007.
182
Object Description
| Title | On optimal signal representation for statistical learning and pattern recognition |
| Author | Silva, Jorge |
| Author email | jorgesil@usc.edu; josilva@ing.uchile.cl |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2008-06-23 |
| Date submitted | 2008 |
| Restricted until | Unrestricted |
| Date published | 2008-10-21 |
| Advisor (committee chair) | Narayanan, Shrikanth S. |
| Advisor (committee member) |
Kuo, C.-C. Jay Ordóñez, Fernando I. |
| Abstract | This work presents contributions on two important aspects of the role of signal representation in statistical learning problems, in the context of deriving new methodologies and representations for speech recognition and the estimation of information theoretic quantities.; The first topic focuses on the problem of optimal filter bank selection using Wavelet Packets (WPs) for speech recognition applications. We propose new results to show an estimation-approximation error tradeoff across sequence of embedded representations. These results were used to formulate the minimum probability of error signal representation (MPE-SR) problem as a complexity regularization criterion. Restricting this criterion to the filter bank selection, algorithmic solutions are provided by exploring the dyadic tree-structure of WPs. These solutions are stipulated in terms of a set of conditional independent assumptions for the acoustic observation process, in particular, a Markov tree property across the indexed structure of WPs. In the technical side, this work presents contributions on the extension of minimum cost tree pruning algorithms and their properties to affine tree functionals. For the experimental validation, a phone classification task ratifies the goodness of Wavelet Packets as an analysis scheme for non-stationary time-series processes, and the effectiveness of the MPE-SR to provide cost effective discriminative filter bank solution for pattern recognition.; The second topic addresses the problem of data-dependent partitions for the estimation of mutual information and Kullback-Leibler divergence (KLD). This work proposes general histogram-based estimates considering non-product data-driven partition schemes. The main contribution is the stipulation of sufficient conditions to make these histogram-based constructions strongly consistent for both problems. The sufficient conditions consider combinatorial complexity indicator for partition families and the use of large deviation type of inequalities (Vapnik-Chervonenkis inequalities). On the application side, two emblematic data-dependent constructions are derived from this result, one based on statistically equivalent blocks and the other, on a tree-structured vector quantization scheme. A range of design values was stipulated to guarantee strongly consistency estimates for both framework. Furthermore, experimental results under controlled settings demonstrate the superiority of these data-driven techniques in terms of a bias-variance analysis when compared to conventional product histogram-based and kernel plug-in estimates. |
| Keyword | signal representation in statistical learning; Bayes decision theory; basis selection; tree-structured bases and Wavelet packet (WP); complexity regularization; minimum cost tree pruning; family pruning problem; mutual information estimation; divergence estimation; data-dependent partitions; statistical learning theory; concentration inequalities; tree-structured vector quantization. |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m1684 |
| Contributing entity | University of Southern California |
| Rights | Silva, Jorge |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | cisadmin@lib.usc.edu |
| Filename | etd-Silva-2450 |
| Archival file | uscthesesreloadpub_Volume32/etd-Silva-2450.pdf |
Description
| Title | Page 195 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | [53] M. Padmanabhan, S. Dharanipragada, Maximizing information content in feature extraction, IEEE Transactions on Speech and Audio Processing 13 (4) (2005) 512– 519. [54] H. V. Poor, J. B. Thomas, Applications of ali-silvey distance measures in the design of generalized quantizers for binary decision problems, IEEE Trans. on Commu-nications COM-25 (9) (1977) 893–900. [55] T. F. Quatieri, Discrete-time Speech Signal Processing principles and practice, Prentice Hall, 2002. [56] L. R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE 77 (2) (1989) 257–286. [57] K. Ramchandran, M. Vetterli, C. Herley, Wavelet, subband coding, and best bases, Proceedings of the IEEE 84 (4) (1996) 541–560. [58] B. D. Ripley, Patten Recognition and Neural Networks, Cambridge Univ Press, 1996. [59] N. Saito, R. R. Coifman, Local discriminant basis, in Proc. SPIE 2303, Mathemat-ical Imaging: Wavelet Applications in Signal and Image Processing (1994) 2–14. [60] N. A. Schmid, J. A. O’Sullivan, Thresholding method for dimensionality reduction in recognition system, IEEE Transactions on Information Theory 47 (7) (2001) 2903–2920. [61] C. Scott, Tree pruning with subadditive penalties, IEEE Transactions on Signal Processing 53 (12) (2005) 4518–4525. [62] C. Scott, R. D. Nowak, Minimax-optimal classification with dyadic decision trees, IEEE Transactions on Information Theory 52 (4) (2006) 1335–1353. [63] J. Silva, S. Narayanan, Minimum probability of error signal representation,, in: IEEE International Workshop on Machine Learning for Signal Processing, 2007. [64] J. Silva, S. Narayanan, Optimal wavelet packets decomposition based on a rate-distortion optimality criterion, in: IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2007. [65] J. Silva, S. Narayanan, Optimal wavelet packets decomposition based on a rate-distortion optimality criterion, in: IEEE International Conference on Acoustics, Speech, and Signal Processing ICASSP, IEEE, 2007. [66] J. Silva, S. Narayanan, Universal consistency of data-driven partitions for diver-gence estimation, in: IEEE International Symposium on Information Theory, 2007. 182 |
