跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.106) 您好!臺灣時間:2026/04/04 07:46
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:姚柏仰
研究生(外文):Yao, Bo-Yang
論文名稱(外文):Quality-Based Full Angle Coverage for Object Tracking in Visual Sensor Networks
指導教授:黃啟富
指導教授(外文):Huang, Chi-Fu
口試委員:賴槿峰朱威達潘孟鉉
口試委員(外文):Lai, Chin-FengChu, Wei-TaPan, Meng-Shiuan
口試日期:2014-07-31
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2014
畢業學年度:102
語文別:英文
論文頁數:53
中文關鍵詞:無線視訊感測網路影像品質
外文關鍵詞:Wireless Visual sensor networksimage quality
相關次數:
  • 被引用被引用:0
  • 點閱點閱:289
  • 評分評分:
  • 下載下載:6
  • 收藏至我的研究室書目清單書目收藏:0
近幾年來,隨著科技的成功發展,無線視訊感測網路的相關研究越來越盛行。動態物體追蹤的問題也廣泛的在無線視訊感測網路中研究。然而鮮少論文討論視訊感測節點所拍攝到的畫面品質如何,所以,在本篇論文中 我們的目的是在任何時間點都可以補捉到目標物體任何角度的畫面,而且最重要的是確保所拍攝到的畫面能保證有一定的品質。為了達成目的,感測的模組會與一般傳統視訊感測模組有些不同,首先,視訊感測器的感測範圍 Field of View (FoV)不會有著固定的感測長度和角度,不會特定預設他的感測範圍,而是透過影像處理Peak Signal-to-Noise Ratio (PSNR)來做品質保證,並透過PSNR的值來界定品質保證的範圍,如此一來,只要物體進到品質保證的範圍時,就可以維持拍攝到的影像資料的品質。第二,我們不對目標物體特徵事前進行假設,我們透過在任何時間點拍攝涵蓋整個物體周圍來確保任何細節不會遺漏。最後,我們同時考量時間和空間因素讓物體追蹤問題轉變成set cover問題。因為是set cover problem,所以我們提出兩個啟發式sensor-based scheme和area-based scheme的選擇節點方法來進行以畫質為前提的節能選點。根據實驗的結果,sensor-based scheme可以減少並關閉多餘的節點,藉此來節省能量,而area-based scheme則可以透過平均分散消耗來延長整體網路的壽命。本篇主要貢獻在於結合考量物體追蹤問題與影像品質問題以及全角度拍攝的問題,並且在選擇之後考量節能問題。
In recent years, with the advancement of technologies, Wireless Visual Sensor Networks (WVSNs) become a popular research. Mobile object tracking problems were widely studied in the WVSNs. However, rare works discourse the quality of images captured by visual sensors. In this paper, our goal is to track a mobile object and obtain images of the object from arbitrarily angle and time. Most importantly, quality of each image is guaranteed. To achieve this goal, some basic sensing models are different from other research. First, Field of View (FoV) of the sensor is no longer a sector with a predefined angle and radius. Without setting the sensing range, we limit the FoV according to the Peak Signal-to-Noise Ratio (PSNR). Second, we assume the feature of the object cannot be known in advance. We intend to cover the entire object all the time to make sure that every detail of the object is not missing. Finally, we model the tracking problem as a set cover problem which considers both of the spatial and time domains at the same time. We propose two heuristic sensor selection schemes, sensor-based scheme and area-based scheme. According to our simulation results, while sensor-based scheme can reduce number of redundant nodes to be selected, area-based scheme can prolong more network lifetime. In conclusion, this work tackles the moving object tracking problem by tacking the image quality and full angle view into consideration and meanwhile achieve energy conservation.
Contents
Introduction 8
Related Works 11
System Model and Network Model 14
System model 14
Network Model 16
Assumptions 18
Problem Statement 20
Basic Optical 21
Full Angle cover 29
Selection Scheme 33
Transform into set cover problem 34
Characteristics of the model 36
Sensor-based scheme 40
Area-based scheme 41
Experiment 43
Simulation 46
Conclusion and future works 51
Reference 52

