default search action
CVDB 2005: Baltimore, MD, USA
- Laurent Amsaleg, Björn Þór Jónsson, Vincent Oria:
Proceedings of the Second International Workshop on Computer Vision meets Databases, CVDB 2005, June 17, 2005, Baltimore, MD, USA. ACM International Conference Proceeding Series 160, ACM 2005, ISBN 1-59593-151-1
Keynote speech 1
- Raghu Ramakrishnan, Jonathan Goldstein, Uri Shaft:
Similarity search in high-dimensional datasets. 1-2
Keynote speech 2
- Patrick Gros:
Joint exploitation of multiple media from multimedia to databases. 3
Multimedia modeling and querying
- Edward Y. Chang:
EXTENT: fusing context, content, and semantic ontology for photo annotation. 5-11 - Anicet Kouomou Choupo, Laure Berti-Équille, Annie Morin:
Optimizing progressive query-by-example over pre-clustered large image databases. 13-20 - Xavier Naturel, Patrick Gros:
A fast shot matching strategy for detecting duplicate sequences in a television stream. 21-27 - Li Yang:
Data embedding techniques and applications. 29-33
CVDB best student paper
- Bin Liu, Amarnath Gupta, Ramesh C. Jain:
A live multimedia stream querying system. 35-42
High-dimensional data analysis and indexing
- Sid-Ahmed Berrani, Christophe Garcia:
On the impact of outliers on high-dimensional data analysis methods for face recognition. 43-49 - Herwig Lejsek:
A case-study of scoring schemes for the PvS-index. 51-58 - Arun Qamra, Edward Y. Chang:
Using pivots to index for support vector machine queries. 59-64 - Lijuan Zhang, Alexander Thomasian:
Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets. 65-70
Panel
- John R. Smith, David S. Doermann, Amarnath Gupta, Jonathan Goldstein, Uri Shaft, Nalini K. Ratha:
Multimedia applications: beyond similarity searches. 71-72
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.