| 研究生: |
周鍾烈 Chung-Lieh Chou |
|---|---|
| 論文名稱: |
基因演算法於語音聲紋解攪拌之應用 Application of Genetic Algorithms in Descrambling Secured Voice Signals |
| 指導教授: |
蘇木春
Mu-Chun Su |
| 口試委員: | |
| 學位類別: |
碩士 Master |
| 系所名稱: |
資訊電機學院 - 資訊工程學系 Department of Computer Science & Information Engineering |
| 畢業學年度: | 93 |
| 語文別: | 中文 |
| 論文頁數: | 42 |
| 中文關鍵詞: | 基因演算法 、拼圖 、聲紋格 、類比加密 |
| 外文關鍵詞: | sonograph, genetic algorithm, jigsaw puzzle |
| 相關次數: | 點閱:13 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在本論文中,將針對高頻無線通訊中的類比語音攪拌加密訊號以基因演算法從其聲紋所具有的特性,看成解方格拼圖的問題還原其原始訊號。實驗中所使用的語音訊號源取樣量化與攪拌模擬,乃至於各類數值與演算法運算,均在x86個人電腦上完成,使用的程式語言為C++,編譯器為Borland C++ Builder;在考量處理速度之下,我們採用8 bits的ADC並將二維的聲紋圖依攪拌使用的四個頻段接續轉為一維的問題處理,而被攪拌的聲紋單元邊界像素被用來做為解攪拌接圖的特徵元素;在一筆語音信號檔中,不含有能量的區間或含有較少能量的聲紋圖框無法完整以拼圖解攪拌還原是可以被理解的,我們對不同能量比例的聲紋圖框做了一系列的實驗統計,在能量佈滿整個聲紋圖框的解攪拌結果上,幾乎都呈現有九成以上的還原率。而且在基因演算法中疊代的世代次數並不用太高即可收斂完成,使用的時間在此NP-Complete的問題上相對並不會太久。從語音訊號的分析、攪拌的原理與模擬、基因演算法的模塑應用與實作結果統計,都在本論文中有詳細的論述。
In this paper, we will reconstruct an analog scramble-secured speech signal, which usually used in HF (High Frequency) radio transmission, using the feature of sonogram of it and treat it as solving a jigsaw puzzle by genetic algorithm (GA). In our experiment, including signal sampling, scrambling simulation, mathematical computing and algorithm applying were all accomplished at x86 PC platform, and with programming language of C++, compiler of Borland C++ Builder. An 8 bits ADC is used by reason of process speed. We also take 2-dimension sonogram as 1-dimension issue by connecting 4 frequency bands which used for scrambling. The boundary pixel of each scrambling element sonogram is used as main feature for descrambling, or reconstruction. In a speech signal source stream, it can be realized that if none of speech energy or small amount of energy located in a process frame is not possible to be fully reconstructed. We have done a series of experimental and statistical analysis according to different amount of energy in one frame. It shows that above 90% reconstruction rate if speech energy spread all over one processing frame. And it also shows that there are not many generations past after GA process to become a converge state. The speech signal analysis, analog scrambling method, scrambling/descrambling simulation and program implementation will all be illustrated in this paper in detail.
[1] R. Bermardini, G.M. Cortelazzo and G.A. Mian, “A General Scrambling Rule for Multidimensional FFT Algorithms”, IEEE Transactions on Signal Processing vol. 42, no. 7, pp. 1786 – 1794, July 1994
[2] K. Brandt, K.R. Burger, J. Downing and S.K. Mathematics, “Using backtracking to solve the scramble squares puzzle” Computer Science, and Physics Rockhurst University
[3] M.G. Chung, M.M. Fleck and D.A. Forsyth, “Jigsaw puzzles solver using shape and color” Proc. 1998 Fourth International Conference on Signal Processing, vol. 2, 12-16, pp. 877 – 880, Oct. 1998
[4] M.S. Ehsani and S.E. Borujeni, “Fast Fourier Transform Speech Scrambler”, Proc. 2002 First International IEEE Symposium on Intelligent Systems vol. 1, 10-12, pp. 248 – 251, Sept. 2002
[5] E.V. Stansfield, D. Harmer and M.F. Kerrigan, “Speech processing techniques for HF radio security”, Proc. IEE on Communications, Speech and Vision, vol. 136, no. 1, pp. 25 – 46, Feb. 1989
[6] P.N. Suganthan, “Solving jigsaw puzzles using Hopfield neural networks”, International Joint Conference on Neural Networks, vol. 6, 10-16, pp. 3745 – 3749, July 1999
[7] F. Toyama, Y. Fujiki, K. Shoji and J. Miyamichi, “Assembly of Puzzles Using a Genetic Algorithm”, Proc. 16th International Conference on Pattern Recognition 2002, vol. 4, pp. 389 – 392, 2002
[8] H. Bergzen “TAudio 4.1”, http://www.delphi32.com/vcl/1871, 1999