Recursive computation of Tchebichef moment and its inverse transform

Guobao Wang, Shigang Wang

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

Tchebichef moment is a novel set of orthogonal moment applied in the fields of image analysis and pattern recognition. Less work has been made for the computation of Tchebichef moment and its inverse moment transform. In this paper, both a direct recursive algorithm and a compact algorithm are developed for the computation of Tchebichef moment. The effective recursive algorithm for inverse Tchebichef moment transform is also presented. Clenshaw's recurrence formula was used in this paper to transform kernels of the forward and inverse Tchebichef moment transform. There is no need for the proposed algorithms to compute the Tchebichef polynomial values. The approaches presented are more efficient compared with the straightforward methods, and particularly suitable for parallel VLSI implementation due to their regular and simple filter structures.

Original languageEnglish (US)
Pages (from-to)47-56
Number of pages10
JournalPattern Recognition
Volume39
Issue number1
DOIs
StatePublished - Jan 1 2006
Externally publishedYes

Keywords

  • Clenshaw's recurrence
  • Inverse transform
  • Recursive algorithm
  • Tchebichef moment

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Recursive computation of Tchebichef moment and its inverse transform'. Together they form a unique fingerprint.

Cite this