期刊文献+

一种曲线形态的描述与识别方法及其应用 被引量:2

A Description and Recognition Method of Curve Configuration and Its Application
下载PDF
导出
摘要 为准确描述与识别时间序列曲线形态,根据曲线段类型定义了5个语素和1个通配符,进而定义语素向量及通配符向量,使得对曲线的描述具有层次性.据此将任意时间序列曲线转变为对应的二维表,二维表第二列组成的字符串能够进行初级的模板匹配,二维表各行所代表的向量增强了语素关系运算的能力,可实现较深入的模式识别.在经典回溯法的启发下设计了一种属性约束下的带通配符字符串匹配算法,并以基于感应线圈信号曲线的车型分类为例,验证了所提出的方法的有效性和合理性. In order to correctly describe and recognize the configuration of a time series crave (TSC) , five morphemes and one wildcard are defined according to the curve segment types, and the corresponding morpheme vector and the wildcard vector are defined for the hierarchical description of the curve. Then, one TSC is transformed into a 2D table. The second colmnn of the table makes up of a string that can effect the elementary pattern matching and the rows of the table represent the attribute vectors that can enhance the morpheme-relational operation, thus reali- zing a more complex pattern matching at the next step. Moreover, a string matching arithmetic with attribute re- straints and wildcard strings is proposed based on the classical backtracking method. The method is finally em- ployed to classify vehicles using the TSCs collected from inductive loops in a real traffic scene. The results show that the proposed method is effective and reasonable.
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2009年第2期77-81,共5页 Journal of South China University of Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(50578064) 广州市科技攻关项目(2007Z2-D3111)
关键词 时间序列曲线 形态描述 形态识别 字符串匹配 车型识别 time series curve configuration description configuration recognition string matching vehicle classification
  • 相关文献

参考文献11

  • 1Yu Li, Wang Run-sheng. Shape representation based on mathematical morphology [J]. Pattern Recognition Letters ,2005,26 : 1 354-1 362.
  • 2Pablo L, Durango Cohen. A time series analysis framework for transportation infrastructure management [ J ]. Transportation Research Part B ,2007,41:493-505.
  • 3Konstantinos Koutroumbas. Pattern recognition third edition[M].李晶皎,等译.北京:电子工业出版社,2006:232-276.
  • 4陆宗骐,童韬.链码和在边界形状分析中的应用[J].中国图象图形学报(A辑),2002,7(12):1323-1328. 被引量:46
  • 5Hermilo Sanchez-Cruz, Ernesto Bribiesca, Ramon M Rodriguez-Dagnino. Efficiency of chain codes to represent binary objects [J]. Pattern Recognition, 2007,40 : 1 660- 1674.
  • 6Liu Yong-kui, Zalik Borut. An efficient chain code with Huffman coding [ J 1- Pattern Recognition, 2005,38 : 553- 557.
  • 7Aho A, Corasick M. Efficient string matching: an aid to bibliographic search [J]. Communications of the ACM, 1975,18:333-343.
  • 8Knuth D, Morris J, Pratt P. Fast pattern matching in strings [J]. SIAM Journal on Computing,1997,6:323-325.
  • 9Boyer R S,Moore J S. A fast string searching algorithm [J]. Communications of the ACM, 1977,20 (10) :762- 772.
  • 10Ihsan Sabuncuoglu, Yasin Gocgun, Erdal Erel. Backtracking and exchange of information: methods to en- hance a beam search algorithm for assembly line scheduling [J]. European Journal of Operational Research, 2008,186:915-930.

二级参考文献4

共引文献45

同被引文献22

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部