By Topic

A Fast Algorithm for Image Geometric Feature Parameters Extraction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cheng Yang ; Dept. of Comput. Sci. & Technol., Southwest Univ. of Sci. & Technol., Mianyang, China ; Rong Lu ; Niannian Chen

How to extract the features quickly and correctly is the essential precondition for image identification and classification. As there existing large computation problems in the traditional feature extraction algorithms, this paper proposes a faster algorithm. Firstly, the image connected region is encoded by using the Vertex Chain Code to map as a closed area. Then a unified computational framework is developed to combine the Vertex Chain Code and Discrete Green, turning surface integral into line integral. Experimental results show that this algorithm is fast and effective, and can be used for special area.

Published in:

Photonics and Optoelectronics (SOPO), 2012 Symposium on

Date of Conference:

21-23 May 2012