Published in

Elsevier, Pattern Recognition, 2(40), p. 659-669

DOI: 10.1016/j.patcog.2006.03.009

Links

Tools

Export citation

Search in Google Scholar

A numerical recipe for accurate image reconstruction from discrete orthogonal moments

Journal article published in 2007 by Bulent Bayraktar, Tytus Bernas, J. Paul Robinson, Bartek Rajwa ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Recursive procedures used for sequential calculations of polynomial basis coefficients in discrete orthogonal moments produce unreliable results for high moment orders as a result of error accumulation. This paper demonstrates accurate reconstruction of arbitrary-size images using full-order (orders as large as the image size) Tchebichef and Krawtchouk moments by calculating polynomial coefficients directly from their definition formulas in hypergeometric functions and by creating lookup tables of these coefficients off-line. An arbitrary precision calculator is used to achieve greater numerical range and precision than is possible with software using standard 64-bit IEEE floating-point arithmetic. This reconstruction scheme is content and noise independent. 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.