Optimized high speed pixel sorting and its application in watershed based image segmentation

Authors:
Patrick De Smet
Affiliations:
Nationaal Instituut voor Criminalistiek en Criminologie (NICC/INCC), Vilvoordsesteenweg 100, B-1120 Brussels, Belgium
Venue:
Pattern Recognition
Year:
2010

Citing 12
Cited 0

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sorting by Address Calculation

Journal of the ACM (JACM)
A Comparison of Algorithms for Connected Set Openings and Closings

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparison of Affine Region Detectors

International Journal of Computer Vision
Efficient Maximally Stable Extremal Region (MSER) Tracking

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Valgrind: a framework for heavyweight dynamic binary instrumentation

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Fast multiresolution motion estimation algorithms for wavelet-based scalable video coding

Image Communication
Fast triangle reordering for vertex locality and reduced overdraw

ACM SIGGRAPH 2007 papers
Template Matching Techniques in Computer Vision: Theory and Practice

Template Matching Techniques in Computer Vision: Theory and Practice
Comparison between immersion-based and toboggan-based watershed image segmentation

IEEE Transactions on Image Processing
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing
New sorting-based lossless motion estimation algorithms and a partial distortion elimination performance analysis

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

Efficient sorting of image pixels based on their grayscale value is traditionally implemented using an algorithm based on distribution or counting sort methods. We show that an elegant alternative can be used which outperforms the traditional method both in terms of processing speed and main memory access. We discuss both theoretically analyzed and real-life performance results, and demonstrate the improvements that can be obtained when our algorithm is combined with a well-known watershed image segmentation method.