Running max/min filters using 1+o(1) comparisons per sample

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 33, Issue 12, 2011, Pages 2544-2548

  Yuan, Hao ^a   Atallah, Mikhail J ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b Purdue University   (United States)

Author keywords

closing; dilation; erosion; Mathematical morphology; opening

Indexed keywords

BEST-KNOWN ALGORITHMS; CLOSING; DETERMINISTIC ALGORITHMS; DILATION; MAX FILTERS; MIN FILTERS; OPENING; SLIDING WINDOW; WINDOW SIZE; WORST CASE;

ALGORITHMS;

MATHEMATICAL MORPHOLOGY;

EID: 80054915025     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2011.183     Document Type: Article

References (16)

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. (Pubitemid 41501355)
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. (Pubitemid 127762246)
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. (Pubitemid 17632080)
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. (Pubitemid 15493878)
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/2/1b976a6 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.