2008Unpublished venueRequires access

An Algebraic Framework for Discrete Basis Functions in Computer Vision

Paul L. O'Leary, Matthew Harker

Open publisher page 34 citations

Abstract

This paper presents a fundamentally new algebraic approach to the analysis and synthesis of discrete orthogonal basis functions. It provides the theoretical background to unify Fourier, Gabor and discrete orthogonal polynomial moments. For the first time, a set of objective tests are proposed to measure the quality of basis functions. It consists of two main sections: the theoretical background on the generation and orthogonalization of basis functions together with a new solution for the computation of spectra from incomplete data, as well as the implementation of interpolation for all orthogonal basis functions; a new approach to discrete orthogonal polynomials, proving that there is one and only one unitary discrete polynomial basis. Furthermore, the concept of anisotropic moments is introduced and applied to 2D seismic data, which is an image processing problem. The new polynomial basis is numerically better conditioned than the discrete cosine transform. This opens the door to new image compression algorithms, offering a higher compression ratio than the well known JPEG method, for the same numerical effort.

About this research paper

What this paper is about

This paper presents a fundamentally new algebraic approach to the analysis and synthesis of discrete orthogonal basis functions. It provides the theoretical background to unify Fourier, Gabor and discrete orthogonal polynomial moments. For the first time, a set of objective tests are proposed to measure the quality of basis functions. It consists of two main sections: the theoretical background on the generation and orthogonalization of basis functions together with a new solution for the computation of spectra from incomplete data, as well as the implementation of interpolation for all orthogonal basis functions; a new approach to discrete orthogonal polynomials, proving that there is one and only one unitary discrete polynomial basis. Furthermore, the concept of anisotropic moments is introduced and applied to 2D seismic data, which is an image processing problem. The new polynomial basis is numerically better conditioned than the discrete cosine transform. This opens the door to new image compression algorithms, offering a higher compression ratio than the well known JPEG method, for the same numerical effort.

Why it matters

OpenAlex reports 34 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a fundamentally new algebraic approach to the analysis and synthesis of discrete orthogonal basis functions. It provides the theoretical background to unify Fourier, Gabor and discrete orthogonal polynomial moments. For the first time, a set of objective tests are proposed to measure the quality of basis functions. It consists of two main sections: the theoretical background on the generation and orthogonalization of basis functions together with a new solution for the computation of spectra from incomplete data, as well as the implementation of interpolation for all orthogonal basis functions; a new approach to discrete orthogonal polynomials, proving that there is one and only one unitary discrete polynomial basis. Furthermore, the concept of anisotropic moments is introduced and applied to 2D seismic data, which is an image processing problem. The new polynomial basis is numerically better conditioned than the discrete cosine transform. This opens the door to new image compression algorithms, offering a higher compression ratio than the well known JPEG method, for the same numerical effort.

Key concepts: Basis function, Orthogonal basis, Discrete cosine transform, Basis (linear algebra), Orthogonalization, Orthogonal functions, Mathematics, Discrete sine transform

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algebraic Framework for Discrete Basis Functions in Computer Vision — Research Paper | ScholarLens