2D C0 Complexity

来源 :the 2nd Shanghai International Symposium on NOnlinear Scienc | 被引量 : 0次 | 上传用户:genggeng07
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  During the past decades a variety of complexity measures of symbol sequences have been defined.Rapp proposed a taxonomic characterization of such measures based on three defining characteristics:randomness finding versus rule finding,probabilistie versus non-probabilistic and formula based versus model based.These measures can be used to analyze data in the form of one-dimensional time series.However,how to extend the above approaches to characterize two-dirnensional data,such as image is still an open problem.And this problem is important m find some integral morphological parameters which can provide measurement for the quantitative characterization and classification of 2D structures.
其他文献
会议
会议
会议
会议
会议
会议
会议
会议
会议
会议