Sciweavers

3560 search results - page 129 / 712
» Low-Fidelity Algorithm Visualization
Sort
View
137
Voted
INFOVIS
2002
IEEE
15 years 7 months ago
Beamtrees: Compact Visualization of Large Hierarchies
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
Frank van Ham, Jarke J. van Wijk
ANTSW
2008
Springer
15 years 4 months ago
A Dynamic Swarm for Visual Location Tracking
Abstract. The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmen...
Marcel Kronfeld, Christian Weiss, Andreas Zell
127
Voted
APVIS
2010
15 years 4 months ago
GMap: Visualizing graphs and clusters as maps
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
CVPR
1997
IEEE
16 years 5 months ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih
CVPR
2006
IEEE
16 years 5 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