VLSI Median Filters

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 38, Issue 1, 1990, Pages 145-153

  Richards, Dana S ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; ELECTRIC FILTERS, DIGITAL; IMAGE PROCESSING; INTEGRATED CIRCUITS, VLSI; SPEECH--PROCESSING;

CONCURRENT PROCESSING; DELAY ANALYSIS; RECURSIVE MEDIAN FILTERS; VLSI MEDIAN FILTERS;

SIGNAL FILTERING AND PREDICTION;

EID: 0025245897     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.45627     Document Type: Article

References (38)

1. G. R. Arce and P. J. Warter, “A median filter architecture suitable for VLSI implementation,” in Proc. 23rd Annu. Allerton Conf. Commun., Contr., Comput., Oct. 1984, pp. 172–181.
2. E. Ataman, V. K. Aatre, and K. M. Wong, “A fast method for realtime median filtering,” IEEE Trans. Acousr., Speech, Signal Processing, vol. ASSP-28, pp. 415–421, 1980.
3. G. Bilardi, M. Pracchi, and F. P. Preparata, “A critique and an appraisal of VLSI models of computation,” in VLSI Systems and Computations. Boca Raton, FL: Computer Science Press, 1981, pp. 81–88.
4. R. P. Brent and H. T. Kung, “On the area of binary tree layouts,” Inform. Processing Lett., vol. 11, pp. 46–48, 1980.
5. H. C. Card, “VLSI computations: From physics to algorithms,” Integration, vol. 5, pp. 247–273, 1987.
6. B. Chazelle and L. Monier, “Towards more realistic models of computation for VLSI,” in Proc. 11th Annu. ACM Symp. Theory Comput., 1979, pp. 209–213.
7. P. Danielsson, “Getting the median faster,” Comput. Graph. Image Processing, vol. 17, pp. 71–78, 1981.
8. A. L. Fisher, “Systolic algorithms for running order statistics in signal and image processing,” J. Digital Syst., vol. 4, no. 2/3, pp. 251–264, 1982.
9. J. P. Fitch, E. L. Coyle, and N. C. Gallagher, “Median filtering by threshold decomposition,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1183–1188, 1984.
10. J. P. Fitch, “Software and VLSI algorithms for generalized ranked order filtering,” IEEE Trans. Circuits Syst., vol. CAS-34. pp. 553–559, 1987.
11. G. Garibotto and L. Lamberelli, “Fast on-line implementation of two-dimensional median filtering,” Electron. Lett., vol. 15, pp. 24–25, 1979.
12. R. G. Harber, S. C. Bass, and G. L. Nuedeck, “VLSI implementation of a fast rank order filtering algorithm,” in Proc. ICASSP'85, 1985, pp. 1396–1399.
13. T. S. Huang, G. J. Yang, and G. Y. Tang, “A fast two-dimensional median filtering algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 13–18, 1979.
14. R. B. Johnson, Jr., “The complexity of a VLSI adder,” Inform. Processing Lett., vol. 11, pp. 92–93, 1980.
15. D. E. Knuth, The Art of Computer Programming: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
16. H. T. Kung, “Why systolic architectures?” IEEE Computer, vol. 15, pp. 37–46, 1982.
17. P. Maragos and R. W. Schafer, “Morphological filters—Part II: Their relations to median, order-statistic, and stack filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1170–1184, 1987.
18. K. N. Mathews, “Large window median filtering on clip7,” Pattern Recogn. Lett., vol. 1, pp. 341–346, 1983.
19. C. A. Mead and L. A. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
20. D. Morgan, “Analog sorting network ranks inputs by amplitude and allows selection,” Electron. Design, vol. 21, no. 2, pp. 72–74, 1973. Corrigendum in vol. 21, no. 17, p. 7, 1973.
21. P. Narendra, “A separable median filter for image noise smoothing,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, pp. 20–29, 1981.
22. T. A. Nodes and N. C. Gallagher, “Median filters: Some modifications and their properties,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 739–746, 1982.
23. K. Oflazer, “Design and implementation of a single-chip 1-D median filter,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 1164–1168, 1983.
24. V. V. B. Rao and K. S. Rao, “A new algorithm for real-time median filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 1674–1675, 1986.
25. A. P. Reeves, “The local median and other window operations on SIMD computers,” Comput. Graph. Image Processing, vol. 19, pp. 165–178, 1982.
26. S. Sastry and V. K. P. Kumar, “A general purpose VLSI array for efficient signal and image processing,” in Proc. Int. Conf. Parallel Processing, 1987, pp. 917–920.
27. C. L. Seitz, “Concurrent VLSI architectures,” IEEE Trans. Comput., vol. C-33, pp. 1247–1265, 1984.
28. M. I. Shamos, “Robust picture processing operators and their implementations as circuits,” in Proc. Image Understanding Workshop, Nov. 1978, pp. 127–129.
29. S. L. Tanimoto, “Algorithms for median filtering of images on a pyramid machine,” in Computing Structures for Image Processing. London: Academic, 1983.
30. C. D. Thompson, “The VLSI complexity of sorting,” IEEE Trans. Comput., vol. C-32, pp. 1171–1184, 1983.
31. C. D. Thompson and H. Yasuura, “On the area-time optimal design of 1-selectors,” in Proc. 19th Asilomar Conf. Circuits, Syst., Comput., 1985, pp. 365–368.
32. J. W. Tukey, Exploratory Data Analysis. Reading, MA: Addison-Wesley, 1977.
33. J. D. Ullman, Computational Aspects of VLSI. Boca Raton, FL: Computer Science Press, 1984.
34. P. M. B. Vitanyi, “Area penalty for sublinear signal propagation delay on chip,” in Proc. 26th Annu. Symp. Foundations Computer Sci., 1985, pp. 197–207.
35. I. Vrto, “The area-time complexity of the VLSI counter,” Inform. Processing Lett., vol. 25, pp. 397–400, 1987.
36. I. Vrto, “Area-time tradeoffs for selection,” Parallel Algorithms and Architectures (LNCS 269), pp. 163–168, 1987.
37. J. Vuillemin, “A combinational limit to the computing power of VLSI circuits,” IEEE Trans. Comput., vol. C-32, 1983.
38. P. Wendt, E. Coyle, and N. Gallagher, “Stack filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 898–911, 1986.