Section Coding: A Similarity Search Technique for the Car Manufacturing Industry
暂无分享,去创建一个
[1] Christos Faloutsos,et al. The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.
[2] Toshikazu Kato,et al. A similarity retrieval of 3D polygonal models using rotation invariant shape descriptors , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.
[3] Gonzalo Navarro,et al. An effective clustering algorithm to index high dimensional metric spaces , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.
[4] Marc Rioux,et al. Description of shape information for 2-D and 3-D objects , 2000, Signal Process. Image Commun..
[5] Marco Patella,et al. PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[6] Willem Jonker,et al. A Framework for Video Modeling , 2000 .
[7] Peter N. Yianilos,et al. Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract) , 2000, SODA '00.
[8] Ricardo A. Baeza-Yates,et al. Spaghettis: an array based algorithm for similarity queries in metric spaces , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).
[9] Ilaria Bartolini,et al. Windsurf: region-based image retrieval using wavelets , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.
[10] Hans-Peter Kriegel,et al. 3D Shape Histograms for Similarity Search and Classification in Spatial Databases , 1999, SSD.
[11] Raimondo Schettini,et al. Multiresolution wavelet transform and supervised learning for content-based image retrieval , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.
[12] Jonathan Foote,et al. An overview of audio information retrieval , 1999, Multimedia Systems.
[13] Atsuo Yoshitaka,et al. A Survey on Content-Based Retrieval for Multimedia Databases , 1999, IEEE Trans. Knowl. Data Eng..
[14] Pavel Zezula,et al. Approximate similarity retrieval with M-trees , 1998, The VLDB Journal.
[15] Hans-Peter Kriegel,et al. A Multistep Approach for Shape Similarity Search in Image Databases , 1998, IEEE Trans. Knowl. Data Eng..
[16] James Ze Wang,et al. System for screening objectionable images , 1998, Comput. Commun..
[17] Hans-Peter Kriegel,et al. The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.
[18] James Ze Wang,et al. Content-based image indexing and searching using Daubechies' wavelets , 1998, International Journal on Digital Libraries.
[19] Andreas Henrich,et al. The LSD/sup h/-tree: an access structure for feature vectors , 1998, Proceedings 14th International Conference on Data Engineering.
[20] Dragana Brzakovic,et al. Evaluation of an algorithm for finding a match of a distorted texture pattern in a large image database , 1998, TOIS.
[21] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[22] Hans-Peter Kriegel,et al. Efficient User-Adaptable Similarity Search in Large Multimedia Databases , 1997, VLDB.
[23] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.
[24] Z. Meral Özsoyoglu,et al. Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.
[25] James Ze Wang,et al. Wavelet-based image indexing techniques with partial sketch retrieval capability , 1997, Proceedings of ADL '97 Forum on Research and Technology. Advances in Digital Libraries.
[26] Kenneth L. Clarkson,et al. Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.
[27] Robert Burgin,et al. Performance Standards and Evaluations in IR Test Collections: Cluster-Based Retrieval Models , 1997, Inf. Process. Manag..
[28] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[29] Christos Faloutsos,et al. Searching Multimedia Databases by Content , 1996, Advances in Database Systems.
[30] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[31] Raj Jain,et al. Algorithms and strategies for similarity retrieval , 1996 .
[32] Sergey Brin,et al. Near Neighbor Search in Large Metric Spaces , 1995, VLDB.
[33] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.
[34] Dragutin Petkovic,et al. The query by image content (QBIC) system , 1995, SIGMOD '95.
[35] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[36] Ricardo A. Baeza-Yates,et al. Proximity Matching Using Fixed-Queries Trees , 1994, CPM.
[37] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[38] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[39] Luisa Micó,et al. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..
[40] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[41] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[42] S Hazout,et al. Searching for geometric molecular shape complementarity using bidimensional surface profiles. , 1992, Journal of molecular graphics.
[43] Hartmut Noltemeier,et al. Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects , 1992, Data Structures and Efficient Algorithms.
[44] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[45] H. V. Jagadish,et al. A retrieval technique for similar shapes , 1991, SIGMOD '91.
[46] Helen R. Tibbo,et al. The Cystic Fibrosis Database: Content and Research Opportunities. , 1991 .
[47] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[48] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[49] F. DEHNE,et al. Voronoi trees and clustering problems , 1987, Inf. Syst..
[50] E. Ruiz. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .
[51] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[52] Iraj Kalantari,et al. A Data Structure and an Algorithm for the Nearest Point Problem , 1983, IEEE Transactions on Software Engineering.
[53] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[54] P. Wintz,et al. An efficient three-dimensional aircraft recognition algorithm using normalized fourier descriptors , 1980 .
[55] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.
[56] Susan Brewer,et al. Information storage and retrieval , 1959, ACM '59.