Fast computation of zernike moments for rice sorting system

Chong Yaw Wee, Raveendran Paramesran, Fumiaki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)

Abstract

In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separation distance of one grain from another will lead to higher output of grains imaged and processed. Hence, the fast computation of a reliable set of pattern features is required in a rice sorting system. Zernike moment, with its rotational invariant property makes it ideally suited to be used. Many fast computation algorithms to compute Zernike moments have been developed. In this study we propose a new application of the symmetrical property of Zernike polynomials to compute a set of Zernike moments in rice sorting system. The average overall classification time of a rice grain is reduced almost by 25.0% when the proposed technique is integrated with the q-recursive method, which currently uses the minimum time to compute a set of Zernike moments.___________________________________

Original languageEnglish
Title of host publication2007 IEEE International Conference on Image Processing, ICIP 2007 Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages165-168
Number of pages4
ISBN (Print)1424414377, 9781424414376
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventIEEE International Conference on Image Processing 2007 - San Antonio, United States of America
Duration: 16 Sept 200719 Sept 2007
Conference number: 14th

Conference

ConferenceIEEE International Conference on Image Processing 2007
Abbreviated titleICIP 2007
Country/TerritoryUnited States of America
CitySan Antonio
Period16/09/0719/09/07

Keywords

  • Fast computation
  • Rice sorting machine
  • Rotational invariant
  • Symmetrical property
  • Zernike moments

Cite this