CN102062860A - Foundation laser radar data registration method based on single tree position and surface information - Google Patents

Foundation laser radar data registration method based on single tree position and surface information Download PDF

Info

Publication number
CN102062860A
CN102062860A CN2009102377622A CN200910237762A CN102062860A CN 102062860 A CN102062860 A CN 102062860A CN 2009102377622 A CN2009102377622 A CN 2009102377622A CN 200910237762 A CN200910237762 A CN 200910237762A CN 102062860 A CN102062860 A CN 102062860A
Authority
CN
China
Prior art keywords
registration
data
trunk
mrow
mtd
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
Application number
CN2009102377622A
Other languages
Chinese (zh)
Inventor
倪文俭
过志锋
孙国清
黄华兵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Remote Sensing Applications of CAS
Original Assignee
Institute of Remote Sensing Applications of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Institute of Remote Sensing Applications of CAS filed Critical Institute of Remote Sensing Applications of CAS
Priority to CN2009102377622A priority Critical patent/CN102062860A/en
Publication of CN102062860A publication Critical patent/CN102062860A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Radar Systems Or Details Thereof (AREA)

Abstract

The invention relates to an automatic registration method between multi-station foundation laser radar data based on single tree position and surface information and is mainly applied to the three-dimensional forest scene reconstruction based on multi-station foundation laser radar data. By the automatic registration method between multi-station foundation laser radar data, in the automatic alignment process, an additive foundation laser radar posture measuring device is used, the number of registration parameters required by registration need to be determined to reduce the number of control points required by registration. Simultaneously the similarity of a triangle formed by a plurality of single trees is utilized to recognize the homonymy single trees automatically, and control points are provided for the registration. By the automatic registration method between multi-station foundation laser radar data based on single tree position and surface information, the accuracy requirements and dependence for the control points in the registration process can be reduced, and the automatic registration of the multi-station foundation laser radar data under a forest environment can be realized.

Description

