Norio Katayama, Shin'ichi Satoh  Home/Search
Context Related
| research.nii.ac.jp/~kata...icde2001.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: research.nii.ac.jp/~kat...English (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database literature reveal that a curious problem happens in high dimensional space. Since high dimensional space has high degree of freedom, points could be so scattered that every distance between them might yield no significant difference. In this case, we can say that the NN is indistinctive because many points exist at the ... (Update)
Similar documents based on text: More All
1.4: Similarity Image Retrieval with Significance-Sensitive.. - Katayama, Satoh (2000) (Correct)
1.4: Significance-Sensitive Nearest-Neighbor Search for Efficient.. - Katayama, Satoh (Correct)
0.3: The SR-tree: An Index Structure for High-Dimensional Nearest.. - Katayama, Satoh (1997) (Correct)
Related documents from co-citation: More All
3: Hd-eye: visual mining of highdimensional data (context) - Hinneburg, Wawryniuk et al. - 1999
3: FALCON: Feedback Adaptive Loop for Content-Based Retrieval - Wu, Faloutsos et al. - 2000
3: The IGrid Index: Reversing the Dimensionality Curse for Similarity Indexing in H.. - Aggarwal, Yu - 2000
BibTeX entry: (Update)
N. Katayama, S. Satoh. Distinctiveness Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information. Proceedings of the ICDE Conference, 2001. http://citeseer.ist.psu.edu/katayama01distinctivenesssensitive.html More
@inproceedings{ katayama01distinctivenesssensitive,
author = "Norio Katayama and Shin'ichi Satoh",
title = "Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information",
booktitle = "{ICDE}",
pages = "493-502",
year = "2001",
url = "citeseer.ist.psu.edu/katayama01distinctivenesssensitive.html" }
Citations (may not include all citations):897 Introduction to Statistical Pattern Recognition (2nd ed (context) - Fukunaga - 1990
266 An Optimal Algorithm for Approximate Nearest Neighbor Search.. - Arya, Mount et al. - 1994
165 The SR-tree: An Index Structure for High-Dimensional Nearest.. - Katayama, Satoh - 1997
162 Similarity Indexing with the SStree (context) - White, Jain - 1996
103 Ranking in Spatial Databases - Hjaltason, Samet - 1995
78 The X-tree: An Index Structure for High-Dimensional Data - Berchtold, Keim et al. - 1996
72 Nearest Neighbor (context) - Beyer, Goldstein et al. - 1999
61 Fast Parallel Similarity Search in Multimedia Databases (context) - Berchtold, Bohm et al. - 1997
55 Similarity Indexing: Algorithms and Performance - White, Jain - 1996
50 The Hybrid Tree: An Index Structure for High Dimensional Fea.. - Chakrabarti, Mehrotra - 1999
32 Independent Quantization: An Index Compression Technique for.. - Berchtold, Bohm et al. - 2000
6 PAC Nearest Neighbor Queries: Approximate and Controlled Sea.. - Ciaccia, Patella - 2000
3 The LSD -tree: An Access Structure for Feature Vectors (context) - Henrich - 1998
Documents on the same site (http://research.nii.ac.jp/~katayama/homepage/papers/English.html): More
A Logic-Based Approach for Managing Structured Document Data - Katayama, Takasu, Adachi (1994) (Correct)
Similarity Image Retrieval with Significance-Sensitive.. - Katayama, Satoh (2000) (Correct)
A Database With An Explicit Semantic Representation - Katayama, Takasu, Adachi (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC