TW200910257A - System and method for cutting point clouds - Google Patents

System and method for cutting point clouds Download PDF

Info

Publication number
TW200910257A
TW200910257A TW96132489A TW96132489A TW200910257A TW 200910257 A TW200910257 A TW 200910257A TW 96132489 A TW96132489 A TW 96132489A TW 96132489 A TW96132489 A TW 96132489A TW 200910257 A TW200910257 A TW 200910257A
Authority
TW
Taiwan
Prior art keywords
point
points
point cloud
cloud
grid
Prior art date
Application number
TW96132489A
Other languages
Chinese (zh)
Other versions
TWI397022B (en
Inventor
Chih-Kuang Chang
Shan-Yang Fu
Xin-Yuan Wu
Xiao-Chao Sun
Original Assignee
Hon Hai Prec Ind Co Ltd
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 Hon Hai Prec Ind Co Ltd filed Critical Hon Hai Prec Ind Co Ltd
Priority to TW96132489A priority Critical patent/TWI397022B/en
Publication of TW200910257A publication Critical patent/TW200910257A/en
Application granted granted Critical
Publication of TWI397022B publication Critical patent/TWI397022B/en

Links

Landscapes

  • Processing Or Creating Images (AREA)

Abstract

A method for cutting point clouds is provided. The method includes the steps of: (a) receiving point clouds from a point clouds obtaining apparatus; (b) constructing a topological structure for the point clouds; (c) selecting a point from the point clouds; (d) searching plurality of points that are nearest to the selected point from the point clouds; (e) constructing a paraboloid according to the selected point and the points that are nearest to the selected point, calculating an equation of the paraboloid, and computing a curvature of the selected point according the equation; (f) repeating steps from (c) to (e), until all the points in the point clouds has been selected; and (g) cutting the point clouds according the curvatures of all points in the point clouds. A related system is also provided.

Description

200910257 九、發明說明: 【發明所屬之技術領域】 本發明涉及一種精簡系統及方法, 簡系統及方法。 、疋一種點雲精 【先前技術】 逆向工程是相對于正向工程而θ 已有產品的設計圖紙,麸彳I按 明向工轾疋指 ,τθ ^, …、後按圖紙加工出產品實物。而讳 向工私疋“速三維録射掃描輯已“逆 型)進行準確、高速的掃描,獲取貝物(樣叩或模 所獲點雲資料構建三維數位模型,點雲資料’根據 成產品的製造。 利用CAM系統完 目刚,利用二維鐳射掃描器 點雲資料-般密度較大,通常有數十^物件後’獲得的 千萬。而目前在逆向工程中 百萬、甚至上 度大都為…因此,時間耗費=構演算法的時間複雜 首要問題。 、疋σ工耘軟體需要解決的 里卜進”Λ的,利用三維鐘射掃描器掃描受測物件r龜 心貧料t,由於各種原因 又冰件仲到的 差,甚至會出現雜訊 奋于]的點雲資料有誤 滑。 ^樣會導致重構出來的面極不平 【發明内容】 馨於以上内纟,有必要提供 法,其可快速地對點發次以’、種點去精簡系統及方 個資料量少、不失真:二?精簡及過渡’以便獲得- 个夭具且較均勻的點雲。 200910257 服點雲精簡系統’包括應用飼服器。所述的應用飼 …科;拓撲結構建立模組, 撲結構,即將fi f 士 ΛΛ 疋.站π建立拓 Ρ將中的所有點建立起 組,用於根據上述建立的拓撲結構,為點 之距離最近㈣干個點,·曲率計,模㉟:哥找與 的點的曲率,即將某—點盘距離、曰=於计异點雲中 局部拋物面的擬人取近的若干個點進行 根據該-般方程式及曲 面:叙方私式,並 點雲精簡模組,用於= 曲率;及 該點雲設置的精簡度參數,對點雲進行产7及用戶對 =率與距離該點最近的若干:某 值在所述的精簡度參數範圍之 =丰千均值的差 不在精簡度參數範圍之内時,保㈣=該點,否則,若 個點::=法’該方法包括如下步禅··(〇從- ^筏取裝置中接收點雲資 ^ 撲結構,即將點雲中的所有的 μ上述點雲建立拓 云中的-個點;(d)根據上述的 ^,(c)選擇點 與該點距離最近的若干個Γ撲、,構,在點雲中尋找 的若干個點進行局部抛物面擬二f該點與距離該點最近 般方程式’並根據該拋物面的二局部抛物面的-計算出該點的曲率;重複上述㈣又ft 率計算公式 f雲中的所有的點的曲率都計到步驟⑷,直至 算出來的曲率,以及用戶對二::畢,及⑴根據上述計 亥點雲設置的精簡度參數,對 200910257 該點雲進行精簡處理。 相較於習知技術,本發 法,可以對三維鐳射掃描::的點雲精簡系統及方 簡,利用曲率差表示每個點資料進行精 度,對形變較小的平面,只=,.、占相靖點的形變程 冗餘點,對形變程度較大的 據仙掉其他 的點雲。 、 不失真且較均勻 【實施方式】 如圖1所示,是本發明點 體架構圖。該系統主要包括點統較佳實施例的硬 網路3及多個使用者端電腦4。 應、用伺服盗2、 其中分散式分佈的多個侈 應用飼服器2相連,網& =電腦4利用網路3與 ㈤咖),也可以是網㈣路了^ —企業内部網路 通訊網絡。 眼料(一)或其他類型的 、點雲獲取裝置!與應用飼服器2相連,用於 測物件得到的點雲資料。在 ' 田叉 取罗/ 佳實施方式中,該點雲獲 獲取點雲資料疋。一固二维錯射婦描器,其透過掃描受測物件 料=ΓΓ③2用於從點雲獲取裝置1中接收點雲資 枓,並對上述點雲進行精簡處理。 π貝 使用者端電腦4提供圖形處理介面,該圖形處理介面 -夠生成並顯示應用飼服器2匯入的點雲資料組成的圖 200910257 -.像,並可以顯示對點雲精簡後的結果。 如圖2所示,是本發明點雲精簡系統較佳實施例中應 ' 用伺服器2的功能模組圖。所述應用伺服器2主要包括:點 ’ 雲接收模組20、拓撲結構建立模組21、點選擇模組22、相 鄰點尋找模組23、曲率計算模組24、判斷模組25、點雲精 簡模組26及點雲輸出模組27。本發明所稱的模組是完成一 特定功能的電腦程式段,比程式更適合於描述軟體在電腦 中的執行過程,因此在本發明以下對軟體描述中都以模組 描述。 其中,所述點雲接收模組20用於從點雲獲取裝置1中 接收點雲資料,並在使用者端電腦4提供的圖形處理介面中 生成並且顯示上述點雲資料形成的圖像。 所述拓撲結構建立模組21主要用於為上述點雲建立 拓撲結構,即將點雲中的所有的點建立起關聯。該拓撲結 構建立模組21按照一個設定的網格間距Step將上述點雲所 在的立方體區域以一定的網格數目進行網格化以得到多個 V. 網格,並為每個網格設置序號,將每一個網格的序號與在 立方體空間内與該網格相鄰的26個網格的序號儲存在一個 列表中,從而將所有的網格之間建立起關聯。所述的網格 間距Step根據實際的情況可以設定不同的值,例如,用戶 希望每個網格中的點多,則網格間距Step的值可以設置的 大一些,若希望每個網格中的點少,則網格間距Step的值 可以小一些。 所述點選擇模組22用於在上述點雲中任意選擇其中 200910257 * 一個點(下稱:該點)。 =相鄰點尋找模組23用於根據上述建立的_結 十找與該點距離最近的若干個點。尋 =述相鄰點尋找模組23取得該= ^ ^ ^ 1 βη , 4异包括该網格在 内』個網格中所有點與該點的距離 近的若干個點。 距離„亥點取 若干=ΖΓ24主要用於將該點與距離該點最近的 =Γ本f佳實施例中為24〜32個點)進行局部拋物 :亚根據該抛物面的-般方程式,及曲率的 Λ式计异出該點的曲率。以下以 對所述曲率計算模组Μ的功能進行;;=明的曲率 々座m2 料將該24〜32個點在 標值下的座標值減去該點(原點)在原座標系下的座 拋物座::’將該點與所述24〜32個點進行局部 传到該局部抛物面的一般方程式: 2 Λ 3 Ν h.u: a200910257 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present invention relates to a simplification system and method, a simplified system and a method.疋一点云精 [Prior Art] Reverse engineering is a design drawing of θ existing products relative to forward engineering. Bran I is processed according to the Ming gong, τθ ^, ..., and then processed according to the drawings. . And the accurate and high-speed scanning of the "speed three-dimensional recording and scanning series" has been carried out to obtain the three-dimensional digital model of the point cloud data obtained by the sample or the model, and the point cloud data is based on the product. The use of CAM system to complete the eyes, the use of two-dimensional laser scanner point cloud data - the general density is large, usually there are dozens of objects after the 'obtained million. And currently in the reverse engineering million, even the upper Most of them are... Therefore, time consumption = the most complicated problem of the time of constructing the algorithm. 疋 耘 耘 耘 需要 需要 需要 需要 , , , , , , , , , , , , , 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用 利用Due to various reasons, the ice is too late, and even the noise of the point cloud is misleading. The sample will cause the reconstructed surface to be extremely uneven. [Inventive content] Provide a method that can quickly send points to ', a variety of points to streamline the system and a small amount of data, no distortion: two? streamlined and transition' in order to obtain - a more uniform point cloud of cookware. 200910257 Cloud streamlined system package Applying the feeding device. The application is applied to the family; the topology building module, the flapping structure, is to establish a set of all points in the π Ρ Ρ ,, for the topology established according to the above Structure, the distance of the point is the closest (four) dry point, · curvature meter, modulo 35: the curvature of the point that the brother finds, that is, the distance of a certain point-dot, 曰 = the proximity of the personification of the local paraboloid in the cloud The points are based on the general equation and surface: the Syrian private, and the point cloud simplification module for = curvature; and the simplification parameters of the point cloud setting, the point cloud production 7 and the user pair = rate and The nearest to the point: a value in the range of the concise parameter = the difference between the mean thousand is not within the range of the confinement parameter, the guarantee (four) = the point, otherwise, if the point:: = method ' The method includes the following steps: 〇 接收 接收 接收 筏 筏 筏 筏 筏 筏 筏 筏 筏 筏 筏 筏 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收 接收^, (c) select the number of points closest to the point, the structure, in the point cloud Find a number of points to perform a local paraboloid quasi-two f. The point is the closest equation to the point and calculate the curvature of the point according to the two-part paraboloid of the paraboloid; repeat the above (4) and ft rate calculation formula f in the cloud The curvature of all the points is counted in step (4) until the calculated curvature, and the user pairs 2::, and (1) the point cloud is streamlined according to the simplification parameter set by the above-mentioned counting point cloud. In the conventional technique, the three-dimensional laser scanning:: point cloud simplification system and square simplification, the curvature difference is used to express the accuracy of each point data, and the plane with smaller deformation is only =, . Jingdian's shape-variation redundant point, other points cloud with a greater degree of deformation, without distortion and more uniform [Embodiment] As shown in Fig. 1, it is a point structure diagram of the present invention. The system mainly includes a hard network 3 and a plurality of client computers 4 of the preferred embodiment. Should be, use the servo stolen 2, which is distributed among a number of extravagant application feeders 2, network & = computer 4 using network 3 and (5) coffee), or network (four) road ^ - corporate intranet Communication network. Eyes (a) or other types of point cloud acquisition devices! It is connected to the application feeder 2 for measuring the point cloud data obtained by the object. In the implementation method of 'Tianfu's Luo/Jia, the point cloud gets the point cloud data疋. A solid two-dimensional misdirected cropper, which scans the object to be tested = ΓΓ 32 for receiving point cloud information from the point cloud acquiring device 1, and streamlining the point cloud. The π 贝 user terminal computer 4 provides a graphic processing interface, which is capable of generating and displaying a graph of the point cloud data that is fed into the application server 2 200910257 -. and can display the result after the point cloud is reduced. . As shown in FIG. 2, it is a functional module diagram of the server 2 in the preferred embodiment of the point cloud reduction system of the present invention. The application server 2 mainly includes: a point cloud receiving module 20, a topology building module 21, a point selecting module 22, an adjacent point finding module 23, a curvature calculating module 24, a determining module 25, and a point. The cloud reduction module 26 and the point cloud output module 27. The module referred to in the present invention is a computer program segment for performing a specific function, and is more suitable for describing the execution process of the software in the computer than the program. Therefore, the following description of the software is described in the module. The point cloud receiving module 20 is configured to receive point cloud data from the point cloud acquiring device 1 and generate and display an image formed by the point cloud data in a graphic processing interface provided by the user terminal computer 4. The topology building module 21 is mainly used to establish a topology for the point cloud, that is, to associate all the points in the point cloud. The topology building module 21 meshes the cube area where the point cloud is located by a certain number of grids according to a set grid spacing Step to obtain a plurality of V. grids, and sets a sequence number for each grid. The serial number of each mesh is stored in a list with the serial numbers of the 26 meshes adjacent to the mesh in the cubic space, thereby associating all the meshes. The grid spacing Step can set different values according to actual conditions. For example, if the user wants more points in each grid, the grid spacing Step value can be set larger, if desired in each grid. If the number of points is small, the value of the grid spacing Step can be smaller. The point selection module 22 is configured to arbitrarily select one of the above-mentioned point clouds, 200910257*, a point (hereinafter referred to as: the point). The adjacent point finding module 23 is configured to find a number of points closest to the point according to the established _ knot. The contiguous point finding module 23 obtains the = ^ ^ ^ 1 βη , which includes a number of points in the grid in which all points in the grid are close to the point. The distance „海点取数=ΖΓ24 is mainly used to make the point closest to the point = 24 to 32 points in the preferred embodiment Γ f f 佳 进行 进行 进行 进行 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部 局部The Λ 计 计 出 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 This point (origin) is a parabolic seat under the original coordinate system: 'The general equation for the local transfer of the point to the local paraboloid from the 24 to 32 points: 2 Λ 3 Ν hu: a