[1]T.-W. Sung and C.-S. Yang. A Voronoi-Based Sensor Handover Protocol for Target Tracking in Distributed Visual Sensor Networks. International Journal of Distributed Sensor Networks, Article ID 586210, 14 pages, 2014.
[2]Ma, J., Lou, W., & Li, X. Contiguous Link Scheduling for Data Aggregation in Wireless Sensor Networks. Parallel and Distributed Systems, IEEE Transactions on, Volume 25, Issue 7. 2014, July.
[3]Roy, R., Pal, M., & Gulati, T. Zooming Digital Images using Interpolation Techniques. International Journal of Application or Innovation in Engineering and Management, (IJAIEM), Volume 2, Issue 4, April, 2013.
[4]Tsai, H. W., Jhong, J. J., & Lin, M. R. The angle coverage algorithm of mobile object in wireless camera sensor networks. In Awareness Science and Technology and Ubi-Media Computing (iCAST-UMEDIA), International Joint Conference on (pp. 422-428). 2013, November.
[5]Hoseini, S. M., Dehghan, M., & Pedram, H. Full angle coverage in visual sensor networks. In Computer and Knowledge Engineering (ICCKE), 2nd International eConference on (pp. 260-265). 2012, October.
[6]Radani, Z. M., Samavi, S., Fooladgar, F., & Fami, E. S. Cluster based algorithm for volumetric coverage in wireless visual sensor network. In Artificial Intelligence and Signal Processing (AISP), 16th CSI International Symposium on (pp. 434-439). 2012, May.
[7]Cheng, C. F., & Tsai, K. T. Distributed Barrier Coverage in Wireless Visual Sensor Networks With-QoM. Sensors Journal, 12(6), 1726-1735. 2012.
[8]Y.-C. Liao and J.-Y. Shieh. Dynamic image stitching for panoramic video, 2012.
[9]Tseng, Y. C., Chen, P. Y., & Chen, W. T. K-Angle Object Coverage Problem in a Wireless Sensor Network. Sensors Journal, 12(12), 3408-3416. 2012.
[10]Hooshmand, M., Samavi, S., & Soroushmehr, S. R. Resource extension in visual sensor network for panoramic image generation. In Electrical Engineering (ICEE), 20th Iranian Conference on (pp. 775-779). 2012, May.
[11]Chen, T. S., Peng, J. J., Lee, D. W., & Tsai, H. W. Prediction-based object tracking and coverage in visual sensor networks. In Wireless Communications and Mobile Computing Conference (IWCMC), 7th International (pp. 278-284). 2011, July.
[12]Li, J., Xin, M., & Jin, J. An evolutionary approach for gray-level image zooming. In Adaptive Hardware and Systems (AHS), NASA/ESA Conference on (pp. 383-389). 2011, June.
[13]Chu, Z., Zhuo, L., Zhao, Y., & Li, X. Cooperative multi-object tracking method for wireless video sensor networks. In Multimedia Signal Processing (MMSP), IEEE 13th International Workshop on (pp. 1-5). 2011, October.
[14]Wang, B. Coverage problems in sensor networks: A survey. ACM Computing Surveys (CSUR), 43(4), 32. 2011.
[15]Jiechao, W., Zhiwei, L., & Min, Z. Two New Proposed Image Zooming Methods. In Wireless Communications Networking and Mobile Computing (WiCOM), 6th International Conference on (pp. 1-4). 2010, September.
[16]Chen, T. S., Tsai, H. W., Chen, C. P., & Peng, J. J. Object coverage with camera rotation in visual sensor networks. In Proceedings of the 6th International Wireless Communications and Mobile Computing Conference (pp. 79-83). 2010, June.
[17]Gil, J. M., Kim, C. M., & Han, Y. H. A greedy algorithm to extend the lifetime of randomly deployed directional sensor networks. In Ubiquitous Information Technologies and Applications (CUTE), Proceedings of the 5th International Conference on (pp. 1-5). 2010, December.
[18]Min, Z., Jiechao, W., Zhiwei, L., & Yonghua, L. An adaptive image zooming method with edge enhancement. In Advanced Computer Theory and Engineering (ICACTE), 3rd International Conference on (Vol. 2, pp. V2-608). 2010, August.
[19]Mulligan, R., & Ammari, H. M. Coverage in wireless sensor networks: a survey. Network Protocols and Algorithms, 2(2), 27-53. 2010.
[20]Aghdasi, H. S., Nasseri, S., & Abbaspour, M. FoV-Clustering as a solution to a novel camera node activation problem in WVSNs. In Wireless Days (WD), IFIP (pp. 1-5). 2010, October.
[21]Hung, K. S., & Lui, K. S. Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range. EURASIP Journal on Wireless Communications and Networking, 2010, 16.
[22]Li, D., & Liu, H. Sensor coverage in wireless sensor networks. International Journal of Sensor Networks, 2. 2009.
[23]Costa, D. G., & Guedes, L. A. The coverage problem in video-based wireless sensor networks: A survey. Sensors, 10(9), 8215-8247. 2010.
[24]Jenjaturong, S., & Intanagonwiwat, C. A set cover-based density control algorithm for sensing coverage problems in wireless sensor networks. In Cognitive Radio Oriented Wireless Networks and Communications. CrownCom. 3rd International Conference on (pp. 1-6). 2008, May.
[25]Yang, F. K. An improved stereo matching algorithm using belief propagation for homogeneous regions (Doctoral dissertation, Master Thesis, National Central University). 2009.
[26]Jia, J., Chen, J., Chang, G., Tian, C., & Qin, W. Maximization for wireless sensor network lifetime with power efficient cover set alternation. In Communications, Circuits and Systems. ICCCAS. International Conference on (pp. 439-443). 2008, May.
[27]Yang, M., Cao, Y., Tan, L., Zhang, C., & Yu, J. A new multi-quality image fusion method in visual sensor network. In Intelligent Information Hiding and Multimedia Signal Processing. IIHMSP. Third International Conference on (Vol. 2, pp. 667-670). 2007, November.
[28]Chow, K. Y., Lui, K. S., & Lam, E. Y. Maximizing angle coverage in visual sensor networks. In Communications. ICC. IEEE International Conference on (pp. 3516-3521). 2007, June.
[29]Soro, S., & Heinzelman, W. Camera selection in visual sensor networks. In Advanced Video and Signal Based Surveillance, AVSS. IEEE Conference on (pp. 81-86). 2007, September.
[30]Cai, Y., Lou, W., & Li, M. Cover set problem in directional sensor networks. In Future Generation Communication and Networking (Vol. 1, pp. 274-278). FGCN 2007, December.
[31]Battiato, S., Di Blasi, G., Gallo, G., & Toro, S. BLAZE: Bilinear LAZA Algorithm for Zooming Enhancement. 2006.
[32]O. Welch and G. Bishop. An introduction to the kalman filter. Technical report, UNC-CH Computer Science Technical Report 95041, 1995.
[33]Ai, J., & Abouzeid, A. A. Coverage by directional sensors in randomly deployed wireless sensor networks. Journal of Combinatorial Optimization, 11(1), 21-41. 2006.
[34]Ma, H., & Liu, Y. Correlation based video processing in video sensor networks. In Wireless Networks, Communications and Mobile Computing, International Conference on (Vol. 2, pp. 987-992). 2005, June.
[35]Xu, Y., & Lee, W. C. On localized prediction for power efficient object tracking in sensor networks. In Distributed Computing Systems Workshops. 23rd International Conference on (pp. 434-439). 2003, May.
[36]Huang, C. F., & Tseng, Y. C. The coverage problem in a wireless sensor network. Mobile Networks and Applications, 10(4), 519-528. 2005.
[37]Slijepcevic, S., & Potkonjak, M. Power efficient organization of wireless sensor networks. In Communications. ICC 2001. IEEE International Conference on (Vol. 2, pp. 472-476). 2001.
[38]Atallah, M. J., Chen, D. Z., & Lee, D. T. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica, 14(5), 429-441. 1995.
[39]Lee, C. C., & Lee, D. T. On a circle-cover minimization problem. Information Processing Letters, 18(2), 109-115. 1984.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top