Sciweavers

778 search results - page 41 / 156
» Improved universal denominators
Sort
View
DCC
2010
IEEE
15 years 1 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
CVPR
2009
IEEE
16 years 4 months ago
Efficient Representation of Local Geometry for Large Scale Object Retrieval
State of the art methods for image and object re- trieval exploit both appearance (via visual words) and local geometry (spatial extent, relative pose). In large scale problems,...
Michal Perdoch (Czech Technical University), Ondre...
96
Voted
CVPR
2009
IEEE
16 years 4 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2008
IEEE
15 years 11 months ago
From skeletons to bone graphs: Medial abstraction for object recognition
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
Diego Macrini, Kaleem Siddiqi, Sven J. Dickinson
CVPR
2010
IEEE
15 years 6 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...