Maximum subarray algorithms for use in astronomical imaging (2013)
Type of ContentJournal Articles
PublisherUniversity of Canterbury. Computer Science and Software Engineering
University of Canterbury. Electrical and Computer Engineering
AuthorsWeddell, S.J., Read, T., Thaher, M., Takaoka, T.show all
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.
CitationWeddell, S.J., Read, T., Thaher, M., Takaoka, T. (2013) Maximum subarray algorithms for use in astronomical imaging. Journal of Electronic Imaging, 22(4), pp. 1-8.
This citation is automatically generated and may be unreliable. Use as a guide only.