Foundation laser radar data registration method based on single-tree position and surface information
Technical Field
The invention relates to an automatic registration method between ground-based laser radar data based on single-tree position and earth surface information, in particular to automatic registration between multi-station ground-based laser radar data in a forest scene, which is mainly applied to three-dimensional forest scene reconstruction based on the multi-station ground-based laser radar data.
Background
Ground-based lidar data has been applied gradually to detailed measurements of structural parameters of singles, including the location and size of singles (Hopkinson et al 2004; Henning and radke 2006). The spatial distribution of forest canopy components is primarily considered on the forest stand scale (Henning and Radtke 2006). Due to the shielding between the single trees, it is difficult to accurately describe the forest using the ground-based lidar data at the forest stand level using single-station data. Multi-station data is used, which requires registration of the multi-station data. In the process of three-dimensional reconstruction of archaeology and buildings, the feature points can be used for registration because the study object has specific corner points and other features. Forests are different from artificial buildings in that there are no specific characteristic points available for direct use. Researchers have therefore attempted to place artificial targets in forest scenes as control points for registration. In addition, some methods for automatic registration without using artificial targets have been reported so far. Most of these methods are directed to artificial objects, such as buildings or industrial components. It is common practice to select homonymous points or homonymous surfaces in a common area of the two station data, whereby the registration parameters are calculated (Goshtasby 1998). The most well known algorithm at present is the Iterative Closest Point algorithm (ICP) proposed by Besl and McKay (Besl and McKay 1992). Although many researchers have improved on the limitations of this algorithm (Gendron et al 1998; Goshtasby 1998; Dalley and Flynn 2002; Estepar et al 2004; Kim et al 2004; Chetverikov et al 2005), this algorithm requires a large overlap between the two stations of data to be registered, often requiring an overlap of more than 50%, and only one object or plane of interest within the overlap region, and a high dot density (Estepar et al 2004; Kim et al 2004; Chetverikov et al 2005). These requirements are not met under forest conditions.
Henning and Radtke proposed a registration method for forest scenes (Henning and Radtke 2008). The method divides the registration process into two steps, firstly selects control points through the ground to carry out coarse registration of data, and then selects more accurate control points from a trunk to carry out fine registration. Although the method has obvious surface characteristics, the density of forest stands is lower, and the method is more applicable when the vegetation is less under the forest; under the condition that the surface features are unknown, the single wood is surrounded by dead branches, and when the shielding is serious, the control points required by the registration are difficult to select, so that the success rate is greatly reduced.
Disclosure of Invention
The key of the multi-station foundation laser radar data registration lies in the selection of control points, while under the forest scene condition, the accurate control points are difficult to select, and the existing data registration algorithm under the forest scene usually requires that a ground table and a trunk have obvious characteristic points for utilization.
The invention mainly solves the problem of reducing the requirement and the degree of dependence of a registration process on the precision of a control point. According to the invention, the number of registration parameters required to be determined for registration is reduced by adding the ground-based laser radar attitude measurement device, so that the number of control points required for registration is reduced, meanwhile, homonymous trees are automatically identified by utilizing the similarity of triangles formed by a plurality of single trees, control points are provided for registration, and the coincidence of the positions of the single trees and the ground surface in a repeated area is used as the basis for calculating the registration parameters, so that the dependence on accurate control points is reduced.
The present invention can be realized by the following scheme.
An automatic registration method for multi-station foundation laser radar data uses an additional foundation laser radar attitude measurement device in the automatic alignment process, and reduces the number of registration parameters required to be determined by registration so as to reduce the number of control points required by registration.
In the above scheme, preferably, the attitude of the instrument may be measured along the X and Y axes of the ground-based lidar using the tilt sensor.
Preferably, the automatic registration method can be used for automatic registration of forest scenes, and the identification of the trunk point cloud can be performed by using a vertical filtering method.
Preferably, in the alignment process, the central position of the trunk is used as a control point, the two stations of data to be registered are called primary data and secondary data, and the corresponding trunk is found in the primary data and the secondary data through the following three steps:
step 1, separating ground points and vegetation points by using a variable scale method;
step 2, respectively carrying out vertical filtering on the main data and the auxiliary data to extract trunk point clouds and calculate the central coordinates of the trunk;
and 3, identifying the corresponding trunk by using the rule that the triangle formed by the corresponding trunk in the main data and the triangle formed by the corresponding trunk in the auxiliary data have similar properties.
Preferably, the identification of the trunk is carried out by utilizing the point cloud of a section of space above the ground surface and below the canopy, and the branch and ground planting noise in the section of space is removed by utilizing the difference between the vertical distribution characteristics of the point cloud of the section of space and the point cloud of the trunk.
In the above scheme, preferably, the automatic registration method may be used for automatic registration of a forest scene, two stations of data to be registered may be referred to as primary data and secondary data, and the same trunk in the primary data and the secondary data may be identified by using similarity of triangles formed by singles.
Preferably, the automatic registration method is used for automatic registration of a forest scene and uses 4 registration parameters; 3 of them are calculated using the same trunk and the 4 th registration parameter is calculated using the surface.
Preferably, the laser radar data is firstly separated from the vegetation points by adopting a variable scale method, then the positions of the singles are identified through vertical filtering, the singles with the same name are automatically identified by utilizing the relative positions of the singles, and the singles with the same name are used as control points to obtain 3 registration parameters; and finally, determining the offset of the two stations of data in the vertical direction according to the optimal matching of the earth surface, and solving a 4 th registration parameter.
An automatic registration method among multi-station foundation laser radar data is used for automatic registration of a forest scene, an additional foundation laser radar attitude measuring device is used in the automatic alignment process, the number of registration parameters required to be determined for registration is reduced, and therefore 4 registration parameters are used, and the number of control points required for registration is reduced; separating the earth surface points from the vegetation points by a scale-variable method; identifying the trunk point cloud by using a vertical filtering method; identifying the same trunk in the main data and the auxiliary data by utilizing the similarity of triangles formed by single trees; 3 of the 4 registration parameters are calculated using the same trunk, the last of the 4 registration parameters being calculated using the surface.
The method can reduce the dependence of the registration process on the control point, and realize the automatic registration of the multi-station foundation laser radar data in the forest environment.
Drawings
FIG. 1 shows the relative position relationship between the O-X ' Y ' Z ' coordinate system and the O-XYZ coordinate system according to the present invention.
Fig. 2 shows a schematic diagram of the gamma' solution of the present invention.
Fig. 3 shows the relationship between the coordinate systems used for the primary and secondary data of the present invention.
Detailed Description
Exemplary embodiments for implementing the present invention will be described in detail below with reference to the accompanying drawings.
According to the data registration principle, 6 parameters are required to be determined in the registration process, the inclination angle sensor is used for measuring the attitude of the instrument along the X axis and the Y axis of the foundation laser radar, so that the number of the parameters required to be determined is 4, and the XOY plane can be rotated to the horizontal plane by using the measured attitude parameters. The method comprises the steps of firstly separating ground points from vegetation points by adopting a variable-scale method for laser radar data, then identifying the positions of the singles through vertical filtering, automatically identifying the singles with the same name by utilizing the relative positions of the singles, taking the singles with the same name as control points, obtaining 3 parameters of the singles, and finally determining the offset of the data of the two stations in the vertical direction according to the optimal matching of the ground surface.
The present invention is described in detail below.
Let the coordinate System (SOCS) used by the instrument to collect data be O-X ' Y ' Z ', and the corresponding coordinate System when the XOY plane is horizontal be O-XYZ, as shown in FIG. 1. Wherein OX is the projection of OX 'on a horizontal plane, OY is perpendicular to OX and points to OY' hemisphere space, and OZ is perpendicular to OX and OY and points upwards. OG and OF are respectively the projection OF OX 'and OY' in an XOY plane, alpha is the included angle between OX 'and OG, beta is the included angle between OY' and OF, and gamma is the included angle between OG and OF.
The unit coordinate vector of O-X ' Y ' Z ' is
Figure B2009102377622D0000061
The unit coordinate vector of O-XYZ is
Figure B2009102377622D0000062
The conversion relationship between them can be expressed as:
<math><mrow><msup><mover><mi>x</mi><mo>^</mo></mover><mo>&prime;</mo></msup><mo>=</mo><mi>cos</mi><mi>&alpha;</mi><mover><mi>x</mi><mo>^</mo></mover><mo>+</mo><mi>sin</mi><mi>&alpha;</mi><mover><mi>z</mi><mo>^</mo></mover></mrow></math>
<math><mrow><msup><mover><mi>y</mi><mo>^</mo></mover><mo>&prime;</mo></msup><mo>=</mo><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>cos</mi><mi>&gamma;</mi><mo>&prime;</mo><mover><mi>x</mi><mo>^</mo></mover><mo>+</mo><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>sin</mi><mi>&gamma;</mi><mo>&prime;</mo><mover><mi>y</mi><mo>^</mo></mover><mo>+</mo><mi>sin</mi><mi>&beta;</mi><mover><mi>z</mi><mo>^</mo></mover></mrow></math>
<math><mrow><mrow><msup><mover><mi>z</mi><mo>^</mo></mover><mo>&prime;</mo></msup><mo>=</mo><msub><mover><mi>x</mi><mo>^</mo></mover><mi>s</mi></msub><mo>&times;</mo><msub><mover><mi>y</mi><mo>^</mo></mover><mi>s</mi></msub><mo>=</mo><mo>-</mo><mi>sin</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>sin</mi><mi>&gamma;</mi><mo>&prime;</mo><mover><mi>x</mi><mo>^</mo></mover><mo>+</mo><mo>[</mo><mi>sin</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>cos</mi><mi>&gamma;</mi><mo>&prime;</mo><mo>-</mo><mi>cos</mi><mi></mi><mi>&alpha;</mi><mi>sin</mi><mi>&beta;</mi><mo>]</mo></mrow><mover><mi>y</mi><mo>^</mo></mover><mo>+</mo><mi>cos</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi>&beta;&gamma;</mi><mo>&prime;</mo><mover><mi>z</mi><mo>^</mo></mover><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><munder><mn>1</mn><mo>&OverBar;</mo></munder><mo>)</mo></mrow></mrow></math>
in matrix form, can be expressed as:
<math><mrow><mfenced open='[' close=']'><mtable><mtr><mtd><msup><mover><mi>x</mi><mo>^</mo></mover><mo>&prime;</mo></msup></mtd></mtr><mtr><mtd><msup><mover><mi>y</mi><mo>^</mo></mover><mo>&prime;</mo></msup></mtd></mtr><mtr><mtd><msup><mover><mi>z</mi><mo>^</mo></mover><mo>&prime;</mo></msup></mtd></mtr></mtable></mfenced><mo>=</mo><mi>M</mi><mfenced open='[' close=']'><mtable><mtr><mtd><mover><mi>x</mi><mo>^</mo></mover></mtd></mtr><mtr><mtd><mover><mi>y</mi><mo>^</mo></mover></mtd></mtr><mtr><mtd><mover><mi>z</mi><mo>^</mo></mover></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow></mrow></math>
<math><mrow><mi>whereM</mi><mo>=</mo><mfenced open='[' close=']'><mtable><mtr><mtd><mi>cos</mi><mi>&alpha;</mi></mtd><mtd><mn>0</mn></mtd><mtd><mi>sin</mi><mi>&alpha;</mi></mtd></mtr><mtr><mtd><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>cos</mi><mi>&gamma;</mi><mo>&prime;</mo></mtd><mtd><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>sin</mi><mi>&gamma;</mi><mo>&prime;</mo></mtd><mtd><mi>sin</mi><mi>&beta;</mi></mtd></mtr><mtr><mtd><mo>-</mo><mi>sin</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>sin</mi><mi>&gamma;</mi><mo>&prime;</mo></mtd><mtd><mi>sin</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>cos</mi><mi>&gamma;</mi><mo>&prime;</mo><mo>-</mo><mi>cos</mi><mi></mi><mi>&alpha;</mi><mi>sin</mi><mi>&beta;</mi></mtd><mtd><mi>cos</mi><mi></mi><mi>&alpha;</mi><mi>cos</mi><mi></mi><mi>&beta;</mi><mi>sin</mi><mi>&gamma;</mi><mo>&prime;</mo></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow></mrow></math>
as shown in fig. 2, the plane XOY in fig. 1 is designated as H, and the planes GOX 'and FOY' are designated as P and Q, respectively. Passing any point C on OX ' as CE// GO (namely, CE is parallel to GO), passing E as ED// OF, wherein ED and OY ' are intersected at a point D, angle COG is alpha, angle DOF is beta, and angle FOG is gamma '. γ' can be calculated by:
<math><mrow><mi>cos</mi><mi>&gamma;</mi><mo>&prime;</mo><mo>=</mo><mfrac><mrow><mi>G</mi><msup><mi>O</mi><mn>2</mn></msup><mo>+</mo><mi>F</mi><msup><mi>O</mi><mn>2</mn></msup><mo>-</mo><mi>G</mi><msup><mi>F</mi><mn>2</mn></msup></mrow><mrow><mn>2</mn><mi>GO</mi><mo>&CenterDot;</mo><mi>FO</mi></mrow></mfrac><mo>=</mo><mo>-</mo><mi>tan</mi><mi></mi><mi>&alpha;</mi><mi>tan</mi><mi>&beta;</mi><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>4</mn><mo>)</mo></mrow></mrow></math>
wherein,
FO=EO/tanβ,
GF2=CO2+DO2=(GO/cosα)2+(EO/sinβ)2
EO=GO·tanα
as can be seen from equations (1) - (4), the O-X 'Y' Z 'coordinate system can be converted to the O-XYZ coordinate system as long as α and β are known, so that prior to inter-station data registration, the coordinate system O-X' Y 'Z' is first transformed to O-XYZ using the respective α and β angles, respectively, and then registration is performed.
For convenience of description, the two stations of data to be registered are referred to as primary data and secondary data, and the registration process is to find the registration parameters of the coordinate system used by the secondary data transformed to the coordinate system used by the primary data. Let the coordinate system of the main data be Om-XmYmZmThe coordinate system used for the side data is Os-XsYsZsAs shown in FIG. 3, H is a horizontal plane and γ is OmYmAnd OsYsAngle between Δ x and Δ y, between the two systemsAlong OmXmAnd OmYmTranslation vector of (1), then Om-XmYmZmAnd Os-XsYsZsThe transformation relationship between can be expressed as:
<math><mrow><mfenced open='[' close=']'><mtable><mtr><mtd><msub><mover><mi>x</mi><mo>^</mo></mover><mi>s</mi></msub></mtd></mtr><mtr><mtd><msub><mover><mi>y</mi><mo>^</mo></mover><mi>s</mi></msub></mtd></mtr><mtr><mtd><msub><mover><mi>z</mi><mo>^</mo></mover><mi>s</mi></msub></mtd></mtr></mtable></mfenced><mo>=</mo><mfenced open='[' close=']'><mtable><mtr><mtd><mi>cos</mi><mi>&gamma;</mi></mtd><mtd><mi>sin</mi><mi>&gamma;</mi></mtd><mtd><mn>0</mn></mtd></mtr><mtr><mtd><mo>-</mo><mi>sin</mi></mtd><mtd><mi>cos</mi><mi>&gamma;</mi></mtd><mtd><mn>0</mn></mtd></mtr><mtr><mtd><mn>0</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>1</mn></mtd></mtr></mtable></mfenced><mfenced open='[' close=']'><mtable><mtr><mtd><msub><mover><mi>x</mi><mo>^</mo></mover><mi>m</mi></msub></mtd></mtr><mtr><mtd><msub><mover><mi>y</mi><mo>^</mo></mover><mi>m</mi></msub></mtd></mtr><mtr><mtd><msub><mover><mi>z</mi><mo>^</mo></mover><mi>m</mi></msub></mtd></mtr></mtable></mfenced><mo>+</mo><mfenced open='[' close=']'><mtable><mtr><mtd><mi>&Delta;x</mi></mtd></mtr><mtr><mtd><mi>&Delta;y</mi></mtd></mtr><mtr><mtd><mi>&Delta;z</mi></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>5</mn><mo>)</mo></mrow></mrow></math>
as can be seen from equations (1) - (5), there are six parameters to be determined in the registration process, namely (α, β, γ, Δ X, Δ Y, Δ z), and α and β are the included angles between the X-axis and the Y-axis of the ground-based lidar data acquisition and the horizontal plane, and the included angles can be measured along the X-axis and the Y-axis by using tilt sensors. Therefore, only four parameters need to be determined in the present invention.
It is assumed that the points from the ground and the points from the vegetation in the primary and secondary data have been successfully separated and two control points have been determined, with their respective coordinates in the primary data being (x)m,1,ym,1)、(xm,2,ym,2) The coordinates in the sub data are (x) respectivelys,1,ys,1)、(xs,2,ys,2) Then they satisfy the following conditions
<math><mrow><mfenced open='(' close=')'><mtable><mtr><mtd><msub><mi>x</mi><mrow><mi>m</mi><mo>,</mo><mn>1</mn></mrow></msub></mtd></mtr><mtr><mtd><msub><mi>y</mi><mrow><mi>m</mi><mo>,</mo><mn>1</mn></mrow></msub></mtd></mtr></mtable></mfenced><mo>=</mo><mfenced open='(' close=')'><mtable><mtr><mtd><mi>cos</mi><mi>&gamma;</mi></mtd><mtd><mo>-</mo><mi>sin</mi><mi>&gamma;</mi></mtd></mtr><mtr><mtd><mi>sin</mi><mi>&gamma;</mi></mtd><mtd><mi>cos</mi><mi>&gamma;</mi></mtd></mtr></mtable></mfenced><mfenced open='(' close=')'><mtable><mtr><mtd><msub><mi>x</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub></mtd></mtr><mtr><mtd><msub><mi>y</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub></mtd></mtr></mtable></mfenced><mo>+</mo><mfenced open='(' close=')'><mtable><mtr><mtd><mi>&Delta;x</mi></mtd></mtr><mtr><mtd><mi>&Delta;y</mi></mtd></mtr></mtable></mfenced></mrow></math> <math><mrow><mfenced open='(' close=')'><mtable><mtr><mtd><msub><mi>x</mi><mrow><mi>m</mi><mo>,</mo><mn>2</mn></mrow></msub></mtd></mtr><mtr><mtd><msub><mi>y</mi><mrow><mi>m</mi><mo>,</mo><mn>2</mn></mrow></msub></mtd></mtr></mtable></mfenced><mo>=</mo><mfenced open='(' close=')'><mtable><mtr><mtd><mi>cos</mi><mi>&gamma;</mi></mtd><mtd><mo>-</mo><mi>sin</mi><mi>&gamma;</mi></mtd></mtr><mtr><mtd><mi>sin</mi><mi>&gamma;</mi></mtd><mtd><mi>cos</mi><mi>&gamma;</mi></mtd></mtr></mtable></mfenced><mfenced open='(' close=')'><mtable><mtr><mtd><msub><mi>x</mi><mrow><mi>s</mi><mo>,</mo><mn>2</mn></mrow></msub></mtd></mtr><mtr><mtd><msub><mi>y</mi><mrow><mi>s</mi><mo>,</mo><mn>2</mn></mrow></msub></mtd></mtr></mtable></mfenced><mo>+</mo><mfenced open='(' close=')'><mtable><mtr><mtd><mi>&Delta;x</mi></mtd></mtr><mtr><mtd><mi>&Delta;y</mi></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>6</mn><mo>)</mo></mrow></mrow></math>
From this can findRegistration parameters
<math><mrow><mi>sin</mi><mi>&gamma;</mi><mo>=</mo><mfrac><mrow><mo>-</mo><mn>2</mn><mi>mQ</mi><mo>+</mo><msqrt><msup><mrow><mo>(</mo><mn>2</mn><mi>mQ</mi><mo>)</mo></mrow><mn>2</mn></msup><mo>-</mo><mn>4</mn><mrow><mo>(</mo><msup><mi>Q</mi><mn>2</mn></msup><mo>+</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow><mrow><mo>(</mo><msup><mi>m</mi><mn>2</mn></msup><mo>-</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow></msqrt></mrow><mrow><mn>2</mn><mrow><mo>(</mo><msup><mi>Q</mi><mn>2</mn></msup><mo>+</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow></mrow></mfrac></mrow></math>
<math><mrow><mi>&Delta;x</mi><mo>=</mo><msub><mi>x</mi><mrow><mi>m</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>-</mo><msub><mi>x</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub><msqrt><mn>1</mn><mo>-</mo><msup><mi>sin</mi><mn>2</mn></msup><mi>&gamma;</mi></msqrt><mo>+</mo><msub><mi>y</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub><mi>sin</mi><mi>&gamma;</mi></mrow></math>
(7)
<math><mrow><mi>&Delta;y</mi><mo>=</mo><msub><mi>y</mi><mrow><mi>m</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>-</mo><msub><mi>x</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub><mi>sin</mi><mi>&gamma;</mi><mo>-</mo><msub><mi>y</mi><mrow><mi>s</mi><mo>,</mo><mn>1</mn></mrow></msub><msqrt><mn>1</mn><mo>-</mo><msup><mi>sin</mi><mn>2</mn></msup><mi>&gamma;</mi></msqrt></mrow></math>
where m=xm,1-xm,2,n=xs,1-xs,2,Q=ys,2-ys,1
Finally, the parameter Δ z, i.e. the offset of the main and sub data in the vertical direction, needs to be determined. The initial value of Δ z may be determined by the two control points and the final value may be cycled to conform the surface to the indicator δG(group Match Index, GMI) minimization to determine:
<math><mrow><msub><mi>&delta;</mi><mi>G</mi></msub><mo>=</mo><mfrac><mn>1</mn><mi>cd</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>m</mi><mo>=</mo><mn>1</mn></mrow><mi>c</mi></munderover><munderover><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow><mi>d</mi></munderover><mo>|</mo><mo>|</mo><msub><mi>G</mi><mrow><mi>mn</mi><mo>,</mo><mi>master</mi></mrow></msub><mo>-</mo><mi>T</mi><mrow><mo>(</mo><msub><mi>G</mi><mrow><mi>mn</mi><mo>,</mo><mi>slave</mi></mrow></msub><mo>)</mo></mrow><mo>|</mo><mo>|</mo><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>8</mn><mo>)</mo></mrow></mrow></math>
wherein G ismn,masterAnd Gmn,slaveAnd the Z values of the m-th row and n-th column grids after the ground points in the main data and the auxiliary data are rasterized are obtained. c. d is the number of rows and columns on the earth surface of the primary and secondary data overlapping area.
Separation of ground point cloud and vegetation point cloud
The registration parameter calculation method adopted by the invention is explained in the foregoing under the condition that the control point is known and the ground point cloud is separated from the vegetation point cloud, and the separation of the ground point and the vegetation point cloud and the identification of the control point are explained in the following.
As described above, in a forest scene, it is difficult to find an obvious control point, and the present invention uses the center position of the trunk as the control point, so that it is necessary to first find the corresponding trunk in the primary and secondary data, and this process is completed in three steps: (1) separating ground points from vegetation points using a scaling method proposed by Huang (2008); (2) respectively carrying out vertical filtering on the main data and the auxiliary data to extract a trunk point cloud and calculate the central coordinate of a trunk; (3) the triangles formed by the corresponding trunks in the primary and secondary data should have similar properties, and the corresponding trunks are identified by using this rule.
The separation of the earth surface point and the vegetation point is the key of data registration and parameter extraction. The lowest point of the point cloud in the local range may be from the surface. The invention adopts a variable-scale method proposed by Huang (2008) to remove ground points and vegetation points. Setting grids with a series of sizes and corresponding distance thresholds, and according to the sequence from large to small, analyzing the ground point and the vegetation point through loop iteration, wherein the specific process is as follows:
(1) rasterizing the data in the horizontal direction according to the set grid size;
(2) recording the lowest points falling within each grid;
(3) calculating the distance between the point in the grid and the lowest point, if the distance is smaller than a set threshold value, retaining the point, and if not, excluding the point;
(4) repeating (1) - (4) using a smaller grid size and corresponding threshold until the set minimum grid size is used.
Identification of a trunk point cloud and generation of a trunk location list
Through the steps, the earth surface point and the vegetation point are processedThe next step is the identification of the trunk point cloud and the calculation of the center location. For a forest stand with a clean forest bottom, a section of space can be found below a canopy above the ground surface, most of point clouds in the space come from a trunk, the influence of branches and vegetation under the forest is small, and the trunk can be identified by using the point clouds. Although the effect of branches and ground vegetation is small in this space, their presence cannot be ignored. This portion of noise points can be removed by their vertical distribution features as distinguished from the trunk point cloud. Usually, the trunk point cloud is continuous in the vertical direction in the space, and the branches and the surface vegetation point cloud are discontinuous, so the point cloud can be processed by adopting a vertical filtering method. The specific process is as follows, the point cloud is rasterized in the horizontal plane by using the most grid size of the previous step, and the point cloud above each grid is divided into the height dhIf n are consecutivecEach volume element contains npAnd (4) regarding the grid as including the trunk point cloud, reserving all points on the grid, and removing all points on the grid which do not meet the conditions. After the above filtering, the mean value (x) of the coordinates of the points belonging to the same trunkc,yc,zc) As shown in the following formula,
<math><mrow><msub><mi>x</mi><mi>c</mi></msub><mo>=</mo><mfrac><mn>1</mn><mi>n</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo></mrow></math> <math><mrow><msub><mi>y</mi><mi>c</mi></msub><mo>=</mo><mfrac><mn>1</mn><mi>n</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><msub><mi>y</mi><mi>i</mi></msub><mo>,</mo></mrow></math> <math><mrow><msub><mi>z</mi><mi>c</mi></msub><mo>=</mo><mfrac><mn>1</mn><mi>n</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><msub><mi>z</mi><mi>i</mi></msub><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>10</mn><mo>)</mo></mrow></mrow></math>
wherein (x)i,yi,zi) The coordinates of points belonging to the same trunk. Thus, a tree trunk position table can be generated from the main data and the auxiliary data respectively.
Identification of corresponding trunks in primary and secondary trunk location lists
At least three trees are ensured in the overlapping area of the two-station data when the station is selected in the data acquisition process, so that the corresponding trunk can be identified by using the rule that the corresponding trunk is similar to triangles formed in the primary data and the secondary data. The specific process of identification is as follows:
the length and direction of a straight line formed by any two trees in the trunk position list are firstly calculated, and then straight line pairs with similar lengths and approximate parallelism are selected from the main trunk position list and the auxiliary trunk position list. Let i (x)m,i,ym,i) And j (x)m,j,ym,j) For two trees from the main trunk location list, p (x)s,p,ys,p) And q (x)s,q,ys,q) For two trees from the secondary trunk location list, they should at least satisfy if they are the corresponding trunks
Δdij=|dm,ij-ds,pq|<εd,Δφij=|φm,ijs,pq|<εφ(11)
Wherein
d m , ij = ( x m , i - x m , j ) 2 + ( y m , i - y m , j ) 2 , φm,ij=tan-1((ym,i-ym,j)/(xm,i-xm,j))
d s , pq = ( x s , p - x s , q ) 2 + ( y s , p - y s , q ) 2 , φs,pq=tan-1((ys,p-ys,q)/(xs,p-xs,q))
(12)
On the basis, a third tree is respectively introduced from the main trunk position list and the auxiliary trunk position list, and forms a triangle with a straight line from the same table, so that the similarity of the two triangles is judged. Let k (x)m,k,ym,k) And r (x)s,r,ys,r) From the primary and secondary stem location lists, respectively, if three trees are the corresponding stems, they should at least satisfy:
Δdik=|dm,ik-ds,pr|<δd Δφik=|φm,iks,pr|<δφ(13)
and
Δdjk=|dm,jk-ds,qr|<δd Δφjk=|φm,jk-φs,qr|<δφ(14)
most corresponding trunks can be identified by the method, but in some cases, the method is exceptional, and another limiting condition can be added for the reason that the registration parameters obtained by the method can be compared with initial values of the registration parameters, the trunks i, j, k and p, q and r are taken as corresponding trunks and are substituted into the formula (7), and two sets of registration parameters gamma can be obtainedik,Δxik,ΔyikAnd gammajk,Δxjk,ΔyjkIf they satisfy:
<math><mrow><mo>|</mo><mfrac><mrow><mo>(</mo><mi>&Delta;</mi><msub><mi>x</mi><mi>ik</mi></msub><mo>+</mo><mi>&Delta;</mi><msub><mi>x</mi><mi>jk</mi></msub><mo>)</mo></mrow><mn>2</mn></mfrac><mo>-</mo><mi>&Delta;</mi><msub><mi>x</mi><mi>initial</mi></msub><mo>|</mo><mo>&lt;</mo><msub><mi>&delta;</mi><mi>x</mi></msub><mo>,</mo></mrow></math> <math><mrow><mo>|</mo><mfrac><mrow><mo>(</mo><mi>&Delta;</mi><msub><mi>y</mi><mi>ik</mi></msub><mo>+</mo><mi>&Delta;</mi><msub><mi>y</mi><mi>jk</mi></msub><mo>)</mo></mrow><mn>2</mn></mfrac><mo>-</mo><mi>&Delta;</mi><msub><mi>y</mi><mi>initial</mi></msub><mo>|</mo><mo>&lt;</mo><msub><mi>&delta;</mi><mi>y</mi></msub><mo>,</mo></mrow></math> ikjk|<δφ (15)
they are certainly the corresponding trunks. Δ xinitialAnd Δ yinitialFor the initial values of the registration parameters Δ x and Δ y, they can be obtained by simple measurement using a scale at the time of data acquisition.
For example, when the ground point cloud and the vegetation point cloud are separated, a variable-scale scheme is adopted, the recommended grid size is 4m, 2m, 1m, 0.5m and 0.25m, and the corresponding distance threshold is 3m, 1.5m, 0.7m, 0.35m and 0.2 m.
From the data used in developing the invention, the point cloud in the space 0.3m to 1.5m above the surface comes mainly from the trunk and is less affected by the branches and vegetation on the surface.
The parameter used in the vertical filtering process is dh=0.05m,nc=10;np=1;
The parameter used in the process of identifying the corresponding single wood is epsilond=0.2m,εφ=10°,δd=0.3m,δφ=20°,δx=1.0m,δy=1.0m.
When Δ z is determined, it is iterated cyclically in 0.01m steps from-1.0 m to find the minimum value for GMI.
The method can reduce the dependence of the registration process on the control point, and realize the automatic registration of the multi-station foundation laser radar data in the forest environment.
While the present invention has been described with reference to exemplary embodiments, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. The scope of the following claims is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures and functions.

