SearcharxivSearch

arXiv subjects

Bharat Biswal

Publications and source records attributed to Bharat Biswal.

4 recordsLinked to original sources

Conditional Evidence Reconstruction and Decomposition for Interpretable Multimodal Diagnosis

Neurobiological and neurodegenerative diseases are inherently multifactorial, arising from coupled influences spanning genetic susceptibility, brain alterations, and environmental and behavioral factors. Multimodal modeling has therefore been increasingly adopted for disease diagnosis by integrating complementary evidence across data sources. However, in both large-scale cohorts and real-world clinical workflows, modality coverage is often incomplete, making many multimodal models brittle when one or more modalities are unavailable. Existing approaches to incomplete multimodal diagnosis typically rely on group-wise or static priors, which may fail to capture subject-specific cross-modal dependencies; moreover, many models provide limited interpretability into which evidence sources drive the final decision. To address these limitations, we propose Conditional Evidence Reconstruction and Decomposition (CERD), a framework for interpretable multimodal diagnosis with incomplete modalities. CERD first reconstructs missing modality representations conditioned on each subject's observed inputs, then decomposes diagnostic evidence into shared cross-modal corroboration and modality-specific cues via logit-level attribution. Experiments on the Alzheimer's Disease Neuroimaging Initiative (ADNI) demonstrate that CERD outperforms competitive baselines under incomplete-modality settings while producing structured and clinically aligned evidence attributions for trustworthy decision support.

cs.CV

3D U-Net Based Brain Tumor Segmentation and Survival Days Prediction

Past few years have witnessed the prevalence of deep learning in many application scenarios, among which is medical image processing. Diagnosis and treatment of brain tumors requires an accurate and reliable segmentation of brain tumors as a prerequisite. However, such work conventionally requires brain surgeons significant amount of time. Computer vision techniques could provide surgeons a relief from the tedious marking procedure. In this paper, a 3D U-net based deep learning model has been trained with the help of brain-wise normalization and patching strategies for the brain tumor segmentation task in the BraTS 2019 competition. Dice coefficients for enhancing tumor, tumor core, and the whole tumor are 0.737, 0.807 and 0.894 respectively on the validation dataset. These three values on the test dataset are 0.778, 0.798 and 0.852. Furthermore, numerical features including ratio of tumor size to brain size and the area of tumor surface as well as age of subjects are extracted from predicted tumor labels and have been used for the overall survival days prediction task. The accuracy could be 0.448 on the validation dataset, and 0.551 on the final test dataset.

eess.IV

Optimal step-size of least mean absolute fourth algorithm in low SNR

There is a need to improve the capability of the adaptive filtering algorithm against Gaussian or multiple types of non-Gaussian noises, time-varying system, and systems with low SNR. In this paper, we propose an optimized least mean absolute fourth (OPLMF) algorithm, especially for a time-varying unknown system with low signal-noise-rate (SNR). The optimal step-size of OPLMF is obtained by minimizing the mean-square deviation (MSD) at any given moment in time. In addition, the mean convergence and steady-state error of OPLMF are derived. Also the theoretical computational complexity of OPLMF is analyzed. Furthermore, the simulation experiment results of system identification are used to illustrate the principle and efficiency of the OPLMF algorithm. The performance of the algorithm is analyzed mathematically and validated experimentally. Simulation results demonstrate that the proposed OPLMF is superior to the normalized LMF (NLMF) and variable step-size of LMF using quotient form (VSSLMFQ) algorithms.

eess.SP

Diffusion probabilistic LMS algorithm

In this paper, a novel diffusion estimation algorithm is proposed from a probabilistic perspective by combining diffusion strategy and the probabilistic least-mean-squares (PLMS) at all agents. The proposed method diffusion probabilistic LMS (DPLMS) is more robust to input signal and impulsive interference than the DSE-LMS, DRVSSLMS and DLLAD algorithms. Instead of minimizing the estimate error, the DPLMS algorithm is derived from approximating the posterior distribution with an isotropic Gaussian distribution. The stability of mean performance and computational complexity are analyzed theoretically. Results from the simulation indicate that the DPLMS algorithm is more robust to input signal and impulsive interference than the DSE-LMS, DRVSSLMS and DLLAD algorithms. These results suggest that the DPLMS algorithm can perform better in identifying the unknown coefficients under the complex and changeable impulsive interference environments.

eess.SP