Sciweavers

6142 search results - page 442 / 1229
» The Complexity of Partition Functions
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
Real-time Body Tracking Using a Gaussian Process Latent Variable Model
In this paper, we present a tracking framework for capturing articulated human motions in real-time, without the need for attaching markers onto the subject's body. This is a...
Shaobo Hou, Aphrodite Galata, Fabrice Caillette, N...
ICCV
2003
IEEE
16 years 8 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
ICIP
2006
IEEE
16 years 8 months ago
Lossy-To-Lossless Block-Based Compression of Hyperspectral Volumetric Data
An embedded, block-based, wavelet transform coding algorithm of low complexity is proposed. Three-Dimensional Set Partitioned Embedded bloCK(3D-SPECK) efficiently encodes hyperspe...
Xiaoli Tang, William A. Pearlman
ICIP
2005
IEEE
16 years 8 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 8 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella