Minimal multiplicative complexity and fast restoration algorithm of digital signals and images

Alexander M. Krot; Helena B. Minervina

doi:10.1117/12.327118

17 July 1998 Minimal multiplicative complexity and fast restoration algorithm of digital signals and images

Alexander M. Krot, Helena B. Minervina

Proceedings Volume 3374, Signal Processing, Sensor Fusion, and Target Recognition VII; (1998) https://doi.org/10.1117/12.327118
Event: Aerospace/Defense Sensing and Controls, 1998, Orlando, FL, United States

Abstract

A fast algorithm of realizing a method of inverting a long liner convolution is presented. It is based on the procedure of sectionalization combined with effective real-valued split- radix fast Fourier transformation (FFT) algorithm for solving problems of restoration digital signals (images). The minimal multiplicative complexity of such algorithm is obtained.

Citation Download Citation

Alexander M. Krot and Helena B. Minervina "Minimal multiplicative complexity and fast restoration algorithm of digital signals and images", Proc. SPIE 3374, Signal Processing, Sensor Fusion, and Target Recognition VII, (17 July 1998); https://doi.org/10.1117/12.327118

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