Coding of images based on finite algebraic structures and fast convolution algorithms

Alexander M. Krot; Mikhail N. Dolgikh; Natalya A. Romanovskaya

doi:10.1117/12.280907

22 July 1997 Coding of images based on finite algebraic structures and fast convolution algorithms

Alexander M. Krot, Mikhail N. Dolgikh, Natalya A. Romanovskaya

Proceedings Volume 3079, Detection and Remediation Technologies for Mines and Minelike Targets II; (1997) https://doi.org/10.1117/12.280907
Event: AeroSense '97, 1997, Orlando, FL, United States

Abstract

This paper gives brief overview of the signal processing problem about image and video coding using new types of discrete orthogonal transforms whose matrices are described with finite group character tables. The new effective algorithm of digital information compression based on discrete transform and convolutions on finite algebraic structures have been developed for reducing temporal and energy expenditures, increasing precision and processing reliability of large information volumes in the computer systems.

Citation Download Citation

Alexander M. Krot, Mikhail N. Dolgikh, and Natalya A. Romanovskaya "Coding of images based on finite algebraic structures and fast convolution algorithms", Proc. SPIE 3079, Detection and Remediation Technologies for Mines and Minelike Targets II, (22 July 1997); https://doi.org/10.1117/12.280907

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available