Claims (9)

1. The automatic registration method for the multi-station foundation laser radar data based on the single-tree position and the earth surface information is characterized in that an additional foundation laser radar attitude measuring device is used in the automatic alignment process, the number of registration parameters required to be determined for registration is reduced, and the number of control points required for registration is reduced.
2. The method of automatic registration according to claim 1, wherein the attitude of the instrument is measured along X and Y axes of the ground based lidar using tilt sensors.
3. The automatic registration method according to claim 1, wherein the automatic registration method is used for automatic registration of forest scenes, and the identification of the trunk point cloud is performed by using a vertical filtering method.
4. The automatic registration method of claim 3,
in the alignment process, the central position of the trunk is used as a control point, two stations of data to be registered are called as main data and auxiliary data, and the corresponding trunk is found in the main data and the auxiliary data through the following three steps:
step 1, separating ground points and vegetation points by using a variable scale method;
step 2, respectively carrying out vertical filtering on the main data and the auxiliary data to extract trunk point clouds and calculate the central coordinates of the trunk;
and 3, identifying the corresponding trunk by using the rule that the triangle formed by the corresponding trunk in the main data and the triangle formed by the corresponding trunk in the auxiliary data have similar properties.
5. The automatic registration method according to claim 3 or 4,
the method comprises the steps of utilizing point clouds in a section of space above the ground surface and below a canopy to identify a trunk, and utilizing the difference between the vertical distribution characteristics of the point clouds in the section of space and the point clouds of the trunk to remove branch and ground planting noise in the section of space.
6. The automatic registration method according to claim 1, wherein the automatic registration method is used for automatic registration of forest scenes, two stations of data to be registered are called primary data and secondary data, and the same trunk in the primary data and the secondary data is identified by using the similarity of triangles formed by singles.
7. The automatic registration method according to claim 2, wherein the automatic registration method is used for automatic registration of forest scenes and uses 4 registration parameters; 3 of them are calculated using the same trunk and the 4 th registration parameter is calculated using the surface.
8. The automatic registration method according to claim 7, characterized in that the laser radar data is subjected to separation of ground points and vegetation points by a variable scale method, then the positions of the singles are identified by vertical filtering, the singles with the same name are automatically identified by using the relative positions of the singles, and the singles with the same name are used as control points to obtain 3 registration parameters; and finally, determining the offset of the two stations of data in the vertical direction according to the optimal matching of the earth surface, and solving a 4 th registration parameter.
9. An automatic registration method between multi-station foundation laser radar data, which is used for automatic registration of forest scenes and is characterized in that,
in the automatic alignment process, an additional foundation laser radar attitude measurement device is used, the number of registration parameters required to be determined by registration is reduced, and therefore 4 registration parameters are used, and the number of control points required by registration is reduced;
separating the earth surface points from the vegetation points by a scale-variable method;
identifying the trunk point cloud by using a vertical filtering method;
identifying the same trunk in the main data and the auxiliary data by utilizing the similarity of triangles formed by single trees;
3 of the 4 registration parameters are calculated using the same trunk, the last of the 4 registration parameters being calculated using the surface.
CN2009102377622A 2009-11-18 2009-11-18 Foundation laser radar data registration method based on single tree position and surface information Pending CN102062860A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009102377622A CN102062860A (en) 2009-11-18 2009-11-18 Foundation laser radar data registration method based on single tree position and surface information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009102377622A CN102062860A (en) 2009-11-18 2009-11-18 Foundation laser radar data registration method based on single tree position and surface information

