Sciweavers

157 search results - page 29 / 32
» Compact representations of separable graphs
Sort
View
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
ICPR
2000
IEEE
13 years 11 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
CVIU
2007
112views more  CVIU 2007»
13 years 7 months ago
Pedestrian detection and tracking in infrared imagery using shape and appearance
In this paper, we present an approach toward pedestrian detection and tracking from infrared imagery using joint shape and appearance cues. A layered representation is first intr...
Congxia Dai, Yunfei Zheng, Xin Li
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 7 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 4 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen