A retrieval technique for similar shapes
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
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
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
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Efficient Color Histogram Indexing for Quadratic Form Distance Functions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Improving Adaptable Similarity Query Processing by Using Approximations
VLDB '98 Proceedings of the 24rd 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
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
3D Similarity Search by Shape Approximation
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Design of an SHD-Distributed Database over IP to Support Telemedicine
Journal of Medical Systems
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
Vulnerabilities in similarity search based systems
Proceedings of the eleventh international conference on Information and knowledge management
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th 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
An Efficient Shape-Based Approach to Image Retrieval
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
A multi-step strategy for approximate similarity search in image databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
The privacy of k-NN retrieval for horizontal partitioned data: new methods and applications
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
A hybrid computational model for an automated image descriptor for visually impaired users
Computers in Human Behavior
Comparing image objects using tree-based approach
ICCVG'12 Proceedings of the 2012 international conference on Computer Vision and Graphics
| Hi-index | 0.00 |
Shape similarity search is a crucial task in image databases, particularly in the presence of errors induced by segmentation or scanning images. The resulting slight displacements or rotations have not been considered so far in the literature. We present a new similarity model that flexibly addresses this problem. By specifying neighborhood influence weights, the user may adapt the similarity distance functions to her or his requirements or preferences. Technically, the new similarity model is based on quadratic forms for which we present a multistep query processing architecture particularly for high dimensions as they occur in image databases. Our algorithm to reduce the dimensionality of quadratic form-based similarity queries results in a lower-bounding distance function that is proven to provide an optimal filter selectivity. Experiments on our test database of 10,000 images demonstrate the applicability and the performance of our approach even in high dimensions such as 1,024.