Magnetic resonance imaging (MRI), which assists doctors in determining clinical staging and expected surgical range, has high medical value. A large number of MRI images require a large amount of storage space and the transmission bandwidth of the PACS system in offline storage and remote diagnosis. Therefore, high-quality compression of MRI images is very research-oriented. Current compression methods for MRI images with high compression ratio cause loss of information on lesions, leading to misdiagnosis; compression methods for MRI images with low compression ratio does not achieve the desired effect. Therefore, a fast fractal-based compression algorithm for MRI images is proposed in this paper. First, three-dimensional (3D) MRI images are converted into a two-dimensional (2D) image sequence, which facilitates the image sequence based on the fractal compression method. Then, range and domain blocks are classified according to the inherent spatiotemporal similarity of 3D objects. By using self-similarity, the number of blocks in the matching pool is reduced to improve the matching speed of the proposed method. Finally, a residual compensation mechanism is introduced to achieve compression of MRI images with high decompression quality. The experimental results show that compression speed is improved by 2-3 times, and the PSNR is improved by nearly 10. It indicates the proposed algorithm is effective and solves the contradiction between high compression ratio and high quality of MRI medical images.
With the development of technologies such as multimedia technology and information technology, a great deal of video data is generated every day. However, storing and transmitting big video data requires a large quantity of storage space and network bandwidth because of its large scale. Therefore, the compression method of big video data has become a challenging research topic at present. Performance of existing content-based video sequence compression method is difficult to be effectively improved. Therefore, in this paper, we present a fractal-based parallel compression method without content for big video data. First of all, in order to reduce computational complexity, a video sequence is divided into several fragments according to the spatial and temporal similarity. Secondly, domain and range blocks are classified based on the color similarity feature to reduce computational complexity in each video fragment. Meanwhile, a fractal compression method is deployed in a SIMD parallel environment to reduce compression time and improve the compression ratio. Finally, experimental results show that the proposed method not only improves the quality of the recovered image but also improves the compression speed by compared with existing compression algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.