摘要:
The present invention discloses methods for automatically generating regions of seeding points for fiber tracking in diffusion tensor images. These methods are based on connected region grow. Seeding point selection criteria involving Fractional Anisotropy thresholding and Dominant Eigen Vector similarity are also disclosed.
摘要:
A method of volume rendering two digital images includes providing a volume-rendering computing sub-system, loading a first image volume into a memory of the volume-rendering sub-system, rendering the first image volume, wherein a 2-dimensional image is output into an image buffer and a set of depth values are output into a depth buffer, loading a second image volume into a memory of the volume-rendering sub-system, rendering the second image volume up to the depth values output from the first image volume, wherein values from the rendering of the second image volume are merged with non-zero values of the image buffer, and rendering the remainder of the second image volume to include second image volume points beyond the depth values output from the rendering of the first image volume, wherein values from the rendering of the remainder of the second image volume are merged with non-zero values of the image buffer.
摘要:
A computer-implemented method for learning a tight frame includes acquiring undersampled k-space data over a time period using an interleaved process. An average of the undersampled k-space data is determined and a reference image is generated based on the average of the undersampled k-space data. Next, a tight frame operator is determined based on the reference image. Then, a reconstructed image data is generated from the undersampled k-space data via a sparse reconstruction which utilizes the tight frame operator.
摘要:
A computer-implemented method for learning a tight frame includes acquiring undersampled k-space data over a time period using an interleaved process. An average of the undersampled k-space data is determined and a reference image is generated based on the average of the undersampled k-space data. Next, a tight frame operator is determined based on the reference image. Then, a reconstructed image data is generated from the undersampled k-space data via a sparse reconstruction which utilizes the tight frame operator.
摘要:
A method for reconstructing parallel magnetic resonance images includes providing a set of acquired k-space MR image data y, and finding a target MR image x that minimizes ½∥Fv−y∥22+λ∥z∥1 where v=Sx and z=Wx where S is a diagonal matrix containing sensitivity maps of coil elements in an MR receiver array, F is an FFT matrix, W is a redundant Haar wavelet matrix, and λ≧0 is a regularization parameter, by updating x k + 1 = ( μ 1 I + μ 3 S H S ) - 1 [ μ 1 W H ( z k - b z k ) + μ 3 S H ( v k - b v k ) ] , z k + 1 = soft ( Wx k + 1 + b z k , 1 μ 1 ) where soft ( x , T ) = { x + T if x ≤ - T , 0 if x ≤ T , x - T if x ≥ T , and v k + 1 = ( F H F + μ 3 I ) - 1 [ F H y + μ 3 ( Sx k + 1 + b v k ) ] , where k is an iteration counter, μ1 and μ3 are parameters of an augmented Lagrangian function, and bz and bv are dual variables of the augmented Lagrangian.
摘要翻译:重建并行磁共振图像的方法包括提供一组获取的k空间MR图像数据y,并找到最小化½|Fv-y‖22+λ‖z‖1的目标MR图像x,其中v = Sx和z = Wx其中S是包含MR接收机阵列中的线圈元件的灵敏度映射的对角矩阵,F是FFT矩阵,W是冗余Haar小波矩阵,并且λ≥0是正则化参数,通过更新xk + 1 =( μ1 I +μ3 SH S) - 1[μ1 WH(zk-bzk)+μ3 SH(vk-bvk)],zk + 1 =软(Wx k + 1 + bzk,1μ1),其中软(x,T)= {x + T,如果üx≤-T,0如果üx≤T,x-T,如果üx≥T ,υ,υνvk + 1 =(FH F +μ3 I)-1 [FH y +μ3(Sx k + 1 + bvk)],其中k是迭代计数器,μ1和 μ3是增强拉格朗日函数的参数,bz和bv是增强拉格朗日的双变量。
摘要:
Certain exemplary embodiments can comprise a method that can comprise automatically causing a representation of body tissue to be rendered. The representation of the body tissue can comprise a plurality of voxels located in an interior region of the body tissue. Each of the plurality of voxels can have a negative value of an energy change function.
摘要:
Certain exemplary embodiments comprise a method, which can comprise automatically causing a representation of body tissue to be rendered. The body tissue can be tracked via clusters. The clusters each can comprise a predetermined number of particles. Each particle of a particular cluster can be representative of a discreet path associated with the particular cluster in a tensor field.
摘要:
A method for reconstructing parallel magnetic resonance images includes providing a set of acquired k-space MR image data y, and finding a target MR image x that minimizes ½∥Fv−y∥22+λ∥z∥1 where v=Sx and z=Wx where S is a diagonal matrix containing sensitivity maps of coil elements in an MR receiver array, F is an FFT matrix, W is a redundant Haar wavelet matrix, and λ≧0 is a regularization parameter, by updating x k + 1 = ( μ 1 I + μ 3 S H S ) - 1 [ μ 1 W H ( z k - b z k ) + μ 3 S H ( v k - b v k ) ] , z k + 1 = soft ( Wx k + 1 b z k , 1 μ 1 ) where soft ( x , T ) = { x + T if x ≤ - T , 0 if x ≤ T , x - T if x ≥ T , and v k + 1 = ( F H F + μ 3 I ) - 1 [ F H y + μ 3 ( Sx k + 1 + b v k ) ] , where k is an iteration counter, μ1 and μ3 are parameters of an augmented Lagrangian function, and bz and bv are dual variables of the augmented Lagrangian.
摘要翻译:重建并行磁共振图像的方法包括提供一组获取的k空间MR图像数据y,并找到最小化½|Fv-y‖22+λ‖z‖1的目标MR图像x,其中v = Sx和z = Wx其中S是包含MR接收器阵列中的线圈元件的灵敏度映射的对角矩阵,F是FFT矩阵,W是冗余Haar小波矩阵,并且λ> = 0是正则化参数,通过更新xk + 1 = (μ1 I +μ3 SH SH) - 1(zk-bzk)+ mu 3 SH(vk-bvk)],zk + 1 =软(Wx k + 1,bzk,1 mu 1)其中软(x,T)= {x + T如果x x = = T,如果x<= T,x - 其中k是迭代,其中k是迭代,其中k是迭代,其中k是迭代,其中k是迭代 计数器,mu1和mu3是增强的拉格朗日函数的参数,bz和bv是增强的拉格朗日的双重变量 ianㄧ。
摘要:
A system and method for prioritized transmission of scalable compressed data are provided, the system including a database server for receiving an interactive prioritization request from a client and prioritizing transmission of the compressed data relative to a bin optimization in response to the interactive prioritization request; and the method including receiving an interactive prioritization request from a client, prioritizing transmission of the compressed data relative to the bin optimization in response to the interactive prioritization request and transmitting the prioritized compressed data to the client.