2003
DOI: 10.1016/s0165-1684(02)00417-6
|View full text |Cite
|
Sign up to set email alerts
|

Fast adaptive eigenvalue decomposition: a maximum likelihood approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 23 publications
0
15
0
Order By: Relevance
“…The singular value decomposition (SVD) step in SVF is by far the most intensive computation in either technique with each SVD representing N 3 operations (Yu and Lovstakken, 2010). Even without optimization, which has been shown to achieve dramatically reduced SVD computational cost (Lovstakken et al , 2006; Chonavel et al , 2003; Mauldin et al , 2010), the SVF technique can be implemented, using dedicated hardware ( e.g. GPUs), to produce frame rates greater than 30 Hz.…”
Section: Discussionmentioning
confidence: 99%
“…The singular value decomposition (SVD) step in SVF is by far the most intensive computation in either technique with each SVD representing N 3 operations (Yu and Lovstakken, 2010). Even without optimization, which has been shown to achieve dramatically reduced SVD computational cost (Lovstakken et al , 2006; Chonavel et al , 2003; Mauldin et al , 2010), the SVF technique can be implemented, using dedicated hardware ( e.g. GPUs), to produce frame rates greater than 30 Hz.…”
Section: Discussionmentioning
confidence: 99%
“…By applying eigenvalue decomposition (EVD) [14] with B, we can easily obtain the (n + k)-dimensional embedded representation O that models the (n+k)-dimensional embedded manifold (R n+k ).…”
Section: Embedded Manifold Extractionmentioning
confidence: 99%
“…The overall computational cost of FAPI is n(3r + 2) + 5r 2 + O(r) flops per iteration 13 (whereas the complexities of PAST [22] and OPAST [25] are respectively 3nr + 2r 2 + O(r) and n(4r + 1) + 2r 2 + O(r)). The overall computational cost of TW-FAPI is n(6r + 8) + 4lr + O(r 2 ) flops per iteration 14 (whereas the complexities of SW-PAST and SW-OPAST [29] are respectively 5nr + 4r 2 + O(r) and n(15r + 28) + 12r 2 + O(r)).…”
Section: B Fast Implementation Of the Particular Solutionmentioning
confidence: 99%
“…Other techniques rely on the noise and signal subspace averaging method [12], the maximum likelihood principle [13], the operator restriction analysis [14], or the perturbation theory [15].…”
Section: Introductionmentioning
confidence: 99%