【摘要】：現(xiàn)在隨著物質(zhì)生活水平的不斷提高,人們對自身的健康狀況也更加的關(guān)心,同時對醫(yī)療手段也提出了更高的要求。手術(shù)導(dǎo)航系統(tǒng)結(jié)合了計算機(jī)、圖像處理和空間定位等多種先進(jìn)的科學(xué)技術(shù),使一些使用傳統(tǒng)手術(shù)方法無法完成或很難完成的手術(shù)成為可能。手術(shù)導(dǎo)航系統(tǒng)具有精度高和微創(chuàng)化的特點,相比以往,醫(yī)生可以在手術(shù)前使用手術(shù)導(dǎo)航系統(tǒng)進(jìn)行模擬手術(shù),這些都大大的提高了外科手術(shù)的安全性。手術(shù)導(dǎo)航系統(tǒng)符合了人們對新的先進(jìn)醫(yī)療技術(shù)的要求。本文的主要研究內(nèi)容是手術(shù)導(dǎo)航系統(tǒng)的關(guān)鍵技術(shù)之一空間配準(zhǔn)技術(shù),空間配準(zhǔn)就是將患者病灶所在的空間坐標(biāo)系和虛擬空間坐標(biāo)系統(tǒng)一在一個坐標(biāo)系內(nèi)。本文分別對成對點集的空間配準(zhǔn)和非成對點集的空間配準(zhǔn)進(jìn)行了研究。對于成對點集本文首先使用傳統(tǒng)的四元數(shù)算法和SVD矩陣分解法進(jìn)行配準(zhǔn),而對于非成對點集采用最近點迭代算法(Iterative Closest Point,ICP)算法進(jìn)行配準(zhǔn)。為了提高空間配準(zhǔn)的精度,針對成對點集的空間配準(zhǔn),本文結(jié)合了ICP算法對四元數(shù)算法進(jìn)行了改進(jìn);針對非成對點集的空間配準(zhǔn),本文結(jié)合了Delaunay剖分對ICP算法進(jìn)行了改進(jìn)。最后本文對提出的兩種改進(jìn)算法進(jìn)行了仿真實驗。通過對實驗結(jié)果的分析可知,兩種改進(jìn)的配準(zhǔn)算法在運算上花費的時間比之前要長,但是仍在可接受的范圍之內(nèi),與此同時在配準(zhǔn)精度上有了明顯的提高,達(dá)到了預(yù)期的效果。
[Abstract]:Now, with the continuous improvement of material living standards, people are more concerned about their own health, and put forward higher requirements for medical means. Surgical navigation system combines computer, image processing and spatial positioning and other advanced science and technology, making it possible to use traditional surgical methods can not complete or very difficult to complete the operation. Surgical navigation system has the characteristics of high precision and minimally invasive. Compared with the past, doctors can use surgical navigation system to simulate surgery before operation, which greatly improves the safety of surgery. The surgical navigation system meets the requirements of new advanced medical technology. The main research content of this paper is one of the key technologies of surgical navigation system. Spatial registration is to put the spatial coordinate system and virtual spatial coordinate system in one coordinate system. In this paper, the spatial registration of pairwise point sets and the spatial registration of non-pairwise point sets are studied respectively. In this paper, the traditional quaternion algorithm and SVD matrix decomposition method are used to register the pairwise point set, while the nearest point iterative algorithm (Iterative Closest Point,ICP) algorithm is used for the non-pairwise point set. In order to improve the accuracy of spatial registration, this paper improves the quaternion algorithm combined with ICP algorithm for the spatial registration of pairwise point sets, and improves the ICP algorithm with Delaunay partition for the spatial registration of non-pairwise point sets. Finally, two improved algorithms are simulated. Through the analysis of the experimental results, it can be seen that the operation time of the two improved registration algorithms is longer than before, but it is still within the acceptable range. At the same time, the registration accuracy has been obviously improved, and the expected results have been achieved.
【學(xué)位授予單位】：河北工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：R616;TP391.41

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 蔣成成;胡同森;周維;;一種改進(jìn)的迭代最近點算法[J];計算機(jī)系統(tǒng)應(yīng)用;2009年08期

，

本文編號：2495248