完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, Tung-Kuang
dc.contributor.authorBrady, Martin L.
dc.date.accessioned2009-08-23T04:39:39Z
dc.date.accessioned2020-05-25T06:26:59Z-
dc.date.available2009-08-23T04:39:39Z
dc.date.available2020-05-25T06:26:59Z-
dc.date.issued2006-10-19T15:39:53Z
dc.date.submitted1998-12-17
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2017-
dc.description.abstractIn this paper we present a fast algorithm for the computation of plannar projections of a 3D image (i.e., the three-dimensional Radon Transform, or 3DRT) and the inverse problem of reconstruction a 3D image from its projections. For an N*N*N image I(x,y,z), it would generally require O(N^5) time to compute the projections of N^3 different planes, since each plane contains about N^2 sample points from I(x,y,z). Reconstruction of an N*N*N image from N^3 projections also would usually take O(N^5) time. Our fast approximate algorithm performs planar projection and backprojection in only O(N^3log N) time.
dc.description.sponsorship成功大學,台南市
dc.format.extent8p.
dc.format.extent730753 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1998 ICS會議
dc.subject.otherImage Segmentation
dc.titleA FAST APPROXIMATION ALGORITHM FOR 3D IMAGE RECONSTRUCTION
分類:1998年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001998000085.pdf713.63 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。