CN104463826A - Novel point cloud parallel Softassign registering algorithm - Google Patents
Novel point cloud parallel Softassign registering algorithm Download PDFInfo
- Publication number
- CN104463826A CN104463826A CN201310424625.6A CN201310424625A CN104463826A CN 104463826 A CN104463826 A CN 104463826A CN 201310424625 A CN201310424625 A CN 201310424625A CN 104463826 A CN104463826 A CN 104463826A
- Authority
- CN
- China
- Prior art keywords
- point
- cloud
- algorithm
- softassign
- point cloud
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10028—Range image; Depth image; 3D point clouds
Landscapes
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a novel point cloud parallel Softassign registering algorithm. On the basis that CUDA performs parallel acceleration on a Softassign algorithm, by use of a method of combining three-dimensional point cloud discrete curvature estimation and three-dimensional Kd-tree, point-cloud simplification is performed on a three-dimensional object point cloud to enable the simplified three-dimensional object point cloud to maintain sufficient geometric characteristics, and then Softassign registering is performed on the simplified object point cloud, such that the registering precision of the Softassign algorithm in three-dimensional object point cloud registering is improved. The algorithm provided by the invention has the following advantages: first of all, the point-cloud simplification is performed on the three-dimensional object point cloud, such that the information content of the Softassign registering is reduced; and secondly, through the improved Softassign registering algorithm, the registering precision in object cloud registering is improved, and through a parallel acceleration technology, the operation speed of the Softassign registering method is enhanced.
Description
Technical field
The present invention relates to a kind of image processing techniques, particularly a kind of simplification of three-dimensional body point cloud information and registration technology.
Background technology
Along with the full-fledged of 3-D scanning technology and application popularization, identify at meter Cheng Wei in recent years the research direction that field is new based on the identification of object three-dimensional shape information and coupling.Point cloud matching is one of key issue of the three-dimensional data coupling of object scan, first due to the restriction of scanning angle, complete subject depth image cannot be obtained by a 3-D scanning, the cloud data that each scanning obtains is the surface data of part, need the data fusion of Multiple-Scan to be spliced into a width Complete three-dimensional cloud data, and the core technology of anastomosing and splicing and three-dimensional registration; Secondly object model to be identified and the object model in reference library are carried out shape facility when comparing, also need to mate between character pair, judge matching precision by comparison match error rice.
Along with the precision of three-dimensional scanning device improves, data scale and registration accuracy also improve thereupon, and traditional serial registration Algorithm efficiency reduces, and cannot meet the demand of real-time; High performance Graphics Processing Unit (Graphic Processing Unit, and unified calculation framework (Compute Unified Device Architecture GPU), CUDA) providing high performance parallel computation environment for addressing this problem, making the real-time solution of the problems such as data scale is huge, point cloud registering precision is higher become possibility.
Point cloud registering adopts ICP (Iterative Closest Point) algorithm usually, namely makes the distance mean square deviation on two subject to registration some clouds between corresponding point obtain minimum value by iterative computation, thus realizes the exact matching between subject to registration some cloud.But the deficiency of ICP algorithm is to need initial alignment, so usually adopt the methods such as PCA (Principal Component Analysis) to carry out initial registration, i.e. thick alignment, then with initial registration result for condition carries out ICP registration, i.e. Accurate align.Rangarajan in 1997 etc. propose Softassign algorithm for all kinds of matching problem, and optimize the solution procedure of corresponding relation between points, improve optimum solution, this algorithm also has certain robustness to abnormity point problem.No matter ICP algorithm or Softassign algorithm are all containing extensive matrix operation, these computings possess the feasibility of parallel accelerate, significantly can improve the deficiency that serial registration efficiency is lower, but due to the restriction in video memory space, this work has been carried out simple stochastic sampling to larger point cloud model and has been simplified, and causes final registration accuracy to there is clear and definite loss.
Summary of the invention
Huge in order to overcome data scale, the problem that point cloud registering precision is not high, of the present inventionly proposes a kind of some cloud newly and to walk abreast Softassign registration Algorithm, avoids the problem of local registration, improves the Efficiency and accuracy of object point cloud registering.
This algorithm solves the technical scheme that its technical matters adopts:
Utilize the method that three-dimensional point cloud Discrete Curvature Estimation and three dimensions kd-tree combine, carry out point cloud simplification to three-dimensional body point cloud, after enabling simplification, three dimensional object point cloud retains enough geometric properties.
Softassign registration is carried out to simplification object point cloud, improves the registration accuracy of Softassign algorithm in three dimensional object point cloud registering.
CUBLAS (CUDA Basic Linear Algebra Subprograms) is utilized to carry out computing between acceleration vector and matrix.Utilize the computing between CUDAkernel function acceleration matrix element.
The beneficial effect of this algorithm is: carry out point cloud simplification to three-dimensional body point cloud, decrease the quantity of information of Softassjgn registration; And the Softassign registration Algorithm by improving, improve the registration accuracy in object cloud registration; Parallel accelerate technology is adopted to improve the arithmetic speed of Softassign registration Algorithm.
Accompanying drawing explanation
Fig. 1 is point cloud simplification details of the present invention signal
Embodiment
Below in conjunction with the drawings and specific embodiments, illustrate the present invention further.
1. utilize kd-tree to carry out point cloud simplification
If the original point cloud data position X of three-dimensional body, first set up the kd-tree (K-dimension tree) of original point, for fast search neighborhood and closest approach.Kd-tree is the sharp data structure divided data at k dimension space.Three dimensional object point cloud can set up kd-tree, and main application is data point search, and it is neighborhood search that its way of search comprises two kinds: one, can search the neighborhood point of specifying in the radius of neighbourhood; Two is k neighborhood search, can search the k strong point that distance objective point is nearest, search for closest approach exactly as k=1.Because kd-tree is the data structure based on spatial division, when carrying out data search, search for from the little space of bottom, can search efficiency be improved.
In the process simplifying some cloud, a cloud is divided into key point and non-key point.First the Gaussian curvature of each point in solution point cloud, and compare with appointment threshold value, if Gaussian curvature is greater than specify threshold value, judge that this point is as key point, directly copy to and simplify in some cloud; If be less than appointment threshold value, judge that this point is non-key point, examination ball is set up by k neighborhood search, dot density in examination ball, if dot density is greater than appointment threshold value, then in mark examination ball equalization point be a little key point, otherwise be labeled as key point a little by ball, realize the simplification to non-key point accordingly.
The object-point cloud shortcut calculation process according to Gaussian curvature and kd-tree that the present invention realizes is as shown in algorithm 1.
In algorithm 1, the detailed description of Step6 and Step7 as shown in Figure 1, the x that sets up an office is the random point that Step4 chooses, as central point, with the detailed description of Step6 and Step7 in an x algorithm 1 as shown in Figure 1, the x that sets up an office is the random point that Step4 chooses, and as central point, utilizes kd-tree to carry out k neighborhood search centered by an x, x is followed successively by from an x distance incremental order in k=3, Fig. 1
1, x
2, x
3, x
4.As Fig. 1 a: if the key point wherein do not marked, be then the centre of sphere with x, with r
3=|| x
3-x|| is that radius sets up examination ball, and in figure, circle represents examination ball; As Fig. 1 b: if x
3for marking key point, be the centre of sphere with x, with r
2=|| x
2-x|| is that radius sets up examination ball, and Fig. 1 a and 1b is sufficient in the step a of Step6 in algorithm 1 and the signal of step b respectively.Fig. 1 c is the final result simplified, with x, x
1, x
2the equalization point x ' of 3 replaces original 3 points, and marks.
2. adopt the Softassign registration Algorithm improved
For two object data point set X and Y to be matched, utilize point cloud simplification algorithm to be simplified a cloud and be designated as X
rand Y
r.Traditional ICP algorithm is at point set Y
rin find and point set X
rin certain some x
ricorresponding some y
rj, make objective function
minimum.And for Softassign algorithm, point set Y
rin each point can with x
rihave corresponding relation, but the alignment probability of correspondence is not identical.Softassign algorithm calculates R and t by minimizing registration error E (such as formula 1).
Wherein m
ijrepresent some x
iwith y
jthe probability of alignment, makes M=(m
ij) represent alignment weight matrix, notice that M contains extra row and processes the abnormal conditions in aliging with row.N
x, n
yrepresent some cloud X
rand Y
rdata scale after simplification, R
k-1, t
k-1represent this registration R, the initial value of t, α, β are constant, specify when algorithm runs.
3.Softassign algorithm parallel accelerate
M in the Step4 of algorithm 2
ijrepresent and simplify some cloud X
rmiddle x
riand Y
rmiddle y
rjregistration probability, then solve m
ijtime, simplify some cloud point X
rand Y
rhelp the relation of mapping, note matrix M=(m
ij), its scale is two simplification point cloud X
rand Y
rthe product of vertex number, that is: | M|=n
x× n
y, when matrix multiplication is carried out to matrix M, the computing scale of more than 1,000,000 times can be reached.
The key of algorithm parallel accelerate is the calculating process of former algorithm to be divided into computing and the computing of matrix interior element between vector and matrix, thus utilizing CUBLAS (CUDABasic Linear Algebra Subprograms) to carry out computing between acceleration vector and matrix on the one hand, CUBLAS is the Parallel Implementation of BLAS based on CUDA; Utilize the computing between CUDAkernel function acceleration matrix element on the other hand.Below elaborate and how to utilize CUBLAS and CUDA kernel function to carry out parallel accelerate to the whole process of Softassign algorithm.
Claims (5)
1. the invention discloses a kind of some cloud newly to walk abreast Softassign registration Algorithm, it is characterized in that, kd-tree is utilized to carry out point cloud simplification, by point cloud simplification algorithm improvement Softassign registration Algorithm, improve the registration accuracy in object cloud registration, and adopt parallel accelerate technology to improve arithmetic speed.
2. method according to claim 1, is characterized in that, three dimensional object point cloud can set up kd-tree, and main application is data point search, and it is neighborhood search that its way of search comprises two kinds: one; Two is k neighborhood search.
3. method according to claim 1, is characterized in that, for two three object data point set X and Y to be matched, utilizes point cloud simplification algorithm to be simplified a cloud and is designated as X
rand Y
rthe Softassign algorithm improved, point set Y
rin each point can with x
rihave corresponding relation, but the alignment probability of correspondence being not identical, calculating R and t by minimizing registration error E.
4. method according to claim 1, the calculating process of former algorithm is it is characterized in that to be divided into computing and the computing of matrix interior element between vector and matrix, thus utilizing CUBLAS to carry out computing between acceleration vector and matrix on the one hand, CUBLAS is the Parallel Implementation of BLAS based on CUDA; Utilize the computing between CUDAkernel function acceleration matrix element on the other hand.
5. method according to claim 2, is characterized in that, in the process simplifying some cloud, a cloud is divided into key point and non-key point.First the Gaussian curvature of each point in solution point cloud, and compare with appointment threshold value, if Gaussian curvature is greater than specify threshold value, judge that this point is as key point, directly copy to and simplify in some cloud; If be less than appointment threshold value, judge that this point is non-key point, examination ball is set up by k neighborhood search, and the dot density examined or check in ball, if dot density is greater than appointment threshold value, then in mark examination ball equalization point be a little key point, otherwise be labeled as key point a little by ball, realize the simplification to non-key point accordingly.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310424625.6A CN104463826A (en) | 2013-09-18 | 2013-09-18 | Novel point cloud parallel Softassign registering algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310424625.6A CN104463826A (en) | 2013-09-18 | 2013-09-18 | Novel point cloud parallel Softassign registering algorithm |
Publications (1)
Publication Number | Publication Date |
---|---|
CN104463826A true CN104463826A (en) | 2015-03-25 |
Family
ID=52909812
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310424625.6A Pending CN104463826A (en) | 2013-09-18 | 2013-09-18 | Novel point cloud parallel Softassign registering algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104463826A (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106097334A (en) * | 2016-06-08 | 2016-11-09 | 北京航空航天大学 | Point cloud registration method based on degree of depth study |
CN106485737A (en) * | 2015-08-25 | 2017-03-08 | 南京理工大学 | Cloud data based on line feature and the autoregistration fusion method of optical image |
CN106485690A (en) * | 2015-08-25 | 2017-03-08 | 南京理工大学 | Cloud data based on a feature and the autoregistration fusion method of optical image |
WO2018049843A1 (en) * | 2016-09-14 | 2018-03-22 | 杭州思看科技有限公司 | Three-dimensional sensor system and three-dimensional data acquisition method |
WO2018161662A1 (en) * | 2017-03-08 | 2018-09-13 | 浙江大学 | Method for enhancing three-dimensional sonar point cloud image based on distance statistics |
CN108665491A (en) * | 2018-03-22 | 2018-10-16 | 西安电子科技大学 | A kind of quick point cloud registration method based on local reference |
CN110097581A (en) * | 2019-04-28 | 2019-08-06 | 西安交通大学 | Method based on point cloud registering ICP algorithm building K-D tree |
CN110097582A (en) * | 2019-05-16 | 2019-08-06 | 广西师范大学 | A kind of spots cloud optimization registration and real-time display system and working method |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102169579A (en) * | 2011-03-31 | 2011-08-31 | 西北工业大学 | Rapid and accurate registration method of dense point cloud model |
CN103150747A (en) * | 2012-11-16 | 2013-06-12 | 佳都新太科技股份有限公司 | Point cloud registration algorithm based on topological characteristic |
CN103236064A (en) * | 2013-05-06 | 2013-08-07 | 东南大学 | Point cloud automatic registration method based on normal vector |
-
2013
- 2013-09-18 CN CN201310424625.6A patent/CN104463826A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102169579A (en) * | 2011-03-31 | 2011-08-31 | 西北工业大学 | Rapid and accurate registration method of dense point cloud model |
CN103150747A (en) * | 2012-11-16 | 2013-06-12 | 佳都新太科技股份有限公司 | Point cloud registration algorithm based on topological characteristic |
CN103236064A (en) * | 2013-05-06 | 2013-08-07 | 东南大学 | Point cloud automatic registration method based on normal vector |
Non-Patent Citations (2)
Title |
---|
TORU TAMAKI ET AL: "Softassign and EM-ICP on GPU", 《2010 FIRST INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING》 * |
董琳等: "基于EM_ICP的三维人脸简化点云并行配准算法", 《微型机与应用》 * |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106485737A (en) * | 2015-08-25 | 2017-03-08 | 南京理工大学 | Cloud data based on line feature and the autoregistration fusion method of optical image |
CN106485690A (en) * | 2015-08-25 | 2017-03-08 | 南京理工大学 | Cloud data based on a feature and the autoregistration fusion method of optical image |
CN106097334A (en) * | 2016-06-08 | 2016-11-09 | 北京航空航天大学 | Point cloud registration method based on degree of depth study |
CN106097334B (en) * | 2016-06-08 | 2023-09-12 | 北京航空航天大学 | Point cloud registration method based on deep learning |
US10309770B2 (en) | 2016-09-14 | 2019-06-04 | Hangzhou Scantech Co., Ltd | Three-dimensional sensor system and three-dimensional data acquisition method |
WO2018049843A1 (en) * | 2016-09-14 | 2018-03-22 | 杭州思看科技有限公司 | Three-dimensional sensor system and three-dimensional data acquisition method |
WO2018161662A1 (en) * | 2017-03-08 | 2018-09-13 | 浙江大学 | Method for enhancing three-dimensional sonar point cloud image based on distance statistics |
US11093790B2 (en) | 2017-03-08 | 2021-08-17 | Zhejiang University | Distance statistics based method for 3D sonar point cloud image enhancement |
CN108665491A (en) * | 2018-03-22 | 2018-10-16 | 西安电子科技大学 | A kind of quick point cloud registration method based on local reference |
CN108665491B (en) * | 2018-03-22 | 2022-04-12 | 西安电子科技大学 | Rapid point cloud registration method based on local reference points |
CN110097581A (en) * | 2019-04-28 | 2019-08-06 | 西安交通大学 | Method based on point cloud registering ICP algorithm building K-D tree |
CN110097582A (en) * | 2019-05-16 | 2019-08-06 | 广西师范大学 | A kind of spots cloud optimization registration and real-time display system and working method |
CN110097582B (en) * | 2019-05-16 | 2023-03-31 | 广西师范大学 | Point cloud optimal registration and real-time display system and working method |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104463826A (en) | Novel point cloud parallel Softassign registering algorithm | |
CN105046688B (en) | A kind of many plane automatic identifying methods in three-dimensional point cloud | |
CN114526745B (en) | Drawing construction method and system for tightly coupled laser radar and inertial odometer | |
KR20190082062A (en) | Method and apparatus for determining a matching relationship between point cloud data | |
CN110930495A (en) | Multi-unmanned aerial vehicle cooperation-based ICP point cloud map fusion method, system, device and storage medium | |
CN105654483B (en) | The full-automatic method for registering of three-dimensional point cloud | |
WO2021109775A1 (en) | Methods and devices for generating training sample, training model and recognizing character | |
CN110363054B (en) | Road marking line identification method, device and system | |
CN114387319B (en) | Point cloud registration method, device, equipment and storage medium | |
CN104121902A (en) | Implementation method of indoor robot visual odometer based on Xtion camera | |
CN115512124A (en) | Method and device for determining relocation frame, vehicle and storage medium | |
CN106886980A (en) | A kind of enhanced method of point cloud density based on three-dimensional laser radar target identification | |
CN105224935A (en) | A kind of real-time face key point localization method based on Android platform | |
CN113763549B (en) | Simultaneous positioning and mapping method and device integrating laser radar and IMU and storage medium | |
CN115797418B (en) | Complex mechanical part measurement point cloud registration method and system based on improved ICP | |
CN105678076A (en) | Method and device for point cloud measurement data quality evaluation optimization | |
CN106500594B (en) | Merge the railroad track method for semi-automatically detecting of reflected intensity and geometric properties | |
Zheng et al. | Minimal solvers for 3d geometry from satellite imagery | |
CN110704652A (en) | Vehicle image fine-grained retrieval method and device based on multiple attention mechanism | |
CN105738915A (en) | Three-dimensional radar measuring method and three-dimensional radar measuring device | |
CN106354935B (en) | Complex curved surface parts matching detection method based on electron outside nucleus probability density distribution | |
Lu et al. | A lightweight real-time 3D LiDAR SLAM for autonomous vehicles in large-scale urban environment | |
CN117237643A (en) | Point cloud semantic segmentation method and system | |
CN109785388B (en) | Short-distance accurate relative positioning method based on binocular camera | |
CN114910892A (en) | Laser radar calibration method and device, electronic equipment and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
DD01 | Delivery of document by public notice |
Addressee: Zhenjiang Furen Network Technology Co., Ltd. Document name: Notification of Publication and of Entering the Substantive Examination Stage of the Application for Invention |
|
DD01 | Delivery of document by public notice |
Addressee: Zhenjiang Furen Network Technology Co., Ltd. Document name: the First Notification of an Office Action |
|
WD01 | Invention patent application deemed withdrawn after publication | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150325 |