CN110458174A - A kind of unordered accurate extracting method of cloud key feature points - Google Patents
A kind of unordered accurate extracting method of cloud key feature points Download PDFInfo
- Publication number
- CN110458174A CN110458174A CN201910574474.XA CN201910574474A CN110458174A CN 110458174 A CN110458174 A CN 110458174A CN 201910574474 A CN201910574474 A CN 201910574474A CN 110458174 A CN110458174 A CN 110458174A
- Authority
- CN
- China
- Prior art keywords
- point
- neighborhood
- discrete
- formula
- angle
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/40—Extraction of image or video features
- G06V10/44—Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
Landscapes
- Engineering & Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Image Analysis (AREA)
Abstract
A kind of unordered accurate extracting method of cloud key feature points, it includes have the following steps: 1) centered on each cloud point, calculating a ring k neighborhood union and construct triangle meshes;2) discrete curvature, discrete normal and the neighborhood point distance for calculating each cloud point are used to construct window function, calculate gradient matrix;3) angle point response characteristic of division point is calculated to gradient matrix.The present invention remains local detail feature using angle point, folding line point and planar point in change of gradient identification point cloud data, and recognition result is accurate, reliable;The 3 D laser scanning detection that can be widely applied to the components such as aviation, automobile, has very strong applicability.
Description
Technical field
The present invention relates to computer graphics and three-dimensional point cloud feature extraction field, and in particular to a kind of unordered point Yun Guanjian
The accurate extracting method of characteristic point.
Background technique
Airplane component has a large scale, weak rigidity and the characteristics of structure is complicated, not only needs to measure the sky of single component
Between size, and the assembly features of complex component are also required to measure.The eyeball cloud amount of these structural members is big and unordered, quasi-
Really extracting key feature points is the necessary means simplified data, improve Data Analysis Services efficiency.Feature extraction is metrical information
Most basic in processing, most critical part, reverse-engineering, the precision of image procossing depend critically upon the precision of feature extraction.
Extracting field in cloud key feature both at home and abroad has had certain research achievement, mainly uses three kinds of modes:
First is that the feature extraction based on normal vector, by combining clustering algorithm determining method to swear, angle is more than that the point of threshold value is characterized a little, this
Kind method is suitable for the part of simple rule shape, but lower for the accuracy of identification of local fine feature.Second is that being based on curvature
Feature extraction, identified according to curvature information mutation at characteristic point.Although this method has noise spot relatively strong
Resistance, but extract characteristic point inside can have pseudo feature point, need additional filtering algorithm to be simplified.Third is that being based on certain
Kind mathematical model or operator improve, and this method improves Feature point recognition precision by designing specific solution process, but
The problem of being omitted there are still wrong identification and characteristic point.
Summary of the invention
The purpose of the present invention is the accuracy of identification of existing local fine feature is extracted for existing cloud key feature
It is lower and there are pseudo feature point and characteristic points to omit, the problem of needing additional filtering algorithm to be simplified, provide a kind of nothing
The accurate extracting method of sequence point cloud key feature points, it is therefore intended that avoid the non-characteristic point in 2 ring neighborhood of real features point by mistake
The problem of identification, accurately identifies angle point, planar point and folding line point using change of gradient and guarantees local detail feature.
The technical scheme is that
Unordered cloud key feature of one kind accurately identifies and extracting method, it is characterized in that carrying out first to each cloud point adjacent
Domain search, calculates neighborhood distance and angle sorts counterclockwise to neighborhood point;Then triangle gridding is constructed to a ring k neighborhood,
The discrete normal direction for calculating vertex calculates discrete curvature using Taylor expansion;Finally, to neighborhood distance, discrete normal direction and discrete song
Rate is weighted construction gradient matrix and calculates angle point response, passes through given threshold identification feature point.Specific step is as follows institute
It states:
Step 1 calculates each cloud point PiA ring k neighborhood Pi-k。
(1) neighborhood k value value range [10,20] are set, each data point is found apart from k+5 nearest neighborhood point, right
Neighborhood point is ranked up counterclockwise, calculates neighbouring 2 neighborhood points and point cloud point PiThe vector angle θ of composition;
(2) calculating the smallest neighborhood point of space length is starting point, calculates threshold angle θ0=360/k, along counterclockwise
Direction is less than threshold angle θ when the angle theta of 2 neighborhood points0, the long biggish neighborhood point of mould is deleted, another point is labeled as qualified point
Retained, qualification point is as new starting point.Circulation (2) terminates when neighborhood point is reduced to k.
Step 2, the neighborhood relationships obtained based on step 1 construct triangle meshes to calculate each cloud point PiIt is discrete
Normal vector calculates discrete curvature using Taylor expansion, specifically:
(1) as shown in Figure 1, calculating all neighborhood triangle side length a/b/c, the shape weight of any neighborhood triangle is calculated
Δj, formula is as follows:
(2) normal vector N is calculated according to neighborhood triangular apex coordinate valuefj, according to the shape weight that (1) obtains, calculate point
The discrete normal direction N of cloud point Pip。
(3) as shown in Fig. 2, calculating point cloud point P according to the normal vector that (2) obtainiTangent plane F, to PiWith Pi-kPlace
Area of space carry out parametric surface S (u, v) fitting.Construct PiAs the local coordinate system xyz of origin, surface coordinates system u/v
It projects on the face F and corresponds to x/y axis.Calculate neighborhood point Pi-kProject to the subpoint Q of tangent plane Fj-k, calculate any subpoint Qj-k
With x-axis angle σj, Qj-kWith y-axis angle ηj。
(4) Taylor expansion is carried out to curved surface S, calculation formula is as follows:
RnIt is a higher-order shear deformation, this value is ignored in subsequent calculating.It is write above formula as matrix form, calculates each data point
PiDiscrete single order { the S of pointu,SvAnd second order { Suu,Suv,SvvDerivative, calculation formula is as follows:
Wherein, Dj=| Pi-k-Pi|, Δ uj=| Qj-k-Pi|cosσj, Δ vj=| Qj-k-Pi|cosηj。
(5) the discrete first derivative obtained according to (4) calculates outer En Jiateng transformation matrix W, and formula is as follows:
In formula: E, F, G are the first kind fundamental quantity of curved surface, L, N, M1、M2For the second class fundamental quantity of curved surface.
(6) the characteristic value k of outer En Jiateng transformation matrix W is calculated1,k2, obtain point cloud point PiDiscrete Gaussian curvature κ, formula
It is as follows:
κ=k1·k2
Step 3 is weighted construction gradient matrix to neighborhood distance, discrete normal direction and discrete curvature and calculates characteristic value,
It is specific as follows by given threshold identification feature point:
(1) neighborhood point spacing d, the discrete normal direction obtained using step 2 and discrete Gaussian curvature calculation window function are calculated
W, formula are as follows:
Wherein, σk,σn, and σcIt is bandwidth parameter, σk=max (d), σn=180, σc=max (κpi-κpi-k)。
(2) window function obtained by (1) calculates PiAlong any Pi-kThe change of gradient of point vector direction, formula is such as
Under
(3) by PiSingle order and Second-Order Discrete derivative substitute into above formula, calculate PiIntegral gradient E in a ring neighborhood, formula
It is as follows:
Above formula is rewritten, neighborhood point P is calculatedi-kDirection cosines cos α, cos β, cos at local coordinate system xyz
γ obtains PiCovariance matrix M (the P of point gradienti), calculation formula is as follows:
(4) as shown in figure 3, calculating gradient matrix M (Pi) three characteristic values and be ranked up, obtain λ1≥λ2≥λ3If
Determine threshold value Ω, made the following judgment according to size relation:
1) angle point: λ1≥λ2≥λ3≥Ω。
2) seamed edge point: λ1≥λ2, λ1>=Ω, λ3≠0;Or λ2≥λ1, λ2>=Ω, λ3≠0。
3) planar point: λ1≤ Ω, λ2≤ Ω, λ3≤Ω。
The curved surface S (u, v) needs to carry out least square and solves acquisition parametric equation, and detailed process is as follows:
(1) surface equation general expression is denoted as:
Z=a1x2+a2xy+a3y2+a4x+a5y+a6
(2) by PiPoint and any 5 neighborhoods point Pi-kIt brings into above formula respectively, obtains hexa-atomic linear function group and asked
Solution obtains coefficient sets A={ a1 ... a6 }.Step (2) are repeated to carry out being no more than N=Ck 5Secondary permutation and combination obtains N group coefficient
Collection.
(3) all neighborhood point P are calculatedi-kTo the sum of the Z-direction projector distance of every group of coefficient fitting surface, minimum value institute is selected
Corresponding surface coefficients are as fitting result.
Simplify the deterministic process of characteristic value size relation, detailed process by calculating angle point receptance function R are as follows:
(1) to gradient matrix E (Pi) derivation is carried out, angle point response R is obtained, calculation formula is as follows:
(2) it is [0.01,0.1] according to the value range of Ω, judges the size relation of angle point analog value R and threshold value Ω such as
Under:
1) work as R > Ω: PiPoint angle point.
2) when R <-Ω: PiPoint is folding line point.
3) as | R | < Ω: PiPoint is planar point.
The beneficial effects of the present invention are:
One, the present invention carries out the extraction of characteristic point using the variation of gradient, as shown in figure 4, the other methods that compare are in office
There is higher accuracy of identification, local detail Feature point recognition rate is 97% or more in portion's details.
Two, for scale, sagging and chamfering category feature point, (feature shows as a plurality of contour line to the present invention, and between distance
Every the minimum accuracy of identification up to 0.5mm) in 0.15mm (1.5 times of eyeball cloud equalization point spacing) hereinafter, can be than calibrated
The non-characteristic point between neighbouring two profiles is really rejected, without additional filtering algorithm.
Detailed description of the invention
Mono- ring neighborhood triangle meshes of Fig. 1 construct schematic diagram.
The building of mono- ring neighborhood local coordinate system of Fig. 2 and neighborhood point perspective view.
Fig. 3 gradient matrix extracts characteristic point schematic diagram.
Fig. 4 the method for the present invention figure compared with other feature extraction algorithm performances.
Fig. 5 the method for the present invention operational flowchart.
Specific embodiment
The present invention is further illustrated for Structure Figure and embodiment below.
As shown in Figs. 1-5.
The neighborhood triangle gridding topology that the present invention is applicable in please refers to shown in Fig. 1, the building process of local coordinate system and one
Ring neighborhood point projecting direction referring to figure 2., calculates the characteristic value that gradient matrix obtains and please refers to figure to extract the process of characteristic point
3。
Unordered cloud key feature of one kind accurately identifies and extracting method, as shown in figure 5, it includes the following steps.
Step 1 calculates each cloud point PiA ring k neighborhood Pi-k。
(1) neighborhood k value value range [10,20] are set, each data point is found apart from k+5 nearest neighborhood point, right
Neighborhood point is ranked up counterclockwise, calculates neighbouring 2 neighborhood points and point cloud point PiThe vector angle θ of composition;
(2) calculating the smallest neighborhood point of space length is starting point, calculates threshold angle θ0=360/k, along counterclockwise
Direction is less than threshold angle θ when the angle theta of 2 neighborhood points0, the long biggish neighborhood point of mould is deleted, another point is labeled as qualified point
Retained, qualification point is as new starting point.Circulation (2) terminates when neighborhood point is reduced to k.
Step 2, the neighborhood relationships obtained based on step 1 construct triangle meshes to calculate each cloud point PiIt is discrete
Normal vector calculates discrete curvature using Taylor expansion, specifically:
(1) as shown in Figure 1, calculating all neighborhood triangle side length a/b/c, the shape weight of any neighborhood triangle is calculated
Δj, formula is as follows:
(2) normal vector N is calculated according to neighborhood triangular apex coordinate valuefj, according to the shape weight that (1) obtains, calculate point
The discrete normal direction N of cloud point Pip。
(3) as shown in Fig. 2, calculating point cloud point P according to the normal vector that (2) obtainiTangent plane F, to PiWith Pi-kPlace
Area of space carry out parametric surface S (u, v) fitting.
The curved surface S (u, v) can be solved by least square and be obtained parametric equation, and detailed process is as follows:
(1) surface equation general expression is denoted as:
Z=a1x2+a2xy+a3y2+a4x+a5y+a6
(2) by PiPoint and any 5 neighborhoods point Pi-kIt brings into above formula respectively, obtains hexa-atomic linear function group and asked
Solution obtains coefficient sets A={ a1 ... a6 }.Step (2) are repeated to carry out being no more than N=Ck 5Secondary permutation and combination obtains N group coefficient
Collection.
(3) all neighborhood point P are calculatedi-kTo the sum of the Z-direction projector distance of every group of coefficient fitting surface, minimum value institute is selected
Corresponding surface coefficients are as fitting result.
Construct PiAs the local coordinate system xyz of origin, surface coordinates system u/v, which is projected on the face F, corresponds to x/y axis.It calculates
Neighborhood point Pi-kProject to the subpoint Q of tangent plane Fj-k, calculate any subpoint Qj-kWith x-axis angle σj, Qj-kWith y-axis angle ηj。
(4) Taylor expansion is carried out to curved surface S, calculation formula is as follows:
RnIt is a higher-order shear deformation, this value is ignored in subsequent calculating.It is write above formula as matrix form, calculates each data point
PiDiscrete single order { the S of pointu,SvAnd second order { Suu,Suv,SvvDerivative, calculation formula is as follows:
Wherein, Dj=| Pi-k-Pi|, Δ uj=| Qj-k-Pi|cosσj, Δ vj=| Qj-k-Pi|cosηj。
(5) the discrete first derivative obtained according to (4) calculates outer En Jiateng transformation matrix W, and formula is as follows:
(6) the characteristic value k of outer En Jiateng transformation matrix W is calculated1,k2, obtain point cloud point PiDiscrete Gaussian curvature κ, formula
It is as follows:
κ=k1·k2
Step 3 is weighted construction gradient matrix to neighborhood distance, discrete normal direction and discrete curvature and calculates characteristic value,
It is specific as follows by given threshold identification feature point:
(1) neighborhood point spacing d, the discrete normal direction obtained using step 2 and discrete Gaussian curvature calculation window function are calculated
W, formula are as follows:
Wherein, σk,σn, and σcIt is bandwidth parameter, σk=max (d), σn=180, σc=max (κpi-κpi-k)。
(2) window function obtained by (1) calculates PiAlong any Pi-kThe change of gradient of point vector direction, formula is such as
Under
(3) by PiSingle order and Second-Order Discrete derivative substitute into above formula, calculate PiIntegral gradient E in a ring neighborhood, formula
It is as follows:
Above formula is rewritten, neighborhood point P is calculatedi-kDirection cosines cos α, cos β, cos at local coordinate system xyz
γ obtains PiCovariance matrix M (the P of point gradienti), calculation formula is as follows:
(4) as shown in figure 3, calculating gradient matrix M (Pi) three characteristic values and be ranked up, obtain λ1≥λ2≥λ3If
Determine threshold value Ω, made the following judgment according to size relation:
1) angle point: λ1≥λ2≥λ3≥Ω。
2) seamed edge point: λ1≥λ2, λ1>=Ω, λ3≠0;Or λ2≥λ1, λ2>=Ω, λ3≠0。
3) planar point: λ1≤ Ω, λ2≤ Ω, λ3≤Ω。
The deterministic process of characteristic value size relation, tool can also be simplified when specific implementation by calculating angle point receptance function R
Body process are as follows:
(1) to gradient matrix E (Pi) derivation is carried out, angle point response R is obtained, calculation formula is as follows:
(2) it is [0.01,0.1] according to the value range of Ω, judges the size relation of angle point analog value R and threshold value Ω such as
Under:
1) work as R > Ω: PiPoint angle point.
2) when R <-Ω: PiPoint is folding line point.
3) as | R | < Ω: PiPoint is planar point.
Part that the present invention does not relate to is same as the prior art or can be realized by using the prior art.
Claims (4)
1. a kind of unordered cloud key feature accurately identifies and extracting method, it is characterized in that carrying out neighborhood to each cloud point first
Search, while calculating neighborhood distance and angle and being sorted counterclockwise to neighborhood point;Then the triangulation network is constructed to a ring k neighborhood
Lattice calculate the discrete normal direction on vertex, calculate discrete curvature using Taylor expansion;Finally, to neighborhood distance, discrete normal direction and discrete
Curvature is weighted construction gradient matrix and calculates angle point response, passes through given threshold identification feature point.
2. according to the method described in claim 1, it is characterized in that it the following steps are included:
Step 1 calculates each cloud point PiA ring k neighborhood Pi-k。
(1) neighborhood k value value range [10,20] are set, each data point is found apart from k+5 nearest neighborhood point, to neighborhood
Point is ranked up counterclockwise, calculates neighbouring 2 neighborhood points and point cloud point PiThe vector angle θ of composition;
(2) calculating the smallest neighborhood point of space length is starting point, calculates threshold angle θ0=360/k, in the counterclockwise direction when
The angle theta of 2 neighborhood points is less than threshold angle θ0, the long biggish neighborhood point of mould is deleted, another point is protected labeled as qualified point
It stays, qualification point is as new starting point;Circulation (2) terminates when neighborhood point is reduced to k;
Step 2, the neighborhood relationships obtained based on step 1 construct triangle meshes to calculate each cloud point PiDiscrete normal direction
Amount calculates discrete curvature using Taylor expansion, specifically:
(1) all neighborhood triangle side length a/b/c are calculated, the shape weight Δ of any neighborhood triangle is calculatedj, formula is as follows:
(2) the shape weight obtained according to (1) calculates point cloud point PiDiscrete normal direction Np;
In formula: NfjFor the normal vector of neighborhood triangle, calculates the vector multiplication cross that any two vertex of neighborhood triangle is constituted and obtain.
(3) point cloud point P was calculated according to the normal vector that (2) obtainiTangent plane F, to PiWith Pi-kThe area of space at place carries out
Parametric surface S (u, v) fitting, constructs PiAs the local coordinate system xyz of origin, the direction selection of x-axis is that most short mould is long | Pi-
Pi-k| vector direction.
(4) Taylor expansion is carried out to curved surface S, calculation formula is as follows:
U/v is the bent line coordinate direction of curved surface in formula, projects on the face F and corresponds to x/y axis.RnIt is a higher-order shear deformation, subsequent meter
This value is ignored in calculation.It is write above formula as matrix form, calculates each data point PiDiscrete single order { the S of pointu,SvAnd second order { Suu,
Suv,SvvDerivative, calculation formula is as follows:
Wherein, Dj=| Pi-k-Pi|, Δ uj=| Qj-k-Pi|cosσj, Δ vj=| Qj-k-Pi|cosηj;Q in formulaj-kFor neighborhood point Pi-k
Project to the subpoint of tangent plane F, σjFor any subpoint Qj-kWith x-axis angle, ηjFor any subpoint Qj-kWith y-axis angle.
(5) the discrete first derivative obtained according to (4) calculates outer En Jiateng transformation matrix W, and formula is as follows:
In formula: E, F, G are the first kind fundamental quantity of curved surface, L, N, M1、M2For the second class fundamental quantity of curved surface.
(6) the characteristic value k of outer En Jiateng transformation matrix W is calculated1,k2, obtain point cloud point PiDiscrete Gaussian curvature κ, formula is such as
Under:
κ=k1·k2
Step 3 is weighted construction gradient matrix to neighborhood distance, discrete normal direction and discrete curvature and calculates characteristic value, passes through
Given threshold identification feature point, specific as follows:
(1) neighborhood point spacing d, the discrete normal direction obtained using step 2 and discrete Gaussian curvature calculation window function w are calculated, it is public
Formula is as follows:
Wherein, σk,σn, and σcIt is bandwidth parameter, σk=max (d), σn=180, σc=max (κpi-κpi-k)。
(2) window function obtained by (1) calculates PiAlong any Pi-kThe change of gradient of point vector direction, formula are as follows
(3) by PiSingle order and Second-Order Discrete derivative substitute into above formula, calculate PiIntegral gradient E in a ring neighborhood, formula is such as
Under:
Above formula is rewritten, P is obtainediCovariance matrix M (the P of point gradienti), calculation formula is as follows:
Cos α in formula, cos β, cos γ respectively correspond neighborhood point Pi-kDirection cosines at local coordinate system x/y/z, Sx, Sy,
Sz is the first-order partial derivative of curved surface S.
(4) gradient matrix M (P is calculatedi) three characteristic values and be ranked up, obtain λ1≥λ2≥λ3, given threshold Ω, according to big
Small relationship makes the following judgment:
1) angle point: λ1≥λ2≥λ3≥Ω;
2) seamed edge point: λ1≥λ2, λ1>=Ω, λ3≠0;Or λ2≥λ1, λ2>=Ω, λ3≠0;
3) planar point: λ1≤ Ω, λ2≤ Ω, λ3≤Ω。
3. according to the method described in claim 2, it is characterized in that the curved surface S (u, v) need to carry out least square solution obtain
Obtain parametric equation:
(1) surface equation general expression is denoted as:
Z=a1x2+a2xy+a3y2+a4x+a5y+a6
(2) by PiPoint and any 5 neighborhoods point Pi-kIt brings into above formula respectively, obtains hexa-atomic linear function group and solved, obtained
To coefficient sets A={ a1 ... a6 };Step (2) are repeated to carry out being no more than N=Ck 5Secondary permutation and combination obtains N group coefficient set;
(3) all neighborhood point P are calculatedi-kTo the sum of the Z-direction projector distance of every group of coefficient fitting surface, select corresponding to minimum value
Surface coefficients as fitting result.
4. according to the method described in claim 2, it is characterized in that being closed by calculating angle point receptance function R to simplify characteristic value size
The deterministic process of system:
(1) to gradient matrix E (Pi) derivation is carried out, angle point response R is obtained, calculation formula is as follows:
(2) it is [0.01,0.1] according to the value range of Ω, judges that angle point analog value R and the size relation of threshold value Ω are as follows:
1) work as R > Ω: PiPoint angle point.
2) when R <-Ω: PiPoint is folding line point.
3) as | R | < Ω: PiPoint is planar point.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910574474.XA CN110458174B (en) | 2019-06-28 | 2019-06-28 | Precise extraction method for key feature points of unordered point cloud |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910574474.XA CN110458174B (en) | 2019-06-28 | 2019-06-28 | Precise extraction method for key feature points of unordered point cloud |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110458174A true CN110458174A (en) | 2019-11-15 |
CN110458174B CN110458174B (en) | 2023-05-09 |
Family
ID=68481816
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910574474.XA Active CN110458174B (en) | 2019-06-28 | 2019-06-28 | Precise extraction method for key feature points of unordered point cloud |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110458174B (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111080692A (en) * | 2019-12-18 | 2020-04-28 | 北京城市网邻信息技术有限公司 | Processing method and processing device based on unordered point set and electronic equipment |
CN111932570A (en) * | 2020-09-10 | 2020-11-13 | 熵智科技(深圳)有限公司 | Edge detection method, device, medium and equipment based on grid data |
CN112101229A (en) * | 2020-09-16 | 2020-12-18 | 云南师范大学 | Point cloud data feature point extraction method and device, computer equipment and storage medium |
CN112150606A (en) * | 2020-08-24 | 2020-12-29 | 上海大学 | Thread surface three-dimensional reconstruction method based on point cloud data |
CN113327328A (en) * | 2021-08-02 | 2021-08-31 | 苏州鼎纳自动化技术有限公司 | Three-dimensional point cloud data compaction method |
CN113487713A (en) * | 2021-06-16 | 2021-10-08 | 中南民族大学 | Point cloud feature extraction method and device and electronic equipment |
CN114022621A (en) * | 2022-01-07 | 2022-02-08 | 清华大学 | Method, apparatus and medium for reconstructing mesh surface from point cloud data without normalization |
CN116012613A (en) * | 2023-01-04 | 2023-04-25 | 北京数字绿土科技股份有限公司 | Method and system for measuring and calculating earthwork variation of strip mine based on laser point cloud |
CN117114971A (en) * | 2023-08-01 | 2023-11-24 | 北京城建设计发展集团股份有限公司 | Pixel map-to-vector map conversion method and system |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101833666A (en) * | 2009-03-11 | 2010-09-15 | 中国科学院自动化研究所 | Estimation method of scattered point cloud data geometric senses |
CN104112289A (en) * | 2014-01-29 | 2014-10-22 | 辽宁师范大学 | Three-dimensional object point cloud registration method based on parallel cascaded EM-ICP |
CN106407985A (en) * | 2016-08-26 | 2017-02-15 | 中国电子科技集团公司第三十八研究所 | Three-dimensional human head point cloud feature extraction method and device thereof |
CN107610232A (en) * | 2017-07-05 | 2018-01-19 | 山东理工大学 | Dispersion point cloud Curvature Estimate method based on sampling point neighborhood isomorphism curved surface |
CN109409437A (en) * | 2018-11-06 | 2019-03-01 | 安徽农业大学 | A kind of point cloud segmentation method, apparatus, computer readable storage medium and terminal |
CN109410342A (en) * | 2018-09-28 | 2019-03-01 | 昆明理工大学 | A kind of point cloud compressing method retaining boundary point |
-
2019
- 2019-06-28 CN CN201910574474.XA patent/CN110458174B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101833666A (en) * | 2009-03-11 | 2010-09-15 | 中国科学院自动化研究所 | Estimation method of scattered point cloud data geometric senses |
CN104112289A (en) * | 2014-01-29 | 2014-10-22 | 辽宁师范大学 | Three-dimensional object point cloud registration method based on parallel cascaded EM-ICP |
CN106407985A (en) * | 2016-08-26 | 2017-02-15 | 中国电子科技集团公司第三十八研究所 | Three-dimensional human head point cloud feature extraction method and device thereof |
CN107610232A (en) * | 2017-07-05 | 2018-01-19 | 山东理工大学 | Dispersion point cloud Curvature Estimate method based on sampling point neighborhood isomorphism curved surface |
CN109410342A (en) * | 2018-09-28 | 2019-03-01 | 昆明理工大学 | A kind of point cloud compressing method retaining boundary point |
CN109409437A (en) * | 2018-11-06 | 2019-03-01 | 安徽农业大学 | A kind of point cloud segmentation method, apparatus, computer readable storage medium and terminal |
Cited By (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111080692B (en) * | 2019-12-18 | 2020-12-25 | 北京城市网邻信息技术有限公司 | Processing method and processing device based on unordered point set and electronic equipment |
CN111080692A (en) * | 2019-12-18 | 2020-04-28 | 北京城市网邻信息技术有限公司 | Processing method and processing device based on unordered point set and electronic equipment |
CN112150606B (en) * | 2020-08-24 | 2022-11-08 | 上海大学 | Thread surface three-dimensional reconstruction method based on point cloud data |
CN112150606A (en) * | 2020-08-24 | 2020-12-29 | 上海大学 | Thread surface three-dimensional reconstruction method based on point cloud data |
CN111932570A (en) * | 2020-09-10 | 2020-11-13 | 熵智科技(深圳)有限公司 | Edge detection method, device, medium and equipment based on grid data |
CN111932570B (en) * | 2020-09-10 | 2021-01-19 | 熵智科技(深圳)有限公司 | Edge detection method, device, medium and equipment based on grid data |
CN112101229A (en) * | 2020-09-16 | 2020-12-18 | 云南师范大学 | Point cloud data feature point extraction method and device, computer equipment and storage medium |
CN112101229B (en) * | 2020-09-16 | 2023-02-24 | 云南师范大学 | Point cloud data feature point extraction method and device, computer equipment and storage medium |
CN113487713A (en) * | 2021-06-16 | 2021-10-08 | 中南民族大学 | Point cloud feature extraction method and device and electronic equipment |
CN113327328A (en) * | 2021-08-02 | 2021-08-31 | 苏州鼎纳自动化技术有限公司 | Three-dimensional point cloud data compaction method |
CN114022621A (en) * | 2022-01-07 | 2022-02-08 | 清华大学 | Method, apparatus and medium for reconstructing mesh surface from point cloud data without normalization |
CN114022621B (en) * | 2022-01-07 | 2022-05-31 | 清华大学 | Method, apparatus and medium for reconstructing mesh surface from point cloud data without normalization |
CN116012613A (en) * | 2023-01-04 | 2023-04-25 | 北京数字绿土科技股份有限公司 | Method and system for measuring and calculating earthwork variation of strip mine based on laser point cloud |
CN116012613B (en) * | 2023-01-04 | 2024-01-16 | 北京数字绿土科技股份有限公司 | Method and system for measuring and calculating earthwork variation of strip mine based on laser point cloud |
CN117114971A (en) * | 2023-08-01 | 2023-11-24 | 北京城建设计发展集团股份有限公司 | Pixel map-to-vector map conversion method and system |
CN117114971B (en) * | 2023-08-01 | 2024-03-08 | 北京城建设计发展集团股份有限公司 | Pixel map-to-vector map conversion method and system |
Also Published As
Publication number | Publication date |
---|---|
CN110458174B (en) | 2023-05-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110458174A (en) | A kind of unordered accurate extracting method of cloud key feature points | |
CN106023298B (en) | Point cloud Rigid Registration method based on local Poisson curve reestablishing | |
CN108376408B (en) | Three-dimensional point cloud data rapid weighting registration method based on curvature features | |
CN109766604B (en) | Blade high-rigidity design method based on random isogeometric analysis | |
CN106874580A (en) | A kind of bend pipe model reconstruction method based on cloud data | |
CN102880737B (en) | Based on the workpiece method for registering in flexible assembly and system | |
CN108955679A (en) | A kind of robot used for intelligent substation patrol high-precision locating method | |
CN109683552B (en) | Numerical control machining path generation method on complex point cloud model guided by base curve | |
CN109214422B (en) | Parking data repairing method, device, equipment and storage medium based on DCGAN | |
CN105654422A (en) | Point cloud registration method and system | |
CN111508015B (en) | Building height extraction method and device based on three-dimensional live-action data | |
CN107492120A (en) | Point cloud registration method | |
CN105354850B (en) | Complex curved surface parts size three-dimensional matching detection method based on electric field property | |
CN111046459A (en) | Building model image design method based on 3D software | |
CN101882150A (en) | Three-dimensional model comparison and search method based on nuclear density estimation | |
CN103617336A (en) | Method for drawing aircraft noise contour map | |
CN102542543A (en) | Block similarity-based interactive image segmenting method | |
CN106338277A (en) | Baseline-based building change detection method | |
Wang et al. | EQSM: An efficient high quality surface grid generation method based on remeshing | |
Ren et al. | Intuitive and efficient roof modeling for reconstruction and synthesis | |
CN112085837B (en) | Three-dimensional model classification method based on geometric shape and LSTM neural network | |
CN109712174A (en) | A kind of point cloud of Complex Different Shape curved surface robot three-dimensional measurement mismatches quasi- filtering method and system | |
CN116541638B (en) | Aircraft skin repair processing path calculation method based on tensor voting | |
CN106815607B (en) | Contour line image data extraction method based on inverse distance weight interpolation inverse function | |
CN102663815B (en) | Level set-based method for constructing LOD2 building model |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |