Linear programming: active set analysis and computer programs
Linear programming: active set analysis and computer programs
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A retrieval technique for similar shapes
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Similar shape retrieval using a structural feature index
Information Systems
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
S3: similarity search in CAD database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
PROBE Spatial Data Modeling and Query Processing in an Image Database Application
IEEE Transactions on Software Engineering
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Feature-Based Retrieval of Similar Shapes
Proceedings of the Ninth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
A 3D Molecular Surface Representation Supporting Neighborhood Queries
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Using extended feature objects for partial similarity retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
Segmentation of molecular surfaces based on their convex hull
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
High performance clustering based on the similarity join
Proceedings of the ninth international conference on Information and knowledge management
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
A Multistep Approach for Shape Similarity Search in Image Databases
IEEE Transactions on Knowledge and Data Engineering
Dynamically Optimizing High-Dimensional Index Structures
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Improving Adaptable Similarity Query Processing by Using Approximations
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Determining the Convex Hull in Large Multidimensional Databases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Adaptable Similarity Search Using Vector Quantization
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Retrieval of 3D objects by visual similarity
Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
Content-based retrieval of 3D models
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Adaptable similarity search using non-relevant information
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
An adaptive partitioning approach for mining discriminant regions in 3D image data
Journal of Intelligent Information Systems
Similarity matrix compression for efficient signature quadratic form distance computation
Proceedings of the Third International Conference on SImilarity Search and APplications
Curvature correlograms for content based retrieval of 3d objects
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
| Hi-index | 0.00 |
The issue of finding similar 3-D surface segments arises in manyrecent applications of spatial database systems, such as molecular biology,medical imaging, CAD, and geographic information systems. Surface segmentsbeing similar in shape to a given query segment are to be retrieved from thedatabase. The two main questions are how to define shape similarity and howto efficiently execute similarity search queries. We propose a newsimilarity model based on shape approximation by multi-parametric surfacefunctions that are adaptable to specific application domains. We then defineshape similarity of two 3-D surface segments in terms of their mutualapproximation errors. Applying the multi-step query processing paradigm, wepropose algorithms to efficiently support complex similarity search queriesin large spatial databases. A new query type, called the ellipsoid query, isutilized in the filter step. Ellipsoid queries, being specified by quadraticforms, represent a general concept for similarity search. Our majorcontribution is the introduction of efficient algorithms to performellipsoid queries on multidimensional index structures. Experimental resultson a large 3-D protein database containing 94,000 surface segmentsdemonstrate the successful application and the high performance of our method.