透過您的圖書館登入
IP:3.22.100.180
  • 學位論文

重複物件探勘與計數演算法的加速與改良

Robust Algorithm for Mining and Counting of Repeat Objects

指導教授 : 黃乾綱

摘要


物件偵測(Object Detection)在生活中具有諸多種應用,其中之一便是針對重複物件的計數。在現有的物件偵測演算法中,往往是針對特定目標對象,由人工設計或電腦學習相關特徵,以達到在影像中偵測特定目標的目的,但此種方法通常只能適用於特定類型的目標,並不能通用化到偵測其他種物件。 本研究延續近年來被提出,基於輪廓特徵抽取與分群的樣式偵測演算法,並在其架構上進行改良,引入具有完整物件概念的邊緣偵測方法、增加輪廓篩選機制、減少運算複雜度,使原有演算法的效能與速度都大幅提升,並達到通用化的樣式與物件偵測能力。 本研究分別針對物件偵測與物件分群兩個目標進行成果評估。物件偵測實驗的結果顯示,使用此改良演算法在原物件偵測資料集的F度量值(F-measure)可達86.48%,與改良前演算法相比提升22.37%;在本研究提供的物件偵測資料集上的F度量值也有84.32%,較改良前提升27.73%。而在物件分群的實驗中,本研究的方法在F度量值與準確度上分別達到91.43%與93.91%,較改良前的方法各自提高6.18%與14.65%。 在相同的硬體設備條件下,原方法在兩物件偵測資料集中,平均每張影像的計算時間(Second Per Frame, SPF)為130.9秒,速度較人工計算慢,本研究改良後則加速至每張平均7.2秒,使演算法更具有物件計數的實用價值。

並列摘要


Repeat object counting is one of the applications of object detection. Most object detection algorithms include human-designed or machine-learned feature extractor, but feature extractor designed in this way can only detect labeled targets and is hard to generalize to detect unseen objects. Our work builds on previous proposed pattern mining algorithm, which bases on contour feature extraction and clustering to achieve general pattern detection. We focus on improving the performance and the speed of the existing algorithm and generalizing its targets to both patterns and objects by introducing noise-resistant edge detection methods, employing more contour selection mechanisms and reducing its computational complexity. Experimental results show that in repeat object detection task, the macro precision, recall and F-measure of the algorithm improves from 80.08% to 86.54%, 53.46% to 86.43% and 64.11% to 86.48% in previous dataset, from 66.77% to 84.89%, 50.37% to 83.76% and 56.59% to 84.32% in new dataset. In object clustering task, our algorithm achieves 91.43% in F-measure and 93.91% in overall accuracy, with 6.18% and 14.65% improvement, respectively. Under same hardware configuration, the original algorithm takes 130.9 seconds per frame in average in object detection task, which is slower than manual counting, while the improved algorithm takes only 7.2 seconds per frame, making the algorithm more practical to real object counting task.

參考文獻


[1] Q. Geissmann, "OpenCFU, a new free and open-source software to count cell colonies and other circular objects," PloS one, vol. 8, no. 2, p. e54072, 2013.
[2] 陳雲濤, "Automatically Count and Classify Multiple Colonies on Mobile Device Captured Images," 2016.
[3] R. Girshick, J. Donahue, T. Darrell, and J. Malik, "Rich feature hierarchies for accurate object detection and semantic segmentation," in Proceedings of the IEEE conference on computer vision and pattern recognition, 2014, pp. 580-587.
[4] J. Redmon, S. Divvala, R. Girshick, and A. Farhadi, "You only look once: Unified, real-time object detection," in Proceedings of the IEEE conference on computer vision and pattern recognition, 2016, pp. 779-788.
[5] Y. Li, L. Liu, C. Shen, and A. Van Den Hengel, "Mining mid-level visual patterns with deep CNN activations," International Journal of Computer Vision, vol. 121, no. 3, pp. 344-364, 2017.

延伸閱讀