Sökning: "subspace algorithms"

Visar resultat 1 - 5 av 32 avhandlingar innehållade orden subspace algorithms.

1. 1. Compressed Sensing : Algorithms and Applications

   Författare :Dennis Sundman; Mikael Skoglund; Magnus Jansson; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; compressed sensing; greedy pursuits; subspace pursuit; orthogonal matching pursuit; power spectral density estimation; distributed compressed sensing;

   Sammanfattning : The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. LÄS MER

3. 2. On subspace-based instrumental variable methods with application to time-varying systems

   Författare :Tony Gustafsson; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; recursive algorithms; change-detection; subspace tracking; system identification; direction of arrival estimation; instrumental variables; subspace methods; correlated noise fields; rank reduction; state-space models;

   Sammanfattning : .... LÄS MER

4. 3. On Speech-to-Text Alignment, Phonetic Labeling, and Recursive Signal Processing

   Författare :Åke Andersson; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; phonetic labeling; recursive algorithms; adaptive algorithms; speech-to-text alignment; dynamic programming; time-varying systems; subspace tracking; time-alignment; parameter estimation; time-warping;

   Sammanfattning : Speech data-bases are an important issue in the study of speech communication. In particular, time-aligned and phonetically labeled speech data-bases are useful during the design of applications such as speech recognizers. The time-alignment and labeling of the speech data is traditionally done manually. LÄS MER

5. 4. Subspace Selection Techniques for Classification Problems

   Författare :David Lindgren; Lennart Ljung; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Linear subspaces for regression; Asymetric classification; Subspace parameterization; Clustered regression analysis;

   Sammanfattning : The main topic of this thesis is linear subspaces for regression - how to find the subspaces and how to evaluate them. The motivation to do regression in a subspace is numerical as well as computational - numerical in the sense that the subspace can filter out the relevant components or features of the problem, computationally in the sense that this filtering can be done quickly and then can nonlinear predictionby artificial neural networks, for instance, be conducted in lower dimensionality. LÄS MER

7. 5. Algorithms in data mining : reduced rank regression and classification by tensor methods

   Författare :Berkant Savas; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

   Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER