CN102779345A - Point cloud precise registering method based on gravity center Euclidean distance - Google Patents
Point cloud precise registering method based on gravity center Euclidean distance Download PDFInfo
- Publication number
- CN102779345A CN102779345A CN2012102293811A CN201210229381A CN102779345A CN 102779345 A CN102779345 A CN 102779345A CN 2012102293811 A CN2012102293811 A CN 2012102293811A CN 201210229381 A CN201210229381 A CN 201210229381A CN 102779345 A CN102779345 A CN 102779345A
- Authority
- CN
- China
- Prior art keywords
- euclidean distance
- cloud
- point
- gravity
- center
- 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.)
- Granted
Links
Images
Landscapes
- Image Analysis (AREA)
- Length Measuring Devices With Unspecified Measuring Means (AREA)
- Length Measuring Devices By Optical Means (AREA)
Abstract
The invention discloses a point cloud precise registering method based on a gravity center Euclidean distance. By calculating the gravity center of an effective point set of a point cloud overlaying portion and the Euclidean distance of all points in each point set relative to the gravity center, optimization screening is conducted, and overall identical points are solved. By judging a hazard ball, the stable overall identical points are obtained, conversion parameters among point cloud coordinate systems are obtained, and precise registering of the point cloud of two measuring stations is achieved. The method adopts the gravity center Euclidean distance to register the point cloud, due to the fact that the gravity center Euclidean distance has the characteristics of uniqueness and quantity limit and the like, point cloud registering speed and precision are improved. By judging the hazard ball, an equal Euclidean distance distinguishing problem is solved, and point cloud matching obscureness is avoided. Point gaps are used as error margins for judging identical Euclidean distance, and registering is more precise. By removing error points in the point cloud continuously, a purpose that abnormal value disturbance is not affected is achieved. A step by step process of first rough registering and then precise registering enables point cloud registering to be easy.
Description
Technical field
The present invention relates to fields such as computer graphics, mapping science and reverse Engineering Technology, specially refer to the site cloud registration problems of surveying more, relate in particular to a kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance.
Background technology
Data acquisition phase in that object dimensional is rebuild need use three-dimensional laser scanner that object is carried out comprehensive scanning; But, because the complicacy of object, can not one-off scanning obtain all cloud datas of object; Need substation scanning, this just is faced with the site cloud registration problems of surveying more.The registration of multi-site cloud is exactly all to be surveyed site cloud coordinate systems be planned for the process under the same public coordinate system.The site cloud registrations of surveying can be exchanged into the registration problems in twos between adjacent two stations more, and the method for registering based on a cloud can be divided into two types at present: common point method and ICP algorithm.The common point method requires to have 3 couples of artificial targets or unique point between adjacent two stations at least; Utilize least square method to find the solution conversion parameter, this method precision is high and reliable, but this method needs scanning separately each sign and identification center; The record period carries out registration, is semi-automatic method; ICP (Iterative Closest Point) algorithm is the 20th century famous algorithms that are suggested of the nineties; This algorithm at first supposes to obtain an initial attitude transformation parameter; From a site cloud, choose the point of some, and the neighbor point of in another cloud, choosing these points is as corresponding point, with point to distance minimization be that condition is carried out iterative computation; Till satisfying the condition of convergence, but the ICP algorithm exists in practical application and is subject to that exceptional value is disturbed, arithmetic speed waits deficiency slowly.Therefore how effectively, autoregistration point cloud fast, accurately, be problem demanding prompt solution in the present object dimensional process of reconstruction.
Summary of the invention
Goal of the invention: the purpose of this invention is to provide a kind of efficiently, accurately based on the accurate method for registering of some cloud of center of gravity Euclidean distance.
Technical scheme: in order to realize the foregoing invention purpose, a kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance of the present invention comprises the steps:
(1), obtains definite initial attitude transformation parameter (R based on the discrete point characteristic for reference point clouds P and registration point cloud M
0, t
0), R
0Be rotation parameter, t
0Be translation parameters;
(2) according to initial attitude transformation parameter (R
0, t
0) point among the registration point cloud M all is transformed into carries out thick registration under the P coordinate system, thick registration equation is:
P=R
0M+t
0;
(3) search and the some M that puts among the cloud M in a cloud P
i(i=1,2 ..., m) the some P of correspondence
j(j=1,2 ..., n), based on a P
jWith a M
iEuclidean distance minimum value screening, obtain effective point set (PS, MS);
(4) obtain the center of gravity PS of each effective point set
GAnd MS
G, and each point is concentrated Euclidean distance storehouse PD and the MD of have a few with respect to its center of gravity:
d(PS
i,PS
G)=|PS
i-PS
G|,(i=1,2,…,h),
d(MS
i,MS
G)=|MS
i-MS
G|,(i=1,2,…,h),
In the formula, d (PS
i, PS
G) and d (MS
i, MS
G) represent respectively the Euclidean distance of point set PS and MS mid point i and center of gravity to form Euclidean distance storehouse PD and MD;
(5) i Euclidean distance MD among the pair set MD
i(i=1,2 ..., h) search minimum euclidean distance PD in set PD
j(j=1,2 ..., h), try to achieve the h that satisfies under the certain distance threshold value to same place (MS
i, PS
j), h representes the number of effective point set, perhaps the number of Euclidean distance storehouse PD or MD;
(6) utilize same place (MS
i, PS
j) ask a conversion parameter of cloud coordinate system, carry out the coordinate conversion of a cloud, realize the accurate registration of some cloud.
Said step is worked as PD in (5)
j-MD
iDuring≤2 α, said PD
jWith MD
iBe corresponding Euclidean distance, corresponding (MS
i, PS
j) be same place, if PD
j-MD
i>2 α, description of step (4) effectively point set search contains the error point, rejects i current Euclidean distance MD
iWith a PS
i, getting back to step (4) and search for next Euclidean distance, α representes the dot spacing of a cloud.
The same place that said step (5) is tried to achieve carries out dangerous ball judgement and distinguishes same place: in point set MS or PS, be the centre of sphere with center of gravity o, and a certain Euclidean distance MD
iDraw a spheroid for radius, have individual some q of x (x>=2) on the spheroid
x(x=1,2 ... X) time, be defined as dangerous ball, the same place on the dangerous ball can't be distinguished, and in order to address this problem, from the same place of having obtained, selects two some D
kQ is calculated in (k=1,2)
xWith two some D
kEuclidean distance dq with centre of sphere o
Xy(y=1,2,3), in the space respectively with o and two D
kBe the centre of sphere, with the Euclidean distance dq of correspondence
XyFor radius is made ball, obtain to intersect and unique some q
x, in like manner to the unique definite some q ' of another point set
x, obtain to distinguish same place (q
x, q '
x), thereby realize differentiation to a plurality of same places on the dangerous ball; And then get back to said step (4) iterative computation, up to the same place that obtains no dangerous ball.
Confirm initial attitude transformation parameter (R in the said step (1)
0, t
0) concrete steps be:
Set up transformation equation: P
i=R
0M
i+ t
0, (i=1,2 ..., m), in the formula, P
iFor among the reference point clouds P a bit, M
iFor among the registration point cloud M a bit, R
0Be rotation parameter, t
0Be translation parameters, m for select public count into, m (m>=3) adopts linear least square to find the solution conversion parameter (R
0, t
0), based on some space Euclidean distance error is defined as:
t
0=P
G-R
0M
G,
Wherein,
Be respectively the center of gravity of P and M;
Make R
0'=P-P
G, M
G'=M-M
GBe the point after the center of gravityization, then
Utilize unit quaternion to minimize e and calculate initial transformation parameter (R
0, t
0).
Said step is utilized same place (MS in (6)
i, PS
j) ask a conversion parameter of cloud coordinate system, carry out the coordinate conversion of a cloud, be based on the overall same place (MS that step (5) is tried to achieve
i, PS
j), confirm initial attitude transformation parameter (R in utilization and the step (1)
0, t
0) identical method find the solution conversion parameter between the cloud coordinate system (R t), changes a cloud M then, realizes smart registration:
M"=RM+t,
M in the formula is " for the some cloud after the conversion, under the coordinate of cloud P.After this step, promptly accomplished the smart registration of reference point clouds P and registration point cloud M.
Beneficial effect: this gordian technique of using gravity-center Euclidean distance of the present invention is come the registration point cloud, because the center of gravity Euclidean distance has characteristics such as uniqueness and limited amount property, has improved some cloud registration speed and precision; Judgement through dangerous ball has solved equal Euclidean distance differentiation problem, avoids a cloud coupling fuzzy; As the limits of error of judging Euclidean distance of the same name, make registration more accurate through dot spacing; The present invention reaches the purpose that not disturbed by exceptional value through constantly rejecting the error point in the some cloud; The incremental process of smart registration is more prone to a cloud registration behind the earlier thick registration.
Description of drawings
Fig. 1 is the smart registration process flow diagram of some cloud that the present invention is based on the center of gravity Euclidean distance;
Fig. 2 is the plane figure of the dangerous ball situation of point set MS in the specific embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing the present invention is done explanation further.
As shown in Figure 1, for to given reference point clouds P that certain degree of overlapping is arranged and match point cloud M, a cloud P and M are carried out thick registration according to the initial attitude transformation parameter of obtaining based on the discrete point characteristic; Through the screening point, obtain the effective corresponding point set of consecutive point cloud lap; Obtain the center of gravity and the each point of each effective point set and concentrate the Euclidean distance of have a few with respect to its center of gravity; For confirming the foundation of same place, find the solution overall same place with the Euclidean distance approximately equal; Effective point set center of gravity of double counting and corresponding Euclidean distance, until the overall same place that obtains count stable till.Utilize same place to try to achieve the conversion parameter between a cloud coordinate system, and carry out the coordinate conversion of a cloud, realize that two survey the smart registration of site cloud.
A kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance of the present invention comprises the steps:
S100:, obtain definite initial attitude transformation parameter (R based on the discrete point characteristic for reference point clouds P and registration point cloud M
0, t
0):
Set up transformation equation:
P
i=R
0M
i+t
0,(i=1,2,…,m),
In the formula, P
iFor among the reference point clouds P a bit, M
iFor among the registration point cloud M a bit, R
0Be rotation parameter, t
0Be translation parameters, m for select public count into, m (m>=3) adopts linear least square to find the solution conversion parameter (R
0, t
0), based on some space Euclidean distance error is defined as:
T is asked local derviation,
Draw:
t
0=P
G-R
0M
G,
Wherein,
Be respectively the center of gravity of P and M; Make P ' G=P-PG, M ' G=M-MG
Be the point after the center of gravityization, then
Utilize unit quaternion to minimize e and calculate initial transformation parameter (R
0, t
0).
S200: according to initial attitude transformation parameter (R
0, t
0) point among the registration point cloud M all is transformed into carries out thick registration under the P coordinate system, thick registration equation is:
P=R
0M+t
0;
S300: search and the some M that puts among the cloud M in a cloud P
i(i=1,2 ..., m) the some P of correspondence
j(j=1,2 ..., n), calculate each point and some M among the P
iEuclidean distance:
d(M
i,P
j)=|P
j-M
i|,
In the formula, d (M
i, P
j) be a some P
jWith a M
iEuclidean distance, search for the minimum value of all Euclidean distances then:
d
min(M
i,P
k)=Min(d(M
i,P
j)),(j=1,2,…,n)
If d
Min(M
i, P
k) less than a threshold value and M
iAnd P
kThe method vector approaching, show that then some cloud P exists and a M
iCorresponding point, retention point M
i, if minor increment or method vector do not meet the demands, retention point M not then
iOther point among the double counting point cloud M is removed ineligible point, form at last effective point set (PS, MS).
S400: the center of gravity PS that obtains each effective point set
GAnd MS
G, and each point is concentrated Euclidean distance storehouse PD and the MD of have a few with respect to its center of gravity:
d(PS
i,PS
G)=|PS
i-PS
G|,(i=1,2,…,h),
d(MS
i,MS
G)=|MS
i-MS
G|,(i=1,2,…,h),
In the formula, PS
GAnd MS
GBe respectively the center of gravity of point set PS and MS, d (PS
i, PS
G) and d (MS
i, MS
G) represent respectively the Euclidean distance of point set PS and MS mid point i and center of gravity to form Euclidean distance storehouse PD and MD;
S500: this step obtains effective point set through calculating the minimum Eustachian distance row filter of going forward side by side.
I Euclidean distance MD among the pair set MD
i(i=1,2 ... H, search minimum euclidean distance PD in set PD
j(j=1,2 ..., h tries to achieve the h that satisfies under the certain distance threshold value to same place (MS
i, PS
j), h representes the number of effective point set, perhaps the number of Euclidean distance storehouse PD or MD.
The certain distance threshold value here i.e. 2 α, and α representes the dot spacing of a cloud, when such, and said PD
jWith MD
iBe corresponding Euclidean distance, corresponding (MS
i, PS
j) be same place, if PD
j-MD
i>2 α, the effective point set search of description of step S400 contains the error point, rejects i current Euclidean distance MD
i, get back to step S400 and search for next Euclidean distance.
S600: in order to solve the problem that equates that Euclidean distance can't be distinguished, avoid a cloud coupling fuzzy, the same place that step S500 is tried to achieve carries out dangerous ball judgement, in point set MS or PS, is the centre of sphere with center of gravity o, a certain Euclidean distance MD
iDraw a spheroid for radius, have individual some q of x (x>=2) on the spheroid
x(x=1,2 ... X) time, be defined as dangerous ball, the same place on the dangerous ball can't be distinguished.
Please refer to Fig. 2, is example with point set MS here, (x>=2) the individual some q that suppose that x is arranged among the MS
x(x=1,2 ..., x) drop on the dangerous ball, from the same place of having obtained, select two same place D
1And D
2And, calculate q then as pseudo-center of gravity
xEuclidean distance with two pseudo-centers of gravity and centre of sphere o:
In the space respectively with o and D
1, D
2Be the centre of sphere, with
For radius is made 3 balls, three balls intersect unique intersection point q
x
In like manner, in point set PS, carrying out similar operation can uniquely confirm and q
xCorresponding some q '
x, obtain same place (q
x, q '
x), distinguished a plurality of points on the dangerous ball.
And then get back to said step S400 iterative computation, up to the same place that obtains no dangerous ball.
S700: utilize same place (MS
i, PS
j) ask a conversion parameter of cloud coordinate system, carry out the coordinate conversion of a cloud, realize the accurate registration of some cloud.
Overall same place (the MS that tries to achieve based on S600
i, PS
j), confirm initial attitude transformation parameter (R among utilization and the S100
0, t
0) identical method find the solution conversion parameter between the cloud coordinate system (R t), changes a cloud M then, realizes smart registration:
M"=RM+t
M in the formula is " for the some cloud after the conversion, under the coordinate of cloud P.After this step, promptly accomplished the smart registration of reference point clouds P and registration point cloud M.
The above only is a preferred implementation of the present invention; Be noted that for those skilled in the art; Under the prerequisite that does not break away from the principle of the invention, can also make some improvement and retouching, these improvement and retouching also should be regarded as protection scope of the present invention.
Claims (4)
1. the accurate method for registering of some cloud based on the center of gravity Euclidean distance is characterized in that comprising the steps:
(1), obtains definite initial attitude transformation parameter (R based on the discrete point characteristic for reference point clouds P and registration point cloud M
0, t
0), R
0Be rotation parameter, t
0Be translation parameters;
(2) according to initial attitude transformation parameter (R
0, t
0) point among the registration point cloud M all is transformed into carries out thick registration under the P coordinate system, thick registration equation is:
P=R
0M+t
0;
(3) search and the some M that puts among the cloud M in a cloud P
i(i=1,2 ..., m) the some P of correspondence
j(j=1,2 ..., n), based on a P
jWith a M
iEuclidean distance minimum value screening, obtain effective point set (PS, MS);
(4) obtain the center of gravity PS of each effective point set
GAnd MS
G, and each point is concentrated Euclidean distance storehouse PD and the MD of have a few with respect to its center of gravity:
d(PS
i,PS
G)=|PS
i-PS
G|,(i=1,2,…,h),
d(MS
i,MS
G)=|MS
i-MS
G|,(i=1,2,…,h),
In the formula, d (PS
i, PS
G) and d (MS
i, MS
G) represent respectively the Euclidean distance of point set PS and MS mid point i and center of gravity to form Euclidean distance storehouse PD and MD;
(5) i Euclidean distance MD among the pair set MD
i(i=1,2 ..., h) search minimum euclidean distance PD in set PD
j(j=1,2 ..., h), try to achieve the h that satisfies under the certain distance threshold value to same place (MS
i, PS
j), h representes the number of effective point set, perhaps the number of Euclidean distance storehouse PD or MD;
(6) utilize same place (MS
i, PS
j) ask a conversion parameter of cloud coordinate system, carry out the coordinate conversion of a cloud, realize the accurate registration of some cloud.
2. a kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance according to claim 1, it is characterized in that: said step is worked as PD in (5)
j-MD
iDuring≤2 α, said PD
jWith MD
iBe corresponding Euclidean distance, corresponding (MS
i, PS
j) be same place, if PD
j-MD
i>2 α reject i current Euclidean distance MD
iWith a PS
i, getting back to step (4) and search for next Euclidean distance, α representes the dot spacing of a cloud.
3. a kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance according to claim 1 and 2 is characterized in that: the same place that said step (5) is tried to achieve carries out dangerous ball judgement and distinguishes same place:
In point set MS or PS, be the centre of sphere with center of gravity o, a certain Euclidean distance MD
iDraw a spheroid for radius, have individual some q of x (x>=2) on the spheroid
x(x=1,2 ... During x, be defined as dangerous ball; From the same place of having obtained, select two some D
k(k=1,2, calculate q
xWith two same place D
kEuclidean distance dq with centre of sphere o
Xy(y=1,2,3), in the space respectively with o and two D
kBe the centre of sphere, with the Euclidean distance dq of correspondence
XyFor radius is made ball, obtain to intersect and unique some q
x, in like manner to the unique definite some q ' of another point set
x, obtain to distinguish same place (q
x, q '
x);
Return said step (4) iterative computation, up to the same place that obtains no dangerous ball.
4. a kind of accurate method for registering of some cloud based on the center of gravity Euclidean distance according to claim 1 is characterized in that: confirm initial attitude transformation parameter (R in the said step (1)
0, t
0) concrete steps be:
Set up transformation equation: P
i=R
0M
i+ t
0, (i=1,2 ..., m),
In the formula, P
iFor among the reference point clouds P a bit, M
iFor among the registration point cloud M a bit, R
0Be rotation parameter, t
0Be translation parameters, m does, m (m>=3) for public the counting of selecting,
Adopt linear least square to find the solution conversion parameter (R
0, t
0), based on some space Euclidean distance error is defined as:
t
0=P
G-R
0M
G,
Wherein,
Be respectively the center of gravity of P and M;
Make P
G'=P-P
G, M
G'=M-M
GBe the point after the center of gravityization, then
Utilize unit quaternion to minimize e and calculate initial transformation parameter (R
0, t
0).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210229381.1A CN102779345B (en) | 2012-07-03 | 2012-07-03 | A kind of some cloud Precision Registration based on center of gravity Euclidean distance |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210229381.1A CN102779345B (en) | 2012-07-03 | 2012-07-03 | A kind of some cloud Precision Registration based on center of gravity Euclidean distance |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102779345A true CN102779345A (en) | 2012-11-14 |
CN102779345B CN102779345B (en) | 2015-09-16 |
Family
ID=47124254
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210229381.1A Expired - Fee Related CN102779345B (en) | 2012-07-03 | 2012-07-03 | A kind of some cloud Precision Registration based on center of gravity Euclidean distance |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102779345B (en) |
Cited By (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103020960A (en) * | 2012-11-26 | 2013-04-03 | 北京理工大学 | Point cloud registration method based on convex hull invariance |
CN103150747A (en) * | 2012-11-16 | 2013-06-12 | 佳都新太科技股份有限公司 | Point cloud registration algorithm based on topological characteristic |
CN103426165A (en) * | 2013-06-28 | 2013-12-04 | 吴立新 | Precise registration method of ground laser-point clouds and unmanned aerial vehicle image reconstruction point clouds |
CN103559689A (en) * | 2013-11-01 | 2014-02-05 | 浙江工业大学 | Removal method for point cloud noise points |
CN104463894A (en) * | 2014-12-26 | 2015-03-25 | 山东理工大学 | Overall registering method for global optimization of multi-view three-dimensional laser point clouds |
CN105469388A (en) * | 2015-11-16 | 2016-04-06 | 集美大学 | Building point cloud registration algorithm based on dimension reduction |
CN106709943A (en) * | 2017-01-12 | 2017-05-24 | 重庆邮电大学 | Point cloud registration method based on optimal transmission |
CN107146241A (en) * | 2017-04-20 | 2017-09-08 | 西安交通大学 | A kind of point cloud registration method based on differential evolution algorithm and TrimmedICP algorithms |
CN107330929A (en) * | 2017-06-08 | 2017-11-07 | 三峡大学 | A kind of multiple dimensioned point cloud registration method based on geometric center of gravity and centroid distance than consistency |
CN108564605A (en) * | 2018-04-09 | 2018-09-21 | 大连理工大学 | A kind of three-dimensional measurement spots cloud optimization method for registering |
CN109147030A (en) * | 2018-07-05 | 2019-01-04 | 厦门大学 | Indoor and outdoor scene based on line feature combines modeling method |
CN109141431A (en) * | 2018-09-07 | 2019-01-04 | 北京数字绿土科技有限公司 | Air strips matching process, device, electronic equipment and readable storage medium storing program for executing |
CN109285184A (en) * | 2018-08-29 | 2019-01-29 | 三峡大学 | Three-dimensional point cloud initial registration algorithm based on center of gravity and centroid transformation |
CN110227876A (en) * | 2019-07-15 | 2019-09-13 | 西华大学 | Robot welding autonomous path planning method based on 3D point cloud data |
CN110264502A (en) * | 2019-05-17 | 2019-09-20 | 华为技术有限公司 | Point cloud registration method and device |
CN112132971A (en) * | 2020-09-08 | 2020-12-25 | 合肥的卢深视科技有限公司 | Three-dimensional human body modeling method, device, electronic equipment and storage medium |
CN113192114A (en) * | 2021-07-01 | 2021-07-30 | 四川大学 | Blade multi-field point cloud registration method based on overlapping features and local distance constraint |
CN115641404A (en) * | 2022-05-07 | 2023-01-24 | 泰瑞数创科技(北京)股份有限公司 | Mobile rapid modeling system based on live-action three-dimensional modeling technology |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090027412A1 (en) * | 2007-07-23 | 2009-01-29 | Disney Enterprises, Inc. | Three-dimensional location-based texture transfers |
CN101887525A (en) * | 2010-07-09 | 2010-11-17 | 北京师范大学 | Grading-based positive and inverse reversing three-dimensional dense point set rapid registering method |
CN102169579A (en) * | 2011-03-31 | 2011-08-31 | 西北工业大学 | Rapid and accurate registration method of dense point cloud model |
-
2012
- 2012-07-03 CN CN201210229381.1A patent/CN102779345B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090027412A1 (en) * | 2007-07-23 | 2009-01-29 | Disney Enterprises, Inc. | Three-dimensional location-based texture transfers |
CN101887525A (en) * | 2010-07-09 | 2010-11-17 | 北京师范大学 | Grading-based positive and inverse reversing three-dimensional dense point set rapid registering method |
CN102169579A (en) * | 2011-03-31 | 2011-08-31 | 西北工业大学 | Rapid and accurate registration method of dense point cloud model |
Non-Patent Citations (3)
Title |
---|
WEI XIN等: "An Improved ICP Algorithm for Point Cloud Registration", 《INTERNATIONAL CONFERENCE ON COMPUTATIONAL AND INFORMATION SCIENCE(ICCIS),2010》, 19 December 2010 (2010-12-19), pages 565 - 568, XP031900989, DOI: doi:10.1109/ICCIS.2010.144 * |
张梅等: "基于欧氏距离测度的激光点云配准", 《测绘科学》, vol. 35, no. 3, 31 May 2010 (2010-05-31), pages 5 - 8 * |
张蕾等: "约束改进的ICP点云配准方法", 《计算机工程与应用》, vol. 48, no. 18, 29 July 2011 (2011-07-29), pages 197 - 200 * |
Cited By (31)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103150747A (en) * | 2012-11-16 | 2013-06-12 | 佳都新太科技股份有限公司 | Point cloud registration algorithm based on topological characteristic |
CN103020960A (en) * | 2012-11-26 | 2013-04-03 | 北京理工大学 | Point cloud registration method based on convex hull invariance |
CN103426165A (en) * | 2013-06-28 | 2013-12-04 | 吴立新 | Precise registration method of ground laser-point clouds and unmanned aerial vehicle image reconstruction point clouds |
CN103559689A (en) * | 2013-11-01 | 2014-02-05 | 浙江工业大学 | Removal method for point cloud noise points |
CN104463894A (en) * | 2014-12-26 | 2015-03-25 | 山东理工大学 | Overall registering method for global optimization of multi-view three-dimensional laser point clouds |
CN104463894B (en) * | 2014-12-26 | 2020-03-24 | 山东理工大学 | Multi-view three-dimensional laser point cloud global optimization integral registration method |
CN105469388B (en) * | 2015-11-16 | 2019-03-15 | 集美大学 | Building point cloud registration method based on dimensionality reduction |
CN105469388A (en) * | 2015-11-16 | 2016-04-06 | 集美大学 | Building point cloud registration algorithm based on dimension reduction |
CN106709943A (en) * | 2017-01-12 | 2017-05-24 | 重庆邮电大学 | Point cloud registration method based on optimal transmission |
CN106709943B (en) * | 2017-01-12 | 2019-09-24 | 重庆邮电大学 | A kind of point cloud registration method based on optimal transmission |
CN107146241B (en) * | 2017-04-20 | 2019-04-16 | 西安交通大学 | A kind of point cloud registration method based on differential evolution algorithm and TrimmedICP algorithm |
CN107146241A (en) * | 2017-04-20 | 2017-09-08 | 西安交通大学 | A kind of point cloud registration method based on differential evolution algorithm and TrimmedICP algorithms |
CN107330929A (en) * | 2017-06-08 | 2017-11-07 | 三峡大学 | A kind of multiple dimensioned point cloud registration method based on geometric center of gravity and centroid distance than consistency |
CN107330929B (en) * | 2017-06-08 | 2019-11-08 | 三峡大学 | A kind of multiple dimensioned point cloud registration method based on geometric center of gravity and centroid distance than invariance |
CN108564605A (en) * | 2018-04-09 | 2018-09-21 | 大连理工大学 | A kind of three-dimensional measurement spots cloud optimization method for registering |
CN108564605B (en) * | 2018-04-09 | 2020-04-07 | 大连理工大学 | Three-dimensional measurement point cloud optimization registration method |
CN109147030B (en) * | 2018-07-05 | 2020-06-30 | 厦门大学 | Indoor and outdoor scene joint modeling method based on line characteristics |
CN109147030A (en) * | 2018-07-05 | 2019-01-04 | 厦门大学 | Indoor and outdoor scene based on line feature combines modeling method |
CN109285184A (en) * | 2018-08-29 | 2019-01-29 | 三峡大学 | Three-dimensional point cloud initial registration algorithm based on center of gravity and centroid transformation |
CN109285184B (en) * | 2018-08-29 | 2021-09-10 | 三峡大学 | Three-dimensional point cloud initial registration algorithm based on barycenter and centroid transformation |
CN109141431A (en) * | 2018-09-07 | 2019-01-04 | 北京数字绿土科技有限公司 | Air strips matching process, device, electronic equipment and readable storage medium storing program for executing |
CN110264502A (en) * | 2019-05-17 | 2019-09-20 | 华为技术有限公司 | Point cloud registration method and device |
CN110264502B (en) * | 2019-05-17 | 2021-05-18 | 华为技术有限公司 | Point cloud registration method and device |
CN110227876B (en) * | 2019-07-15 | 2021-04-20 | 西华大学 | Robot welding path autonomous planning method based on 3D point cloud data |
CN110227876A (en) * | 2019-07-15 | 2019-09-13 | 西华大学 | Robot welding autonomous path planning method based on 3D point cloud data |
CN112132971A (en) * | 2020-09-08 | 2020-12-25 | 合肥的卢深视科技有限公司 | Three-dimensional human body modeling method, device, electronic equipment and storage medium |
CN112132971B (en) * | 2020-09-08 | 2024-04-23 | 合肥的卢深视科技有限公司 | Three-dimensional human modeling method, three-dimensional human modeling device, electronic equipment and storage medium |
CN113192114A (en) * | 2021-07-01 | 2021-07-30 | 四川大学 | Blade multi-field point cloud registration method based on overlapping features and local distance constraint |
CN113192114B (en) * | 2021-07-01 | 2021-09-03 | 四川大学 | Blade multi-field point cloud registration method based on overlapping features and local distance constraint |
CN115641404A (en) * | 2022-05-07 | 2023-01-24 | 泰瑞数创科技(北京)股份有限公司 | Mobile rapid modeling system based on live-action three-dimensional modeling technology |
CN115641404B (en) * | 2022-05-07 | 2023-09-05 | 泰瑞数创科技(北京)股份有限公司 | Mobile rapid modeling system based on live-action three-dimensional modeling technology |
Also Published As
Publication number | Publication date |
---|---|
CN102779345B (en) | 2015-09-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN102779345A (en) | Point cloud precise registering method based on gravity center Euclidean distance | |
CN101936761B (en) | Visual measuring method of stockpile in large-scale stock ground | |
CN104656097B (en) | Caliberating device based on rotary two-dimensional laser three-dimensional reconfiguration system and method | |
CN104729485B (en) | A kind of vision positioning method based on vehicle-mounted panoramic image Yu streetscape map match | |
CN102607459A (en) | Splicing method and splicing device of Lidar measurement data | |
CN102930525B (en) | Line matching method based on affine invariant feature and homography | |
CN105160702A (en) | Stereoscopic image dense matching method and system based on LiDAR point cloud assistance | |
CN105184801A (en) | Optical and SAR image high-precision registration method based on multilevel strategy | |
CN103295239A (en) | Laser-point cloud data automatic registration method based on plane base images | |
CN103236064A (en) | Point cloud automatic registration method based on normal vector | |
CN102779231B (en) | Based on contiguous coordinate transformation parameter computing method | |
CN104078446A (en) | Bonding alignment mark and method for calculating offset | |
CN103646156A (en) | Ball target detection-based automatic registration method for laser point cloud data | |
CN102446354A (en) | Integral registration method of high-precision multisource ground laser point clouds | |
CN107238374B (en) | A kind of classification of concave plane part and recognition positioning method | |
CN103761739A (en) | Image registration method based on half energy optimization | |
CN107818598A (en) | A kind of three-dimensional point cloud map amalgamation method of view-based access control model correction | |
CN104134216A (en) | Laser point cloud auto-registration method and system based on 16-dimension feature description | |
CN105184786A (en) | Floating-point-based triangle characteristic description method | |
CN110375712A (en) | Drift section extracting method, device, equipment and storage medium | |
CN104077769A (en) | Error matching point pair removing algorithm in image registration | |
CN105004337A (en) | Straight line matching based autonomous navigation method for agricultural unmanned aerial vehicle | |
CN104569911A (en) | OBU positioning method, RSU and ETC system | |
CN105427177A (en) | Automatic farmland four-boundary calculation method based on GIS (Geographic Information System) | |
CN102289561A (en) | 3D (three-dimensional) and 2D (two-dimensional) radar three-threshold real-time track association algorithm in case of system deviation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150916 Termination date: 20180703 |