Fast hierarchical reprojection algorithm for tomography

G - Physics – 06 – T

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06T 11/00 (2006.01) A61B 6/03 (2006.01)

Patent

CA 2398729

A method for reprojecting images (32, 76) into sinograms (74, 112) includes the steps of recursively dividing a two-dimensional image (32, 76) into sub-images (34, 36, 38, 40) (78, 80, 82, 84) as small as one pixel and reprojecting the sub-images at the same or a smaller number of orientations to form subsinograms (42, 44, 46, 48) (86, 88, 90, 92). These subsinograms (42, 44, 46, 48)(86, 88, 90, 92) are then successively aggregated and processed to form a full sinogram (74, 112). The method uses two algorithms to aggregate the sub- sinograms. In one algorithm, the aggregation is exact, and in the other algorithm, aggregation is an approximation. The first algorithm is accurate, but relatively slow, and the second algorithm is faster, but less accurate. By performing some aggregations with the exact algorithm and some aggregations with the approximate algorithm, switching between the two algorithms in one of a number of suitable ways, an accurate result can be obtained quickly.

La présente invention concerne une procédé permettant la reprojection d'images (32, 76) en sinogrammes (74, 112), ledit procédé comprenant les étapes de subdivision récursive d'une image en deux dimensions (32, 76) en sous-images (34, 36, 38, 40) (78, 80, 82, 84) aussi petites qu'un pixel, et de reprojection des sous-images dans un nombre inférieur ou égal d'orientations pour former des sous-sinogrammes (42, 44, 46, 48) (86, 88, 90, 92). Ces sous-sinogrammes (42, 44, 46, 48) (86, 88, 90, 92) sont ensuite successivement regroupés et traités pour former un sinogramme complet (74, 112). Le procédé fait intervenir deux algorithmes servant à regrouper les sous-sinogrammes. Dans un algorithme, le regroupement est exact, et dans l'autre algorithme, le regroupement est approximatif. Le premier algorithme est précis, mais relativement lent, et le second algorithme est plus rapide, mais moins précis. La réalisation de certains regroupements avec l'algorithme exact et de certains autres regroupements avec l'algorithme approximatif, et le passage d'un algorithme à l'autre d'une manière convenable parmi plusieurs autres, permet d'obtenir rapidement un résultat précis.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Fast hierarchical reprojection algorithm for tomography does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast hierarchical reprojection algorithm for tomography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast hierarchical reprojection algorithm for tomography will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1897729

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.