25 October 2013 Maximum subarray algorithms for use in astronomical imaging
Stephen J. Weddell, Tristan R. Read, Mohammed Thaher, Tadao Takaoka
Author Affiliations +
Abstract
The maximum subarray problem is used to identify the subarray of a two-dimensional array, where the sum of elements is maximized. In terms of image processing, the solution has been used to find the brightest region within an image. Two parallel algorithms of the maximum subarray problem solve this problem in O(n) and O(log n) time. A field programmable gate array implementation has verified theoretical maximum performance; however, extensive customization is required, restricting general application. A more convenient platform for this work is a graphics processor unit since it offers a flexible trade-off between hardware customization and performance. Implementation of the maximum subarray algorithm on a graphics processor unit is discussed in this article for rectangular solutions and convex extensions are explored.
© 2013 SPIE and IS&T 0091-3286/2013/$25.00 © 2013 SPIE and IS&T
Stephen J. Weddell, Tristan R. Read, Mohammed Thaher, and Tadao Takaoka "Maximum subarray algorithms for use in astronomical imaging," Journal of Electronic Imaging 22(4), 043011 (25 October 2013). https://doi.org/10.1117/1.JEI.22.4.043011
Published: 25 October 2013
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Astronomical imaging

Algorithm development

Field programmable gate arrays

Visualization

Astatine

Computer programming

RELATED CONTENT


Back to Top