Optimization techniques for real-time image processing

Phillip A. Laplante; Edward R. Dougherty

doi:10.1117/12.205471

23 March 1995 Optimization techniques for real-time image processing

Phillip A. Laplante, Edward R. Dougherty

Proceedings Volume 2421, Image and Video Processing III; (1995) https://doi.org/10.1117/12.205471
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States

Abstract

Real-time image-processing differs from 'ordinary' image-processing in that the logical correctness of the system requires both correct and timely outputs. And, although special real-time imaging architectures are available or can theoretically be constructed, there are no standard programming languages to support these architectures. Moreover, many applications cannot or do not take advantage of any special imaging architectures; they use standard processors instead. In this case, optimization of run-time code is necessarily done with hand-tuning or by trial-and-error. In this paper these optimization techniques are formalized and it is shown how they can be applied to imaging algorithms in real-time to improve run-time performance.

Citation Download Citation

Phillip A. Laplante and Edward R. Dougherty "Optimization techniques for real-time image processing", Proc. SPIE 2421, Image and Video Processing III, (23 March 1995); https://doi.org/10.1117/12.205471

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