dHBLSN: A diligent hierarchical broad learning system network for cogent polyp segmentation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F24%3A50021593" target="_blank" >RIV/62690094:18450/24:50021593 - isvavai.cz</a>

Result on the web

<a href="https://www.sciencedirect.com/science/article/pii/S0950705124008621?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0950705124008621?via%3Dihub</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.knosys.2024.112228" target="_blank" >10.1016/j.knosys.2024.112228</a>

Result language

angličtina

Original language name

dHBLSN: A diligent hierarchical broad learning system network for cogent polyp segmentation

Original language description

In medical practice, polyp segmentation holds immense significance for early Colorectal Cancer diagnosis. Over the past decade, techniques based on Deep Learning (DL) have been used extensively for segmentation purposes, showcasing promising performance. However, the efficacy of DL methods comes with a trade-off as they require manipulating many parameters for better performance, which increases the computation cost and takes a large amount of training time. In this study, we unfold a new perspective on polyp segmentation based on a broad learning system (BLS) namely dHBLSN: A diligent Hierarchical Broad Learning System Network for Cogent Polyp Segmentation that does not require multiple layers for training which significantly reduces the computational cost. The proposed dHBLSN is characterized by multi-feature extraction and hierarchical structure. Firstly, the colonoscopy images were partitioned into non-overlapping patches, which was beneficial for extracting local spatial information. Subsequently, Multi-scale features namely “Single Iteration forward pass convolution (Sifp-conv)” feature and “2D Dual Tree-Complex Wavelet Transform (2D-DT-CWT)” feature were extracted from each patch and were used directly as the feature nodes and no explicit feature mapping was required, unlike other BLS variants. These multiscale features are then enhanced and trained separately within two parallel BLS, each with its own set of feature and enhancement nodes. A separate fusion BLS was used to stack the output of the two parallel BLS hierarchically. Additionally, we introduced diligence parameter (d), to regulate the possibility of sudden divergence of the already learned and settled network during incremental learning, ensuring network stability. We performed extensive experiments on two public datasets, namely CVC-Clinic and Kvasir-SEG. Our proposed framework achieved Dice Coefficient (DC)- 0.889, Precision-0.917, Recall-0.906, F1-0.911, and F2-0.908 on the CVC-Clinic dataset. For the Kvasir-SEG dataset, our method achieved Dice Coefficient (DC)- 0.909, Precision-0.924, Recall-0.909, F1-0.916, and F2-0.911. Cross-dataset validation further underscores the generalization capability of dHBLSN, affirming its clinical relevance. Comparative analysis against state-of-the-art models highlights dHBLSN&apos;s superior balance between effectiveness and computational complexity. © 2024 Elsevier B.V.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Knowledge-based systems

ISSN

0950-7051

e-ISSN

1872-7409

Volume of the periodical

300

Issue of the periodical within the volume

September

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

12

Pages from-to

"Article number: 112228"

UT code for WoS article

001275707900001

EID of the result in the Scopus database

2-s2.0-85199049308