Sciweavers

1348 search results - page 145 / 270
» Matching planar maps
Sort
View
ACCV
2009
Springer
14 years 3 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
SI3D
2003
ACM
14 years 2 months ago
Application of the two-sided depth test to CSG rendering
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...
Sudipto Guha, Shankar Krishnan, Kamesh Munagala, S...
ICAD
2004
13 years 10 months ago
Creating Functional and Livable Soundscapes for Peripheral Monitoring of Dynamic Data
Sonifications must be studied in order to match listener expectancies about data representation in the form of sound. In this study, a system was designed and implemented for dyna...
Brad S. Mauney, Bruce N. Walker
IJON
2006
109views more  IJON 2006»
13 years 9 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
NN
2006
Springer
113views Neural Networks» more  NN 2006»
13 years 8 months ago
Large-scale data exploration with the hierarchically growing hyperbolic SOM
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
Jörg Ontrup, Helge Ritter