cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Dayat Kurniawan
Contact Email
Dayat Kurniawan
Phone
-
Journal Mail Official
redaksi@jurnalet.com
Editorial Address
-
Location
Kota adm. jakarta selatan,
Dki jakarta
INDONESIA
Jurnal Elektronika dan Telekomunikasi
Published by Lembaga Ilmu Pengetahuan Indonesia
ISSN : 14118289     EISSN : 25279955     DOI : -
Core Subject : Engineering,
Electrical & Electronics Engineering Engineering
Jurnal Elektronika dan Telekomunikasi (JET) is an open access, a peer-reviewed journal published by Research Center for Electronics and Telecommunication - Indonesian Institute of Sciences. We publish original research papers, review articles and case studies on the latest research and developments in the field of electronics, telecommunications, and microelectronics engineering. JET is published twice a year and uses double-blind peer review. It was first published in 2001.
Arjuna Subject : -
Articles 11 Documents
 1   2 
Search results for , issue "Vol 22, No 2 (2022)" : 11 Documents clear
Mineral Mapping on Hyperspectral Imageries Using Cohesion-based Self Merging Algorithm Afnindar Fakhrurrozi; Izzul Qudsi; Mochamad Rifat Noor; Anggun Mayang Sari
Jurnal Elektronika dan Telekomunikasi Vol 22, No 2 (2022)
Publisher : National Research and Innovation Agency

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55981/jet.507

Abstract

Recently, hybrid clustering algorithms gained much research attention due to better clustering results and are computationally efficient. Hyperspectral image classification studies should be no exception, including mineral mapping. This study aims to tackle the biggest challenge of mapping the mineralogy of drill core samples, which consumes a lot of time. In this paper, we present the investigation using a hybrid clustering algorithm, cohesion-based self-merging (CSM), for mineral mapping to determine the number and location of minerals that formed the rock. The CSM clustering performance was then compared to its classical counterpart, K-means plus-plus (K-means++). We conducted experiments using hyperspectral images from multiple rock samples to understand how well the clustering algorithm segmented minerals that exist in the rock. The samples in this study contain minerals with identical absorption features in certain locations that increase the complexity. The elbow method and silhouette analysis did not perform well in deciding the optimum cluster size due to slight variance and high dimensionality of the datasets. Thus, iterations to the various numbers of k-clusters and m-subclusters of each rock were performed to get the mineral cluster. Both algorithms were able to distinguish slight variations of absorption features of any mineral. The spectral variation within a single mineral found by our algorithm might be studied further to understand any possible unidentified group of clusters. The spatial consideration of the CSM algorithm induced several misclassified pixels. Hence, the mineral maps produced in this study are not expected to be precisely similar to ground truths.

Page 2 of 2 | Total Record : 11

 1   2 

Filter by Year

2022 2022


Reset
Filter By Issues
All Issue Vol 25, No 2 (2025) Vol 25, No 1 (2025) Vol 24, No 2 (2024) Vol 24, No 1 (2024) Vol 23, No 2 (2023) Vol 23, No 1 (2023) Vol 22, No 2 (2022) Vol 22, No 1 (2022) Vol 21, No 2 (2021) Vol 21, No 1 (2021) Vol 20, No 2 (2020) Vol 20, No 1 (2020) Vol 19, No 2 (2019) Vol 19, No 1 (2019) Vol 18, No 2 (2018) Vol 18, No 2 (2018) Vol 18, No 1 (2018) Vol 18, No 1 (2018) Vol 17, No 2 (2017) Vol 17, No 2 (2017) Vol 17, No 1 (2017) Vol 17, No 1 (2017) Vol 16, No 2 (2016) Vol 16, No 2 (2016) Vol 16, No 1 (2016) Vol 16, No 1 (2016) Vol 15, No 2 (2015) Vol 15, No 2 (2015) Vol 15, No 1 (2015) Vol 15, No 1 (2015) Vol 14, No 2 (2014) Vol 14, No 2 (2014) Vol 14, No 1 (2014) Vol 14, No 1 (2014) Vol 13, No 2 (2013) Vol 13, No 2 (2013) Vol 13, No 1 (2013) Vol 13, No 1 (2013) Vol 01-12 (Printed Issues) More Issue