kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An efficient algorithm to compute the X-ray transform
LSEC, ICMSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, People's Republic of China.
Princeton International School of Mathematics and Science, Princeton, NJ, USA.
Department of Computer Science, The Oden Institute for Computational Engineering and Sciences, University of Texas at Austin, Austin, TX, USA.
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).ORCID-id: 0000-0002-1118-6483
2022 (Engelska)Ingår i: International Journal of Computer Mathematics, ISSN 0020-7160, E-ISSN 1029-0265, Vol. 99, nr 7, s. 1325-1343Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We propose a new algorithm to compute the X-ray transform of an image represented by unit (pixel/voxel) basis functions. The fundamental task is equivalently calculating the intersection lengths of the ray with associated units. For the given ray, we derive the sufficient and necessary condition for non-vanishing intersectability. By this condition, we can distinguish the units that produce valid intersections with the ray. Only for those units, we calculate the intersection lengths by the obtained analytic formula. The proposed algorithm is adapted to various two-dimensional (2D)/three-dimensional (3D) scanning geometries, and its several issues are also discussed, including the intrinsic ambiguity, flexibility, computational cost and parallelization. The proposed method is fast and easy to implement, more complete and flexible than the existing alternatives with respect to different scanning geometries and different basis functions. Finally, we validate the correctness of the algorithm.

Ort, förlag, år, upplaga, sidor
Informa UK Limited , 2022. Vol. 99, nr 7, s. 1325-1343
Nyckelord [en]
65R32, 68U10, 92C55, 94A08, ambiguity and flexibility, intersection length, non-vanishing intersectability, projection matrix, tomographic image reconstruction, X-ray transform, Computerized tomography, Functions, Analytic formula, Computational costs, Intrinsic ambiguities, Parallelizations, Scanning geometry, Sufficient and necessary condition, Two Dimensional (2 D), X-ray transforms, X rays
Nationell ämneskategori
Matematisk analys
Identifikatorer
URN: urn:nbn:se:kth:diva-311206DOI: 10.1080/00207160.2021.1969017ISI: 000690307600001Scopus ID: 2-s2.0-85113620599OAI: oai:DiVA.org:kth-311206DiVA, id: diva2:1653208
Anmärkning

QC 20250508

Tillgänglig från: 2022-04-21 Skapad: 2022-04-21 Senast uppdaterad: 2025-05-08Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Öktem, Ozan

Sök vidare i DiVA

Av författaren/redaktören
Öktem, Ozan
Av organisationen
Matematik (Avd.)
I samma tidskrift
International Journal of Computer Mathematics
Matematisk analys

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 784 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf