Finite dataset interpolation method
US8582869B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Jan 19, 2012 |
| Grant date | Nov 12, 2013 |
| Priority date | — |
| Expiry date | Jan 19, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T3/40
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The invention provides a fast method for a high-quality interpolation of a finite multidimensional dataset. It has particular application in digital image processing, including, but not limited to, processing of both still images and real-time image/data processing. The method uses discrete cosine and sine transforms of appropriate types to covert, in blocks of desired size, the initial dataset to the frequency domain. Proposed interpolators calculate a chain of inverse transforms of non-square sizes that perform the interpolation. The larger transform is broken into smaller transforms of non-square size using a recursive size reduction process of FFT-type, and the smaller transforms are calculated directly exploiting the symmetry properties of smaller interpolator functions involved. An output dataset is then assembled using the calculated transforms. The method avoids computationally costly process of inflating the coefficient space by padding zeros exploited for DCT-based interpolations previously.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.