410 search results - page 73 / 82 » A Fast Method for Local Penetration Depth Computation |
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
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...
SIAMNUM
2011
12 years 11 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
TVCG
2012
11 years 11 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
IPPS
2000
IEEE
14 years 29 days ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...