Fast image database search using tree-structured VQ
暂无分享,去创建一个
[1] Forest Baskett,et al. An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.
[2] Ramesh C. Jain,et al. Similarity indexing: algorithms and performance , 1996, Electronic Imaging.
[3] Michael T. Orchard,et al. A fast nearest-neighbor search algorithm , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[4] E. Ruiz. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .
[5] James C. French,et al. Using the triangle inequality to reduce the number of comparisons required for similarity-based retrieval , 1996, Electronic Imaging.
[6] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.
[7] Linda G. Shapiro,et al. Efficient image retrieval with multiple distance measures , 1997, Electronic Imaging.
[8] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[9] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[10] Judea Pearl,et al. Heuristics - intelligent search strategies for computer problem solving , 1984, Addison-Wesley series in artificial intelligence.
[11] Jesse S. Jin,et al. SS+ tree: an improved index structure for similarity searches in a high-dimensional feature space , 1997, Electronic Imaging.
[12] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[13] Raymond T. Ng,et al. Evaluating multidimensional indexing structures for images transformed by principal component analysis , 1996, Electronic Imaging.
[14] Allen Gersho,et al. Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.