Publications (1)

Publication Number Publication Date
CN102062860A true CN102062860A (en) 2011-05-18

Family

ID=43998222

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009102377622A Pending CN102062860A (en) 2009-11-18 2009-11-18 Foundation laser radar data registration method based on single tree position and surface information

Country Status (1)

Country Link
CN (1) CN102062860A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102314674A (en) * 2011-08-29 2012-01-11 北京建筑工程学院 Registering method for data texture image of ground laser radar
CN102419818A (en) * 2011-10-28 2012-04-18 中国林业科学研究院资源信息研究所 LiDAR (Light Detecting and Ranging) data single-tree extraction method with combination of morphological canopy control and watershed
CN103983963A (en) * 2014-06-09 2014-08-13 北京数字绿土科技有限公司 Automatic registering method for multi-station foundation laser radar data
CN107170033A (en) * 2017-04-12 2017-09-15 青岛市光电工程技术研究院 Smart city 3D live-action map systems based on laser radar technique
CN111666858A (en) * 2020-05-29 2020-09-15 中国科学院地理科学与资源研究所 Forest remote sensing image registration method and system based on single tree recognition
CN117253141A (en) * 2023-08-29 2023-12-19 北京观微科技有限公司 Method and device for determining sample data of forest investigation sample and electronic equipment

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102314674A (en) * 2011-08-29 2012-01-11 北京建筑工程学院 Registering method for data texture image of ground laser radar
CN102419818A (en) * 2011-10-28 2012-04-18 中国林业科学研究院资源信息研究所 LiDAR (Light Detecting and Ranging) data single-tree extraction method with combination of morphological canopy control and watershed
CN102419818B (en) * 2011-10-28 2014-12-10 中国林业科学研究院资源信息研究所 LiDAR (Light Detecting and Ranging) data single-tree extraction method with combination of morphological canopy control and watershed
CN103983963A (en) * 2014-06-09 2014-08-13 北京数字绿土科技有限公司 Automatic registering method for multi-station foundation laser radar data
CN107170033A (en) * 2017-04-12 2017-09-15 青岛市光电工程技术研究院 Smart city 3D live-action map systems based on laser radar technique
CN111666858A (en) * 2020-05-29 2020-09-15 中国科学院地理科学与资源研究所 Forest remote sensing image registration method and system based on single tree recognition
CN117253141A (en) * 2023-08-29 2023-12-19 北京观微科技有限公司 Method and device for determining sample data of forest investigation sample and electronic equipment

