scholarly journals Compressed-Sensing Magnetic Resonance Image Reconstruction Using an Iterative Convolutional Neural Network Approach

2020 ◽  
Vol 10 (6) ◽  
pp. 1902
Author(s):  
Fumio Hashimoto ◽  
Kibo Ote ◽  
Takenori Oida ◽  
Atsushi Teramoto ◽  
Yasuomi Ouchi

Convolutional neural networks (CNNs) demonstrate excellent performance when employed to reconstruct the images obtained by compressed-sensing magnetic resonance imaging (CS-MRI). Our study aimed to enhance image quality by developing a novel iterative reconstruction approach that utilizes image-based CNNs and k-space correction to preserve original k-space data. In the proposed method, CNNs represent a priori information concerning image spaces. First, the CNNs are trained to map zero-filling images onto corresponding full-sampled images. Then, they recover the zero-filled part of the k-space data. Subsequently, k-space corrections, which involve the replacement of unfilled regions by original k-space data, are implemented to preserve the original k-space data. The above-mentioned processes are used iteratively. The performance of the proposed method was validated using a T2-weighted brain-image dataset, and experiments were conducted with several sampling masks. Finally, the proposed method was compared with other noniterative approaches to demonstrate its effectiveness. The aliasing artifacts in the reconstructed images obtained using the proposed approach were reduced compared to those using other state-of-the-art techniques. In addition, the quantitative results obtained in the form of the peak signal-to-noise ratio and structural similarity index demonstrated the effectiveness of the proposed method. The proposed CS-MRI method enhanced MR image quality with high-throughput examinations.

Author(s):  
Indrarini Dyah Irawati ◽  
Sugondo Hadiyoso ◽  
Gelar Budiman ◽  
Asep Mulyana

Compressed sampling in the application of magnetic resonance imaging compression requires high accuracy when reconstructing from a small number of samples. Sparsity in magnetic resonance images is a fundamental requirement in compressed sampling. In this paper, we proposed the lifting wavelet transform sparsity technique by taking wavelet coefficients on the low pass sub-band that contains meaningful information. The application of novel methods useful for compressing data with the highest compression ratio at the sender but still maintaining high accuracy at the receiver. These wavelet coefficient values are arranged to form a sparse vector. We explore the performance of the proposed method by testing at several levels of lifting wavelet transform decomposition, include Levels 2, 3, 4, 5, and 6. The second requirement for compressed sampling is the acquisition technique. The data sampled sparse vectors using a normal distributed random measurement matrix. This matrix is normalized to the average energy of the image pixel block. The last compressed sampling requirement is a reconstruction algorithm. In this study, we analyze three reconstruction algorithms, namely Level 1 magic, iteratively reweighted least squares, and orthogonal matching pursuit, based on structural similarity index measured and peak signal to noise ratio metrics. Experimental results show that magnetic resonance imaging can be reconstructed with higher structural similarity index measured and peak signal to noise ratio using the lifting wavelet transform sparsity technique at a minimum decomposition level of 4. The proposed lifting wavelet transforms and Level 1 magic reconstruction algorithm has the best performance compared to the others at the measurement rate range between 10 to 70. This method also outperforms the techniques in previous studies.


MR imaging method is widely used for diagnosis applications. The echo signal received from the MR scanning machine is used to generate the image. The data acquisition and reconstruction are the important operations. In this paper the kspace is compressively sampled using Radial Sampling pattern for acquiring the k-space data and Particle Swarm Optimization (PSO) with Total Variation (TV) is used as the reconstruction algorithm for the faithful reconstruction of MR image. The experiments are conducted on MR images of Brain, Head Angiogram and Shoulder images. Performance of the proposed method of reconstruction is analyzed for different sampling kspace scanning percentages. The reconstruction results are compared with the standard sampling pattern used for compressive sampling prove the novelty of the proposed method. The results are verified in terms of Peak Signal to Noise Ratio (PSNR), Mean Squared Error (MSE) and Structural Similarity index (SSIM).


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Maria Murad ◽  
Abdul Jalil ◽  
Muhammad Bilal ◽  
Shahid Ikram ◽  
Ahmad Ali ◽  
...  

Magnetic Resonance Imaging (MRI) is an important yet slow medical imaging modality. Compressed sensing (CS) theory has enabled to accelerate the MRI acquisition process using some nonlinear reconstruction techniques from even 10% of the Nyquist samples. In recent years, interpolated compressed sensing (iCS) has further reduced the scan time, as compared to CS, by exploiting the strong interslice correlation of multislice MRI. In this paper, an improved efficient interpolated compressed sensing (EiCS) technique is proposed using radial undersampling schemes. The proposed efficient interpolation technique uses three consecutive slices to estimate the missing samples of the central target slice from its two neighboring slices. Seven different evaluation metrics are used to analyze the performance of the proposed technique such as structural similarity index measurement (SSIM), feature similarity index measurement (FSIM), mean square error (MSE), peak signal to noise ratio (PSNR), correlation (CORR), sharpness index (SI), and perceptual image quality evaluator (PIQE) and compared with the latest interpolation techniques. The simulation results show that the proposed EiCS technique has improved image quality and performance using both golden angle and uniform angle radial sampling patterns, with an even lower sampling ratio and maximum information content and using a more practical sampling scheme.


