Two Dimensional Largest Common Subpatterns between Pictures
スポンサーリンク
概要
- 論文の詳細を見る
Several two-dimensional largest common sub-patterns (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.
- 社団法人電子情報通信学会の論文
- 1996-09-25
著者
-
Masuda Sumio
Kobe University Department Of Electrical And Electronics Engineering
-
TANAKA Eiichi
Kobe University, Department of Electrical and Electronics Engineering
-
Tanaka Eiichi
Kobe University Department Of Electrical And Electronics Engineering
-
TANAKA Eiichi
Kobe University
関連論文
- Two Dimensional Largest Common Subpatterns between Pictures
- Recursive and non recursive formulas in finitism
- Recursive and non recursive formulas in finitism