N U; 2^4 11 200910257N U; 2^4 11 200910257

CC

其中:among them:

S6 N 的 其中U’ V’ h分別代表該點以及與所述24〜32個' ,y,z座標值;n代表進并—私I ( 茗所述相_尋卿έ 擬合#帥錄’例如’ 心二:“找板組23尋找到3。個與該點距離最近的 最後,所述曲率計算模組24利用曲率計算 Curvature = ( 4*a*c _ b*b ) / 2 计算出該點的曲率。 程相同 計算該點0其他點㈣率财與上述過 12 200910257 所述判斷模組2 5用於判斷是否點雲t的 率都已經計算完畢。若不是,則所述點選擇模組^選擇點 雲中另一個點。 ”· 所述點雲精簡模組2 6主要用於根據上述計算 所有點的曲率,及用戶對該點雲的精簡度要求^點♦推 :精簡處!。以下以對點雲中一個點進行精簡處理的:程 、十點雲精簡模組26的功能進行詳細說明: 首先,所述相_軸额23根據點雲 :尋找距離該點最近的若干個點,本較佳實施例中 =干個點為9〜15個點;計算該9〜⑸固點的 处 汁鼻該點的㈣與上述”平均值的差值用戶^ = ==,判斷該點是否應該被精簡 二 ===:==内;若在範 少,該點可以被精簡;否則,聋 面的形變較 』右小在乾圍之内,則%'明兮 :述9〜15點所組成的曲面的形變較大,該點不; 點雲中其他點的精簡處理與上述過程相同。 =雲f出模組27用於輸出精簡後的點雲。 二精簡方法較佳實施例的主流程圖。 雲㈣_〇’點雲接收模組2G從點雲獲取裝1中接收點 步驟S11,招禮纟士槐也 結構,即將點雲中的;立模組21為上述點雲建立拓撲 的所有的點建立起關聯。 200910257 . 步驟S12,點選擇模組22選擇點雲中的一個點(下稱: 該點)。 ' 步驟S13,相鄰點尋找模組23根據上述的拓撲結構, * 在點雲中尋找與該點距離最近的若干個點。在本實施例 中,此處的若干個點為24〜32個點。 步驟S14,所述曲率計算模組24將該點與上述得到的 距離該點最近的若干個點(24~32個)進行局部抛物面擬 合,並根據該抛物面的一般方程式及曲率的計算公式計算 出該點的曲率。 步驟S15,判斷模組25判斷是否點雲中的所有點的曲 率都已經計算完畢。若不是,則返回步驟S12,所述點選 擇模組22選擇點雲中另一個點。 若點雲中所有點的曲率都已經計算完畢,則步驟 S16,點雲精簡模組26根據上述計算出來的曲率,以及用 戶的精簡度要求,對該點雲進行精簡處理。 步驟S17,點雲輸出模組27輸出精簡後的點雲。 、 參閱圖4所示,是圖3中步驟S11建立點雲之間拓撲結 構的具體實施流程圖。 步驟S110,拓撲結構建立模組21按照一個設定的網格 間距Step將上述點雲所在的立方體區域以一定的網格數目 進行網格化,以得到多個網格。所述的網格間距Step根據 實際的情況可以設定不同的值,例如,用戶希望每個網格 中的點多,則網格間距Step的值可以設置的大一些,若希 望每個網格中的點少,則網格間距Step的值可以小一些。 14 200910257 步驟sill,拓撲結構建立模組21為每個網格 /驟如,該_結射域組21將其巾—個網序= 序说與在立方體空間内與該網格相鄰的26個網格的序 =在一個列表中’從而將該網格與其他網格之間建立_ 步驟S113,判_組25判岐否已將所 相鄰的網格之間建立起了《。若沒有,則:=; S112。否則,點雲之間的拓撲結構建立完畢。 , 參閱圖5所示,是圖3中步驟S13在點雲中尋找距 點最近的若干個點的具體實施流程圖。 步驟S130,所述相鄰點尋找模組23取得所選擇的點所 在的、、罔私序號,並根據該網格序號在上述列表中取得與該 網格在立方體空間内相鄰的26個網格。 步驟S131 ’判斷模組25判斷該點所在的網格及其相鄰 的26個網格’共27個網格内的點的總數是否不少於一個設 定的值。在本實施例中,該設定的值為24。 若該27個網格内的點的總數少於所設定的值,即少於 24 ’則步驟S132,所述相鄰點尋找模組23可以透過上述列 表,得到與該27個網格相鄰的其他網格。直至得到的網格 内的點的總數不少於24,則步驟S133,所述相鄰點尋找模 組23計算所得到的所有網格中的所有點與該點的距離’得 到距離該點最近的24〜32個點。 參閱圖6所示,是圖3中步驟S14計算一個點的曲率的 具體實施流程圖。 15 200910257 ^驟5140 ’所述曲率計算模組24建立以所選擇的點為 原點的局部座標系,則所述24〜32個點在該局部座標系下 的座標值分別為將該Μ〜%健在職標系下的座標值減 去該點(原點)在原座標系下的座標值。 ▲步驟S141 ’所述曲率計算模組24在局部座標系下 ㈣與所述24〜32個點進行局部拋物面擬合, 拋物面的一般方程式: 】涊局邛Where U' V' h of S6 N represents the point and the coordinates of the 24 to 32 ', y, z coordinates respectively; n represents the incorporation and private I ( 茗 the phase _ 寻卿 έ fit #帅录'For example' Heart 2: "Finding plate set 23 finds 3. The last closest to the point, the curvature calculation module 24 calculates Curvature = ( 4 * a * c _ b * b ) / 2 using the curvature calculation The curvature of the point is calculated. The same point is calculated. The other points of the point (4) rate and the above-mentioned 12 200910257 are used to determine whether the rate of the point cloud t has been calculated. If not, the point is Select module ^ to select another point in the point cloud. ”· The point cloud reduction module 26 is mainly used to calculate the curvature of all points according to the above, and the user needs to simplify the point cloud. The following is a detailed description of the functions of the process and the ten-point cloud streamlining module 26: First, the phase_axis amount 23 is based on the point cloud: finding the nearest distance from the point. a number of points, in the preferred embodiment, = dry points are 9 to 15 points; calculate the 9~(5) fixed point of the juice nose at the point (4) The above-mentioned difference between the average users ^ = ==, to determine whether the point should be reduced by two ===:==; if it is less, the point can be reduced; otherwise, the deformation of the face is smaller than the right Within the dry perimeter, %' alum: the deformation of the surface composed of 9~15 points is larger, and the point is not; the streamlining of other points in the point cloud is the same as the above process. = cloud f out module 27 For outputting the streamlined point cloud. The second flow chart of the preferred embodiment of the preferred embodiment. Cloud (four) _ 〇 'point cloud receiving module 2G from the point cloud to obtain the receiving point in the device 1 step S11, the ceremonial gentleman 槐The structure is about to be in the point cloud; the vertical module 21 establishes an association for all the points of the point cloud establishing topology. 200910257. In step S12, the point selection module 22 selects a point in the point cloud (hereinafter: the point) In step S13, the neighboring point finding module 23 searches for a plurality of points in the point cloud that are closest to the point according to the above-mentioned topological structure. In the embodiment, the points here are 24 to 32. Step S14, the curvature calculation module 24 compares the point with the obtained points closest to the point (24~32) perform local paraboloid fitting, and calculate the curvature of the point according to the general equation of the paraboloid and the calculation formula of the curvature. In step S15, the determining module 25 determines whether the curvature of all points in the point cloud has been The calculation is completed. If not, returning to step S12, the point selection module 22 selects another point in the point cloud. If the curvature of all the points in the point cloud has been calculated, then in step S16, the point cloud reduction module 26 is based on The point cloud is streamlined according to the calculated curvature and the user's simplification requirement. In step S17, the point cloud output module 27 outputs the streamlined point cloud. Referring to FIG. 4, it is a specific implementation flowchart of establishing a topology structure between point clouds in step S11 in FIG. In step S110, the topology building module 21 meshes the cube area where the point cloud is located by a certain number of grids according to a set grid spacing Step to obtain a plurality of grids. The grid spacing Step can set different values according to actual conditions. For example, if the user wants more points in each grid, the grid spacing Step value can be set larger, if desired in each grid. If the number of points is small, the value of the grid spacing Step can be smaller. 14 200910257 Step sill, the topology building module 21 is for each grid/sequence, the _junction domain group 21 has its towel-net sequence=preface and 26 adjacent to the grid in the cubic space. The order of the grids = in a list - thus establishing the grid with other grids - step S113, the judgment group 25 judges whether the adjacent grids have been established. If not, then: =; S112. Otherwise, the topology between the point clouds is established. Referring to FIG. 5, it is a specific implementation flowchart of searching for a number of points closest to the point in the point cloud in step S13 in FIG. Step S130, the neighboring point finding module 23 obtains the smuggling number of the selected point, and obtains 26 nets adjacent to the grid in the cubic space according to the grid number. grid. Step S131' determines whether the total number of points in the grid of 27 grids and the adjacent 26 grids of the point is not less than a set value. In the present embodiment, the set value is 24. If the total number of points in the 27 grids is less than the set value, that is, less than 24', then in step S132, the neighboring point finding module 23 can obtain the adjacent grid by using the above list. Other grids. Until the total number of points in the obtained grid is not less than 24, in step S133, the adjacent point finding module 23 calculates the distance of all points in all the obtained grids from the point 'to get the closest to the point 24 to 32 points. Referring to Fig. 6, there is shown a specific implementation flow chart for calculating the curvature of a point in step S14 of Fig. 3. 15 200910257 ^Step 5140 'The curvature calculation module 24 establishes a local coordinate system with the selected point as the origin, and the coordinate values of the 24 to 32 points under the local coordinate system are respectively % is the coordinate value under the standard coordinate system minus the coordinate value of the point (origin) under the original coordinate system. ▲Step S141' The curvature calculation module 24 performs local paraboloid fitting with the 24~32 points under the local coordinate system (4), the general equation of the paraboloid:

b = S1S5 - C =b = S1S5 - C =

SlS 5 - S 2S 4 其中:SlS 5 - S 2S 4 where:

ufv.Ufv.

16 2 20091025716 2 200910257

N NN N

其中,u,v,h分別代表該點以及與該點距離最近的 24〜32個點的X,y,z座標值;N代表進行拋物面擬合的點 的個數,例如,若所述相鄰點尋找模組23尋找到30個與該 點距離最近的點,則N=31。 步驟S142,所述曲率計算模組24利用曲率計算公式: Curvature = ( 4*a*c - b*b )/2 計算出該點的曲率。 參閱圖7所示,是圖3中步驟S16對點雲進行精簡處理 的具體實施流程圖。 步驟S160,用戶設置對點雲的精簡度要求,即輸入一 個精簡度參數。 步驟S161,點選擇模組22選擇點雲中的一個點。 步驟S162,點雲精簡模組26根據點雲之間的拓撲結構 尋找距離該點最近的9〜15個點(方法與上述圖5所示的步 驟相似)。 步驟S163,點雲精簡模組26計算出上述9〜15個點的曲 率平均值。 步驟S164,點雲精簡模組26計算該點的曲率與上述 9〜15個點的曲率平均值的差值。 步驟S165,點雲精簡模組26將上述計算出來的差值與 17 200910257 所設置的精簡度參數相比較,根據比較結果,為該點設置 不同的精簡標誌。若上述差值在所設置的精簡度參數範圍 之内,則說明該點與上述9〜15點所組成的曲面的形變較 少,該點可以被精簡,所述點雲精簡模組26可以將該點設 置精簡標誌為“1” ;否則,若上述差值不在用戶設置的精簡 度參數範圍之内,則說明該點與上述9〜15點所組成的曲面 的形變較大,該點不可以被精簡,所述點雲精簡模組26可 以將該點設置精簡標詰為“ 0 ”。 步驟S166,判斷模組25判斷是否該點所在的網格内的 所有點都已經設置了精簡標誌。 若該點所在的網格内退有點沒有被設置精簡標諸.,則 步驟S167,點選擇模組22選擇該網格内的其他點,然後回 到步驟S162。 否則,若該點所在的網格所有的點都已經設置精簡標 誌,則在步驟S168中,判斷模組25根據設置的精簡標誌判 斷是否該網格内所有的點都將被精簡,即是否該網格内的 所有點都被設置了標誌“1”。 若是,則步驟S169,點雲精簡模組26保留該網格内距 離中心位置最近的一個點,即將距離該網格中心位置最近 的一個點的精簡標誌修改為“0”。在每個網格中至少保留一 個點可以使精簡後的點雲分佈較均勻。 若該網格内至少有一個點可以保留,則步驟S170,判 斷模組25判斷是否該點雲中的所有點都已經設置了精簡標 18 200910257 . 若還有點沒有設置精簡標誌,則返回步驟S161,點選 擇模組22繼續選擇點雲中的另一個點。 ' 若該點雲中點所有的點都已經設置了精簡標誌,則步 • 驟S171,點雲精簡模組26根據上述設置的精簡標誌精簡點 雲中的點。 本發明所述的24〜32個點或者9〜15個點,只是經過驗 證後得到的較佳的取值範圍,對於其他的取值範圍都不應 該排除在本發明所保護的範圍之内。 f 本發明所提供的點雲精簡系統及方法可以對三維鐳 射掃描器掃描出的點雲資料進行精簡,利用曲率差表示每 個點相較於其相鄰點的形變程度,對形變較小的平面,只 保留必要的點,而精簡掉其他冗餘點,對形變程度較大的 曲面,根據精簡度要求決定保留的點數,因此可以獲得一 個資料量少、不失真且較均勻的點雲。進一步的,本發明 將點雲之間建立起了關聯,因此在計算距離某一點最近的 若干個點時,不用計算該點與點雲中所有點的距離,而透 過點雲之間的關聯,在距離該點較近的點中尋找,因此, 極大的提高了運算速度。 以上所述僅為本發明之較佳實施例而已,且已達廣泛 之使用功效,凡其他未脫離本發明所揭示之精神下所完成 之均等變化或修飾,均應包含在下述之申請專利範圍内。 【圖式簡單說明】 圖1是本發明點雲精簡系統較佳實施例的硬體架構 圖。 19 200910257 圖2是圖1中應用伺服器的功能模組圖。 圖3疋本發明點雲精簡方法較佳實施例的主流程圖。 圖4是圖3中步驟S11建立點 貝細*流程圖。 每之間拓撲結構的具體 若干圖3中步驟S13在點雲中尋找距離-點最近的 干個點的具體實施流程圖。 流程^是圖3中步驟S14計算1點的曲率的具體實施 圖7是圖3中步驟S16對點雲進 施流程圖。 π間處理的具體實 【主要元件符號說明】 點雲獲取裝置 應用伺服器 1 網路 2 使用者端電腦 3 點雲接收模組 4 抬撲結構建立模組 20 選擇模組 21 相鄰點尋找模組 22 曲率計算模組 23 判斷模組 24 點雲精簡模組 25 點雲輸出模組 26 接收點雲資料 27 S10 200910257 511 512 哥找與上述選擇的點距離 建立點雲之間的拓撲結構 選擇點雲中的—個點 根據上述的拓撲結構,在點雲中 最近的若干個點 S13 =選擇的賴上舰轉歸賴斜舰進行抛物面 擬合,計算出該點的曲率 點雲中所有點的曲率都已= 根據上述計算出來的# . 雲進行精簡處m U的曲率及精簡度的要求’對點 516 517 輪出精簡後的點雲 21Where u, v, h represent the point, and the X, y, z coordinate values of the nearest 24 to 32 points from the point; N represents the number of points at which the paraboloid fit is performed, for example, if the phase The neighbor finding module 23 finds 30 points closest to the point, then N=31. In step S142, the curvature calculation module 24 calculates the curvature of the point using the curvature calculation formula: Curvature = (4*a*c - b*b)/2. Referring to FIG. 7, it is a specific implementation flowchart of the process of streamlining the point cloud in step S16 in FIG. In step S160, the user sets a requirement for the simplicity of the point cloud, that is, inputs a simplification parameter. In step S161, the point selection module 22 selects a point in the point cloud. In step S162, the point cloud reduction module 26 searches for the closest 9 to 15 points from the point according to the topology between the point clouds (the method is similar to the step shown in Fig. 5 above). In step S163, the point cloud reduction module 26 calculates the average of the curvature values of the above 9 to 15 points. In step S164, the point cloud reduction module 26 calculates the difference between the curvature of the point and the average value of the curvature of the above 9 to 15 points. In step S165, the point cloud reduction module 26 compares the calculated difference with the simplification parameter set by 17 200910257, and sets different simplification flags for the point according to the comparison result. If the difference is within the set range of the simplification parameter, it means that the deformation of the surface formed by the point and the above 9~15 points is less, and the point can be simplified, and the point cloud simplification module 26 can At this point, the simplification flag is set to "1"; otherwise, if the difference is not within the range of the simplification parameter set by the user, it means that the deformation of the surface formed by the point and the above 9 to 15 points is large, and the point cannot be Being reduced, the point cloud reduction module 26 can set the point to a simplification standard of "0." In step S166, the judging module 25 judges whether all the points in the grid in which the point is located have been set with the compact flag. If the grid in which the point is located is not set to be reduced, then the point selection module 22 selects other points in the grid, and then returns to step S162. Otherwise, if all the points of the grid in which the point is located have been set with the streamlined flag, then in step S168, the determining module 25 determines whether all the points in the grid will be streamlined according to the set compact flag, that is, whether All points in the grid are set with the flag "1". If so, in step S169, the point cloud reduction module 26 retains a point in the grid that is closest to the center position, i.e., the reduced flag of a point closest to the center of the grid is modified to "0". Keeping at least one point in each grid makes the streamlined point cloud distribution more uniform. If at least one point in the grid can be reserved, then in step S170, the determining module 25 determines whether all the points in the point cloud have been set with the simplification standard 18 200910257. If there is still no point to set the condensed flag, then return to step S161. The point selection module 22 continues to select another point in the point cloud. ' If all the points in the point cloud have been set with the streamlined flag, then in step S171, the point cloud reduction module 26 condenses the points in the point cloud according to the reduced flag set above. The 24 to 32 points or 9 to 15 points of the present invention are only preferred ranges of values obtained after verification, and the other ranges of values should not be excluded from the scope of protection of the present invention. The point cloud simplification system and method provided by the invention can simplify the point cloud data scanned by the three-dimensional laser scanner, and use the curvature difference to express the degree of deformation of each point compared to its adjacent point, and the deformation is small. Plane, only retain the necessary points, and streamline other redundant points. For surfaces with a large degree of deformation, the number of points to be reserved is determined according to the requirements of the simplification, so that a point cloud with less data, no distortion and more uniformity can be obtained. . Further, the present invention establishes an association between point clouds, so when calculating a number of points closest to a certain point, it is not necessary to calculate the distance between the point and all points in the point cloud, and the association between the point clouds is Searching at a point closer to the point, thus greatly improving the speed of the operation. The above is only the preferred embodiment of the present invention, and has been used in a wide range of applications. Any other equivalent changes or modifications which are not departing from the spirit of the present invention should be included in the following claims. Inside. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a hardware architecture diagram of a preferred embodiment of the point cloud reduction system of the present invention. 19 200910257 Figure 2 is a functional block diagram of the application server of Figure 1. 3 is a main flow chart of a preferred embodiment of the point cloud reduction method of the present invention. Fig. 4 is a flow chart showing the step of establishing a point in step S11 of Fig. 3. The specific implementation flow chart of each of the topologies is shown in step S13 of Fig. 3 in the point cloud to find the closest point of the distance-point. The flow is a specific implementation of calculating the curvature of 1 point in step S14 in Fig. 3. Fig. 7 is a flowchart of the point cloud in step S16 in Fig. 3. π Inter-process processing [main component symbol description] Point cloud acquisition device application server 1 network 2 user terminal computer 3 point cloud receiving module 4 lifting structure establishment module 20 selection module 21 adjacent point finding module Group 22 curvature calculation module 23 judgment module 24 point cloud reduction module 25 point cloud output module 26 receiving point cloud data 27 S10 200910257 511 512 brother finds the point selection distance between the selected point point and the point cloud The point in the cloud is based on the above topology, and several points in the point cloud are the most recent points S13 = the selected Lai ship is converted to the parabolic ship for parabolic fitting, and all the points in the curvature point cloud of the point are calculated. The curvature has been = calculated according to the above #. Cloud to reduce the curvature and the degree of refinement of m U 'point to point 516 517 rounded down point cloud 21

Claims (1)

200910257 十、申請專利範圍: 1.::點雲精簡系統,包括應用伺服 伺服器包括: 〃r 所述應用 料^接收拉組’用於從一個點雲獲取裝置令接收點雲資 拓撲結構建立模組,用於 將點雲中的所有點建立起建立拓撲結構,即 相鄰點尋找模組,用於根據上述建立的招撲 雲中的點尋找與之距離最近的…構’為點 曲率計算模組,用於計算點 =… 點與距離該點最近的若干個 、’”、率,即將某一 得到該局部抛二行局部拋物峨^ 及曲率計算公柄算級點的㈣=據該—般方程式 點雲精簡模組,用於根據上述計算 對該點雲設置的精簡度參數 =及用戶 值的離該點最近的若干個點的曲率平均 ^差值在所述的精簡度參數範圍之 - 否則1不在精簡度參數範圍之内時,伴留=該點, 專利範圍第1項所述之點雲精簡系統,:中,所述 二撲結構建立模組建立拓撲結構是依據如下步: 二:=網Γ間距將點雲所在的立方體區域以二定 的凋格數目進行網格化以得到多疋 置序號;將每一個網格的序號與在立;體設 格相鄰的2 6個網格的序卢 -工間内與該網 的序途儲存在一個列表中,從而將所 22 200910257 有的網格之間建立起關聯。 3. 如申睛專利範圍第2 jg μ、+、 • —y ^ 边之點雲精簡系統,其中,所述 ’干個點雲中的點尋找與之距離最近的若 $L ... .在點^中選擇一個點;取得該 網格在立3 = 根據所述列表尋找與該點所在的 個網格中所有點與該點的距離,取得 距離該點取近的若干個點。 4. 如申請專利範圍第 率气^ 士弟項所述之點雲精簡系統,其中,在曲 述的若干個點為24〜32個點,在點雲 間拉組中所述的若干個點為9〜15個點。 5. ^種點雲精簡枝,財法包括如下㈣: a從-個點雲獲取裝置中接收點雲資料「 上述點雲建立拓撲結構,即將點雲中的所有點; (c)選擇點雲中的一個點; 的蝴結構,在㈣巾軸與該點距㈣ 該點最近的若干個點進行局部難 面的-==面的一般方程式,並根據卿 重複上、料算公式計算出該點的曲率丨 述乂驟(C)到步驟(e),直至點 率都計算完畢;及 r所有點的曲 ⑴《上述計算出來的曲率’以及用戶對該點雲設置 23 200910257 的精簡度參數,對該點雲進行精簡處理。 6·如申請專·圍第5韻述之點雲 步驟(b)包括: 方法,其中,所述 (bl)按照-個設定_袼間 妒卩祕LV — ΑΛ λ α ^上述點雲所在的立方 體£域以一疋的網格數目進的 (b2)為每個網格設置序號; 以传到多個網格; (b3)將其中—個網格的序號與在 格相鄰的26個網格的錢儲存在―;s内與該網 網格與其他網格之間建立起關聯,飞、中’從而將該 重複上述㈣㈤),鼓將财網 之間建立起了關聯。 …相拍網格 =申請翻仙第6韻叙點雲精簡 所 步驟(d)包括: /、T所述 ,並根據該網格序號在 體空間内相鄰的26個網 取得所選擇的點所在的網格序號 上述列表中取得與該網格在立方 格;及 计异包括該點所在網格在内’共27個網格中所有點鱼談 點的距離’取得距離該點最近的若干個點。 ”以 8. 如申請專利範圍第7項所述之點雲精簡方法,其 的若干個點為24〜32個點。 义 9. 如申請專利範圍第6項所述之點雲精簡方法, 步驟(f)包括: 即輸入一個精簡 (fi)用戶設置對點雲的精簡度要求, 度參數; 24 200910257 (f 2 )選擇點雲中的一個點; (f3 )根據點雲之問的知* 拓撲、、,°構哥找距離該點最近的若 干個點; J石 =)·計算該點的曲率與上述若干個點的曲率平均值的 ⑻將上述計算出來的差值與上述設置的精簡度來數 相比較,根據比較的結果,為唁 ]又/数 ()攸該點所在的網格内選擇其他的 (f3)到步驟(f5),直至哕點j 、’稷’ η罢在的網格内的所有點都 被纟又置了精間度標誌; ⑼根據設置的精簡標㈣斷是否該網 都將被精簡; 丨另幻點 ⑻若是’則保留軸格岐離中心位置最近的—個 改距離該網格中心位置最近的點的精簡度 ⑼重複步驟⑼到⑼,直至 被設置了精簡度標誌;及 另幻點都 (_根據上述設置的精簡標誌精簡點雲中的點。 10·如申請專利範圍第9項所述之點雲精簡方法,其中 述的若干個點為9〜15個點。 11·、如申請專利第5項所述之點雲精簡方法,其中 述的抛物面的一般方程式為: Ν hu/ N N N 25 % 200910257 其中: b = c =: ^2S 6 -S Is 5 ~ 5254 1 5 4200910257 X. Patent application scope: 1.:: Point cloud streamlining system, including application servo server includes: 〃r The application material ^ receiving pull group is used to acquire the device from a point cloud to make the receiving point cloud topology a module for establishing a topology in all points in the point cloud, that is, an adjacent point finding module, for finding a point closest to the point in the cloud according to the above-mentioned established cloud The calculation module is used to calculate the point =... the point closest to the point, the '', the rate, that is, the local quadratic parabola 及^ and the curvature calculation for the local scalar point (4) = The general equation point cloud simplification module is configured to calculate a simplification parameter of the point cloud according to the above calculation= and a curvature average value of a plurality of points of the user value closest to the point in the simplification parameter Scope - Otherwise 1 is not within the range of the simplification parameter, the mate = the point, the point cloud simplification system described in the first item of the patent scope, in which the second hop structure is established by the module to establish the topology is based on the following step : 2:=The distance between the grids and the cubes where the point cloud is located is meshed by the number of the number of stagnations to obtain the number of multiple tiling numbers; the serial number of each grid is adjacent to the erect; The order of the six grids is stored in a list with the order of the network, thus establishing a correlation between the grids of the 22200910257. 3. If the application scope is 2 jg μ, +, • -y ^ edge cloud reduction system, where the 'points in the point cloud look for the nearest $L .... select a point in point ^; get the grid In the vertical 3 = according to the list to find the distance from all the points in the grid where the point is located, and obtain a number of points close to the point. 4. If the patent application rate is the first rate The point cloud reduction system, wherein a plurality of points in the description are 24 to 32 points, and a plurality of points in the point cloud group are 9 to 15 points. 5. ^ Seed cloud reduction Branch, the financial method includes the following (4): a Receive point cloud data from a point cloud acquisition device "The above point cloud establishes a topology structure, It is about to point all the points in the cloud; (c) select a point in the point cloud; the butterfly structure, in the (four) towel axis and the point distance (four) the nearest point of the point to the local difficult face -== face general Equation, and calculate the curvature of the point according to the repeated calculation formula of the point (C) to step (e) until the point rate is calculated; and the curvature of all points of r (1) "The above calculated curvature 'And the user's streamlined parameter of the point cloud setting 23 200910257, the point cloud is streamlined. 6. The point cloud step (b) of applying the special 5th rhyme includes: method, wherein Bl) according to a setting _ 妒卩 妒卩 LV LV ΑΛ λ α ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ Grid; (b3) store the serial number of one of the grids and the 26 grids adjacent to the grid in the ";s" and establish an association between the grid and other grids, fly, medium 'There will be the repetition of the above (4) (five)), and the drums will establish an association between the financial networks. ...Photographing grid=Applying the sacred sixth rhyme point cloud reduction step (d) includes: /, T, and according to the grid number, the selected points are obtained in 26 adjacent networks in the body space. The grid number in the above list is obtained in the cube with the grid; and the distance including the grid where the point is located, the distance of all the points in the 27 grids is the closest to the point. a point. 8. The point cloud reduction method described in item 7 of the patent application scope has a number of points of 24 to 32 points. 9. The point cloud reduction method described in claim 6 of the patent scope, the steps (f) includes: inputting a streamlined (fi) user setting for the point cloud's simplification requirement, degree parameter; 24 200910257 (f 2 ) selecting a point in the point cloud; (f3) according to the point cloud's knowledge* Topology, ,, °, find the closest point to the point; J stone =) · Calculate the curvature of the point and the average of the curvature of the above points (8) to reduce the above calculated difference with the above settings According to the result of the comparison, select (f3) to step (f5) in the grid where the point is located, until the point j, '稷' η All the points in the grid are smashed and set the fine mark; (9) according to the set of the simplified standard (four) break whether the net will be streamlined; 丨 another magic point (8) if it is, then retain the axis grid closest to the center position Duplicate (9) of the point closest to the center of the grid Steps (9) to (9) until the simplification flag is set; and the other phantom points (_ simplifies the point cloud according to the condensed flag set above. 10. The point cloud simplification method as described in claim 9 of the patent scope, The several points mentioned therein are 9 to 15 points. 11. The point cloud reduction method described in claim 5, wherein the general equation of the paraboloid is: Ν hu/ NNN 25 % 200910257 where: b = c =: ^2S 6 -S Is 5 ~ 5254 1 5 4 N hivfy.uf ^ N «S6 = W,2..2 其中’公式中沾 若干個點的x,yU :,广別代表該點及距離該點最近的 的個數。y’z座標值,N代表進行拋物面擬合的點 12.如申請翻_第11項所述之點雲卜 述的曲率計算公式為: 1間方法,其中,所 Curvature =( 4*a*c — b*K \ 0 ) / 2。 26N hivfy.uf ^ N «S6 = W,2..2 where x is the number of points in the formula, yU :, the width represents the point and the nearest number to the point. Y'z coordinate value, N represents the point at which the paraboloid fit is performed. 12. The curvature calculation formula of the point cloud described in the application of the item 11 is: 1 method, where Curvature = (4*a* c — b*K \ 0 ) / 2. 26
TW96132489A 2007-08-31 2007-08-31 System and method for cutting point clouds TWI397022B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW96132489A TWI397022B (en) 2007-08-31 2007-08-31 System and method for cutting point clouds

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW96132489A TWI397022B (en) 2007-08-31 2007-08-31 System and method for cutting point clouds

Publications (2)

Publication Number Publication Date
TW200910257A true TW200910257A (en) 2009-03-01
TWI397022B TWI397022B (en) 2013-05-21

Family

ID=44724322

Family Applications (1)

Application Number Title Priority Date Filing Date
TW96132489A TWI397022B (en) 2007-08-31 2007-08-31 System and method for cutting point clouds

Country Status (1)

Country Link
TW (1) TWI397022B (en)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2003245483A1 (en) * 2002-06-12 2003-12-31 Spatial Integrated Systems, Inc. Discrete linear space sampling method and apparatus for generating digital 3d models
US6831641B2 (en) * 2002-06-17 2004-12-14 Mitsubishi Electric Research Labs, Inc. Modeling and rendering of surface reflectance fields of 3D objects

Also Published As

Publication number Publication date
TWI397022B (en) 2013-05-21

Similar Documents

Publication Publication Date Title
WO2021232687A1 (en) Deep learning-based point cloud upsampling method
US11601775B2 (en) Method for generating a customized/personalized head related transfer function
US20210366152A1 (en) Method and apparatus with gaze estimation
Takemoto et al. Mechanism for generating peaks and notches of head-related transfer functions in the median plane
JP7242882B2 (en) Information processing device, information processing device operation method, information processing device operation program
JP2021520568A (en) Tissue nodule detection method and its model Training method, equipment, equipment, system, and its computer program
GB2581374A (en) 3D Face reconstruction system and method
JP2012155723A (en) Method and apparatus for automatically generating optimal two-dimensional medical image from three-dimensional medical image
Rakotosaona et al. Learning delaunay surface elements for mesh reconstruction
JP2007181679A5 (en)
WO2015039375A1 (en) Method and system for automatically optimizing quality of point cloud data
Levi et al. Local computation algorithms for graphs of non-constant degrees
JP2023505899A (en) IMAGE DATA DETECTION METHOD AND DEVICE, COMPUTER DEVICE AND PROGRAM
Heymann Validation of 3D EM reconstructions: The phantom in the noise
CN111860664A (en) Ultrasonic plane wave composite imaging method, device and storage medium
Hogg et al. HRTF upsampling with a generative adversarial network using a gnomonic equiangular projection
CN112214684B (en) Seed-expanded overlapping community discovery method and device
TW200910257A (en) System and method for cutting point clouds
Zhao et al. Self-supervised arbitrary-scale implicit point clouds upsampling
Eastwood et al. Autonomous close-range photogrammetry using machine learning
CN115866238A (en) Feedback using coverage for object scanning
Zheng et al. Improvement of grayscale image segmentation based on pso algorithm
Schwartz et al. Surface detection and modeling of an arbitrary point cloud from 3D sketching
Azernikov et al. Emerging non-contact 3D measurement technologies for shape retrieval and processing
CN114764746A (en) Super-resolution method and device for laser radar, electronic device and storage medium

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees