A remark on NP-completeness of picture matching-Reference-Cited by-同舟云学术

A remark on NP-completeness of picture matching

Published:1991-09 Issue:5 Volume:39 Page:241-243
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Tucci Maurizio,Costagliola Gennaro,Chang Shi-Kuo

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference5 articles.

1. Query-by-pictorial-example;Chang;IEEE Trans. Softw. Eng.,1980

2. Iconic indexing by 2-D strings;Chang;IEEE Trans. Pattern Analysis and Machine Intelligence,1984

3. J. Drakopoulos and P. Constantopoulos. An exact algorithm for 2-D string matching, Tech. Rept., Institute of Computer Science, Foundation of Research and Technology — Hellas, Heraklion, Crete, Greece.

4. Computers and Intractability;Garey,1979

5. Pyramidal algorithms for iconic indexing;Tortora;Computer Vision, Graphics, and Image Processing,1990

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph-based representation for similarity retrieval of symbolic images;Data & Knowledge Engineering;2008-06

2. Spatial layout representation for query-by-sketch content-based image retrieval;Pattern Recognition Letters;2002-11

3. Image retrieval based on object's orientation spatial relationship;Pattern Recognition Letters;2001-04

4. Computational complexity of similarity retrieval in a pictorial database;Information Processing Letters;2000-08

5. Multidimensional interval filter: A new indexing method for subpicture query of image retrieval;Pattern Recognition Letters;1998-11