Similar Documents

Publication Publication Date Title
CN104931022B (en) Satellite image stereoblock adjustment method based on spaceborne laser altimeter system data
CN105184250B (en) A kind of terrain classification method of electric power corridor airborne LiDAR point cloud data
CN108107444B (en) Transformer substation foreign matter identification method based on laser data
Lam et al. Urban scene extraction from mobile ground based lidar data
CN103703490B (en) For generation of the equipment of three-dimensional feature data and the method for generation of three-dimensional feature data
CN102062860A (en) Foundation laser radar data registration method based on single tree position and surface information
KR100963651B1 (en) Method of automatic extraction of building boundaries using airborne lidar
Pueschel The influence of scanner parameters on the extraction of tree metrics from FARO Photon 120 terrestrial laser scans
CN104103070B (en) Landing point selecting method based on optical images
CN109100719A (en) Combine plotting method with the topographic map of optical image based on satellite-borne SAR image
KR101080985B1 (en) Method for checking height of tree and population using lidar
CN114689015B (en) Method for improving elevation precision of optical satellite stereoscopic image DSM
CN110889899A (en) Method and device for generating digital earth surface model
CN117197677A (en) Tropical rain forest arbor-shrub separation method based on laser radar point cloud data
CN113218310A (en) Extraction method and system of important parameters of dry beach of tailing pond based on three-dimensional laser point cloud
Abdulkareem et al. Accuracy assessment of digital elevation models produced from different geomatics data
Javanmardi et al. Autonomous vehicle self-localization based on probabilistic planar surface map and multi-channel LiDAR in urban area
Jacob et al. Sentinel-1A SAR data for global urban mapping: Preliminary results
Tse et al. 3D city modelling from LIDAR data
ITRM20130115A1 (en) PROCEDURE AND MATCHING DEVICE FOR THE DIGITAL MODELING OF OBJECTS BY STEREOSCOPIC IMAGES
CN102706348A (en) Gravimetric map fast matching method based on triangle
Serbouti et al. Pixel and object-based machine learning classification schemes for lithological mapping enhancement of semi-arid regions using sentinel-2A imagery: a case study of the southern Moroccan meseta
Zhu et al. Research on deep learning individual tree segmentation method coupling RetinaNet and point cloud clustering
CN104614729A (en) Method for analyzing elevation matching quality of laser radar flight strip
CN108595373A (en) It is a kind of without control DEM method for registering

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20110518