Year-end Sale % OFF 
Abstract
The algorithm basic for a rotation invariant method producing frequency transform is offered. The execution is based on a blocked matrixes usage. Each group of blocks consists of four units. Transform calculation direction is different for each block in a group. The transform results have a lot of fragments for which invariance for rotation is present for angles divisible by 90 degrees. This limitation is determined by a data representation rectangular grid. The consideration is based on two-dimensional digital cosine transform, but it could be used for different transform basics and any dimensions. The Hadamard matrix can be considered as such an example. The same algorithm could be used for compressed domain image retrievals based on DCT-processing.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
