Sciweavers

3630 search results - page 19 / 726
» Fast Marching Methods
Sort
View
EMMCVPR
2001
Springer
14 years 7 days ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps
CVPR
2011
IEEE
13 years 3 months ago
Novel 4-D Open-Curve Active Contour and Curve Completion Approach for Automated Tree Structure Extraction
We present novel approaches for fully automated extraction of tree-like tubular structures from 3-D image stacks. A 4-D Open-Curve Active Contour (Snake) model is proposed for sim...
Yu Wang, Arunachalam Narayanaswamy, Badri Roysam
DFT
1999
IEEE
119views VLSI» more  DFT 1999»
14 years 1 days ago
RAMSES: A Fast Memory Fault Simulator
In this paper, we present a memory fault simulator called the Random Access Memory Simulator for Error Screening (RAMSES). Although it was designed based on some wellknown memory ...
Chi-Feng Wu, Chih-Tsun Huang, Cheng-Wen Wu
CGF
2011
12 years 11 months ago
Contouring Discrete Indicator Functions
We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2material volume fractions with a high degree of accuracy. Although Marchi...
Josiah Manson, J. Smith, Scott Schaefer
MTA
2006
195views more  MTA 2006»
13 years 7 months ago
An efficient and robust algorithm for 3D mesh segmentation
Abstract This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods deco...
Lijun Chen 0003, Nicolas D. Georganas