Sciweavers

80 search results - page 13 / 16
» Constrained Aggregate Similarity Queries in Metric Spaces
Sort
View
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
15 years 9 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 9 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
15 years 2 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
MLDM
1999
Springer
15 years 1 months ago
Independent Feature Analysis for Image Retrieval
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They su€er from unequal di€erential relevance of features in comput...
Jing Peng, Bir Bhanu