The discrete cosine transform on triangles

11/09/2018
by   Bastian Seifert, et al.
0

The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by combining algebraic signal processing theory with a specific kind of multivariate Chebyshev polynomials. Using a multivariate Christoffel-Darboux formula it is shown how to derive an orthogonal version of the transform.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2018

Fast cosine transform for FCC lattices

Voxel representation and processing is an important issue in a broad spe...
research
01/18/2019

FFT and orthogonal discrete transform on weight lattices of semi-simple Lie groups

We give two algebro-geometric inspired approaches to fast algorithms for...
research
07/14/2012

Incremental Learning of 3D-DCT Compact Representations for Robust Visual Tracking

Visual tracking usually requires an object appearance model that is robu...
research
09/10/2009

Sparsity and `Something Else': An Approach to Encrypted Image Folding

A property of sparse representations in relation to their capacity for i...
research
10/04/2019

Hyperspectral holography and spectroscopy: computational features of inverse discrete cosine transform

Broadband hyperspectral digital holography and Fourier transform spectro...
research
02/05/2021

Cosine Series Representation

This short paper is based on Chung et al. (2010), where the cosine serie...
research
09/07/2009

Sparse image representation by discrete cosine/spline based dictionaries

Mixed dictionaries generated by cosine and B-spline functions are consid...

Please sign up or login with your details

Forgot password? Click here to reset