Abstract
The representation of 2-D signals which are symmetric under the affine group of transformations is considered. An extension of the multiresolution Fourier transform (MFT) is presented and shown to have a predictable redistribution of energy as a result of affine transformations of the input signal. An approximation based on the discrete MFT then forms the basis of a computationally efficient algorithm for estimating local affine coordinate transformations between pairs of image regions. Results of applying the technique to an image registration problem illustrate its potential.
| Translated title of the contribution | Image representation based on the affine symmetry group |
|---|---|
| Original language | English |
| Title of host publication | Proceedings of 3rd IEEE International Conference on Image Processing |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 189-192 |
| Number of pages | 4 |
| ISBN (Print) | 0-7803-3259-8 |
| DOIs | |
| Publication status | Published - 1996 |
Fingerprint
Dive into the research topics of 'Image representation based on the affine symmetry group'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver