Sciweavers

2183 search results - page 114 / 437
» Multi-pass geometric algorithms
Sort
View
TOG
2012
267views Communications» more  TOG 2012»
13 years 7 months ago
Global parametrization by incremental flattening
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
Ashish Myles, Denis Zorin
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 6 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CVPR
1997
IEEE
16 years 7 months ago
Images as embedding maps and minimal surfaces: movies, color, and volumetric medical images
A general geometrical framework for image processing is presented. We consider intensity images as surfaces in the (x I) space. The image is thereby a two dimensional surface in t...
Ron Kimmel, Ravi Malladi, Nir A. Sochen
ICIP
2008
IEEE
16 years 6 months ago
Robust video fingerprinting based on 2D-OPCA of affine covariant regions
This paper proposes a robust video fingerprinting method based on 2-Dimensional Oriented Principal Component Analysis (2D-OPCA) of affine covariant regions. The goal of video fing...
Chang Dong Yoo, Sunil Lee
190
Voted
MICCAI
2005
Springer
15 years 10 months ago
Learning Best Features for Deformable Registration of MR Brains
Abstract. This paper presents a learning method to select best geometric features for deformable brain registration. Best geometric features are selected for each brain location, a...
Guorong Wu, Feihu Qi, Dinggang Shen