http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Research on Parallel KD-Tree Construction for Ray Tracing
Zhang Peicheng,Xu Huahu,Bian Minjie,Honghao 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.11
Many computer graphics rendering algorithms and techniques use ray tracing for generation of photo-realistic images, and kd-tree is the most popular acceleration data structure for ray tracing. In order to avoid the inefficient parallel performance of kd-tree construction based on surface area heuristic (SAH), an algorithm using Morton code and path compression was present in this paper. Instead of building a kd-tree layer-by-layer, the proposed approach can be performed in parallel from bottom of a conceptual perfect binary tree. Experimental results on GPU show that our work achieves a faster kd-tree construction procedure.
Fast Pedestrian Detection with Adaboost Algorithm Using GPU
Chong Chao Cai,Jue Gao,Bian Minjie,Peicheng Zhang,Honghao Gao 보안공학연구지원센터 2015 International Journal of Database Theory and Appli Vol.8 No.6
Pedestrian detection is one of the hot research problems in computer vision field. The Cascade AdaBoost System is a commonly used algorithm in this region. However, when the training datasets become larger, it is still a time consuming process to build one Adaboost classifier. In this paper we detail an implementation of the AdaBoost algorithm using the NVIDIA CUDA framework based on the haar features as feature vectors, and downscaling with integral image. The result shows that we can get nearly 6x from the standard code to with our CPU implementation to achieve a near real-time performance and ensure better classification results in misjudgment.