Sciweavers

2342 search results - page 104 / 469
» Sublinear geometric algorithms
Sort
View
102
Voted
EMMCVPR
2009
Springer
14 years 10 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
84
Voted
VRML
1997
ACM
15 years 5 months ago
Lodestar: An Octree-Based Level of Detail Generator for VRML
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
Dieter Schmalstieg
SIAMMA
2011
71views more  SIAMMA 2011»
14 years 7 months ago
Reconstruction of Penetrable Obstacles in Acoustic Scattering
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
Sei Nagayasu, Gunther Uhlmann, Jenn-Nan Wang
CVPR
2006
IEEE
16 years 2 months ago
Incremental learning of object detectors using a visual shape alphabet
We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the detectors built previously for other categories, and fo...
Andreas Opelt, Axel Pinz, Andrew Zisserman
113
Voted
CVPR
2008
IEEE
16 years 2 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch