By Topic

Processing pictorial queries with multiple instances using isomorphic subgraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Folkers ; Center for Autom. Res., Maryland Univ., College Park, MD, USA ; H. Samet ; A. Soffer

An algorithm is given for processing pictorial query specifications that consist of a query image and a similarity level that must hold between the query image and database images. The similarity level specifies the contextual similarity (how well the content of one image matches that of another) as well as the spatial similarity (the relative locations of the matching symbols in the two images). The algorithm differs from previous approaches in its ability to handle multiple instances of each object in both the query and database images by searching for isomorphic subgraphs. The running time of the algorithm is O(m 2m) in the worst case where all symbols in both the query and database image are from the same class, but falls far below this bound in the presence of spatial constraints

Published in:

Pattern Recognition, 2000. Proceedings. 15th International Conference on  (Volume:4 )

Date of Conference:

2000