Haron , Habibollah and Shamsuddin , Siti Mariyam and Mohamed, Dzulkifli (2005) A new corner detection algorithm for chain code representation. International Journal of Computer Mathematics, 82 (8). pp. 941-950. ISSN 0020-7160
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1080/00207160410001684271
A new algorithm is proposed to detect a corner of a thinned binary image that is represented by an eight-connected contour chain code. The algorithm is based on chain-coded image, deriving the slope between each code, analyze the series of chain code, and finally decide the existence of corner at the current pixel location. The work assumes that the pre-processing processes on the image, namely thinning and digitization, have been done. Two weighted parameters identified as significant factors in determining the accuracy of the corner detection algorithm are discussed. The parameters are the length of segment and threshold value. Computational phases to derive values of rows and columns given a series of chain code are also given in detail. The algorithm can be used to interpret line drawing that represents three-dimensional object.
|Uncontrolled Keywords:||Chain code, line drawing, thinned binary image.|
|Subjects:||T Technology > T Technology (General)|
|Divisions:||Computer Science and Information System (Formerly known)|
|Deposited By:||Nur Amal Zakiah Shamsudin|
|Deposited On:||09 Jan 2009 08:06|
|Last Modified:||09 Jan 2009 08:06|
Repository Staff Only: item control page