Two Dimensional Largest Common Subpatterns between Pictures

Eiichi TANAKA  Sumio MASUDA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E79-D   No.9   pp.1358-1361
Publication Date: 1996/09/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Image Processing,Computer Graphics and Pattern Recognition
Keyword: 
largest common subpattern,  longest common subsequence,  pattern matching,  picture,  similarity,  

Full Text: PDF(234.5KB)
>>Buy this Article


Summary: 
Several two-dimensional largest common subpatterns (LCP) between pictures are defined and their computing methods are proposed. The time and space complexities of the computing methods are O(IJMN) to obtain the size of LCPs between a picture with IJ pixels and a picture with MN pixels. These LCPs can be used as similarity measures between pictures and can be applied to texture recognition and classification.