電機資訊學院: 電信工程學研究所指導教授: 謝宏昀宋長諭Song, Chang-YuChang-YuSong2017-03-062018-07-052017-03-062018-07-052015http://ntur.lib.ntu.edu.tw//handle/246246/276682多重相機網路的一大特色是資料量龐大，並且有低傳輸延遲的需求。因此，不同於傳統網路下考慮如何最大化個別相機的傳輸效能，我們以如何能更有效的提升頻譜使用效率作為出發點，試圖在不影響影像蒐集品質的前提下，最小化實際所需傳輸的資料量。基於鄰近相機之間所拍攝到的影像可能會有所重疊，我們引入了多視角視訊編碼技術(Multiview video coding)，使得個別相機能夠透過重疊影像之相關性以降低影像編碼時所需的資料量。在本篇論文中，我們提出了一個利用側聽編碼來去除不同相機所攝影像間相關資料的技術，此一技術的優點是相機不需要在傳輸前彼此交換資訊，也因此並不會造成頻譜的額外負擔。對於此類問題，過去的相關文獻常以相機間的幾何資訊做為估計網路相關性的依據，然而此種方式時常會因估計的誤差而損失側聽編碼的效能。因此，為了使側聽編碼的效能最大化，我們藉由實際的移動向量估計方式來計算相機間的相關性，並且提出了一個綜合考量相機參考圖像的最佳化問題，最後在不損失最佳化特性的前提下將此問題拆解成「I-圖像相機選擇」以及「P-圖像相機參考圖像決定」的這兩個問題，使得P-圖像能夠選擇與其相關性最大的I-圖像作為移動向量估計時之參考圖像。我們接著提出了三種演算法來解決I-圖像相機選擇的問題，其一是藉由分支界定法(Branch-and-bound)以得到此問題的最佳解，其二是利用模擬退火法(Simulated annealing)來求得一近似最佳值的解，最後則是透過圖學近似的方式來更有效率的選擇I-圖像相機。此外，在實際多重相機網路的應用當中，相機間的相關性會隨著不同時間點拍攝到的影像而有所變化。因此我們也提出了一個觸發I-圖像重新選擇的機制，使得整體的網路能夠在不增加太多計算複雜度的前提下，得以迎合不同時間點之相關性變化。透過3D建模軟體當中虛擬城市所拍攝到的影像以及電腦模擬結果的分析，我們比較了三種演算法的時間複雜度，以及在相機相關性改變時之效能差異。我們發現在資料相關性高時，圖學近似的方式可以得到一接近最佳值的解，而若是針對資料相關性較低的網路，模擬退火法則比較適用。此外，模擬結果也顯示我們提出的側聽編碼技術約能減少35%的資料傳輸量，而使用相機幾何資訊估計相關性的做法只能達到15%的減少量，因此確立了此種做法確實為一可能運用在缺乏頻譜資源時的多重相機網路下之資料蒐集技術。In this thesis, we investigate the problem of correlated data gathering in the wireless multi-camera networks by considering the I-frame selection problem and the P-frame association problem. Since multiple cameras may be deployed in a neighborhood area with overlapping perspectives of the street views, we exploit the capability of transmission overhearing among cameras. If a camera can overhear transmissions from previous scheduled nearby cameras, it can reference the image and reduce the amount of bits required to be delivered to the aggregator by performing the multiview encoding technique. Unlike related works often use geometric information to predict correlation among cameras, we refer to the multiview video encoder for measuring realistic cameras correlation such that no performance loss will be caused due to prediction error. We further propose three I-frame selection algorithms based on branch-and-bound, simulated annealing, and graph approximation. We also introduce a P-frame association method to determine reference structure for all cameras such that the amount of required transmission bits can be minimized. Besides, for real-world applications, it might require multiple transmission rounds for delivering the collected images back to the data aggregator. Therefore, in this thesis, we also describe how to apply the correlated data gathering scheme via overhearing source coding for more than one transmission rounds. To evaluate the proposed algorithms, we resort to a 3D modeling software to generate quasi-realistic city views for all cameras and use a H.264 multiview video encoding reference software to encode collected images. Based on the evaluation for a semi-realistic multi-camera network, we compare the performance gain of our three proposed algorithms with a baseline approaches and point out the trade-off among the three proposed methods. That is, the graph approximation algorithm can perform well when the network is high correlated, whereas the simulated annealing algorithm might be a better choice if the network correlation level becomes low. We also show that our proposed approaches can result in 35% transmission reduction for high correlated multi-camera networks, however, only 15% can be reduced if geometric correlation is applied. The results thus motivate further investigation along this direction.21748390 bytesapplication/pdf論文公開時間: 2016/8/21論文使用權限: 同意有償授權(權利金給回饋本人)無線監控網路側聽編碼多視角視訊編碼分支界定法Wireless multi-camera networksoverhearing source codingmulti-view video codingbranch-and-boundthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/276682/1/ntu-104-R02942122-1.pdf