Sciweavers

1539 search results - page 32 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
142
Voted
TSP
2010
14 years 9 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
110
Voted
ICCV
2003
IEEE
16 years 4 months ago
Circular Motion Geometry by Minimal 2 Points in 4 Images
This paper describes a new and simple method of recovering the geometry of uncalibrated circular motion or single axis motion using a minimal data set of 2 points in 4 images. Thi...
Guang Jiang, Long Quan, Hung-Tat Tsui
113
Voted
CVBIA
2005
Springer
15 years 7 months ago
Fast 3D Brain Segmentation Using Dual-Front Active Contours with Optional User-Interaction
Abstract. Important attributes of 3D brain segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms ...
Hua Li, Anthony J. Yezzi, Laurent D. Cohen
129
Voted
ECCV
2006
Springer
16 years 4 months ago
Integrating Surface Normal Vectors Using Fast Marching Method
i Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the de...
Jeffrey Ho, Jongwoo Lim, Ming-Hsuan Yang, David J....
143
Voted
ICCV
2007
IEEE
16 years 4 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....