By Topic

A fast computation of Hahn moments for binary and gray-scale images

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)
Sayyouri, M. ; Fac. of Sci. Dhar el mehraz (LESSI), Univ. Sidi Mohamed Ben Abdellah, Fès, Morocco ; Hmimid, A. ; Qjidaa, H.

The discrete orthogonal moments have been introduced in the fields of images analysis (reconstruction, classification, indexation, recognition of shapes, ...). They have excellent capacity of representing the image than the continuous orthogonal moments. The problem that limits the use of moments is the high cost of calculation. So as to resolve the problem, we are going to present, in this paper, a method to accelerate the time of the calculation of Hahn's moments for binary and gray-scale images. The method is based on the calculation of Hahn's discrete orthogonal polynomials considering the recurrence relation with respect to variable x and order n, and applying the algorithm image block representation IBR for binary images and PIBR for gray-scale images. The moments of image can be obtained from the moments of all blocks. Thus, it can accelerate the computational efficiency since the number of blocks is less than the size of the image. This method also accelerates the reconstruction's time of images and the quality of reconstruction which will be evaluated by the calculation of error of reconstruction (mse).

Published in:

Complex Systems (ICCS), 2012 International Conference on

Date of Conference:

5-6 Nov. 2012