Sciweavers

3360 search results - page 519 / 672
» Opportunistic Data Structures with Applications
Sort
View
ICCV
2003
IEEE
16 years 5 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
ICCV
2003
IEEE
16 years 5 months ago
Image Statistics and Anisotropic Diffusion
Many sensing techniques and image processing applications are characterized by noisy, or corrupted, image data. Anisotropic diffusion is a popular, and theoretically well understo...
Hanno Scharr, Michael J. Black, Horst W. Haussecke...
ECCV
2008
Springer
16 years 5 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 5 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
217
Voted
ICDE
1999
IEEE
111views Database» more  ICDE 1999»
16 years 5 months ago
Storage of Multidimensional Arrays Based on Arbitrary Tiling
Storage management of multidimensional arrays aims at supporting the array model needed by applications and insuring fast execution of access operations. Current approaches to sto...
Paula Furtado, Peter Baumann