[1]繆紹綱譯,數位影像處理,培生教育出版社,2009。
[2]T. A. Nodes and N. C. Gallagher, “Median Filters: Some Modifications and Their Properties,” IEEE Trans. Acoust, Speech, Signal Process., no. 5, pp. 739-746, Oct. 1982.
[3]J. L. Starck, M. Elad, and D. Donoho, “Redundant Multiscale Transforms and Their Application for Morphological Component Separation,” Advances in Image and Electron Physics, vol. 132, pp. 288-348, 2004.
[4]J. L. Starck, M. Elad, and D. Donoho, “Image Decomposition via the Combination of Sparse Representatntions and Variational Approach,” IEEE Trans. Image Process, vol. 14, no. 10, pp. 1570-1582, 2005.
[5]X. Deng and Z. Liu, “An Improved Image Denoising Method Applied in Resisting Mixed Noise Based on MCA and Median Filter,” International Conference on Computational Intelligence and Security, pp. 162-166, 2015.
[6]S. Ruikar and D. D. Doye, “Image Denoising Using Wavelet Transform,” International Conference on Mechanical and Electrical Technology, pp. 509-515, 2010.
[7]K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering,” IEEE Trans. Image Process, vol. 16, no. 8, pp. 2080-2095, 2007.
[8]A. Buades, B. Coll, and J. M. Morel, “A Non-local Algorithm for Image Denoising,” IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 60-65, 2005.
[9]H. M. Lin and A. N. Willson, “Median Filters with Adaptive Length,” IEEE Trans. Circuits Systems, vol. 35, no. 6, pp. 675-690, 1988.
[10]O.Y. Harja, J. Astola, and Y. Neuvo, “Analysis of the Properties of Median and Weighted Median Filters Using Threshold Logic and Stack Filter Representation,” IEEE Trans. Signal Process., vol. 39, pp. 395-410, Feb. 1991.
[11]邱宇翼,基於DCT與DC-QIM技術之強健型浮水印,碩士論文,國立臺北科技大學電腦與通訊研究所,臺北,2013。[12]S. Mallat, “A Theory for Multiresolution Signal Decomposition: The Wavelet Representatin,” IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 674-693, 1989.
[13]I. Daubechies, “Orthonormal Bases of Compactly Supported Wavelets,” Communications on Pure and Applied Mathematics, pp. 909-996, 1988.
[14]J. Bobin, J. L. Starck, Y. Moudden, and M. J. Fadili, “Blind Source Separation: The Sparsity Revolution,” Advances in Image and Electron Physics, vol. 152, pp. 221-298, 2008.
[15]S. Chen, D. Donoho, and M. Saunder, “Atomic Decomposition by Basis Pursuit,” IEEE Trans. Signal Process., vol. 20, no. 1, pp. 33-61, Aug. 1998.
[16]S. Mallat and Z. Zhang, “Matching Pursuit in a Time-Frequency Dictionary,” IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
[17]Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition,” International Conference on Signals Systems and Computers, vol. 1, pp. 40-44, 1993.
[18]M. J. Fadili, J. L. Starck, J. Bobin, and Y. Moudden, “Image Decomposition and Separation Using Sparse Representations: An Overview,” Proceedings of the IEEE, vol. 98, pp. 983-994, 2010.
[19]M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation,” IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, 2006.
[20]E. J. Candes and D. L. Dnonoho, “Curvelets–A Surprisingly Effective Nonadaptive Representation for Objects with Edges,” TN, Nashville:Vanderbilt University Press, pp. 1-16, 1999.
[21]E. J. Candes, Ridgelets: theory and applications, Ph.D. Dissertation, Statistics, Stanford University, 1998.
[22]E. J. Candes, “Monoscale Ridgelets for the Representation of Images with Edges,” Technical Report, Statistics, Stanford University, pp. 1-26, 1999.
[23]E. Candes, L. Demanet, D. Donoho, and L. Ying, “Fast Discrete Curvelet Transforms,” Multiscale Modeling and Simulation, vol. 5, pp. 861-899, 2006.
[24]T. S. Lee, “Image Representation Using 2D Gabor Wavelets,” IEEE Trans. Pattern Anal. and Machine Intell., vol. 18, pp. 959-971, 1996.
[25]R.Verma and R. Pandey, “Non local means Algorithm with Adaptive Isotropic Search Window Size for Image Denoising,” Annual IEEE India Conference, pp. 1-5, 2015.