Abstract
We present a two-phase retrieval process for finding a target query within a set of 2-D line drawings, where the query is itself a line drawing. We also describe a logic-based matching method that uses unification and resolution to compare the semantic networks representing the spatial structure of two 2-D line drawings.
Retrieval of diagrams from an external memory (e.g., a computer-based library of diagrams) is a key problem in reasoning about diagrams. The task in our work assumes a computer-based library of 2-D line drawings, takes as input a representation of a 2-D line drawing as a query, and its desired output is a set of drawings retrieved from the library that are similar to the query (meaning that the target can be found within these sources based on a qualitative highlevel comparison). The goal of the work described in this paper is to develop a retrieval process and a matching procedure for enabling querying by example.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yaner, P.W., Goel, A.K. (2002). Retrieving 2-D Line Drawings by Example. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds) Diagrammatic Representation and Inference. Diagrams 2002. Lecture Notes in Computer Science(), vol 2317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46037-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-46037-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43561-7
Online ISBN: 978-3-540-46037-4
eBook Packages: Springer Book Archive