H. V. Jagadish
- 1 N.J. Ayache and O. D. Faugeras, "HYPER - A New Approach for the Recognition and Position of Two- Dimensional Objects," 1EEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-8, 1986, 44-54. Google Scholar
Digital Library
- 2 S-K. Chang, Y. Cheng, S. S. Iyengar, and R. L. Kashyap, "A New Method of Image Compression Using Irreducible Covers of Maximal Rectangles," 1EEE Trans. on Software Engineering, 14(5), May 1988,651-658. Google ScholarDigital Library
- 3 S-K. Chang and S-H. Liu, "Picture Indexing and Abstraction Techniques for Pictorial Databases," 1EEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-6(4), July 1984, 475-483.Google ScholarDigital Library
- 4 D. S. Franzblau, "Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles," SlAM J. Disc. Math., 2(3), 1989, 307-321. Google ScholarDigital Library
- 5 W.I. Grosky, P. Neo, and R. Mehrotra, "A Pictorial Index Mechanism for Model Based Matching," Proc. Fifth IEEE Int'l Conf. on Data Engineering, Los Angeles, CA, 1989, 180-187. Google ScholarDigital Library
- 6 A. Guttman, "R Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. on the Management of Data, 1984, 47-57. Google ScholarDigital Library
- 7 H.V. Jagadish, "Spatial Search with Polyhedra," Proc. Sixth 1EEE Int'l Conf. on Data Engineering, Los Angeles, CA, Feb 1990. Google ScholarDigital Library
- 8 H.V. Jagadish and A. M. Bruckstein, "On Sequential Shape Descriptions," Pattern Recognition, 1991 (to appear). Google ScholarDigital Library
- 9 D.B. Lomet and B. Salzberg, "A Robust Multi- Attribute Search Structure," Proc. Fifth IEEE lnt'l Conf. on Data Engineering, Los Angeles, CA, Feb. 1989, 296-304. Google ScholarDigital Library
- 10 D. Mumford , "The Problem of Robust Shape Descriptors ," Center for Intelligent Control Systems Report CICS-P-40, Harvard University, Cambridge, Mass., Dec. 1987.Google Scholar
- 11 J. Nievergelt, H. Hinterberger, and K. C. Sevcik, "The Grid file: An Adaptable Symmetric Multikey File Structure," ACM Trans. on Database Systems, 9(1), 1984. Google ScholarDigital Library
- 12 J.A. Orenstein and F. A. Manola, "PROBE Spatial Data Modeling and Query Processing in an Image Database Application," IEEE Trans. Software Engg., 14(5), May 1988, 611-629. Google ScholarDigital Library
- 13 J.T. Robinson, "K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indices," Proc. ACM SIGMOD Conf. on the Management of Data, 1981. Google ScholarDigital Library
- 14 B. Seeger and H. P. Kriegel, "The Buddy Tree: An Efficient and Robust Access Method for Spatial Database Systems," Proc. 16th Int'l Conf on Very Large Databases, Brisbane, Australia, Aug. 1990, 590-601. Google ScholarDigital Library
- 15 T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+ Tree: A Dynamic Index for Multidimensional Objects," Proc. 13th lnt'l Conf on Very Large Databases, Brighton, U. K., Sep. 1987, 507-518. Google ScholarDigital Library
- 16 T.P. Wallace and P. A. Wintz, "An Efficient Three- Dimensional Aircraft Recognition Algorithm Using Normalized Fourier Descriptors," Computer Graphics and Image Processing, 13, 1980, 99-126.Google ScholarCross Ref
Index Terms
- A retrieval technique for similar shapes
Recommendations
Retrieving Similar Shapes Effectively and Efficiently
In this paper, we address the following problem: given a large collection of shapes and a query shape, retrieve all shapes (from the shape database) that are similar to the query shape. A generalized centroid-radii model is used to model all forms of ...
Efficient retrieval of similar shapes
We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence of noise and supports several important notions of similarity including optimal ...
Fast retrieval of isolated visual shapes
Similarity-based retrieval from databases of isolated visual shapes has become an important information retrieval problem. The goal of the current work is to achieve high retrieval speed with reasonable retrieval effectiveness, and support for partial ...
Comments