For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Two Dimensional Largest Common Subpatterns between Pictures
Eiichi TANAKA Sumio MASUDA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/09/25
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Image Processing,Computer Graphics and Pattern Recognition
largest common subpattern, longest common subsequence, pattern matching, picture, similarity,
Full Text: PDF(234.5KB)
>>Buy this Article
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.