IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 6 - Issue 1, January 2017 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Comparison On Matching Methods Used In Pose Tracking For 3D Shape Representation

[Full Text]

 

AUTHOR(S)

Khin Kyu Kyu Win, Yu Yu Lwin

 

KEYWORDS

ICP algorithm, matching technique, pose tracking, 3D shape representation, point cloud model

 

ABSTRACT

In this work, three different algorithms such as Brute Force, Delaunay Triangulation and k-d Tree, are analyzed on matching comparison for 3D shape representation. It is intended for developing the pose tracking of moving objects in video surveillance. To determine 3D pose of moving objects, some tracking system may require full 3D pose estimation of arbitrarily shaped objects in real time. In order to perform 3D pose estimation in real time, each step in the tracking algorithm must be computationally efficient. This paper presents method comparison for the computationally efficient registration of 3D shapes including free-form surfaces. Matching of free-form surfaces are carried out by using geometric point matching algorithm (ICP). Several aspects of the ICP algorithm are investigated and analyzed by using specified surface setup. The surface setup processed in this system is represented by simple geometric primitive dealing with objects of free-from shape. Considered representations are a cloud of points.

 

REFERENCES

[1] P. Besl, and N. McKay, 1992. “A method for registration of 3-d shapes”. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2).

[2] V. Matiukas, D. Miniotas. 2011. “Point Cloud Merging for Complete 3D Surface Reconstruction”. Electronics and Electrical Engineering, No. 7(113).

[3] Timothée Jost and Heinz Hügli. 2002. Fast ICP algorithms for shape registration. Lecture Notes on Pattern Recognition.

[4] Micha Hersch et. al. 2011. Iterative Estimation of Rigid-Body Transformations, Springer.

[5] P. S. Manoj, et. al. “A Closed-form Estimate of 3D ICP Covariance”. IAPR International Conference on Machine Vision Applications, May 2015, Tokyo, Japan.

[6] S. Marden and J. Guivant. “Improving the Performance of ICP for Real-Time Applications using an Approximate Nearest Neighbour Search.” Proceedings of Australasian Conference on Robotics and Automation, New Zealand, 2012.

[7] R. Boerner, and M. Kr¨ohnert. “Brute Force matching Between Camera Shots and Synthetic Images from Point Clouds.” The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume XLI-B5, 2016.

[8] Bin Yang, Shuyuan Shang. 2012. Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation. American Journal of Computational Mathematics, vol.2, pp. 336-340.

[9] Andrew W. Moore, “An Introductory Tutorial on kd-Trees”, PhD Thesis, Computer Laboratory, University of Cambridge, 1991.

[10] Y. D. Rajendra. et. al. “Evaluation of Partially Overlapping 3D Point Cloud’s Registration by Using ICP Variant and Cloud Compare.” The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume XL-8, 2014.