Tracking Nonrigid Motion and Structure from 2D Satellite Cloud Images without Correspondences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Integral Histogram: A Fast Way To Extract Histograms in Cartesian Spaces
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Geodesic Active Contour Based Fusion of Visible and Infrared Video for Persistent Object Tracking
WACV '07 Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision
CellSs: making it easier to program the cell broadband engine processor
IBM Journal of Research and Development
Hierarchical Task-Based Programming With StarSs
International Journal of High Performance Computing Applications
Moving object segmentation using the flux tensor for biological video microscopy
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Realtime motion detection based on the spatio-temporal median filter using GPU integral histograms
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Efficient GPU implementation of the integral histogram
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume Part I
Hi-index | 0.00 |
The integral histogram is a recently proposed preprocessing technique to compute histograms of arbitrary rectangular gridded (i.e. image or volume) regions in constant time. We formulate a general parallel version of the the integral histogram and analyse its implementation in Star Superscalar (StarSs). StarSs provides a uniform programming and runtime environment and facilitates the development of portable code for heterogeneous parallel architectures. In particular, we discuss the implementation for the multi-core IBM Cell Broadband Engine (Cell/B.E.) and provide extensive performance measurements and tradeoffs using two different scan orders or histogram propagation methods. For 640 × 480 images, a tile or block size of 28 × 28 and 16 histogram bins the parallel algorithm is able to reach greater than real-time performance of more than 200 frames per second.