Sciweavers

2127 search results - page 100 / 426
» Computing large matchings fast
Sort
View
136
Voted
RT
1998
Springer
15 years 8 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
IEICET
2010
124views more  IEICET 2010»
14 years 10 months ago
Fast Polar and Spherical Fourier Descriptors for Feature Extraction
Polar Fourier Descriptor(PFD) and Spherical Fourier Descriptor(SFD) are rotation invariant feature descriptors for two dimensional(2D) and three dimensional(3D) image retrieval an...
Zhuo Yang, Sei-ichiro Kamata
126
Voted
ICRA
2010
IEEE
116views Robotics» more  ICRA 2010»
15 years 2 months ago
Learning visibility of landmarks for vision-based localization
— We aim to perform robust and fast vision-based localization using a pre-existing large map of the scene. A key step in localization is associating the features extracted from t...
Pablo Fernández Alcantarilla, Sang Min Oh, ...
151
Voted
CAD
2008
Springer
15 years 3 months ago
Structure-oriented contour representation and matching for engineering shapes
Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations....
Suyu Hou, Karthik Ramani
CVPR
2007
IEEE
16 years 5 months ago
Probabilistic Reverse Annotation for Large Scale Image Retrieval
Automatic annotation is an elegant alternative to explicit recognition in images. In annotation, the image is matched with keyword models, and the most relevant keywords are assig...
K. Pramod Sankar, C. V. Jawahar