Sciweavers

2450 search results - page 253 / 490
» Time Mapping with Hypergraphs
Sort
View
PAMI
2008
270views more  PAMI 2008»
15 years 3 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
TOG
2008
125views more  TOG 2008»
15 years 3 months ago
Factoring repeated content within and among images
We reduce transmission bandwidth and memory space for images by factoring their repeated content. A transform map and a condensed epitome are created such that all image blocks ca...
Huamin Wang, Yonatan Wexler, Eyal Ofek, Hugues Hop...
JEI
2007
79views more  JEI 2007»
15 years 3 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
JFR
2007
103views more  JFR 2007»
15 years 3 months ago
Evolving interface design for robot search tasks
This paper describes two steps in the evolution of human-robot interaction designs developed by the University of Massachusetts Lowell (UML) and the Idaho National Laboratory (INL...
Holly A. Yanco, Brenden Keyes, Jill L. Drury, Curt...
JGT
2007
73views more  JGT 2007»
15 years 3 months ago
New bounds on the edge number of a k-map graph
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
Zhi-Zhong Chen