z-logo
Premium
Triple novelty block detection and classification approach for lung tumor analysis
Author(s) -
Rani K. Vijila,
Dayana C. Thinkal,
Therese P. Sujatha,
Prince M. Eugine
Publication year - 2021
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.22509
Subject(s) - false positive paradox , segmentation , computer science , artificial intelligence , pattern recognition (psychology) , cluster analysis , histogram , image (mathematics)
Recently the increased utilization of computer‐aided detection is more helpful to assist the radiologist, recognize the minute lung lesion. In this research article, we propose three novel block detection methods for lung lesion segmentation. First, an automatic algorithm for lung lesion detection and segmentation by using histogram‐based affine‐invariant detection (HAID) is proposed. HAID is a novel segmentation technique that applies enhanced maximally stable extremal region algorithm results to segment the lung lesion. The lung lesions are segmented with an accuracy of 91.5% and false positives per scan is 5.52. To reduce the false positives per scan of lung tumor segmentation, a spatial constraint‐based new fuzzy clustering (SCNFC) approach is then proposed. The experimental results proved the efficiency of the SCNFC technique in the successful segmentation of lung tumor tissues with high accuracy and reduced the false positive per scan (95.21% and 3.69 for a database of simulated computed tomography images). Finally, firefly search‐based Macqueen's K‐means clustering algorithm (FSMKC) is proposed. The performance of the FSMKC method is evaluated on series assessments using the Lung Image Database Consortium dataset (1505 images) and it achieved the accuracy of 97.18% and 96.28% of sensitivity with only 2.27 false positives per scan.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here