Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Stein, G. Medioni (1990)
Efficient two dimensional object recognition[1990] Proceedings. 10th International Conference on Pattern Recognition, i
Hannu Kauppinen, T. Seppänen, M. Pietikäinen (1995)
An Experimental Comparison of Autoregressive and Fourier-Based Descriptors in 2D Shape ClassificationIEEE Trans. Pattern Anal. Mach. Intell., 17
Clu-istos Foutsos, M. llanganatan, Yanais Maaolopoulo (1994)
Fast Subsequence Matching in Time-Series Databases
M. Freeston (1987)
The BANG file: A new kind of grid file
H. Jagadish (1991)
A retrieval technique for similar shapes
O. Günther (1989)
The design of the cell tree: an object-oriented index structure for geometric databases[1989] Proceedings. Fifth International Conference on Data Engineering
I. Gargantini (1982)
An effective way to represent quadtreesCommun. ACM, 25
E. Petrakis, C. Faloutsos (1994)
Similarity searching in large image database
R. Mehrotra, James Gary (1997)
Feature-Index-Based Similar Shape Retrieval
H. Kriegel (1991)
Query Processing in Spatial Database Systems
H. Alt, Johannes Blömer (1992)
Resemblance and Symmetries of Geometric Patterns
R. Agrawal, C. Faloutsos, A. Swami (1993)
Efficient Similarity Search In Sequence Databases
H. Jagadish (1990)
Spatial search with polyhedra[1990] Proceedings. Sixth International Conference on Data Engineering
Jack Orenstein (1990)
A comparison of spatial query processing techniques for native and parameter spaces
I. Rigoutsos, R. Hummel (1992)
Massively parallel model matching: geometric hashing on the Connection MachineComputer, 25
R. Mehrotra, James Gary (1993)
Feature-based retrieval of similar shapesProceedings of IEEE 9th International Conference on Data Engineering
(1987)
The Problem of Robust Shape Descriptors
(1997)
Geometry based search of similar parts. (in german)
R. Agrawal, King-Ip Lin, H. Sawhney, Kyuseok Shim (1995)
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
J. Nievergelt, Hans Hinterberger, K. Sevcik (1984)
The Grid File: An Adaptable, Symmetric Multikey File StructureACM Trans. Database Syst., 9
T. Wallace, P. Wintz (1980)
An efficient three-dimensional aircraft recognition algorithm using normalized fourier descriptorsComputer Graphics and Image Processing, 13
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching
L. Kehrer, C. Meinecke (1996)
Chapter 2 Perceptual organization of visual patterns: The segmentation of textures, 1
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles
T. Sellis, N. Roussopoulos, C. Faloutsos (1987)
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
E. Petrakis, C. Faloutsos (1994)
Similarity Searching in Large Image DataBases
K. Wakimoto, M. Shima, S. Tanaka, A. Maeda, Hideyuki Tamura, Shunji Mori, J. Shibayama, M. Ireton (1994)
Efficient and Effective Querying by Image Content
(1980)
The Joy of Fourier Analysis
H. Jagadish (1990)
Linear clustering of objects with multiple attributes, 19
B. Seeger, H. Kriegel (1990)
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
Thomas Brinkhoff, H. Kriegel, R. Schneider (1993)
Comparison of approximations of complex objects used for approximation-based query processing in spatial database systemsProceedings of IEEE 9th International Conference on Data Engineering
In this paper, we introduce the concept of extended feature objects for similarity retrieval. Conventional approaches for similarity search in databases map each object in the database to a point in some high-dimensional feature space and define similarity as some distance measure in this space. For many similarity search problems, this feature-based approach is not sufficient. When retrieving partially similar polygons, for example, the search cannot be restricted to edge sequences, since similar polygon sections may start and end anywhere on the edges of the polygons. In general, inherently continuous problems such as the partial similarity search cannot be solved by using point objects in feature space. In our solution, we therefore introduce extended feature objects consisting of an infinite set of feature points. For an efficient storage and retrieval of the extended feature objects, we determine the minimal bounding boxes of the feature objects in multidimensional space and store these boxes using a spatial access structure. In our concrete polygon problem, sets of polygon sections are mapped to 2D feature objects in high-dimensional space which are then approximated by minimal bounding boxes and stored in an R $^*$ -tree. The selectivity of the index is improved by using an adaptive decomposition of very large feature objects and a dynamic joining of small feature objects. For the polygon problem, translation, rotation, and scaling invariance is achieved by using the Fourier-transformed curvature of the normalized polygon sections. In contrast to vertex-based algorithms, our algorithm guarantees that no false dismissals may occur and additionally provides fast search times for realistic database sizes. We evaluate our method using real polygon data of a supplier for the car manufacturing industry.
The VLDB Journal – Springer Journals
Published: Nov 1, 1997
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.