TWI307057B - A method for rendering three-dimension volume data - Google Patents
A method for rendering three-dimension volume data Download PDFInfo
- Publication number
- TWI307057B TWI307057B TW95102936A TW95102936A TWI307057B TW I307057 B TWI307057 B TW I307057B TW 95102936 A TW95102936 A TW 95102936A TW 95102936 A TW95102936 A TW 95102936A TW I307057 B TWI307057 B TW I307057B
- Authority
- TW
- Taiwan
- Prior art keywords
- line segment
- line
- points
- dimensional
- face
- Prior art date
Links
Landscapes
- Image Generation (AREA)
- Magnetic Resonance Imaging Apparatus (AREA)
- Image Processing (AREA)
Description
1307057 九、發明說明: 【發明所屬之技術領域】 本案係為一種顯示三維體積資料之方法,更特別 地,本發明是關於一種使用二維平面的方格來處理資 料,同時利用銳利特徵來偵測拓樸資訊以對三維體= 貧料進行表面擷取的顯示三維體積資料之方法。 【先前技術】 近年來’隨著電腦圖學(computergraphics)技術的 發展,科學視覺化(scientific visualizati〇n)的應用也隨 之快速地興起,相較於傳統上使用一堆數字的表示方 式,科學視覺化利關形、顏色及影像來呈現三維資 料的内容,使人更容易印象深刻且一目了然。 隨著影像技術的快速發展,利用各種不同的呈像 方法獲得所需的影像資訊(如:電腦斷層掃瞄CT、核 磁共振影像MRI、正子斷層攝影pET)。對於醫學而 言,人體内部構造的瞭解越來越受到重視,一些重要 的資訊往往埋藏在醫學影像中而無法被肉眼輕ί觀察 到’於是醫學影像處理變成1朗的研究領域。其 中二對於體積資料的處理,我們可藉由電腦斷層掃猫 取得人體器官各層的三維資#,再透過電腦圖學 (C〇mPUter graphiCS )的科學視覺化(scientific 技術,製作成我們所需的模型,讓醫師 能夠快速且清楚地瞭解三維資料的内容。 6 •1307057 所謂的體積資料(volume data )是指在規則的空 間格子點上賦予取樣值(sampling data ),其來源可來 自電腦斷層掃猫(computer tomography,CT )、核磁 共振影像(magnetic resonance imaging,MRI)或由三 維幾何外形轉換而來。於是,明確來說體積資料是由 許多連續的二維影像所重疊組合而成的三維立體資 料,例如使用電腦斷層掃瞄技術將人類的頭顱進行分 層掃瞄,可得到多張連續的二維灰階影像,再將這些 連續的影像重疊而形成三維的體積資料,又可稱為資 料集(dataset)。 而體積呈像(volume rendering)技術係為透過體 積資料在三維窆間中的定義,將不易觀察的三維資料 以二維影像的方式呈現,讓使用者易於瞭解體積資料 的内容,且因由體積資料所描述的物體,在原始資料 上並沒有明確的幾何描述,因而在顯示技術中就有以 下兩大分類: 第一類為直接式體積資料呈像方法(direct volume rendering ),像是光跡投影法(ray casting ),其方法是 從圖像中的每一像素以平行投影方式射出,並累加射 線所經過的voxel對像素在顏色上的貢獻,於是通常 要使用到整個體積資料的立體像素(voxels),適用在 較為模糊或有深度資訊的實體;以及 另一類是非直接式體積資料呈像方法(indirect volume rendering ),又可稱為曲面逼近法(surface 7 '1307057 fitting ),其方法是利用三角片貼附於體積資料上,進 而利用這些三角片來描繪物體表面,即是三維等值面 的操取(3D iso-surface extraction),適用於體積資料 有較為明顯的表面,此類方法以Lorensen與Cline兩 人所提出的 Marching Cubes 演算法(Lorensen W. E., Cline Η. Ε.: Marching cubes: A high resolution 3d surface construction algorithm. In Proceedings of ACM SIGGRAPH (1987),pp. 163—169,同時包含兩項美國專 利:US4,710,876以及US4,719,585 )為研究的先驅, 亦被視為解決等值面擷取的標準方法。 現今應用在三維體積資料上比較普遍的演算法是 marching cubes演算法,這也是應用的很普遍的繪製等 位面(equipotential surface )或者隱函數曲線之演算 法。其基本思想是按照空間座標將空間劃分成均等大 小的立方體(cube )。通過測試空間每一個立方體的每 一個頂點’針對所對應的應該在此cube座標應該繪製 的情況替換為一系列適當的三角片。最終所得的結果 就是一個近似於等位面的光滑表面。 然而前述的marching cubes演算法其對空間之分 析以二維立體方塊為基礎’且使用上一直存在下列問 題.如無法保留物體的銳利特徵(sharp features ),有 拓樸資訊不正確或不一致的情形,以及多重解析度需 要修補破洞(crack patching )。另外,在保留銳利特徵 時’上述的方法會引發額外的相依性(inter_eell 8 4307057 dependency)〇 •- 至於國内之相關研究多為多屬於醫療影像如 ' CT、MRI以及超音波影像等擷取及顯示之方法,或是 二維立體成像之技術,其實施之方法與特點仍未脫離 . 上述marching cubes演算法,仍是具有相同的缺陷。 . 縱上所述,由於現今在三維體積資料之顯示與表 面結構之擷取等技術仍有不足之處,因此發明人有鑑 於上述習知技術之缺失而發明出本案「顯示三維體籍 • 資訊之方法」。1307057 IX. Description of the invention: [Technical field to which the invention pertains] The present invention is a method for displaying three-dimensional volume data, and more particularly, the present invention relates to a method for processing data using a square of a two-dimensional plane while utilizing sharp features to detect A method for displaying three-dimensional volume data by performing topographic extraction on a three-dimensional body = poor material. [Prior Art] In recent years, with the development of computergraphics technology, the application of scientific visualization has rapidly emerged, compared to the traditional use of a bunch of digital representations. Scientific visualization of the shape, color and image to present the content of the three-dimensional data makes it easier to be impressed and at a glance. With the rapid development of imaging technology, various imaging methods are used to obtain the required image information (such as computed tomography CT, nuclear magnetic resonance imaging MRI, positron tomography pET). For medicine, the understanding of the internal structure of the human body has received more and more attention. Some important information is often buried in medical images and cannot be observed by the naked eye. Thus, medical image processing has become a research field of 1 lang. Among them, for the processing of volume data, we can obtain the three-dimensional capital of each layer of human organs by computerized tomography, and then use the scientific visualization of computer graphics (C〇mPUter graphiCS) to make what we need. The model allows the physician to quickly and clearly understand the content of the 3D data. 6 • 1307057 The so-called volume data refers to the sampling data given to the regular spatial grid points, the source of which can be derived from the computerized tomography sweep. Computer tomography (CT), magnetic resonance imaging (MRI) or three-dimensional geometric shape transformation. Therefore, the volume data is a three-dimensional combination of many continuous two-dimensional images. Data, such as the use of computerized tomography to stratify the human skull, can obtain multiple continuous two-dimensional grayscale images, and then overlay these continuous images to form three-dimensional volume data, also known as data Set (dataset). The volume rendering technique is based on volumetric data in 3D. The definition in the middle, the three-dimensional data that is difficult to observe is presented as a two-dimensional image, so that the user can easily understand the content of the volume data, and because the object described by the volume data does not have a clear geometric description on the original data, There are two major categories in display technology: The first is direct volume rendering, such as ray casting, which is from every pixel in the image. Shooting in parallel projection and accumulating the contribution of the voxel through the ray to the color of the pixel, so the voxels of the entire volume data are usually used for entities with more ambiguous or deep information; and the other Indirect volume rendering, also known as surface approximation (surface 7 '1307057 fitting ), which uses triangles to attach to volume data, and then uses these triangles to depict objects. The surface, which is the 3D iso-surface extraction, is suitable for volume data. Obvious surface, such method is based on the Marching Cubes algorithm proposed by Lorensen and Cline (Lorensen WE, Cline Η. Ε.: Marching cubes: A high resolution 3d surface construction algorithm. In Proceedings of ACM SIGGRAPH (1987), Pp. 163-169, which contains two US patents: US4,710,876 and US4,719,585) is a pioneer in research and is also considered a standard method for solving isosurface extraction. The more common algorithm used today in 3D volumetric data is the marching cubes algorithm, which is also a very common algorithm for plotting equipotential surfaces or implicit function curves. The basic idea is to divide the space into cubes of equal size according to the space coordinates. Each vertex of each cube through the test space is replaced with a series of appropriate triangles for the corresponding case where the cube coordinates should be drawn. The result is a smooth surface that approximates the equipotential surface. However, the aforementioned marching cubes algorithm based on the analysis of space is based on two-dimensional cubes. The following problems have always existed in use. For example, the sharp features of objects cannot be preserved, and the topology information is incorrect or inconsistent. And multiple resolutions require crack patching. In addition, when the sharp features are retained, the above method will cause additional dependence (inter_eell 8 4307057 dependency) 〇•- As far as domestic research is concerned, most of them are medical images such as 'CT, MRI and ultrasound images. And the method of display, or the technique of two-dimensional stereo imaging, the method and characteristics of its implementation are still not separated. The above-mentioned marching cubes algorithm still has the same defects. In the above, since the technology of capturing three-dimensional volume data and the surface structure is still in shortcoming, the inventor has invented the case "displaying three-dimensional body information and information" in view of the above-mentioned lack of the prior art. Method."
L贫明内容J 本案之主要目的在於提供一種顯示三維體積資訊 之方法,其轉變原本使用三維立方體的方式,改用二 維平面的方格來處理三維體積資訊,藉此可 : 理的維度’而以簡單快速的方式顯示三維的體積; 況,且同時達成重建物體的銳利特徵,另外可 利特徵來偵測拓樸資訊’空間無相依性,可平 處理’並且能以最精細的方式之支援多重解析度。 方本本f之又—目的為提供一種顯示三維體積資料之 在-三維空間中重建—物體的表面 :係包3下列步驟··⑷分割該三維空 ⑻產生同方向的複二等 錄該射線與該物體所交會之複數:樣 9 1307057 =:2:中:每一面中該等複數其中之兩個取樣點可 : Se_nt); (C)取得該等點的位置狀態 等線段的特2所包含之取樣點;(D)分別計算出該 一中士、知點(Sharp feature point) ;( E)於每一單 有的線段成為—線段環(C〇mponent),並 〇十算5亥線段環之料激& . γ ^、 點各自轉換為複數:角片t)=有線段環與其特徵 間關係將該等二角Γ 及(G)依一空 構。 角片進仃組合以重建該物體之表面結 根據上述構想,該等射線係以 生,該等射線係以向量方式記錄該等取樣唯式產 根據上述構推,該辇朴 , 該物體内而分為二物俨内鱼置狀態係依據是否位於 根據上逑構想型。 _ 兩個取樣點的法向量^該線段中之該 的交點而取得該線段之:::個切線’並以該兩個切線 根據上述構想,該步驟 進行分()更包含對所有面分別 中包含其内的所有線段。 的开可3 =想,該步驟(D)中之該線段在該面中 型態編:模糊型態’其中該簡單 模糊型態係輪中有=:::線段通過,而該 根據上述構想,該模糊能 徵點與其對應取樣嶋之延 10 1307057 為兩種組態。 單元==2=二之該線段環係透過該 段組合而構成。一間關係組合且將頭尾相連的線 環之==想’該步驟⑴之三角片係以該線段 衣之特U點為中點,對該線段環中之 線段環之特徵點而產生。 U兩兩配合該 勺人ΓΪ上述構想,該邊係由兩點所組成,或是複數條 包含其内的子邊cedge)連結而成。U稷數條 :據上述構想’該面係由包圍四個邊緣(上、下、L lean content J The main purpose of this case is to provide a method for displaying three-dimensional volume information, which transforms the original method of using a three-dimensional cube, and uses a two-dimensional plane to process three-dimensional volume information, thereby: The three-dimensional volume is displayed in a simple and fast manner; at the same time, the sharp features of the reconstructed object are achieved at the same time, and the topology information can be detected to detect the spatial non-interdependence, can be processed flatly and can be processed in the most subtle manner. Support multiple resolutions. The purpose of the present invention is to provide a three-dimensional volume data reconstruction in the three-dimensional space - the surface of the object: the following steps of the package 3 (4) segmentation of the three-dimensional space (8) to produce the same direction of the second-class recording of the ray and The number of intersections of the objects: 9 1307057 =: 2: Medium: Two of the complex points in each of the faces can be: Se_nt); (C) Get the positional state of the points, etc. The sampling point; (D) respectively calculate the sergeant, the sharp feature point; (E) the line segment of each single becomes the line segment ring (C〇mponent), and the 〇10 counts the 5 hai line segment The ring material stimulates & . γ ^, the points are each converted into a complex number: the corner piece t) = the relationship between the wire segment ring and its characteristics, the two corners Γ and (G) are in a space configuration. According to the above concept, the horns are combined to form a surface knot according to the above concept, and the ray systems are recorded in a vector manner according to the above-described configuration, according to the above-mentioned structure, the object is inside the object. The state of the fish in the two objects is based on whether it is based on the concept of the upper jaw. _ The normal vector of the two sampling points ^ the intersection point of the line segment to obtain the line segment::: a tangent line and according to the above two tangents, the step of dividing () is more included in all the faces Contains all the line segments within it. Open 3 = I think, the line segment in the step (D) is in the face type: fuzzy type 'where the simple fuzzy type wheel has the =::: line segment passed, and according to the above concept The fuzzy energy signature point and its corresponding sampling delay 10 1307057 are two configurations. The ring segment of the unit == 2 = two is formed by combining the segments. A line combination of the relationship and the head and tail connected to the ring == think that the triangle piece of the step (1) is generated by the U point of the line segment as the midpoint of the line segment ring in the line segment ring. The U and the two cooperate with the above-mentioned concept, and the side is composed of two points or a plurality of cedges including the same. U稷 number: According to the above concept, the face is surrounded by four edges (upper, lower,
Hbfa所組成,或是由數個包含於其内的子面 (sub_face)所組成。 根據上述構想,該單元係由上、下、左义 狀:二了向的面,或是由數個包含於其内的子;元 (sub-cell)所組成。 丁平兀 方法本用案目的為提供—種顯示三維體積資料之 将勺人一二維空間+重建一物體之表面結構,1 t = T驟:分割該三維空間以生成複數的點 一給Φ邊Μ#)及面(faCe)及單元(ceU);以 二:=__對該物體進行取樣;以向量 ’其中至少二個取樣點可構成-線段; :析通過母—邊之取樣點,·分析通過每一面之線段电 I::,每一單元中之上下左右前後六個方向 有線段’並連結該等線段成為-線段環;計 13〇7〇57 算》亥線段架之特徵點;以及以線段 對線段環中之所有取樣點兩兩配合上之 角片,冷二-^ 口上符敛點來產生三 =體之::^/⑽仙多^^^合以重建 俾有更深入之了:目的,可猎由下列實施方式說明,Hbfa consists of or consists of several sub-faces contained within it. According to the above concept, the unit is composed of upper, lower and left meanings: a bidirectional face, or a sub-cell consisting of a plurality of sub-cells contained therein. Ding Pingyi method The purpose of this project is to provide a three-dimensional space for displaying three-dimensional volume data + reconstructing the surface structure of an object, 1 t = T: dividing the three-dimensional space to generate a complex point-to-Φ BianΜ#) and face (faCe) and unit (ceU); sample the object with two:=__; take the vector 'in which at least two sample points can form a line segment;: analyze the sample point through the mother-edge ,························································································· Point; and all the sampling points in the line segment ring with the line segment, the cold two-^ mouth on the convergence point to produce three = body:: ^ / (10) cents ^ ^ ^ combined to reconstruct More in-depth: the purpose, can be hunted by the following implementation,
【實施方式】 文中:::下文中說明本發明,熟悉本技術者須瞭解下 中的说明僅係作為例證用,而不用於限制本發明。 料之2針對本案較佳實施狀示三維體積資 ^方法進行描述,但實際架構與採行之方法並不必The present invention is described below, and the description of the present invention is to be understood as being illustrative only and not limiting. Item 2 describes the three-dimensional volume method for the preferred embodiment of the present case, but the actual architecture and the method of adoption do not have to be described.
It!合描述之架構與方法,熟習本技藝者當能在 不脫離本發日狀實際㈣及範圍的情況下,做出種種 變化及修改。It! The structure and method of the description, the skilled person will be able to make various changes and modifications without departing from the actual (4) and scope of this issue.
一請參閱第一圖,其係為本發明所揭示之一種顯示 三維體積資料之方法的概要流程示意圖。本 維體積資料之方法可以在一三維空間中透過取樣與; 算而重建出-物體的表面結構,其主要係先將該物體 所處的三維空間進行分割101以生成複數的點 (voxel )、邊(edge )及面(face )及單元(c⑷),再 以一二維陣列形式而產生複數條同方向之射線1〇2, 而該等射線可分別與該物體交會而形成複數取樣點 (sample p〇int ),隨後沿著該射線的方向以向量形式 12 '1307057 點,所有取樣點的資訊皆可紀錄於射 可包含下列: 其資訊 1.位置;以及 2·法向量。 兩兩為一 ’其連線 在射線中,取樣點依其位置順序排序, 組:兩個取樣點係代表—段連續的實體區間 可稱為一線段(segment)。 -ft jc. iej γPlease refer to the first figure, which is a schematic flow chart of a method for displaying three-dimensional volume data disclosed in the present invention. The method of volumetric data of the present dimension can reconstruct the surface structure of the object through sampling and calculation in a three-dimensional space, which mainly divides the three-dimensional space in which the object is located to generate a complex point (voxel), An edge and a face and a cell (c(4)), in a two-dimensional array, generate a plurality of rays 1 in the same direction, and the rays respectively intersect with the object to form a plurality of sampling points ( Sample p〇int ), then in the direction of the ray in the form of a vector 12 '1307057 points, the information of all sampling points can be recorded in the shot can contain the following: its information 1. position; and 2 · normal vector. Two pairs are one ‘the line is in the ray, the sampling points are sorted according to their position order, group: two sampling points are representative—the continuous physical interval of the segment can be called a segment. -ft jc. iej γ
線進行取樣,即如第-圖所-列排列而成之射 绩* Γη 所不’其中虛線箭頭代表射 線,空心圈代表取樣點以及粗實線代表。 由於’整個空間是屬於三維空間’且每 =的射線皆為同方向’因此,本案可以分别依χ:陣 軸,Ζ車由,三個不同的方向來產生三個同 =列排狀轉,於是可以生的點、邊及: 早70 ’且牙透位於此三維”的物體而產生多個取 樣點。 此外,根據上面敘述,在三維空間中 之形式可由下列元素所構成: 1. 點(voxel or corner); 2. 邊(edge),由兩點所組成,或由數條包含於 ”内的子邊(sub-edge)連結而成; 3‘面(face),由包圍四個上、下、左、右的邊 所組成’或由數個包含於其_子面(sub_f獄)所組 成;以及 14 1307057 單元㈤。’有包圍六個方向(上下左右前 後)的面所組成,或由數個包含於其内的 (sub-cell)所組成。 對於所重建二維物體,其外觀則可由下列元素所 組成: ^ L 取樣點(sample point); 2 ·特徵點(sharp feature p〇int); 3.線段(segment);以及 4·線段環(component)。 列方:此用對於前述所取樣的三維空間,本案實施下 歹J方法用以重建二維物體之外觀: 一、 將所有點予以分類,分為物 兩種不同類型。 艘卜 二、 對所有邊進行分析,計算出 之所有取樣,點。 馨 三、 對所有的面進行分析,計算出其中包含於 之所有線段,並計算線段之特徵點。 、 四、 對所有的單元進行分析,連結所有的線段 成為線段環,並計算線段環之特徵點。 五、 將所有線段環與其特徵點轉換 (triangle)。 得侠馮二角片 而在上述第三項步驟中,本案利㈣ =以用Γ圖所列之5種組態來得出所有可能包含 在早一面中之線段型態。 15 i3〇7〇57 、而在第Γ圖中’組態0 (Case 0),組態1 (Case 以及組恶2 ( Case 2 )係屬於簡單型態,而組態3 ^ )為模糊型態,其中該簡單型態係為該面中 ^何線&或疋僅有—線段通過而該模糊型態係為該 面中有兩條線段通過。但該模糊型態則會具有組態3 ιThe line is sampled, that is, the scores arranged as shown in the first-graph-column * Γη are not where the dotted arrows represent the rays, the open circles represent the sampling points and the thick solid lines represent. Since 'the whole space belongs to the three-dimensional space' and the rays of each = are in the same direction', the case can be relied on: the front, the brake, and the three different directions to produce three identical rows. Thus, the points and edges that can be born are: 70's and the teeth are located in the three-dimensional object to generate a plurality of sampling points. Further, according to the above description, the form in the three-dimensional space can be composed of the following elements: Voxel or corner); 2. Edge, consisting of two points, or a number of sub-edges enclosed in "3" (face), surrounded by four The bottom, left, and right sides are composed of 'or consist of several _ sub-surfaces (sub_f prison); and 14 1307057 units (five). It consists of a face that surrounds six directions (up, down, left, and right) and is composed of several sub-cells. For a reconstructed two-dimensional object, its appearance can be composed of the following elements: ^ L sample point; 2 · sharp feature p〇int; 3. segment; and 4 segment segment ( Component). Columns: For the three-dimensional space sampled above, the 方法J method is used to reconstruct the appearance of the two-dimensional object: 1. All points are classified into two different types. Ships 2. Analyze all sides and calculate all the samples and points. Xin 3. Analyze all the faces, calculate all the segments included in them, and calculate the feature points of the segments. 4. Analyze all the units, connect all the line segments into line segments, and calculate the feature points of the line segments. 5. Convert all line segments and their feature points. In the third step above, in the third step above, the case (4) = use the five configurations listed in the figure to get all the line segments that may be included in the early side. 15 i3〇7〇57, and in the figure 'Configuration 0 (Case 0), configuration 1 (Case and group 2 (case 2) belong to simple type, and configuration 3 ^) is fuzzy State, wherein the simple type is the line in the face & or the only line segment passing through and the fuzzy form is the passage of two line segments in the face. But the fuzzy type will have the configuration 3 ι
3·υ以及組態3.2(CaSe3.2)兩種可能,於是 頁另^進仃分辨。而對於此點,本案係透過單一線 广中之邊兩個取樣點的法向量以取得兩個切線,並以 兩個切線的交點而取得該線段之特徵點,即如第五 =所不,其中v〇、V1、V2和%分別代表點,淺色 工心圈為取樣點,實線箭頭為其切線,深里 特徵點。 因此,藉由上述所偵測的特徵點,隨後透過於該 =中的兩條線&所運算㈣特徵點與其對應取樣點連 、、、。之延伸線段是否相交而可以分類為組態31或组離 3.2,若兩線段無相㈣情況,此類的自时類為組態 •卜若兩線段有相交的情況,此類的面的分類為組態 其中有相父情況的示意圖如第六圖所示。 一时而對於上述第四項步驟,本案係取得分別屬於單 早7L中其上下左右前後之六個方向的面,且找出所 有面中的線段,並將所有面,依其空間關係組合,最 =頭尾相連的線段組合起來成為線段環,而形成線 段環與產生線段環之特徵關概念形式則請參閱第七 圖之示意圖。 16 Ϊ307057 此外,有關於線段環特徵點的產生,本案係採用 Kobbelt et al 等人所提出之論文(Kobbelt L_ P., Botsch M., Schwanecke U., Seidel H.-P.: Feature sensitive surface extraction from volume data. In Proceedings of ACM SIGGRAPH (2001),pp. 57—66·)中所採行的方法 而用來運算出本案之線段環特徵點,其運算之概要說 明如下: 一個線段環係由複數個採樣點所構成,假設線段 環中共有n+1個採樣點,則令s〇,...,sn為線段環中之採 樣點,且n〇,...,nn為相對應採樣點的法向量,則: 以運算式Θ = min(/7 f ' )來計算出其法向量中最 大的張開角度Θ,且若該Θ係小於一個事先定義的數 值0sharp,則此線段環即包含有一個特徵點P。而一般 來說’建議的數值為0sharp = 〇.9。 另外,假設P點為該線段環之特徵點,理論上其 P點會與每個由取樣點與法向量所形成之平面相交, 因此,利用運算式:[…τν.·]7’;? =[…心可得出p點,該P 點即為該線段環之特徵點。 再則,在上述之第五項步驟,則是以線段環之特 徵點為中點,對線段環中之所有取樣點兩兩配合其對 應特徵點來產生三角片,其概要示意圖如第八圖所 示。最後所產生的各個三角片,則依照相對的空間關 係相互組合,進而重建出該三維物體之表面結構。 於是,本案發明提出了一個新的技術用來顯示三 17 ^ 1307057 維的體籍二欠a 貝這個新技術可同時達成重建物體的銳 η的t,保留—致的拓樸資訊,以及在不需要修補破 =情況下支援多重解析度。本案發明基本上與一般 ^為運用來來顯示體積資訊的_hing cubes技術相 此所有與體積資訊相關的應用都能轉換使用 案發明。如,醫療影像處理,三二 物件修復,虛擬雕刻..等。 成一、准3 · υ and configuration 3.2 (CaSe3.2) two possibilities, so the page is different. For this point, the case is to obtain two tangent lines through the normal vectors of the two sampling points on the side of the single line, and obtain the feature points of the line segment by the intersection of the two tangent lines, that is, as the fifth = no, Where v〇, V1, V2, and % represent points, respectively, the light-colored work core is the sampling point, the solid arrow is the tangent line, and the deep feature points. Therefore, by the above-mentioned detected feature points, the (four) feature points are then connected to the corresponding sample points through the two lines & Whether the extended line segments intersect can be classified into configuration 31 or group away from 3.2. If the two line segments have no phase (four), the self-time class of this type is the configuration. If the two line segments have intersections, the classification of such surfaces is A schematic diagram of the configuration in which there is a phase of the father is shown in the sixth figure. For the fourth step mentioned above, the case is to obtain the faces in the six directions of the upper and lower left and right of the 7L in the morning, and find the line segments in all the faces, and combine all the faces according to their spatial relationship. = The line segments connected at the beginning and the end are combined to form a line segment ring, and the conceptual form of forming a line segment ring and generating a line segment ring is shown in the schematic diagram of the seventh figure. 16 Ϊ 307057 In addition, regarding the generation of feature points of line segments, this paper uses the paper proposed by Kobbelt et al et al. (Kobbelt L_P., Botsch M., Schwanecke U., Seidel H.-P.: Feature sensitive surface extraction From Volume data. In Proceedings of ACM SIGGRAPH (2001), pp. 57-66·) is used to calculate the line segment feature points of this case. The summary of the operation is as follows: A plurality of sampling points are formed. If there are n+1 sampling points in the line segment ring, let s〇,...,sn be the sampling points in the line segment ring, and n〇,...,nn is the corresponding sampling The normal vector of the point, then: Calculate the maximum opening angle Θ in the normal vector with the expression Θ = min(/7 f ' ), and if the Θ system is less than a predefined value of 0sharp, then the line segment ring That is, it contains a feature point P. In general, the suggested value is 0sharp = 〇.9. In addition, suppose that point P is the characteristic point of the line segment ring. In theory, the point P will intersect with each plane formed by the sampling point and the normal vector. Therefore, the arithmetic expression: [...τν.·]7'; =[...the heart can get p point, which is the feature point of the line segment ring. Furthermore, in the fifth step, the feature point of the line segment ring is the midpoint, and all the sampling points in the line segment ring are matched with the corresponding feature points to generate a triangular piece, and the schematic diagram is as shown in the eighth figure. Shown. The resulting triangles are combined with each other according to relative spatial relationships to reconstruct the surface structure of the three-dimensional object. Therefore, the invention of the present invention proposes a new technique for displaying the three 17 ^ 1307057 dimension of the body 2 owing a shell. This new technology can simultaneously achieve the sharp η of the reconstructed object, retaining the topological information, and not Need to repair broken = support multiple resolutions. The invention of the present invention is basically compatible with the _hing cubes technology which is used to display volume information, and all applications related to volume information can be converted into use inventions. For example, medical image processing, three-two object restoration, virtual engraving, etc. Into one
、τ'上所述,本案確實可提供一種顯示三維體積資 λ之方法,其轉變原本使用方塊的方式,改用平面的 方,處理資料,並利用銳利特徵來偵測拓樸資訊而 以簡單快速的方式顯示三維的體積資訊,並同時達成 重建物體的銳利特徵、利用銳利特徵來侧拓樸資 訊、空間無相依性、可平行獨立處理以及能以最精細 的方式之支援多重解析度等功效,且所能產生的外 觀,為目前使用類似技術中誤差最小的方法。 、因此,本案顯示三維體積資料之方法的技術簡單 但卻可提供極高的便利十生’且彳以有效增進產業之進 步,本案技術簡單,可運用領域廣泛,實具產 值’爰依法提出發明專利申請。 ” 以上所述係利用較佳實施例詳細說明本發明,而 非限制本發明㈣ϋ,因此熟知此技藝的人士應能明 瞭,適當而作些微的改變與調整,仍將不失本發明之 要義所在,亦不脫離本發明之精神和範圍,故都應視 為本發明的進一步實施狀況。謹請貴審查委員明 18 1307057 鑑’並祈惠准,是所至禱。 本案得由熟習此技術之人士任施匠思而為諸^修 飾,然皆不脫本案申請專利範圍所欲保護者。又^ 【圖式簡單說明】 示三維體積 點之概念示 第一圖係為本案較佳實施例之一種顯 資料之方法的流程示意圖。As described above, τ', this case can indeed provide a method for displaying the three-dimensional volume λ, which changes the way of using the square, uses the plane of the plane, processes the data, and uses the sharp feature to detect the topology information and is simple. Quickly display 3D volume information, and at the same time achieve sharp features of reconstructed objects, sharp features for side topology, spatial non-dependency, parallel independent processing, and support for multiple resolutions in the most subtle way And the appearance that can be produced is the least error method in the current use of similar technology. Therefore, the method of displaying the three-dimensional volume data in this case is simple in technology, but it can provide a very high convenience for the ten students' and to effectively improve the progress of the industry. The technology of the present case is simple and can be applied in a wide range of fields, and the production value is 'in accordance with the law. patent application. The above description of the present invention will be described in detail by the preferred embodiments of the present invention, and is not to be construed as limiting the scope of the invention. Without departing from the spirit and scope of the present invention, it should be regarded as a further implementation of the present invention. I would like to ask your reviewer to clarify that it is a prayer. This case is familiar with this technology. The person who has been arbitrarily arbitrarily modified, but does not deviate from the scope of the patent application scope of the present application. Also ^ [Simple description of the schema] The concept of the three-dimensional volume point is shown in the preferred embodiment of the present invention. A schematic flow chart of a method for displaying data.
第二圖係為本案方法以射線紀錄取樣 意圖。 圃你局本案方法以 $ I干π饼夕丨】而成之 對空間進行取樣之概念示意圖。 ’、’· 第四圖係為本案方法中於每一面 的各種組態之概念示意圖。 π線&刀布 概念m係為本案方法中運料條線段的特徵點之 第六圖係為本案方法用來區 組態之概念示意圖。 H、中的不同 第七圖係為本案方法於每一 概念示意圖。 早凡中產生線段環之 第八圖係為本案方法於每一單元 概念示意圖。 產生一角片之 【主要元件符號說明】 19 1307057 101分割空間之步驟 102產生射線之步驟 103紀錄取樣點之步驟 104取得每一邊中的取樣點之步驟 105取得每一面中的線段之步驟 106分析線段型態之步驟 107將線段連結成線段環之步驟 108轉換為三角片之步驟 109重建物體表面結構之步驟The second figure is the intention of sampling the ray record for this method.圃 局 局 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本',' The fourth picture is a conceptual diagram of the various configurations on each side of the method in this case. Π-line & knife cloth Concept m is the feature point of the line segment of the method in this method. The sixth picture is a conceptual diagram of the method used for the configuration of this method. H, the difference in the seventh picture is the schematic diagram of each method in this case. The eighth figure that produces the line segment in the early days is the schematic diagram of the method in this case. Generating a corner piece [Major component symbol description] 19 1307057 101 Stepping space 102 step of generating a ray step 103 Recording a sample point step 104 Obtaining a sample point in each side Step 105 Obtaining a line segment in each side Step 106 Analysis line segment Step 107 of the type step of reconstructing the surface structure of the object by the step 109 of converting the line segment into a line segment and converting the step 108 into a triangular piece
Case 0組態0Case 0 configuration 0
Case 1組態1Case 1 configuration 1
Case 2組態1Case 2 configuration 1
Case 3.1 組態 3.1Case 3.1 Configuration 3.1
Case 3.2 組態 3.2 V點Case 3.2 Configuration 3.2 V point
2020
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW95102936A TWI307057B (en) | 2006-01-25 | 2006-01-25 | A method for rendering three-dimension volume data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW95102936A TWI307057B (en) | 2006-01-25 | 2006-01-25 | A method for rendering three-dimension volume data |
Publications (2)
Publication Number | Publication Date |
---|---|
TW200729078A TW200729078A (en) | 2007-08-01 |
TWI307057B true TWI307057B (en) | 2009-03-01 |
Family
ID=45071529
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
TW95102936A TWI307057B (en) | 2006-01-25 | 2006-01-25 | A method for rendering three-dimension volume data |
Country Status (1)
Country | Link |
---|---|
TW (1) | TWI307057B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TWI550416B (en) * | 2015-08-18 | 2016-09-21 | 國立交通大學 | Method of generated sampling form utilizing kernel subspace |
TWI607862B (en) * | 2014-12-12 | 2017-12-11 | 英華達股份有限公司 | Method and apparatus of generating a 3-d model from a, object |
-
2006
- 2006-01-25 TW TW95102936A patent/TWI307057B/en not_active IP Right Cessation
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TWI607862B (en) * | 2014-12-12 | 2017-12-11 | 英華達股份有限公司 | Method and apparatus of generating a 3-d model from a, object |
TWI550416B (en) * | 2015-08-18 | 2016-09-21 | 國立交通大學 | Method of generated sampling form utilizing kernel subspace |
Also Published As
Publication number | Publication date |
---|---|
TW200729078A (en) | 2007-08-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Yu et al. | Ec-net: an edge-aware point set consolidation network | |
Xu et al. | Disn: Deep implicit surface network for high-quality single-view 3d reconstruction | |
Nan et al. | Polyfit: Polygonal surface reconstruction from point clouds | |
Zhou et al. | Efficient skeletonization of volumetric objects | |
EP3633612A1 (en) | Method and system for segmenting image | |
Hu et al. | Efficient tree modeling from airborne LiDAR point clouds | |
Weber | Another link between archaeology and anthropology: virtual anthropology | |
US20240177307A1 (en) | Teeth segmentation using neural networks | |
JP2023512083A (en) | Segmentation of tooth group using neural network | |
CN109191510B (en) | 3D reconstruction method and device for pathological section | |
Chen et al. | Shape registration with learned deformations for 3D shape reconstruction from sparse and incomplete point clouds | |
Feng et al. | Feature-preserving triangular geometry images for level-of-detail representation of static and skinned meshes | |
Liu et al. | High-quality textured 3D shape reconstruction with cascaded fully convolutional networks | |
Gobron et al. | GPGPU computation and visualization of three-dimensional cellular automata | |
Yang et al. | A completely parallel surface reconstruction method for particle-based fluids | |
TWI307057B (en) | A method for rendering three-dimension volume data | |
de Moraes et al. | Medical volume rendering based on gradient information | |
Plath | 3D imaging of musical instruments: methods and applications | |
Wei et al. | Home environment augmented reality system based on 3d reconstruction of a single furniture picture | |
Imielinska et al. | Technical challenges of 3D visualization of large color data sets | |
Liang et al. | Fast hardware-accelerated volume rendering of CT scans | |
Shimabukuro et al. | Visualisation and reconstruction in dentistry | |
Masero et al. | Volume reconstruction for health care: a survey of computational methods | |
Eapen et al. | Elementary Methods for Generating Three‐Dimensional Coordinate Estimation and Image Reconstruction from Series of Two‐Dimensional Images | |
Liu et al. | VIV: Using visible internal volume to compute junction-aware shape descriptor of 3D articulated models |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
MM4A | Annulment or lapse of patent due to non-payment of fees |