Static Fingerspelling Recognition Based on Boundary Tracing Algorithm and Chain Code

Author(s):  
Ahmad Yahya Dawod ◽  
Md Jan Nordin ◽  
Junaidi Abdullah
2011 ◽  
Vol 411 ◽  
pp. 469-473
Author(s):  
Yue Shen Lai ◽  
Meng Shi ◽  
Jun Wei Tian ◽  
Gang Cheng

Boundary tracing method is an important preprocessing instrument for image recognition and image measurement, but the traditional boundary tracing method exits a conflict between the veracity and the speed. In response to these problems, we propose the boundary tracking algorithm based on the model, and then obtain the tool diameter. Experiments show that the boundary tracking algorithm can achieve a good boundary track. Compared two algorithms of diameter measurements, we obtain that the least square method runs shorter, and more efficient.


2010 ◽  
Vol 437 ◽  
pp. 389-392
Author(s):  
Yan Long Cao ◽  
Hua Wen Zheng ◽  
Jiang Xin Yang ◽  
Yuan Feng He

A method of automatic shape grading of pearl using machine vision is presented in this paper. Firstly, the preprocessed color image is segmented according to its grey degree histogram. Then the morphological closing operation is adopted to eliminate the noise points. An 8-directional boundary-tracing algorithm is applied to obtain the sequences of the boundary. And then the Euclidean distance between the pearls under checking is compared with ones in the standard template library, which is utilized to distinguish the pearls’ shape. Finally the experimental result demonstrates the validity and practicability of this method.


Author(s):  
Qiang Fu ◽  
Zezhong C. Chen

Medial axis transform (MAT) is a very useful shape interrogation tool in NC tool path generation for pocket milling. This paper presents a new, efficient approach to calculating MATs of planar profiles with boundaries of free-form curves. The proposed approach is mainly based on profile boundary tracing and decomposition. By studying the basic elements of MAT and their geometric properties, several algorithms of finding contact circles are developed. The boundary tracing algorithm can handle profiles with/without internal holes. For a profile without internal holes, it is continuously divided into simpler sub-profiles while travelling along the boundary, and a tree data structure is adopted to keep track of the boundary decomposition process. For a profile with internal holes, it is divided into several simple profiles without internal holes. After generating the MAT of each simple profile, the completed MAT can be found by combining these MATs. This proposed approach is implemented and some illustrative samples are presented to demonstrate its advantages.


Author(s):  
Wang Jun-Feng ◽  
Ding Gang-Yi ◽  
Wang Yi-Ou ◽  
Li Yu-Gang ◽  
Zhang Fu-Quan

Sign in / Sign up

Export Citation Format

Share Document