• 沒有找到結果。

壓縮感知的高壓縮率特性使得產品輕量化而可以大大的減少成本,透過數值 演算法將如此稀疏並且不連貫數據重建出原始資料的過程意味著此程序可以統 計並預測一定範圍的錯誤偏差,因此本身具有通道編碼的技術隱含其中,近幾年 來研究人員盡力研究如何透過感知矩陣演算出更有效率的壓縮原始資料,或者是 在統計的過程中可以更快的完成。另外一方面也盡力使用各種方法確保受破壞的 資訊可以重建並可以以統計的方式重建的訊源編碼技術,如PCT , 錯誤更正碼 BCH 的技術,亦有在通道編碼的觀念上研究,即是利用錯誤更正碼技術運用於感 知矩陣,使得壓縮數據不必再經過訊源編碼的方法即可得到必要的錯誤更正能 力。

壓縮感知亦可以看作下一代的感測裝置,從最早期的類比感知系統,至現代 廉價且普遍的數位感知系統,到最近所開始受到關注的壓縮感知系統,經歷了數 十年的演進。電子計算機運算速度的進步以及演算法的上可以解決

ill-condition的數學模型是開啟研究人員著手研究壓縮感知的領域研究的契機。

且壓縮感知的一特點為可運用於多方面的觀點,從感測端到系統後端的輸出端,

都可以透過這門技術有更多元的設計方法。

人類運用科技建立的文明資訊數以億計,價格較低的資訊傳播設備,如智慧 手…等裝置可以很輕易的製作資訊並傳播,及大量的資訊如何擷取當下適用的並 將其資訊隱喻壓縮於壓縮數據中,有些資訊當下或許無相關性,但是巨量統計之 後即具可分析的有用資訊,由於壓縮感知的壓縮數據是透過感知矩陣隨機運算而 成,其數據特性與巨量數據的觀念一致,這樣的觀點為這新型的壓縮統計技術可 以運用於高度激增資訊時代,使得分析的觀點更具多元與分析的方法,這些技術 方法的發展將可以使得壓縮感知這門資訊科學可以在未來幾年中慢慢取代已沿 用數十年的資訊處理壓縮的技巧與保護的方法。這門技術的特性也很容易運用在 各個科學技術的領域,現代各方資訊匯流的時代,值得深入研究與探討的領域。

63

參考文獻

[1] J. Romberg, “Imaging via compressive sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 14–20, Mar. 2008.

[2] E. J. Candes and M. B. Wakin, “An introduction to compressive sampling,”

IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21 – 30, March 2008.

[3] S. S. Chen, D. L. Donoho and M. A. Saunders, “Atomic decomposition by basis pursuit,” Society for Industrial and Applied Mathematics”, vol. 43, no. 1, pp.

129–159, Aug. 2006

[4] E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, Dec. 2005.

[5] D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, l. 52, no. 4, pp. 1289 – 1306, Apr. 2006

[6] E. Candes and J. Romberg, l1-magic : Recovery of Sparse Signal via Convex Programming, Oct. 2005

[7] J. Noecdal and S. J. Wright, Numerical Optimization, New York Springer, 1999.

[8] A. Antoniou and W. S. Lu, Practical Optimization, Springer US, 2007

[9] S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004.

[10] H. Cheng, Sparse Representation, Modeling and Learning in Visual Recognition, Springer, 2015

[11] V. M. Patel and R. Chellappa, Sparse Representations and Compressive Sensing for Imaging and Vision, Springer, 2013

[12] S. Mallat, A Wavelet Tour of Signal Processing. Academic Press, San Diego, second edition, 1999.

[13] V .K. Goyal and J. Kovacevic, “Generalized multiple description coding with correlating transforms,” IEEE Transactions on Information Theory, vol. 47, no. 6, pp. 2199 - 2224 , Sep. 2001.

[14] Y. Wang, M.T. Orchard, V. Vaishampayan and A.R. Reibman, “Multiple description coding using pairwise correlating transforms,” IEEE Transactions on Image Processing, vol. 10, no. 3, pp. 351 – 366, Mar. 2001.

