Multiscale autoconvolution histograms for affine invariant pattern recognition. Rahtu, E.; Salo, M.; and Heikkilä, J. In BMVC 2006 - Proceedings of the British Machine Vision Conference 2006, pages 1059-1068, 2006. Citeseer.
abstract   bibtex   
In this paper we present a new way of producing affine invariant histograms from images. The approach is based on a probabilistic interpretation of the image function as in the multiscale autoconvolution (MSA) transform, but the histograms extract much more information of the image than traditional MSA. The new histograms can be considered as generalizations of the image gray scale histogram, encoding also the spatial information. It turns out that the proposed method can be efficiently computed using the Fast Fourier Transform, and it will be shown to have essentially the same computational load as MSA. The experiments performed indicate that the new invariants are capable of reliable classification of complex patterns, outperforming MSA and many other methods.
@inproceedings{
 title = {Multiscale autoconvolution histograms for affine invariant pattern recognition},
 type = {inproceedings},
 year = {2006},
 pages = {1059-1068},
 publisher = {Citeseer},
 id = {5c164d00-9db9-316b-b9c3-94ff05dfbb48},
 created = {2019-09-15T16:34:27.055Z},
 file_attached = {false},
 profile_id = {bddcf02d-403b-3b06-9def-6d15cc293e20},
 last_modified = {2019-09-26T17:24:07.856Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 source_type = {CONF},
 private_publication = {false},
 abstract = {In this paper we present a new way of producing affine invariant histograms from images. The approach is based on a probabilistic interpretation of the image function as in the multiscale autoconvolution (MSA) transform, but the histograms extract much more information of the image than traditional MSA. The new histograms can be considered as generalizations of the image gray scale histogram, encoding also the spatial information. It turns out that the proposed method can be efficiently computed using the Fast Fourier Transform, and it will be shown to have essentially the same computational load as MSA. The experiments performed indicate that the new invariants are capable of reliable classification of complex patterns, outperforming MSA and many other methods.},
 bibtype = {inproceedings},
 author = {Rahtu, Esa and Salo, Mikko and Heikkilä, Janne},
 booktitle = {BMVC 2006 - Proceedings of the British Machine Vision Conference 2006}
}
Downloads: 0