Share Email Print
cover

Journal of Electronic Imaging

Maximum subarray algorithms for use in astronomical imaging
Author(s): Stephen J. Weddell; Tristan R. Read; Mohammed Thaher; Tadao Takaoka
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 25 October 2013
PDF: 9 pages
J. Electron. Imaging. 22(4) 043011 doi: 10.1117/1.JEI.22.4.043011
Published in: Journal of Electronic Imaging Volume 22, Issue 4
Show Author Affiliations
Stephen J. Weddell, Univ. of Canterbury (New Zealand)
Tristan R. Read, Univ. of Canterbury (New Zealand)
Mohammed Thaher, Univ. of Canterbury (New Zealand)
Tadao Takaoka, Univ. of Canterbury (New Zealand)


© SPIE. Terms of Use
Back to Top