Samiran Das

Dr. Samiran Das

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 July 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
WYWeikang Yu
Weikang Yu
Xiaokang ZhangXiaokang Zhang
Xiaokang Zhang
SDSamiran Das
Samiran Das
XZXiao Zhu
Xiao Zhu
Pedram GhamisiPedram Ghamisi
Pedram Ghamisi
Change detection (CD) from remote sensing (RS) images using deep learning has been widely investigated in the literature. It is typically regarded as a pixel-wise labeling task that aims to classify each pixel as changed or unchanged. Although per-pixel classification networks in encoder-decoder structures have shown dominance, they still suffer from imprecise boundaries and incomplete object delineation at various scenes. For high-resolution RS images, partly or totally changed objects are more worthy of attention rather than a single pixel. Therefore, we revisit the CD task from the mask prediction and classification perspective and propose MaskCD to detect changed areas by adaptively generating categorized masks from input image pairs. Specifically, it utilizes a cross-level change representation perceiver (CLCRP) to learn multiscale change-aware representations and capture spatiotemporal relations from encoded features by exploiting deformable multihead self-attention (DeformMHSA). Subsequently, a masked cross-attention-based detection transformers (MCA-DETR) decoder is developed to accurately locate and identify changed objects based on masked cross-attention and self-attention mechanisms. It reconstructs the desired changed objects by decoding the pixel-wise representations into learnable mask proposals and making final predictions from these candidates. Experimental results on five benchmark datasets demonstrate the proposed approach outperforms other state-of-the-art models. Codes and pretrained models are available online (https://github.com/EricYu97/MaskCD).

4 January 2021 in IET Image Processing
Verified
Journal Article
Open access
PDF file
SDSamiran Das
Samiran Das
Hyperspectral image and videos provide rich spectral information content, which facilitates accurate classification, unmixing, temporal change detection, and so on. However, with the rapid improvements in technology, the data size has increased many folds. To properly handle the enormous data volume, efficient methods are required to compress the data. This paper proposes a multi‐way approach for compression of the hyperspectral image or video sequence. In this approach, a differential representation of the data is first obtained. In the case of hyperspectral images, the difference between consecutive bands is obtained and in case of videos, the difference between consecutive frames is computed. In the next step, a sparse Tucker tensor decomposition is performed and the sparse core tensor obtained. Finally, the core tensor and the corresponding factor matrices are truncated and the data encoded to obtain the compressed version for transmission. The compression method utilises the multi‐way structure of the data and hence can be extended for hyperspectral videos. Experimental results on several real data imply that the proposed compression approach obtains better efficiency in terms of compression ratio, signal to noise ratio.

11 July 2018 in Remote Sensing
Verified
Journal Article
Open access
PDF file
SDSamiran Das
Samiran Das
ARAurobinda Routray
Aurobinda Routray
ADAlok Kanti Deb
Alok Kanti Deb
Dictionary pruning step is often employed prior to the sparse unmixing process to improve the performance of library aided unmixing. This paper presents a novel recursive PCA approach for dictionary pruning of linearly mixed hyperspectral data motivated by the low-rank structure of a linearly mixed hyperspectral image. Further, we propose a mutual coherence reduction method for pre-unmixing to enhance the performance of pruning. In the pruning step we, identify the actual image endmembers utilizing the low-rank constraint. We obtain an augmented version of the data by appending each image endmember and compute PCA reconstruction error, which is a convex surrogate of matrix rank. We identify the pruned library elements according to PCA reconstruction error ratio (PRER) and PCA reconstruction error difference (PRED) and employ a recursive formulation for repeated PCA computation. Our proposed formulation identifies the exact endmember set at an affordable computational requirement. Extensive simulated and real image experiments exhibit the efficacy of the proposed algorithm in terms of its accuracy, computational complexity and noise performance.

8 January 2019 in IEEE Geoscience and Remote Sensing Letters
Verified
Journal Article
Closed access
SDSamiran Das
Samiran Das
ARAurobinda Routray
Aurobinda Routray
Hyperspectral sparse unmixing methods estimate abundance of endmembers, assuming spectral library as an overcomplete set of endmembers. In this letter, we present a novel, fast and efficient dictionary pruning approach for hyperspectral unmixing. We quantify the change in the latent structure of data due to augmentation of spectral library element using covariance similarity measure. Since the covariance matrices form a nonlinear manifold, choosing an appropriate similarity measure is a nontrivial task. We explored prevalent similarity measures, which motivated us to employ Jeffrey's Kullback-Leibler divergence measure due to its tighter bounds and better noise performance. We also present analytical formulations for faster implementation of covariance similarity. We evaluate the performance of dictionary pruning algorithms on several synthetic and real hyperspectral images and demonstrate the proficiency of our proposed work in diverse scenarios.

3 May 2022 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
SDSamiran Das
Samiran Das
SPSawon Pratiher
Sawon Pratiher
CKChirag Kyal
Chirag Kyal
Pedram GhamisiPedram Ghamisi
Pedram Ghamisi
Hyperspectral images provide rich spectral information corresponding to visible and Near-infrared imaging (NIR) regions, facilitating accurate classication, object identication, and target detection. However, the high volume of data creates a computational challenge in processing. The band selection process identies specic informative and discriminative spectral bands from the data speed up the processing without impeding the performance. This paper presents an application-independent band selection framework that utilizes improved sparse deep subspace clustering and introduces an efcient multicriteria-based representative band selection (BS). The proposed sparse deep subspace clustering approach efciently identies the underlying non-linear subspace structure of the data and organizes the data accordingly. The work introduces a novel, robust sparsity measure to obtain a powerful self-representation and ameliorated performance compared to the prevalent subspace clustering methods. The work subsequently selects the representative bands from each cluster by combining structural information of the band images with the statistical similarity measure. We evaluate the BS performance on standard real images using information-theoretic criterion, classication, and unmixing performance. The comparative performance assessment demonstrates that our proposed method identies the informative bands and out.

1 October 2019 in IET Image Processing
Verified
Journal Article
Open access
PDF file
SDSamiran Das
Samiran Das
ARAurobinda Routray
Aurobinda Routray
ADAlok Kanti Deb
Alok Kanti Deb
Availability of a large number of application‐specific spectral libraries has generated a great deal of interest in semi‐blind unmixing of the hyperspectral image in both remote sensing and signal processing community. This study presents a novel, semi‐supervised, parameter‐free algorithm which employs sparsity measures for library pruning. The overall algorithm includes sparsity criteria based library pruning and sparse inversion method for abundance computation. In the pruning process, each library element is removed from the spectral library and the corresponding sparse abundance matrix is computed. The library elements which lead to higher sparsity are adjudged as image endmembers, based on the assumption that elimination of actual image endmember enhances sparsity level. The authors also present a detailed exploration of standard sparsity measures. They calculate the abundance of the pruned library by maximising Gini index or pq ‐norm sparsity, which satisfies the desirable sparsity properties and is easier to compute. The abundance calculation task is solved using the adaptive direction method of multipliers. The experimental results on several real and synthetic image datasets demonstrate the computational efficiency and proficiency the authors’ method in the presence of noise and highly coherent spectral library.