Discriminating speech and non-speech with regularized least...

Data processing: artificial intelligence – Plural processing systems

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S045000

Reexamination Certificate

active

07853539

ABSTRACT:
Sound discrimination techniques are disclosed that can be employed, for example, in the task of discriminating speech and non-speech in a noisy environment and other noise classification applications. In one particular embodiment, a classifier system is provided that includes a linear Regularized Least Squares classifier used directly on a high-dimensional cortical representation of the target sound. The regularization constant lambda (λ) can be selected automatically, yielding a parameter-free learning system. In addition, the high-dimensional hyperplane can be viewed directly in the cortical space, leading to greater interpretability of the classifier results.

REFERENCES:
patent: 5839103 (1998-11-01), Mammone et al.
Tommaso, et al, The measure of randomness by leave one out prediction error in the analysis of EEG after laser painful stimulation in healthy subjects and migraine patients, Clinical Neurophysiology, vol. 116, 2005, pp. 2775 to 2782.
Rifkin, R., et al, Discriminating Speech and Non-Speech with Regularized Least Squares, Ninth International Conference on Spoken Language Processing, Pittsburgh, PA, Sep. 2006, pp. 1-4.
Aronszajn, N., “Theory of Reproducing Kernels,” Transactions of the American Mathematical Society, May 1950, pp. 337-404, vol. 68.
Chi, T., et al., “Multiresolution Spectrotemporal Analysis of Complex Sounds,” Journal of the Acoustical Society of America, Aug. 2005, pp. 887-906, vol. 118, No. 2.
De Lathauwer, L., et al., “A Multilinear Singular Value Decomposition,” SIAM Journal of Matrix Analysis and Applications, 2000, pp. 1253-1278, vol. 21, No. 4.
Evgeniou, T., et al., “Regularization Networks and Support Vector Machines,” Advances in Computational Mathematics, 2000, pp. 1-50, vol. 13.
Fine, S., et al., “Efficient SVM Training Using Low-Rank Kernel Representations,” Journal of Machine Learning Research, 2001, pp. 243-264, vol. 2.
Golub, G. H., et al., “Matrix Computations, Third Edition,” 1996, pp. vii-ix.
Hastie, T., et al., “The Entire Regularization Path for the Support Vector Machine (1),” Journal of Machine Learning Research, 2004, pp. 1391-1415, vol. 5.
Hastie, T., et al., “The Entire Regularization Path for the Support Vector Machine (2),” 8 pages, Year: 2004.
Joachims, T., et al., “Estimating the Generalization Performance of a SVM Efficiently,” Dec. 29, 1999, Universität Dortmund, pp. 1-27, Technical Report LS-8, Report 25.
Kingsbury, B., et al., “Robust Speech Recognition in Noisy Environments: The 2001 IBM Spine Evaluation System,” IEEE, to appear in Proceedings of ICASSP, 2002, pp. I-53-I-56.
Lehoucq, R. B., et al., “Deflation Techniques for an Implicitly Restarted Arnoldi Iteration,” SIAM Journal on Matrix Analysis and Applications, Oct. 1996, pp. 789-821, vol. 17, No. 4.
Lehoucq, R. B., et al., “Arpack Users Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods,” Computational and Applied Mathematics, Technical Report, Rice University, Mar. 14, 1997, pp. 1-140.
Mesgarani, N., et al., “Discrimination of Speech from Nonspeech Based on Multiscale Spectro-Temporal Modulations,” IEEE Transactions on Audio, Speech, and Language Processing, May 2006, pp. 920-930, vol. 14, No. 3.
Ramaswamy, S., et al., “Multiclass Cancer Diagnosis Using Tumor Gene Expression Signatures,” PNAS, Dec. 18, 2001, pp. 15149-15154, vol. 98, No. 26.
Rifkin, R. M., et al., “Everything Old is New Again: A Fresh Look at Historical Approaches in Machine Learning,” Doctoral Dissertation, Massachusetts Institute of Technology, Sep. 2002, pp. 1-225.
Rifkin, R., et al., “In Defense of One-Vs-All Classification,” Journal of Machine Learning Research, 2004, pp. 101-141, vol. 5.
Scheirer, E., et al., “Construction and Evaluation of a Robust Multifeature Speech/Music Discriminator,” IEEE, to appear in the Proceedings of ICASSP, Apr. 21-24, 1997, pp. 1-4.
Schölkopf, B., “A Generalized Representer Theorem,” 14thAnnual Conference on Computational Learning Theory, 2001, pp. 416-426.
Smola, A. J., “Sparse Greedy Matrix Approximation for Machine Learning,” Proceedings of the International Conference on Machine Learning, 8 pages, Year: 2000.
Vapnik, V. N., “Statistical Learning Theory,” John Wiley & Sons, Inc., 1998, pp. vii-xix, 1-15.
Wahba, G., “Spline Models for Observational Data,” Society for Industrial and Applied Mathematics, 1990, pp. 1-20, 45-65, vol. 59 of CBMS-NSF Regional Conference Series in Applied Mathematics.
Williams, C. K. I., et al., “Using the Nyström Method to Speed Up Kernel Machines,” Advances in Neural Information Processing Systems 13, Proceedings of the 2000 Conference, 2000, pp. 682-688.
Yang, C., et al., “Efficient Kernel Machines Using the Improved Fast Gauss Transform,” Advances in Neural Information Processing Systems 17, Proceedings of the 2004 Conference, 2004, pp. 1561-1568.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Discriminating speech and non-speech with regularized least... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Discriminating speech and non-speech with regularized least..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discriminating speech and non-speech with regularized least... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4175286

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.