2021 ◽  
pp. 2726-2739
Author(s):  
Jalal H. Awad ◽  
Balsam D. Majeed

     Various document types play an influential role in a lot of our lives activities today; hence preserving their integrity is an important matter. Such documents have various forms, including texts, videos, sounds, and images.  The latter types' authentication will be our concern here in this paper. Images can be handled spatially by doing the proper modification directly on their pixel values or spectrally through conducting some adjustments to some of the addressed coefficients. Due to spectral (frequency) domain flexibility in handling data, the domain coefficients are utilized for the watermark embedding purpose. The integer wavelet transform (IWT), which is a wavelet transform based on the lifting scheme, is adopted in this paper in order to provide a direct way for converting image pixels' integer values to integer coefficient values rather than floating point coefficients that could be produced by the traditional wavelet transform. This direct relation can enhance the processed image quality due to avoiding the rounding operations on the floating point coefficients. The well-known parity bit approach is also utilized in this paper as an authentication mechanism, where 3 secret parity bits are used for each block in an image which is divided into non-overlapped blocks in order to enforce a form of fragile watermark approach. Thus, any alteration in the block pixels could cause the adopted (even) parity to be violated. The fragile watermarking is achieved through the modification of least significant bits ((LSBs) of certain frequency coefficients' according to the even parity condition. In spite of this image watermarking operation, the proposed method is efficient. In order to prove the efficiency of our proposed method, it was tested against standard images using measurements like peak signal to noise ratio (PSNR) and structural similarity index (SSIM).  Experiments showed promising results; the method preserves high image quality (PSNR≈ 44.4367dB, SSIM≈ 0.9956) and good tamper detection capability.


Sensors ◽  
2021 ◽  
Vol 21 (18) ◽  
pp. 6208
Author(s):  
Jose Balsa ◽  
Óscar Fresnedo ◽  
José A. García-Naya ◽  
Tomás Domínguez-Bolaño ◽  
Luis Castedo

This work considers the design and practical implementation of JSCC-Cast, a comprehensive analog video encoding and transmission system requiring a reduced amount of digital metadata. Suitable applications for JSCC-Cast are multicast transmissions over time-varying channels and Internet of Things wireless connectivity of end devices having severe constraints on their computational capabilities. The proposed system exhibits a similar image quality compared to existing analog and hybrid encoding alternatives such as Softcast. Its design is based on the use of linear transforms that exploit the spatial and temporal redundancy and the analog encoding of the transformed coefficients with different protection levels depending on their relevance. JSCC-Cast is compared to Softcast, which is considered the benchmark for analog and hybrid video coding, and with an all-digital H.265-based encoder. The results show that, depending on the scenario and considering image quality metrics such as the structural similarity index measure, the peak signal-to-noise ratio, and the perceived quality of the video, JSCC-Cast exhibits a performance close to that of Softcast but with less metadata and not requiring a feedback channel in order to track channel variations. Moreover, in some circumstances, the JSCC-Cast obtains a perceived quality for the frames comparable to those displayed by the digital one.


Author(s):  
Mahesh Satish Khadtare

This chapter deals with performance analysis of CUDA implementation of an image quality assessment tool based on structural similarity index (SSI). Since it had been initial created at the University of Texas in 2002, the Structural SIMilarity (SSIM) image assessment algorithm has become a valuable tool for still image and video processing analysis. SSIM provided a big giant over MSE (Mean Square Error) and PSNR (Peak Signal to Noise Ratio) techniques because it way more closely aligned with the results that would have been obtained with subjective testing. For objective image analysis, this new technique represents as significant advancement over SSIM as the advancement that SSIM provided over PSNR. The method is computationally intensive and this poses issues in places wherever real time quality assessment is desired. We tend to develop a CUDA implementation of this technique that offers a speedup of approximately 30 X on Nvidia GTX275 and 80 X on C2050 over Intel single core processor.


2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Jianping Huang ◽  
Lihui Wang ◽  
Yuemin Zhu

Compressed Sensing Magnetic Resonance Imaging (CS-MRI) is a promising technique for accelerating MRI acquisitions by using fewer k-space data. Exploiting more sparsity is an important approach to improving the CS-MRI reconstruction quality. We propose a novel CS-MRI framework based on multiple sparse priors to increase reconstruction accuracy. The wavelet sparsity, wavelet tree structured sparsity, and nonlocal total variation (NLTV) regularizations were integrated in the CS-MRI framework, and the optimization problem was solved using a fast composite splitting algorithm (FCSA). The proposed method was evaluated on different types of MR images with different radial sampling schemes and different sampling ratios and compared with the state-of-the-art CS-MRI reconstruction methods in terms of peak signal-to-noise ratio (PSNR), feature similarity (FSIM), relative l2 norm error (RLNE), and mean structural similarity (MSSIM). The results demonstrated that the proposed method outperforms the traditional CS-MRI algorithms in both visual and quantitative comparisons.


2020 ◽  
Vol 25 (2) ◽  
pp. 86-97
Author(s):  
Sandy Suryo Prayogo ◽  
Tubagus Maulana Kusuma

DVB merupakan standar transmisi televisi digital yang paling banyak digunakan saat ini. Unsur terpenting dari suatu proses transmisi adalah kualitas gambar dari video yang diterima setelah melalui proses transimisi tersebut. Banyak faktor yang dapat mempengaruhi kualitas dari suatu gambar, salah satunya adalah struktur frame dari video. Pada tulisan ini dilakukan pengujian sensitifitas video MPEG-4 berdasarkan struktur frame pada transmisi DVB-T. Pengujian dilakukan menggunakan simulasi matlab dan simulink. Digunakan juga ffmpeg untuk menyediakan format dan pengaturan video akan disimulasikan. Variabel yang diubah dari video adalah bitrate dan juga group-of-pictures (GOP), sedangkan variabel yang diubah dari transmisi DVB-T adalah signal-to-noise-ratio (SNR) pada kanal AWGN di antara pengirim (Tx) dan penerima (Rx). Hasil yang diperoleh dari percobaan berupa kualitas rata-rata gambar pada video yang diukur menggunakan metode pengukuran structural-similarity-index (SSIM). Dilakukan juga pengukuran terhadap jumlah bit-error-rate BER pada bitstream DVB-T. Percobaan yang dilakukan dapat menunjukkan seberapa besar sensitifitas bitrate dan GOP dari video pada transmisi DVB-T dengan kesimpulan semakin besar bitrate maka akan semakin buruk nilai kualitas gambarnya, dan semakin kecil nilai GOP maka akan semakin baik nilai kualitasnya. Penilitian diharapkan dapat dikembangkan menggunakan deep learning untuk memperoleh frame struktur yang tepat di kondisi-kondisi tertentu dalam proses transmisi televisi digital.


2021 ◽  
Vol 21 (1) ◽  
pp. 1-20
Author(s):  
A. K. Singh ◽  
S. Thakur ◽  
Alireza Jolfaei ◽  
Gautam Srivastava ◽  
MD. Elhoseny ◽  
...  

Recently, due to the increase in popularity of the Internet, the problem of digital data security over the Internet is increasing at a phenomenal rate. Watermarking is used for various notable applications to secure digital data from unauthorized individuals. To achieve this, in this article, we propose a joint encryption then-compression based watermarking technique for digital document security. This technique offers a tool for confidentiality, copyright protection, and strong compression performance of the system. The proposed method involves three major steps as follows: (1) embedding of multiple watermarks through non-sub-sampled contourlet transform, redundant discrete wavelet transform, and singular value decomposition; (2) encryption and compression via SHA-256 and Lempel Ziv Welch (LZW), respectively; and (3) extraction/recovery of multiple watermarks from the possibly distorted cover image. The performance estimations are carried out on various images at different attacks, and the efficiency of the system is determined in terms of peak signal-to-noise ratio (PSNR) and normalized correlation (NC), structural similarity index measure (SSIM), number of changing pixel rate (NPCR), unified averaged changed intensity (UACI), and compression ratio (CR). Furthermore, the comparative analysis of the proposed system with similar schemes indicates its superiority to them.


Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5540
Author(s):  
Nayeem Hasan ◽  
Md Saiful Islam ◽  
Wenyu Chen ◽  
Muhammad Ashad Kabir ◽  
Saad Al-Ahmadi

This paper proposes an encryption-based image watermarking scheme using a combination of second-level discrete wavelet transform (2DWT) and discrete cosine transform (DCT) with an auto extraction feature. The 2DWT has been selected based on the analysis of the trade-off between imperceptibility of the watermark and embedding capacity at various levels of decomposition. DCT operation is applied to the selected area to gather the image coefficients into a single vector using a zig-zig operation. We have utilized the same random bit sequence as the watermark and seed for the embedding zone coefficient. The quality of the reconstructed image was measured according to bit correction rate, peak signal-to-noise ratio (PSNR), and similarity index. Experimental results demonstrated that the proposed scheme is highly robust under different types of image-processing attacks. Several image attacks, e.g., JPEG compression, filtering, noise addition, cropping, sharpening, and bit-plane removal, were examined on watermarked images, and the results of our proposed method outstripped existing methods, especially in terms of the bit correction ratio (100%), which is a measure of bit restoration. The results were also highly satisfactory in terms of the quality of the reconstructed image, which demonstrated high imperceptibility in terms of peak signal-to-noise ratio (PSNR ≥ 40 dB) and structural similarity (SSIM ≥ 0.9) under different image attacks.


Sign in / Sign up

Export Citation Format

Share Document