This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Running Max/Min Filters Using 1+o(1) Comparisons per Sample
December 2011 (vol. 33 no. 12)
pp. 2544-2548
ASCII Text
x 
 
Hao Yuan, Mikhail J. Atallah, "Running Max/Min Filters Using 1+o(1) Comparisons per Sample," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2544-2548, December, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TPAMI.2011.183,
author = {Hao Yuan and Mikhail J. Atallah},
title = {Running Max/Min Filters Using 1+o(1) Comparisons per Sample},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {33},
number = {12},
issn = {0162-8828},
year = {2011},
pages = {2544-2548},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2011.183},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Running Max/Min Filters Using 1+o(1) Comparisons per Sample
IS - 12
SN - 0162-8828
SP2544
EP2548
EPD - 2544-2548
A1 - Hao Yuan,
A1 - Mikhail J. Atallah,
PY - 2011
KW - Mathematical morphology
KW - erosion
KW - dilation
KW - opening
KW - closing.
VL - 33
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 
Hao Yuan, City University of Hong Kong, Hong Kong
Mikhail J. Atallah, Purdue University, West Lafayette
A running max (or min) filter asks for the maximum or (minimum) elements within a fixed-length sliding window. The previous best deterministic algorithm (developed by Gil and Kimmel, and refined by Coltuc) can compute the 1D max filter using 1.5+o(1) comparisons per sample in the worst case. The best-known algorithm for independent and identically distributed input uses 1.25+o(1) expected comparisons per sample (by Gil and Kimmel). In this work, we show that the number of comparisons can be reduced to 1+o(1) comparisons per sample in the worst case. As a consequence of the new max/min filters, the opening (or closing) filter can also be computed using 1+o(1) comparisons per sample in the worst case, where the previous best work requires 1.5+o(1) comparisons per sample (by Gil and Kimmel); and computing the max and min filters simultaneously can be done in 2+o(1) comparisons per sample in the worst case, where the previous best work (by Lemire) requires three comparisons per sample. Our improvements over the previous work are asymptotic, that is, the number of comparisons is reduced only when the window size is large.

[1] S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe, "Nearest Common Ancestors: A Survey and a New Distributed Algorithm," Proc. 14th Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 258-264, 2002.
[2] M.A. Bender, M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin, "Lowest Common Ancestors in Trees and Directed Acyclic Graphs," J. Algorithms, vol. 57, no. 2, pp. 75-94, 2005.
[3] D. Coltuc, "Mathematical Complexity Of Running Filters on Semi-Groups and Related Problems," IEEE Trans. Signal Processing, vol. 56, no. 7, pp. 3191-3197, July 2008.
[4] H.N. Gabow, J.L. Bentley, and R.E. Tarjan, "Scaling and Related Techniques for Geometry Problems," Proc. 16th Ann. ACM Symp. Theory of Computing, pp. 135-143, 1984.
[5] D. Gevorkian, J. Astola, and S. Atourian, "Improving Gil-Werman Algorithm for Running Min and Max Filters," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 5, pp. 526-529, May 1997.
[6] J. Gil and M. Werman, "Computing 2-D Min, Median, and Max Filters," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 5, pp. 504-507, May 1993.
[7] J. Gil and R. Kimmel, "Efficient Dilation, Erosion, Opening, and Closing Algorithms," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 12, pp. 1606-1617, Dec. 2002.
[8] R.M. Haralick, S.R. Sternberg, and X. Zhuang, "Image Analysis Using Mathematical Morphology," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 532-550, July 1987.
[9] D. Harel and R.E. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors," SIAM J. Computing, vol. 13, no. 2, pp. 338-355, 1984.
[10] D. Lemire, "Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element," Nordic J. Computing, vol. 13, no. 4, pp. 328-339, 2006.
[11] I. Pitas, "Fast Algorithms for Running Ordering and Max/Min Calculation," IEEE Trans. Circuits and Systems, vol. 36, no. 6, pp. 795-804, June 1989.
[12] B. Schieber and U. Vishkin, "On Finding Lowest Common Ancestors: Simplification and Parallelization," SIAM J. Computing, vol. 17, no. 6, pp. 1253-1262, 1988.
[13] P. Soille, Morphological Image Analysis: Principles and Applications. Springer-Verlag, 2003.
[14] M. van Herk, "A Fast Algorithm for Local Minimum and Maximum Filters on Rectangular and Octagonal Kernels," Pattern Recognition Letters, vol. 13, no. 7, pp. 517-521, http://www.sciencedirect.com/science/article/ B6V15-48N559B-18/21b976a6 102acf3d50831ad0e75a481e2 , 1992.
[15] J. Vuillemin, "A Unifying Look at Data Structures," Comm. ACM, vol. 23, no. 4, pp. 229-239, 1980.
[16] H. Yuan and M.J. Atallah, "Data Structures for Range Minimum Queries in Multidimensional Arrays," Proc. 21st Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 150-160, 2010.

Index Terms:
Mathematical morphology, erosion, dilation, opening, closing.
Citation:
Hao Yuan, Mikhail J. Atallah, "Running Max/Min Filters Using 1+o(1) Comparisons per Sample," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2544-2548, Dec. 2011, doi:10.1109/TPAMI.2011.183
Usage of this product signifies your acceptance of the Terms of Use.