Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition
Set Partitioning in Hierarchical Trees (SPIHT) represents a leading-edge algorithm in near-lossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims t...
Gespeichert in:
Veröffentlicht in: | Traitement du signal 2023-12, Vol.40 (6), p.2723-2730 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2730 |
---|---|
container_issue | 6 |
container_start_page | 2723 |
container_title | Traitement du signal |
container_volume | 40 |
creator | Yuan, Goh Jee Adam, Afzan Hasan, Mohammad Kamrul Alyasseri, Zaid Abdi Alkareem Fauzi, Mohammad Faizal Ahmad Chan, Elaine Wan Ling |
description | Set Partitioning in Hierarchical Trees (SPIHT) represents a leading-edge algorithm in near-lossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims to enhance the SPIHT algorithm specifically for DPIs by investigating the impact of applying various wavelets in the wavelet decomposition process and the introduction of auto-recursion in the SPIHT algorithm. An extensive selection of wavelet types were tested within the wavelet decomposition process integral to the SPIHT algorithm. The ultimate goal was to identify the wavelet that yields the highest compression ratio and the one that maintains the highest data consistency. The proposed auto-recursion was also examined against the original n-recursive algorithm to discern differences in compression performance. The results indicated that the BIOR 5.5 wavelet is more apt for achieving a high compression ratio, while the BIOR 3.9 wavelet is more suitable for securing high compression quality in the compression of high-resolution DPIs. The newly introduced auto-recursion feature contributes significantly to optimizing the quality of the compressed image. Visual verification of the compressed image's quality, for any potential loss of detail, was carried out through expert validation in a clinical setting. This expert validation confirmed that the proposed algorithm can produce higher quality compressed images with negligible loss of quality. Thus, this research offers a partial solution to current challenges in digital pathology related to storage, transfer, and archiving of high-resolution DPIs, by providing a more effective compression algorithm. |
doi_str_mv | 10.18280/ts.400632 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3097397965</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3097397965</sourcerecordid><originalsourceid>FETCH-LOGICAL-c184t-49698c60f4ea9b8c63821b20886c5ad1c7a9d325994417b2a888aef3972016943</originalsourceid><addsrcrecordid>eNotkcFKAzEQhoMoWGovPkHAm7A12exmk2Np1RYKSq14XNJ0dpuyu6lJutDn8UWNrXOZYfj--WF-hO4pGVORCvIU_DgjhLP0Cg2ozEWScyKu0YAUPE8IofIWjbzfk1iMZpyzAfqZbHvVaWihCx6bDi-t9w14j1W3xSvowXmzaQBPbXtwcW9sh22FZ6Y2QTX4XYWdbWx9wotW1eBxbxSeHINNVqCPUdsD_oAQORdMiGLT1X82cwNOOb0zOh5ZO4CL4ZfqoYn4DHT0s_4suUM3lWo8jP77EH2-PK-n82T59rqYTpaJpiILSSa5FJqTKgMlN3FiIqWblAjBda62VBdKblmaS5lltNikSgihoGKySAnlMmND9HC5e3D2-wg-lHt7dF20LBmRRQQlzyP1eKG0i69yUJUHZ1rlTiUl5TmHMvjykgP7Bc-ifMw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3097397965</pqid></control><display><type>article</type><title>Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Yuan, Goh Jee ; Adam, Afzan ; Hasan, Mohammad Kamrul ; Alyasseri, Zaid Abdi Alkareem ; Fauzi, Mohammad Faizal Ahmad ; Chan, Elaine Wan Ling</creator><creatorcontrib>Yuan, Goh Jee ; Adam, Afzan ; Hasan, Mohammad Kamrul ; Alyasseri, Zaid Abdi Alkareem ; Fauzi, Mohammad Faizal Ahmad ; Chan, Elaine Wan Ling</creatorcontrib><description>Set Partitioning in Hierarchical Trees (SPIHT) represents a leading-edge algorithm in near-lossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims to enhance the SPIHT algorithm specifically for DPIs by investigating the impact of applying various wavelets in the wavelet decomposition process and the introduction of auto-recursion in the SPIHT algorithm. An extensive selection of wavelet types were tested within the wavelet decomposition process integral to the SPIHT algorithm. The ultimate goal was to identify the wavelet that yields the highest compression ratio and the one that maintains the highest data consistency. The proposed auto-recursion was also examined against the original n-recursive algorithm to discern differences in compression performance. The results indicated that the BIOR 5.5 wavelet is more apt for achieving a high compression ratio, while the BIOR 3.9 wavelet is more suitable for securing high compression quality in the compression of high-resolution DPIs. The newly introduced auto-recursion feature contributes significantly to optimizing the quality of the compressed image. Visual verification of the compressed image's quality, for any potential loss of detail, was carried out through expert validation in a clinical setting. This expert validation confirmed that the proposed algorithm can produce higher quality compressed images with negligible loss of quality. Thus, this research offers a partial solution to current challenges in digital pathology related to storage, transfer, and archiving of high-resolution DPIs, by providing a more effective compression algorithm.</description><identifier>ISSN: 0765-0019</identifier><identifier>EISSN: 1958-5608</identifier><identifier>DOI: 10.18280/ts.400632</identifier><language>eng</language><publisher>Edmonton: International Information and Engineering Technology Association (IIETA)</publisher><subject>Algorithms ; Brain research ; Compression ratio ; Data compression ; Datasets ; Decomposition ; Digital imaging ; Discrete Wavelet Transform ; Effectiveness ; High resolution ; Image compression ; Image enhancement ; Image quality ; Image resolution ; Kidneys ; Partitioning ; Pathology ; Wavelet transforms</subject><ispartof>Traitement du signal, 2023-12, Vol.40 (6), p.2723-2730</ispartof><rights>2023. This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Yuan, Goh Jee</creatorcontrib><creatorcontrib>Adam, Afzan</creatorcontrib><creatorcontrib>Hasan, Mohammad Kamrul</creatorcontrib><creatorcontrib>Alyasseri, Zaid Abdi Alkareem</creatorcontrib><creatorcontrib>Fauzi, Mohammad Faizal Ahmad</creatorcontrib><creatorcontrib>Chan, Elaine Wan Ling</creatorcontrib><title>Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition</title><title>Traitement du signal</title><description>Set Partitioning in Hierarchical Trees (SPIHT) represents a leading-edge algorithm in near-lossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims to enhance the SPIHT algorithm specifically for DPIs by investigating the impact of applying various wavelets in the wavelet decomposition process and the introduction of auto-recursion in the SPIHT algorithm. An extensive selection of wavelet types were tested within the wavelet decomposition process integral to the SPIHT algorithm. The ultimate goal was to identify the wavelet that yields the highest compression ratio and the one that maintains the highest data consistency. The proposed auto-recursion was also examined against the original n-recursive algorithm to discern differences in compression performance. The results indicated that the BIOR 5.5 wavelet is more apt for achieving a high compression ratio, while the BIOR 3.9 wavelet is more suitable for securing high compression quality in the compression of high-resolution DPIs. The newly introduced auto-recursion feature contributes significantly to optimizing the quality of the compressed image. Visual verification of the compressed image's quality, for any potential loss of detail, was carried out through expert validation in a clinical setting. This expert validation confirmed that the proposed algorithm can produce higher quality compressed images with negligible loss of quality. Thus, this research offers a partial solution to current challenges in digital pathology related to storage, transfer, and archiving of high-resolution DPIs, by providing a more effective compression algorithm.</description><subject>Algorithms</subject><subject>Brain research</subject><subject>Compression ratio</subject><subject>Data compression</subject><subject>Datasets</subject><subject>Decomposition</subject><subject>Digital imaging</subject><subject>Discrete Wavelet Transform</subject><subject>Effectiveness</subject><subject>High resolution</subject><subject>Image compression</subject><subject>Image enhancement</subject><subject>Image quality</subject><subject>Image resolution</subject><subject>Kidneys</subject><subject>Partitioning</subject><subject>Pathology</subject><subject>Wavelet transforms</subject><issn>0765-0019</issn><issn>1958-5608</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNotkcFKAzEQhoMoWGovPkHAm7A12exmk2Np1RYKSq14XNJ0dpuyu6lJutDn8UWNrXOZYfj--WF-hO4pGVORCvIU_DgjhLP0Cg2ozEWScyKu0YAUPE8IofIWjbzfk1iMZpyzAfqZbHvVaWihCx6bDi-t9w14j1W3xSvowXmzaQBPbXtwcW9sh22FZ6Y2QTX4XYWdbWx9wotW1eBxbxSeHINNVqCPUdsD_oAQORdMiGLT1X82cwNOOb0zOh5ZO4CL4ZfqoYn4DHT0s_4suUM3lWo8jP77EH2-PK-n82T59rqYTpaJpiILSSa5FJqTKgMlN3FiIqWblAjBda62VBdKblmaS5lltNikSgihoGKySAnlMmND9HC5e3D2-wg-lHt7dF20LBmRRQQlzyP1eKG0i69yUJUHZ1rlTiUl5TmHMvjykgP7Bc-ifMw</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Yuan, Goh Jee</creator><creator>Adam, Afzan</creator><creator>Hasan, Mohammad Kamrul</creator><creator>Alyasseri, Zaid Abdi Alkareem</creator><creator>Fauzi, Mohammad Faizal Ahmad</creator><creator>Chan, Elaine Wan Ling</creator><general>International Information and Engineering Technology Association (IIETA)</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PQBIZ</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20231201</creationdate><title>Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition</title><author>Yuan, Goh Jee ; Adam, Afzan ; Hasan, Mohammad Kamrul ; Alyasseri, Zaid Abdi Alkareem ; Fauzi, Mohammad Faizal Ahmad ; Chan, Elaine Wan Ling</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c184t-49698c60f4ea9b8c63821b20886c5ad1c7a9d325994417b2a888aef3972016943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Brain research</topic><topic>Compression ratio</topic><topic>Data compression</topic><topic>Datasets</topic><topic>Decomposition</topic><topic>Digital imaging</topic><topic>Discrete Wavelet Transform</topic><topic>Effectiveness</topic><topic>High resolution</topic><topic>Image compression</topic><topic>Image enhancement</topic><topic>Image quality</topic><topic>Image resolution</topic><topic>Kidneys</topic><topic>Partitioning</topic><topic>Pathology</topic><topic>Wavelet transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yuan, Goh Jee</creatorcontrib><creatorcontrib>Adam, Afzan</creatorcontrib><creatorcontrib>Hasan, Mohammad Kamrul</creatorcontrib><creatorcontrib>Alyasseri, Zaid Abdi Alkareem</creatorcontrib><creatorcontrib>Fauzi, Mohammad Faizal Ahmad</creatorcontrib><creatorcontrib>Chan, Elaine Wan Ling</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest One Business</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Traitement du signal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yuan, Goh Jee</au><au>Adam, Afzan</au><au>Hasan, Mohammad Kamrul</au><au>Alyasseri, Zaid Abdi Alkareem</au><au>Fauzi, Mohammad Faizal Ahmad</au><au>Chan, Elaine Wan Ling</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition</atitle><jtitle>Traitement du signal</jtitle><date>2023-12-01</date><risdate>2023</risdate><volume>40</volume><issue>6</issue><spage>2723</spage><epage>2730</epage><pages>2723-2730</pages><issn>0765-0019</issn><eissn>1958-5608</eissn><abstract>Set Partitioning in Hierarchical Trees (SPIHT) represents a leading-edge algorithm in near-lossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims to enhance the SPIHT algorithm specifically for DPIs by investigating the impact of applying various wavelets in the wavelet decomposition process and the introduction of auto-recursion in the SPIHT algorithm. An extensive selection of wavelet types were tested within the wavelet decomposition process integral to the SPIHT algorithm. The ultimate goal was to identify the wavelet that yields the highest compression ratio and the one that maintains the highest data consistency. The proposed auto-recursion was also examined against the original n-recursive algorithm to discern differences in compression performance. The results indicated that the BIOR 5.5 wavelet is more apt for achieving a high compression ratio, while the BIOR 3.9 wavelet is more suitable for securing high compression quality in the compression of high-resolution DPIs. The newly introduced auto-recursion feature contributes significantly to optimizing the quality of the compressed image. Visual verification of the compressed image's quality, for any potential loss of detail, was carried out through expert validation in a clinical setting. This expert validation confirmed that the proposed algorithm can produce higher quality compressed images with negligible loss of quality. Thus, this research offers a partial solution to current challenges in digital pathology related to storage, transfer, and archiving of high-resolution DPIs, by providing a more effective compression algorithm.</abstract><cop>Edmonton</cop><pub>International Information and Engineering Technology Association (IIETA)</pub><doi>10.18280/ts.400632</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0765-0019 |
ispartof | Traitement du signal, 2023-12, Vol.40 (6), p.2723-2730 |
issn | 0765-0019 1958-5608 |
language | eng |
recordid | cdi_proquest_journals_3097397965 |
source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | Algorithms Brain research Compression ratio Data compression Datasets Decomposition Digital imaging Discrete Wavelet Transform Effectiveness High resolution Image compression Image enhancement Image quality Image resolution Kidneys Partitioning Pathology Wavelet transforms |
title | Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T08%3A58%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Advancements%20in%20Lossless%20and%20Reversible%20Compression%20of%20Digital%20Pathology%20Images%20via%20Auto-Recursive%20Set%20Partitioning%20in%20Hierarchical%20Trees%20and%20Wavelet%20Decomposition&rft.jtitle=Traitement%20du%20signal&rft.au=Yuan,%20Goh%20Jee&rft.date=2023-12-01&rft.volume=40&rft.issue=6&rft.spage=2723&rft.epage=2730&rft.pages=2723-2730&rft.issn=0765-0019&rft.eissn=1958-5608&rft_id=info:doi/10.18280/ts.400632&rft_dat=%3Cproquest_cross%3E3097397965%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3097397965&rft_id=info:pmid/&rfr_iscdi=true |