簡易檢索 / 詳目顯示

研究生: 陳仕儒
Chen, Shr-Ru
論文名稱: 利用霍夫森林建構行人偵測技術
Hough Forest Based Human Detection
指導教授: 黃仲陵
Huang, Chung-Lin
林嘉文
Lin, Chia-Wen
口試委員: 曾定章
黃文吉
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2012
畢業學年度: 101
語文別: 中文
論文頁數: 50
中文關鍵詞: 行人偵測霍夫森林
外文關鍵詞: human detection, hough forest
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在本篇論文中,我們提出了一種利用樣本比對的方法產生相似特徵,並結合了霍夫森林的分類演算法,透過霍夫森林產生出來的每一個葉點皆可視為一個行人身上的區域部位偵測器,這些葉點除了是行人的區域部位偵測器之外還同時扮演著一個行人中心位置的密碼書,因此一張區域圖片掉到一個葉點後可以被判斷為跟葉點裡的訓練資料為相同區域部位,之後利用此葉點的密碼書對行人中心位置進行投票,透過不同葉點不同部位的投票結果,在霍夫平面上擁有較多票數的地方為行人中心位置的機率就越高。
    為了避免錯誤的投票位置,我們使用了一種滑動窗口的偵測策略,對每一個視窗裡的影像進行第一次投票,之後將這個視窗內區域最大值位置重新轉換到原本影像上,並於整張影像裡的相對位置進行第二次投票,透過這個方法可以大幅的降低兩行人中間的false positive情形。


    In this paper, we propose a method for the human detection. This method use similarity feature as our feature and hough forest as our classifier. We calculate the similarity between input path and example patch, and this similarity is one bin of our similarity feature. This similarity feature makes the split of the node in hough forest more meaningful. Through the hough forest, it collect the similar patch in the same leaf node, so that the leaf node can be seen as the part detector. Besides the leaf node also severs as a codebook recording the possible locations of the human center. Based on the codebook, the patch falling in this leaf node can cast probabilistic votes for possible locations of the centroid of the human. After all the path cast their votes, more votes indicate more likely the centroid of the human is.
    In order to reduce the error voting, we use the sliding window strategy to prevent casting the votes outside the window. The local maximum in the hough space of the window is then filtered by the threshold. The position with remaining local maximum is then transformed to the coordinate of the image, and cast the second vote in the hough space of the original image. By using the sliding window strategy, the filter of the threshold, and the second vote method, it can reduce the false positive in the image.

    目錄 第一章 介紹 1 1.1動機 1 1.2相關論文 2 1.3論文組織 3 第二章 霍夫森林 5 2.1決策樹 5 2.2隨機森林 6 2.3霍夫森林 7 第三章 利用樣本比對為基礎的決策函數 10 3.1梯度方向直方圖 11 3.2統計型區域二元特徵 11 3.3區域方向特徵 15 3.4樣本圖庫 17 3.5相似特徵計算 18 第四章 霍夫森林訓練及建構模型 20 4.1相似特徵向量 21 4.2決策函數 22 4.3決策標準及最佳決策函數選取 23 4.4葉點條件及葉點資訊彙整 25 4.5霍夫森林模組建立 26 第五章 霍夫森林應用於行人偵測 28 5.1霍夫投票 29 5.2尋找區域最大值座標 30 5.3滑動窗口偵測 31 5.4投票數閥值 31 5.5二次投票機制 32 5.6行人大小問題 32 第六章 實驗結果及討論 34 6.1訓練資料庫介紹 34 6.2計算相似向量的最佳的特徵形式以及最合適的區域圖片大小 36 6.3閥值計算 39 6.4 霍夫森林裡決策樹的數量 40 6.5不同尺寸下的投票結果 41 6.6實際圖片偵測結果的評估指標 42 6.7影像實際偵測結果 44 第七章 結論與未來工作 48 7.1 結論 48 7.2未來展望 48 REFERENCES 49

    REFERENCES

    [1] N. Dalal, B. Triggs. “Histograms of oriented gradients for human detection,” IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 886-893, July 2005.
    [2] Xiaoyu Wang, Tony X. Han, Shuicheng Yan. “An HOG-LBP human detector with Partial occlusion handling,” IEEE Conf. Computer Vision, pp.32-39, 2009.
    [3] Timo Ahonen, Abdenour Hadid, and Matti Pietikainen. “Face description with local binary patterns: Application to face recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, pp.2037-2041, 2006.
    [4] Y. Freund and R. E. Schapire. “A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” Journal of Computer and System Sciences, vol. 55, pp. 119-139, 1997.
    [5] Jürgen Gall and Victor Lempitsky. “Class-specific Hough forests for object detection”.In Int’l Conf. Computer Vision and Pattern Recognition, pages 1022–1029, 2009.
    [6] A. Bosch, A. Zisserman, and X. Mu˜noz. “Image classification usingrandom forests and ferns”. ICCV, pp. 1–8, 2007.
    [7] V. Lepetit, P. Lagger, and P. Fua. “Randomized trees for real-timekeypoint recognition”. CVPR (2), pp. 775–781, 2005.
    [8] F. Schroff, A. Criminisi, and A. Zisserman. “Object class segmentation using random forests”. BMVC, 2008.
    [9] Breiman , Leo. “Random Forests.” Machine Learning 45 (1): 5–32.
    [10] Ho, Tin Kam. “Random Decision Forest”. Proceedings of the 3rd International Conference on Document Analysis and Recognition, Montreal, QC, 14–16 August 1995. pp. 278–282.
    [11] Ho, Tin Kam. "The Random Subspace Method for Constructing Decision Forests". IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (8): 832–844.
    [12] Yun-Hong Wang , Yi-Ding Wang , Di Huang “Face recognition with statistical Local Binary Patterns” In machine learning and cybernrtics,2009 International Conference on 2433-2439,12-15, July2009
    [13] T Ahonen, A Hadid, M Pietikäinen “Face recognition with local binary patterns” Computer Vision-ECCV 2004, 2004 – Springer
    [14] Taskeed Jabid, Md. Hasanul Kabir, Oksam Chae “Gender Classification using Local Directional Pattern (LDP)” 2010 International Conference on Pattern Recognition
    [15] Djouadi, A.; Snorrason, O.; Garber, F. (1990). "The quality of Training-Sample estimates of the Bhattacharyya coefficient". IEEE Transactions on Pattern Analysis and Machine Intelligence 12 (1): 92–97
    [16] INRIA Person Dataset, http://pascal.inrialpes.fr/data/human/

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE