6365 search results - page 106 / 1273 » Fast Local Computation Algorithms |
130
click to vote
ICIP
1999
IEEE
16 years 4 months ago
1999
IEEE
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
129
Voted
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
157
Voted
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
101
Voted
ISBI
2008
IEEE
16 years 3 months ago
2008
IEEE
Tracking of left ventricles in 3D echocardiography is a challenging topic because of the poor quality of ultrasound images and the speed consideration. In this paper, a fast and a...
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...