2272 search results - page 207 / 455 » Capture Complexity by Partition |
133
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
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...
123
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we propose a method for extending the standard motion estimation algorithms used in video compression algorithms, to incorporate motion parameters that describe non-...
134
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
An embedded, block-based, wavelet transform coding algorithm of low complexity is proposed. Three-Dimensional Set Partitioned Embedded bloCK(3D-SPECK) efficiently encodes hyperspe...
137
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
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 ...
351
Voted
ICDE
2000
IEEE
16 years 4 months ago
2000
IEEE
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...