Two Dimensional Largest Common Subpatterns between Pictures

Eiichi TANAKA; Sumio MASUDA

Two Dimensional Largest Common Subpatterns between Pictures

Eiichi TANAKA, Sumio MASUDA

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.9 pp.1358-1361

Publication Date: 1996/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Image Processing,Computer Graphics and Pattern Recognition

Cite this

Copy

Eiichi TANAKA, Sumio MASUDA, "Two Dimensional Largest Common Subpatterns between Pictures" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 9, pp. 1358-1361, September 1996, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e79-d_9_1358/_p

Copy

@ARTICLE{e79-d_9_1358,
author={Eiichi TANAKA, Sumio MASUDA, },
journal={IEICE TRANSACTIONS on Information},
title={Two Dimensional Largest Common Subpatterns between Pictures},
year={1996},
volume={E79-D},
number={9},
pages={1358-1361},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - Two Dimensional Largest Common Subpatterns between Pictures
T2 - IEICE TRANSACTIONS on Information
SP - 1358
EP - 1361
AU - Eiichi TANAKA
AU - Sumio MASUDA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 1996
AB - 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.
ER -