Sciweavers

439 search results - page 63 / 88
» Visualizing Graphs and Clusters as Maps
Sort
View
ICCV
2005
IEEE
14 years 10 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
ATAL
2005
Springer
14 years 1 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
ICPR
2010
IEEE
14 years 3 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
SMI
2010
IEEE
188views Image Analysis» more  SMI 2010»
13 years 6 months ago
Sharp Feature Detection in Point Clouds
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
Christopher Weber, Stefanie Hahmann, Hans Hagen
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
14 years 1 months ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon