Computer Science ›› 2017, Vol. 44 ›› Issue (9): 49-52.doi: 10.11896/j.issn.1002-137X.2017.09.009

Previous Articles     Next Articles

Extraction Method of LPR Characters Features Based on Soft K-segments Algorithm for Principal Curves

JIAO Na   

  • Online:2018-11-13 Published:2018-11-13

Abstract: License plate recognition is an important part of intelligent transportation systems.In order to improve the recognition rate of LPR characters,extraction of features are critical.Principal curves are nonlinear generalizations of principal components analysis.They are smooth self-consistent curves that pass through the “middle” of the distribution.By analysis of existed principal curves,we learned that a soft K-segments algorithm for principal curves exhibits good performance in such situations in which the data sets are concentrated around a highly curved or self-intersecting curves.Therefore,we attemptd to use the algorithm to extract structural features of LPR characters.Experiment results show that the algorithm is feasible for extraction of structural features of LPR characters.The proposed method can provide a new approach to the research for extraction of LPR characters features.

Key words: Soft K-segments algorithm for principal curves,Structural features,Features extraction

[1] HASTIE T.Principal curves and surfaces[J].Principal Curves & Surfaces,1984.
[2] BANFIELD J D,RAFTERY A E.Ice floe identification in satellite images using mathematical morphology and clustering about principal curves[J].Journal of the American Statistical Association,1992,87(417):7-16.
[3] KEGL B,KRZYZAK A,et al.A polygonal Line algorithm for constructing principal curves[C]∥Proceedings of Neural Information Processing System.Denver Colorado,USA:Computer Press,1999:501-507.
[4] VERBEEK J J,VLASSIS N,KROSE B.A k-segments algori-thm for finding principal curves[J].Pattern Recognition Letters,2002,23(8):1009-1017.
[5] VERBEEK J J,VLASSIS N,KROSE B.A soft k-segments algorithm for principal curves[M]∥ Artificial Neural Networks-ICANN 2001.Springer Berlin Heidelberg,2001:450-456.
[6] DELICADO P.Another look at principal curves and surfaces[J].Journal of Multivariate Analysis,2001,77(1):84-116.
[7] ZHANG J P,WANG Y.An Overview of Principal Curves[J].Chinese Journal of Computers,2003,6(2):129-146.(in Chinese) 张军平,王珏.主曲线研究综述[J].计算机学报,2003,6(2):129-146.
[8] BAS E,ERDOGMUS D.Principal curves as skeletons of tubular objects:locally characterizing the structures of axons[J].Neuroinformatics,2011,9(2/3):181-191.
[9] WANG H N,LEE T C M.Extraction of curvilinear features fromnoisy point patterns using principal curves[J].Pattern Recognition Letter,2008,29(16):2078-2084.
[10] REINHARD K,NIRANJAN M.Parametric subspace modeling of speech transitions[J].Speech Communication,1999,27(1):19-42.
[11] ZHANG J P,WANG X D,KRUGER U,et al.Principal curve algorithms for partitioning high-dimensional data spaces[J].IEEE Transactions on Neural Networks,2011,22(3):367-380.
[12] ZHANG H Y,MIAO D Q,XIA F C,et al.Automatic Recognition System of Bills Based on Principal Curves[J].Journal of Information and Computational Science,2004,1(2):199-204.
[13] ZHANG J P,CHEN D W,KRUGER U.Adaptive constraint k-segment principal curves for intelligent transportation systems[J].IEEE Transactions on Intelligent Transportation Systems,2008,9(4):666-677.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!