Intelligent vehicle needs the turn light information of front vehicles to make decisions in autonomous navigation. A recognition algorithm was designed to get information of turn light. Approximated center segmentatio...Intelligent vehicle needs the turn light information of front vehicles to make decisions in autonomous navigation. A recognition algorithm was designed to get information of turn light. Approximated center segmentation method was designed to divide the front vehicle image into two parts by using geometry information. The number of remained pixels of vehicle image which was filtered by the morphologic feaatres was got by adaptive threshold method, and it was applied to recognizing the lights flashing. The experimental results show that the algorithm can not only distinguish the two turn lights of vehicle but also recognize the information of them. The algorithm is quiet effective, robust and satisfactory in real-time performance.展开更多
This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applie...This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applied in coded modulation scheme based on hexagonal-like signal constellations. Since the development of tight bounds for error correcting codes using new distance is a research problem, the purpose of this note is to generalize the Plotkin bound for linear codes over finite fields equipped with the Hexagonal metric. By means of a two-step method, the author presents a geometric method to construct finite signal constellations from quotient lattices associated to the rings of Eisenstein-Jacobi （E J） integers and their prime ideals and thus naturally label the constellation points by elements of a finite field. The Plotkin bound is derived from simple computing on the geometric figure of a finite field.展开更多
基金Projects(90820302,60805027)supported by the National Natural Science Foundation of ChinaProject(200805330005)supported by the PhD Programs Foundation of Ministry of Education of ChinaProject(20010FJ4030)supported by the Academician Foundation of Hunan Province,China
文摘Intelligent vehicle needs the turn light information of front vehicles to make decisions in autonomous navigation. A recognition algorithm was designed to get information of turn light. Approximated center segmentation method was designed to divide the front vehicle image into two parts by using geometry information. The number of remained pixels of vehicle image which was filtered by the morphologic feaatres was got by adaptive threshold method, and it was applied to recognizing the lights flashing. The experimental results show that the algorithm can not only distinguish the two turn lights of vehicle but also recognize the information of them. The algorithm is quiet effective, robust and satisfactory in real-time performance.
基金supported by 973 project under Grant No.2007CB807901the Fundamental Research Funds for the Central Universities under Grant Nos.YWFF-10-02-072 and YWF-10-01-A28
文摘This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applied in coded modulation scheme based on hexagonal-like signal constellations. Since the development of tight bounds for error correcting codes using new distance is a research problem, the purpose of this note is to generalize the Plotkin bound for linear codes over finite fields equipped with the Hexagonal metric. By means of a two-step method, the author presents a geometric method to construct finite signal constellations from quotient lattices associated to the rings of Eisenstein-Jacobi （E J） integers and their prime ideals and thus naturally label the constellation points by elements of a finite field. The Plotkin bound is derived from simple computing on the geometric figure of a finite field.
