Sciweavers

3466 search results - page 134 / 694
» Fast computation of special resultants
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Fast and robust active contours for image segmentation
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
Wei Yu, Franz Franchetti, Yao-Jen Chang, Tsuhan Ch...
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
15 years 4 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 1 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn

Publication
303views
17 years 5 months ago
Automatic Ascending Aorta Detection in CTA Datasets
The assessment of coronary arteries is an essential step when diagnosing coronary heart diseases. There exists a wide range of specialized algorithms for the segmentation of the co...
Stefan C. Saur, Caroline Kühnel, Tobias Boska...