Manohar Karki

Dr. Manohar Karki

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
3 November 2015
Verified
Conference Paper
Open access
SBSaikat Basu
Saikat Basu
SGSangram Ganguly
Sangram Ganguly
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay
RDRobert DiBiano
Robert DiBiano
MKManohar Karki
Manohar Karki
RNRamakrishna Nemani
Ramakrishna Nemani
Satellite image classification is a challenging problem that lies at the crossroads of remote sensing, computer vision, and machine learning. Due to the high variability inherent in satellite data, most of the current object classification approaches are not suitable for handling satellite datasets. The progress of satellite image analytics has also been inhibited by the lack of a single labeled high-resolution dataset with multiple class labels. The contributions of this paper are twofold -- (1) first, we present two new satellite datasets called SAT-4 and SAT-6, and (2) then, we propose a classification framework that extracts features from an input image, normalizes them and feeds the normalized feature vectors to a Deep Belief Network for classification. On the SAT-4 dataset, our best network produces a classification accuracy of 97.95% and outperforms three state-of-the-art object recognition algorithms, namely - Deep Belief Networks, Convolutional Neural Networks and Stacked Denoising Autoencoders by ~11%. On SAT-6, it produces a classification accuracy of 93.9% and outperforms the other algorithms by ~15%. Comparative studies with a Random Forest classifier show the advantage of an unsupervised learning approach over traditional supervised learning techniques. A statistical analysis based on Distribution Separability Criterion and Intrinsic Dimensionality Estimation substantiates the effectiveness of our approach in learning better representations for satellite imagery.

24 January 2019 in Journal of Digital Imaging
Verified
Journal Article
Closed access
PDF file
JCJunghwan Cho
Junghwan Cho
KPKi-Su Park
Ki-Su Park
MKManohar Karki
Manohar Karki
ELEunmi Lee
Eunmi Lee
SKSeokhwan Ko
Seokhwan Ko
SPSinyoul Park
Sinyoul Park

1 January 2018 in Neural Networks
Verified
Journal Article
Closed access
SBSaikat Basu
Saikat Basu
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay
MKManohar Karki
Manohar Karki
RDRobert DiBiano
Robert DiBiano
SGSangram Ganguly
Sangram Ganguly
SGShreekant Gayaka
Shreekant Gayaka

15 September 2016 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
SBSaikat Basu
Saikat Basu
MKManohar Karki
Manohar Karki
SGSangram Ganguly
Sangram Ganguly
RDRobert DiBiano
Robert DiBiano
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay
RNRamakrishna Nemani
Ramakrishna Nemani

26 May 2015 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
SBSaikat Basu
Saikat Basu
SGSangram Ganguly
Sangram Ganguly
RNRamakrishna R. Nemani
Ramakrishna R. Nemani
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay
GZGong Zhang
Gong Zhang
SLShuang Li
Shuang Li
Accurate tree-cover estimates are useful in deriving above-ground biomass density estimates from very high resolution (VHR) satellite imagery data. Numerous algorithms have been designed to perform tree-cover delineation in high-to-coarse-resolution satellite imagery, but most of them do not scale to terabytes of data, typical in these VHR data sets. In this paper, we present an automated probabilistic framework for the segmentation and classification of 1-m VHR data as obtained from the National Agriculture Imagery Program (NAIP) for deriving tree-cover estimates for the whole of Continental United States, using a high-performance computing architecture. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on conditional random field, which helps in capturing the higher order contextual dependence relations between neighboring pixels. Once the final probability maps are generated, the framework is updated and retrained by incorporating expert knowledge through the relabeling of misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates (FPRs). The tree-cover maps were generated for the state of California, which covers a total of 11 095 NAIP tiles and spans a total geographical area of 163 696 sq. miles. Our framework produced correct detection rates of around 88% for fragmented forests and 74% for urban tree-cover areas, with FPRs lower than 2% for both regions. Comparative studies with the National Land-Cover Data algorithm and the LiDAR high-resolution canopy height model showed the effectiveness of our algorithm for generating accurate high-resolution tree-cover maps.

1 June 2020 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
MKManohar Karki
Manohar Karki
JCJunghwan Cho
Junghwan Cho
ELEunmi Lee
Eunmi Lee
MHMyong-Hun Hahm
Myong-Hun Hahm
SYSang-Youl Yoon
Sang-Youl Yoon
SPsinyoul Park
sinyoul Park