Alok Kanti Deb
Alok Kanti Deb has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Aurobinda Routray
Department of Electrical Engineering, IIT Kharagpur, Kharagpur, India
1 shared publication - Himadri Sekhar Bhunia
Advanced Technology Development Centre, IIT Kharagpur, Kharagpur, India
1 shared publication - Jayanta Mukherjee
Indian Institute of Technology Kharagpur
1 shared publication - Sainul Islam Ansary
Institute of Robotics and Machine Intelligence, Poznan University of Technology, Pozna, Poland
1 shared publication - Samiran Das
IISER Bhopal, Bhopal, Madhya Pradesh, India
1 shared publication - Sangeeta Nundy
Department of Electrical Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India
1 shared publication
Latest Publications
- 25 November 2019
- Published by Springer Nature
- p. 490-498
Multipath Based Correlation Filter for Visual Object Tracking
- 25 November 2019
- Published by Springer Nature
- p. 490-498
Multipath Based Correlation Filter for Visual Object Tracking
- 6 August 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (10) , 223-228
FPGA based Time Code Generation and Dissemination in a Distributed Control Systems
- 6 August 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (10) , 223-228
FPGA based Time Code Generation and Dissemination in a Distributed Control Systems
- Open Access
- 11 July 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (7) , 1106
Fast Semi-Supervised Unmixing of Hyperspectral Image by Mutual Coherence Reduction and Recursive PCA
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.
- 11 July 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (7) , 1106
Open AccessFast Semi-Supervised Unmixing of Hyperspectral Image by Mutual Coherence Reduction and Recursive PCA
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.
- 1 January 2016
- Published by Springer Nature
- p. 313-321
A Three Finger Tendon Driven Robotic Hand Design and Its Kinematics Model
- 1 January 2016
- Published by Springer Nature
- p. 313-321
A Three Finger Tendon Driven Robotic Hand Design and Its Kinematics Model
- 11 August 2015
- Published by Wiley in Journal of Heat Transfer
- Vol. 137 (12) , 121014
Joint State and Input Estimation for One-Dimensional Heat Conduction
This paper presents a joint state and input estimation algorithm for the one-dimensional heat-conduction problem. A computationally efficient method is proposed in this work to solve the inverse heat-conduction problem (IHCP) using orthogonal collocation method (OCM). A Kalman filter (KF) algorithm is used in conjunction with a recursive-weighted least-square (RWLS)-based method to simultaneously estimate the input boundary condition and the temperature field over the heat-conducting element. A comparison study of the algorithm is shown with explicit finite-difference method (FDM) of approximation and analytical solution of the forward problem, which clearly reveals the high accuracy with lower-dimensional modeling. The estimation results show that the performance of the estimator is robust to noise sensitivity up to a certain level, which is practically acceptable.
- 11 August 2015
- Published by Wiley in Journal of Heat Transfer
- Vol. 137 (12) , 121014
Joint State and Input Estimation for One-Dimensional Heat Conduction
This paper presents a joint state and input estimation algorithm for the one-dimensional heat-conduction problem. A computationally efficient method is proposed in this work to solve the inverse heat-conduction problem (IHCP) using orthogonal collocation method (OCM). A Kalman filter (KF) algorithm is used in conjunction with a recursive-weighted least-square (RWLS)-based method to simultaneously estimate the input boundary condition and the temperature field over the heat-conducting element. A comparison study of the algorithm is shown with explicit finite-difference method (FDM) of approximation and analytical solution of the forward problem, which clearly reveals the high accuracy with lower-dimensional modeling. The estimation results show that the performance of the estimator is robust to noise sensitivity up to a certain level, which is practically acceptable.