Iterative static ∆B0 field map estimation for off-resonance correction in non-Cartesian susceptibility weighted imaging

International audiencePatient-induced inhomogeneities in the magnetic field cause distortions and blurring during acquisitions with long readouts such as in susceptibility-weighted imaging (SWI). Most correction methods require collecting an additional ∆B 0 field map to remove these artifacts. The static ∆B0 field map can be approximated with an acceptable error directly from a single echo acquisition in SWI. The main component of the observed phase is linearly related to ∆B0 and the echo time TE , and the relative impact of non-∆B0 terms becomes insignificant with TE > 20ms at 3T for a well-tuned system. The main step is to combine and unfold the multi-channel phase maps wrapped many times, and several competing algorithms are compared for this purpose. Four in vivo brain data sets collected using the recently proposed 3D SPARKLING readouts are used to assess the proposed method. The estimated 3D field maps generated with a 0.6 mm isotropic spatial resolution provide overall similar off-resonance corrections compared to reference corrections based on an external ∆B0 acquisitions, and even improved for two out of four individuals. Although a small estimation error is expected, no aftermath was observed in the proposed corrections, while degradations were observed in the references. A static ∆B0 field map estimation method was proposed to take advantage of acquisitions with long echo times, and outperformed the reference technique based on an external field map. The difference can be attributed to an inherent robustness to mismatches between volumes and external ∆B0 maps, and diverse other sources investigated

Correction d'inhomogénéités de champs pour la SWI non-cartésienne par estimation des cartes de champs

International audiencePatient-induced inhomogeneities in the magnetic field cause distortions and blurring during acquisitions with long echo times, as in susceptibility-weighted imaging. Most correction methods require collecting an additional ΔB0 field map. To avoid that, we propose a method to approximate this field map using the single echo acquisition only. The main component of the observed phase is linearly related to ΔB0 and TE, and the relative impact of non-ΔB0 terms becomes insignificant with TE>20ms at 3T. The estimated 3D field maps, produced at 0.6 mm isotropic under 3 minutes, provide equivalent corrections to acquired ones.Les inhomogénéités de champs induites par les patients sont à l'origine de distorsions et de floutages durant les acquisitions à temps d'écho longs, comme pour l'imagerie pondérée en susceptibilité. La plupart des méthodes de correction nécessitent d'acquérir une carte de champ ΔB0 additionnelle. Pour éviter cela, nous proposons une méthode pour approximer cette carte de champs en utilisant seulement l'acquisition à écho unique. La composante principale de la phase observée est linéairement liée au ΔB0 et au TE, et l'impact relatif des termes indépendants du ΔB0 deviennent négligeables pour TE>20ms à 3T. Les cartes 3D estimées, produites à 0.6 mm isotrope en moins de 3 minutes, permettent d'obtenir une correction équivalente aux cartes acquises

SCALABLE LOW COMPLEXITY CODER FOR HIGH RESOLUTION AIRBORNE VIDEO

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, NevadaReal-time transmission of airborne images to a ground station is highly desirable in many telemetering applications. Such transmission is often through an error prone, time varying wireless channel, possibly under jamming conditions. Hence, a fast, efficient, scalable, and error resilient image compression scheme is vital to realize the full potential of airborne reconnaisance. JPEG2000, the current international standard for image compression, offers most of these features. However, the computational complexity of JPEG2000 limits its use in some applications. Thus, we present a scalable low complexity coder (SLCC) that possesses many desirable features of JPEG2000, yet having high throughput.International Foundation for TelemeteringProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection

SCALABLE LOW COMPLEXITY CODER FOR HIGH RESOLUTION AIRBORNE VIDEO

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, NevadaReal-time transmission of airborne images to a ground station is highly desirable in many telemetering applications. Such transmission is often through an error prone, time varying wireless channel, possibly under jamming conditions. Hence, a fast, efficient, scalable, and error resilient image compression scheme is vital to realize the full potential of airborne reconnaisance. JPEG2000, the current international standard for image compression, offers most of these features. However, the computational complexity of JPEG2000 limits its use in some applications. Thus, we present a scalable low complexity coder (SLCC) that possesses many desirable features of JPEG2000, yet having high throughput.International Foundation for TelemeteringProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection

Synthesis of a Nonrecurrent Associative Memory Model Based on a Nonlinear Transformation in the Spectral Domain

A new nonrecurrent associative memory model is proposed. This model is composed of a nonlinear transformation in the spectral domain followed by the association. The MoorePenrose pseudoinverse is employed to obtain the least-squares optimal solution. Computer simulations are done to evaluate the performance of the model. The simulations use one-dimensional speech signals and two-dimensional head/shoulder images. Comparison of the proposed model with the classical optimal linear associative memory and an optimal nonlinear associative memory is presented. I. INTRODUCTION ASSOCIATIVE recall (memory) may be understood as an operation or transformation with a set of input signals or other items considered as keys, and some sort of outcome which constitutes the recall. In the simplest form both the key and the recall are spatial patterns of simultaneous signal values. Associative recall can be realized in electrical networks, optical filters, and as realizations of neural networks. The most ..