[15] V. K. Gayal, “Multiple description coding: compression meets the network,”

IEEE Signal Processing Magazine, vol. 18, no. 5, pp. 74 – 93, Sep 2001.

[16] R. Venkataramani, G. Kramer and V. K. Goyal, “Multiple description coding with many channels,” IEEE Transactions on Information Theory, vol. 49, no. 9, Sep. 2003

[17] J. K. Pant, W-S. Lu and A. Antoniou, “A new algorithm for compressive sensing

64

based on total-variation norm,” 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013), pp. 1352 – 1355, May. 2013.

[18] J.Reneger, A Mathematical View Of Interior-point Methods In Convex Optimization, SIAM, 2001.

[19] S. J. Wright, Primal-Dual Interior-Point Methods, SIAM, 1997.

[20] A. Chambolle, ” An algorithm for total variation minimization and applications,”

Journal of Mathematical Imaging and Vision, pp. 89–97, 2004.

[21] L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation noise removal algorithm,” PhysicaD, vol. 60, no. 1-4, pp. 259–268, Nov. 1992.

[22] F. Alizadeh and D. Goldfarb, “Second-order cone programming,” Math.

Program., Ser. B, 95:3-51, 2003

[23] R. Coifman, F. Geshwind and Y. Meyer. “Noiselet,” Applied and Computational Harmonic Analysis, pp. 27-44, 2001

[24] E. Candes and J. Romberg, “Sparsity and incoherence in compressive sampling,”

IOP Publishing Ltd, vol. 23, no. 3, April 2007.

[25] E. Candes and J. Romberg, “Robust uncertainty principle: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489 – 509, Feb. 2006.

[26] E. Candes, J. Romberg and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communication on Pure and Applied Mathematics, vol. 59, no. 8, pp. 1207–1223, Aug. 2006.

[27] M. K. Ng, L. Qi, Y. F. Yang, and Y. M. Huang, “On semismooth newton methods for total variation minimization,” vol. 27, no. 3, pp. 265-276, Apr. 2007

[28] T. Strohmer, “Measure what should be measured progress and challenges in compressive sensing,” IEEE Signal Processing Letters, vol. 19, no. 12, December 2012.

[29] M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing, vol. 54, no. 11, pp. 4311 – 4322, Nov 2006.

[30] A. G. Dimakis, R. Smarandache and P. O. Vontobel, “LDPC Codes for Compressed Sensing,” IEEE Transactions on Information Theory, vol. 58, no. 5, pp. 3093 – 3114, Jan 2012.

[31] M. Akcakaya and V. Tarokh, “Shannon-theoretic limits on noisy compressive sampling,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 492 – 504, Jan. 2010.

[32] J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231 – 2242, Oct. 2004 [33] T. M. Cover and J. A. Thomas, “Elements Of Information Theory, Second

65

Edition,” Wiely, 7 APR 2005.

[34] S. Qaisar, R. Muhammad, W. Iqbal, M. Naureen and S. Lee, “Compressive sensing: from theory to applications, a survey,” Journal of Communications and Networks, vol. 15, no. 5, pp. 443 – 456, Oct. 2013

[35] C. A. Metzler, A. Maleki and G. Baraniuk, “From denoising to compressed sensing,” IEEE Transactions on Information Theory, vol. PP, no. 99, pp. 1, Apr.

2006.

[36] H. Bai, A. Wang, Y. Zhao, J-S. Pan and A. Abraham, “Distributed Multiple Description Coding,” Springer, 2011

[37] V. K. Goyal, A. K. Fletcher and S. Rangan, “Compressive sampling and lossy compression,” IEEE Signal Processing Magazine, vol. 25, pp. 2, Mar 2008.

[38] Z. Wang, A. C. Bovik, H. R. Sheikh and E. P. Simonceiil, “Image Quality Assessment: From Error Visibility to Structural Similarity,” IEEE Transactions on Image Processing, vol. 13, no. 4, pp. 600 – 612, Apr. 2004

[39] R. C. Gonzalez, R. E. Woods and S. L. Eddins, Digital Image Processing Using Matlab, Mcgrawhill, 2011

相關文件