Novel and fast mapping triangulation algorithm for unorganized points cloud

Wei, Yongchao

doi:10.1117/1.3013234

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Delaunay triangulation node localization algorithm based on the planar domain proposed by Wang Wen et al [5] achieves two-dimensional planar localization, but this algorithm requires high efficiency and stability in triangulation network construction; Gao Fei et al [6] proposed a visual positioning model based on spatial plane constraints, which requires the use of binocular cameras and has a complex processing process; Xu Bing [7] proposed a template matching method based on the self normalized product correlation by using the center rotation invariant property of the center symmetric mark. Chai Xinghua et al [8] proposed a measurement and calculation method for the characteristic points on the surface of the object to be measured by directly projecting a calibrated laser dot matrix on the object to be measured.…”

Section: Introductionmentioning

confidence: 99%

A 2D Localization Model for Image Targets Based on Monocular Vision

Lian,

Li,

et al. 2024

Advances in Transdisciplinary Engineering

View full text Add to dashboard Cite

With the development of artificial intelligence and the continuous deepening of visual surveillance applications, how to quickly and accurately locate targets in images and videos has become a hot research topic in the industry. This article proposes a two-dimensional feature point localization method based on a monocular vision ranging model to address the issues of low accuracy and speed in existing monocular vision feature point localization. This method fits the world coordinates of feature points by converting pixel coordinates into world coordinates and establishing a compensation model based on errors. The experiment shows that the average relative accuracy of world coordinates after error compensation reaches 98.590%, improving the accuracy of monocular visual positioning.

show abstract

Section: Introductionmentioning

confidence: 99%

A 2D Localization Model for Image Targets Based on Monocular Vision

Lian,

Li,

et al. 2024

Advances in Transdisciplinary Engineering

View full text Add to dashboard Cite

show abstract

A Triangulation Method for Unorganized Points Cloud Based on Ball Expanding

Zhang¹,

Wang²,

Zhou³

et al. 2013

Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013

View full text Add to dashboard Cite

Local Optimum Triangulation for Unorganized Points Cloud

Wang¹,

Zhang²,

Zhou³

et al. 2013

RJASET

View full text Add to dashboard Cite

The triangulation of the unorganized data from the 3D scanner is always an important research subject of the CAD, computer geometry, reverse engineering and other areas. This paper introduces the current mainstream methods of triangulation that based on 3D points cloud data: plane projection method and direct method of division. This paper put forward a local optimization of direct triangulations method.

show abstract

Novel and fast mapping triangulation algorithm for unorganized points cloud

Cited by 3 publications

References 20 publications

A 2D Localization Model for Image Targets Based on Monocular Vision

A 2D Localization Model for Image Targets Based on Monocular Vision

A Triangulation Method for Unorganized Points Cloud Based on Ball Expanding

Local Optimum Triangulation for Unorganized Points Cloud

Contact Info

Product

Resources

About