A 3-D discrete hartley transform coder for compression of Magnetic Resonance images
In this paper, a 3-D discrete Hartley transform coder is proposed to compress 2-D Magnetic Resonance brain images. The image is segmented into four different sets of subblocks based on the local energy magnitude of the image. Then the subblocks with the same energy are grouped to form a 3-D cuboid....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2410/ |
| _version_ | 1848790048408862720 |
|---|---|
| author | Sunder, , R. Shyam Sriraam,, N Eswaran,, C. |
| author_facet | Sunder, , R. Shyam Sriraam,, N Eswaran,, C. |
| author_sort | Sunder, , R. Shyam |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | In this paper, a 3-D discrete Hartley transform coder is proposed to compress 2-D Magnetic Resonance brain images. The image is segmented into four different sets of subblocks based on the local energy magnitude of the image. Then the subblocks with the same energy are grouped to form a 3-D cuboid. Finally 3-D Discrete Hartley transform is applied to the 3-D cuboids and the resulting coefficients are scanned and encoded using Huffman coding. It is found that this technique gives better result compared to the standard JPEG compression method. |
| first_indexed | 2025-11-14T18:06:25Z |
| format | Article |
| id | mmu-2410 |
| institution | Multimedia University |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:06:25Z |
| publishDate | 2005 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-24102011-08-22T02:57:44Z http://shdl.mmu.edu.my/2410/ A 3-D discrete hartley transform coder for compression of Magnetic Resonance images Sunder, , R. Shyam Sriraam,, N Eswaran,, C. QA75.5-76.95 Electronic computers. Computer science In this paper, a 3-D discrete Hartley transform coder is proposed to compress 2-D Magnetic Resonance brain images. The image is segmented into four different sets of subblocks based on the local energy magnitude of the image. Then the subblocks with the same energy are grouped to form a 3-D cuboid. Finally 3-D Discrete Hartley transform is applied to the 3-D cuboids and the resulting coefficients are scanned and encoded using Huffman coding. It is found that this technique gives better result compared to the standard JPEG compression method. 2005 Article NonPeerReviewed Sunder, , R. Shyam and Sriraam,, N and Eswaran,, C. (2005) A 3-D discrete hartley transform coder for compression of Magnetic Resonance images. 2005 IEEE INTERNATIONAL CONFERENCE ON ELECTRO/INFORMATION TECHNOLOGY (EIT 2005) . pp. 464-469. |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Sunder, , R. Shyam Sriraam,, N Eswaran,, C. A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title | A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title_full | A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title_fullStr | A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title_full_unstemmed | A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title_short | A 3-D discrete hartley transform coder for compression of Magnetic Resonance images |
| title_sort | 3-d discrete hartley transform coder for compression of magnetic resonance images |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2410/ |