Jhao-Ting Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jhao-Ting Lin has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Chia-Hsiang Lin
Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan
7 shared publications - Charles H. Lin
Department of Earth Sciences National Cheng Kung University Tainan Taiwan
1 shared publication Cheng-Ying Hsieh
Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan
1 shared publication- Jui-Ting Chen
Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan
1 shared publication - Pai-Chuan Chang
Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan
1 shared publication - Po-Wei Tang
Institute of Computer and Communication Engineering, Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan
1 shared publication
Latest Publications
- 26 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 64 (01962892) , 1-15
Deep Unfolding Real-Time Super-Resolution Using Subpixel-Shift Twin Image and Convex Self-Similarity Prior
Multi-image super-resolution (MISR) is a critical technique for satellite remote sensing. In the perspective of information, twin-image super-resolution (TISR) is regarded as the most challenging MISR scenario, having crucial applications like the SPOT-5 supermode imaging. In TISR, an image is super-resolved by its subpixel-shift counterpart (i.e., twin image), where the two images are typically offset by half a pixel both horizontally and vertically. We formulate the less investigated TISR using a convex criterion, which is implemented using a novel deep unfolding network. In the unfolding, an embedded simple shift operator trickily addresses the coupled TISR data-fitting terms, and a transformer trained with a convex self-similarity loss function elegantly implements the proximal mapping induced by the TISR regularizer. The proposed convex self-similarity unfolding supermode super-resolution (COSUP) algorithm is interpretable and achieves state-of-the-art performance with very fast millisecond-level computational time. COSUP is also tested on real-world data, for which the subpixel shifts would not be spatially uniform, with results showing great superiority over the official CNES supermode imaging product in terms of credible metrics (e.g., natural image quality evaluator, NIQE).
- 26 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 64 (01962892) , 1-15
Deep Unfolding Real-Time Super-Resolution Using Subpixel-Shift Twin Image and Convex Self-Similarity Prior
Multi-image super-resolution (MISR) is a critical technique for satellite remote sensing. In the perspective of information, twin-image super-resolution (TISR) is regarded as the most challenging MISR scenario, having crucial applications like the SPOT-5 supermode imaging. In TISR, an image is super-resolved by its subpixel-shift counterpart (i.e., twin image), where the two images are typically offset by half a pixel both horizontally and vertically. We formulate the less investigated TISR using a convex criterion, which is implemented using a novel deep unfolding network. In the unfolding, an embedded simple shift operator trickily addresses the coupled TISR data-fitting terms, and a transformer trained with a convex self-similarity loss function elegantly implements the proximal mapping induced by the TISR regularizer. The proposed convex self-similarity unfolding supermode super-resolution (COSUP) algorithm is interpretable and achieves state-of-the-art performance with very fast millisecond-level computational time. COSUP is also tested on real-world data, for which the subpixel shifts would not be spatially uniform, with results showing great superiority over the official CNES supermode imaging product in terms of credible metrics (e.g., natural image quality evaluator, NIQE).
- Open Access
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-21
Quantum-Driven Multihead Inland Waterbody Detection With Transformer-Encoded CYGNSS Delay-Doppler Map Data
Inland waterbody detection (IWD), which aims at identifying and mapping waterbodies such as rivers, lakes, and reservoirs, is critical for water resources management and agricultural planning. However, the development of high-fidelity IWD mapping technology remains unresolved. We aim to propose a practical solution using only the easily accessible delay-Doppler map (DDM) data provided by NASA’s Cyclone Global Navigation Satellite System (CYGNSS), which facilitates effective estimation of physical parameters on the Earth’s surface with high temporal resolution and wide spatial coverage. Specifically, as quantum deep network (QUEEN) has revealed its strong proficiency in addressing classification-like tasks, we encode the DDM using a customized transformer, followed by feeding the transformer-encoded DDM (tDDM) into a highly entangled QUEEN to distinguish whether the tDDM corresponds to a hydrological region. In recent literature, QUEEN has achieved outstanding performances in numerous challenging remote sensing tasks (e.g., hyperspectral restoration, change detection, and mixed noise removal, etc.), and its high effectiveness stems from the fundamentally different way it adopts to extract features (the so-called quantum unitary-computing features). The meticulously designed IWD-QUEEN retrieves high-precision river textures, such as those in Amazon River Basin in South America, demonstrating its superiority over traditional classification methods and existing global hydrography maps. IWD-QUEEN, together with its parallel quantum multihead scheme, works in a near-real-time manner (i.e., millisecond-level computing per DDM data). To broaden accessibility for users of traditional computers, we also provide the non-quantum counterpart of our method, called IWD-Transformer, thereby increasing the impact of this work. In terms of quantitative evaluation, IWD-QUEEN leads the IWD-Transformer by approximately 7% and 8% in F1-score and Cohen’s kappa, respectively, alluding the promising role of QUEEN in achieving high-performance detection. Source codes: https://github.com/IHCLab/IWD-QUEEN.
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-21
Open AccessQuantum-Driven Multihead Inland Waterbody Detection With Transformer-Encoded CYGNSS Delay-Doppler Map Data
Inland waterbody detection (IWD), which aims at identifying and mapping waterbodies such as rivers, lakes, and reservoirs, is critical for water resources management and agricultural planning. However, the development of high-fidelity IWD mapping technology remains unresolved. We aim to propose a practical solution using only the easily accessible delay-Doppler map (DDM) data provided by NASA’s Cyclone Global Navigation Satellite System (CYGNSS), which facilitates effective estimation of physical parameters on the Earth’s surface with high temporal resolution and wide spatial coverage. Specifically, as quantum deep network (QUEEN) has revealed its strong proficiency in addressing classification-like tasks, we encode the DDM using a customized transformer, followed by feeding the transformer-encoded DDM (tDDM) into a highly entangled QUEEN to distinguish whether the tDDM corresponds to a hydrological region. In recent literature, QUEEN has achieved outstanding performances in numerous challenging remote sensing tasks (e.g., hyperspectral restoration, change detection, and mixed noise removal, etc.), and its high effectiveness stems from the fundamentally different way it adopts to extract features (the so-called quantum unitary-computing features). The meticulously designed IWD-QUEEN retrieves high-precision river textures, such as those in Amazon River Basin in South America, demonstrating its superiority over traditional classification methods and existing global hydrography maps. IWD-QUEEN, together with its parallel quantum multihead scheme, works in a near-real-time manner (i.e., millisecond-level computing per DDM data). To broaden accessibility for users of traditional computers, we also provide the non-quantum counterpart of our method, called IWD-Transformer, thereby increasing the impact of this work. In terms of quantitative evaluation, IWD-QUEEN leads the IWD-Transformer by approximately 7% and 8% in F1-score and Cohen’s kappa, respectively, alluding the promising role of QUEEN in achieving high-performance detection. Source codes: https://github.com/IHCLab/IWD-QUEEN.
- Open Access
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-16
COS2A: Conversion From Sentinel-2 to AVIRIS Hyperspectral Data Using Interpretable Algorithm With Spectral–Spatial Duality
The Sentinel-2 satellite, launched by the European Space Agency (ESA), offers extensive spatial coverage and has become indispensable in a wide range of remote sensing applications. However, it just has 12 spectral bands, making substances/objects identification less effective, not mentioning the varying spatial resolutions (10/20/60 m) across the 12 bands. If such a multi-resolution 12-band image can be computationally converted into a hyperspectral image with uniformly high resolution (i.e., 10 m), it significantly facilitates remote identification tasks. Though there are some spectral super-resolution methods, they did not address the multi-resolution issue on one hand, and, more seriously, they mostly focused on the CAVE-level hyperspectral image reconstruction (involving only 31 visible bands) on the other hand, greatly limiting their applicability in real-world remote sensing scenarios. We ambitiously aim to convert Sentinel-2 data directly into NASA’s AVIRIS-level hyperspectral image (encompassing up to 172 visible and near-infrared (NIR) bands, after ignoring those absorption/corruption ones). For the first time, this paper solves this specific super-resolution problem (highly ill-posed), allowing all historical Sentinel-2 data to have their corresponding high-standard AVIRIS counterparts. We achieve so by customizing a novel algorithm that introduces deep unfolding regularization and Q-quadratic-norm regularization into the so-called convex/deep (CODE) small-data learning criterion. Based on the derived spectral-spatial duality, the proposed interpretable COS2A algorithm demonstrates superior spectral super-resolution results across diverse land cover types, as validated through extensive experiments. Source codes: https://github.com/IHCLab/COS2A.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-16
Open AccessCOS2A: Conversion From Sentinel-2 to AVIRIS Hyperspectral Data Using Interpretable Algorithm With Spectral–Spatial Duality
The Sentinel-2 satellite, launched by the European Space Agency (ESA), offers extensive spatial coverage and has become indispensable in a wide range of remote sensing applications. However, it just has 12 spectral bands, making substances/objects identification less effective, not mentioning the varying spatial resolutions (10/20/60 m) across the 12 bands. If such a multi-resolution 12-band image can be computationally converted into a hyperspectral image with uniformly high resolution (i.e., 10 m), it significantly facilitates remote identification tasks. Though there are some spectral super-resolution methods, they did not address the multi-resolution issue on one hand, and, more seriously, they mostly focused on the CAVE-level hyperspectral image reconstruction (involving only 31 visible bands) on the other hand, greatly limiting their applicability in real-world remote sensing scenarios. We ambitiously aim to convert Sentinel-2 data directly into NASA’s AVIRIS-level hyperspectral image (encompassing up to 172 visible and near-infrared (NIR) bands, after ignoring those absorption/corruption ones). For the first time, this paper solves this specific super-resolution problem (highly ill-posed), allowing all historical Sentinel-2 data to have their corresponding high-standard AVIRIS counterparts. We achieve so by customizing a novel algorithm that introduces deep unfolding regularization and Q-quadratic-norm regularization into the so-called convex/deep (CODE) small-data learning criterion. Based on the derived spectral-spatial duality, the proposed interpretable COS2A algorithm demonstrates superior spectral super-resolution results across diverse land cover types, as validated through extensive experiments. Source codes: https://github.com/IHCLab/COS2A.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-15
PRIME: Unsupervised Multispectral Unmixing Using Virtual Quantum Prism and Convex Geometry
Multispectral unmixing (MU) is critical due to the inevitable mixed pixel phenomenon caused by the limited spatial resolution of typical multispectral images in remote sensing. However, MU mathematically corresponds to the underdeter-mined blind source separation problem, thus highly challenging, preventing researchers from tackling it. Previous MU works all ignore the underdetermined issue, and merely consider scenarios with more bands than sources. This work attempts to resolve the underdetermined issue by further conducting the light-splitting task using a network-inspired virtual prism, and as this task is challenging, we achieve so by incorporating the very advanced quantum feature extraction techniques. We emphasize that the prism is virtual (allowing us to fix the spectral response as a simple deterministic matrix), so the virtual hyperspectral image (HSI) it generates has no need to correspond to some real hyperspectral sensor; in other words, it is good enough as long as the virtual HSI satisfies some fundamental properties of light splitting (e.g., non-negativity and continuity). With the above virtual quantum prism, we know that the virtual HSI is expected to possess some desired simplex structure. This allows us to adopt the convex geometry to unmix the spectra, followed by downsampling the pure spectra back to the multispectral domain, thereby achieving MU. Experimental evidence shows great potential of our MU algorithm, termed as prism-inspired multispectral endmember extraction (PRIME).
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-15
PRIME: Unsupervised Multispectral Unmixing Using Virtual Quantum Prism and Convex Geometry
Multispectral unmixing (MU) is critical due to the inevitable mixed pixel phenomenon caused by the limited spatial resolution of typical multispectral images in remote sensing. However, MU mathematically corresponds to the underdeter-mined blind source separation problem, thus highly challenging, preventing researchers from tackling it. Previous MU works all ignore the underdetermined issue, and merely consider scenarios with more bands than sources. This work attempts to resolve the underdetermined issue by further conducting the light-splitting task using a network-inspired virtual prism, and as this task is challenging, we achieve so by incorporating the very advanced quantum feature extraction techniques. We emphasize that the prism is virtual (allowing us to fix the spectral response as a simple deterministic matrix), so the virtual hyperspectral image (HSI) it generates has no need to correspond to some real hyperspectral sensor; in other words, it is good enough as long as the virtual HSI satisfies some fundamental properties of light splitting (e.g., non-negativity and continuity). With the above virtual quantum prism, we know that the virtual HSI is expected to possess some desired simplex structure. This allows us to adopt the convex geometry to unmix the spectra, followed by downsampling the pure spectra back to the multispectral domain, thereby achieving MU. Experimental evidence shows great potential of our MU algorithm, termed as prism-inspired multispectral endmember extraction (PRIME).
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-16
SuperRPCA: A Collaborative Superpixel Representation Prior-Aided RPCA for Hyperspectral Anomaly Detection
Recently, numerous hyperspectral anomaly detection (HAD) methods have been proposed for broad and crucial applications. Among these, robust principal component analysis (RPCA) gains considerable attention in HAD, as it separates the matrix into global low-rank and sparse components, corresponding to the property of background and anomaly. However, RPCA solves the problem by treating hyperspectral imagery (HSI) as a matrix, but this approach alone cannot well describe the local spatial texture information. In addition, a pixel-wise detection method, collaborative representation detector (CRD), has been proposed, which exploits the vital piece of local information by assuming that background pixels can be composed of their neighbor pixels, while abnormal ones cannot. Although several CRD-based methods achieve promising HAD performances, they generally suffer from high computational costs due to the pixel-wise optimization scheme. To overcome the aforementioned two limitations, we propose a novel algorithm, SuperRPCA. First, we improve CRD to superpixel-wise calculation and reconstruct the background with a simplex-based algebraic solution. Subsequently, the rebuilt background is tailored to serve as a convex regularizer and integrated into RPCA. Besides, the regularizer inherently possesses a low-rank property, adeptly substituting the nuclear norm in traditional RPCA and hence significantly reducing computational costs. SuperRPCA demonstrates easily identifiable visual qualities and state-of-the-art quantitative performance with all the closed-form algorithmic expressions explicitly derived.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-16
SuperRPCA: A Collaborative Superpixel Representation Prior-Aided RPCA for Hyperspectral Anomaly Detection
Recently, numerous hyperspectral anomaly detection (HAD) methods have been proposed for broad and crucial applications. Among these, robust principal component analysis (RPCA) gains considerable attention in HAD, as it separates the matrix into global low-rank and sparse components, corresponding to the property of background and anomaly. However, RPCA solves the problem by treating hyperspectral imagery (HSI) as a matrix, but this approach alone cannot well describe the local spatial texture information. In addition, a pixel-wise detection method, collaborative representation detector (CRD), has been proposed, which exploits the vital piece of local information by assuming that background pixels can be composed of their neighbor pixels, while abnormal ones cannot. Although several CRD-based methods achieve promising HAD performances, they generally suffer from high computational costs due to the pixel-wise optimization scheme. To overcome the aforementioned two limitations, we propose a novel algorithm, SuperRPCA. First, we improve CRD to superpixel-wise calculation and reconstruct the background with a simplex-based algebraic solution. Subsequently, the rebuilt background is tailored to serve as a convex regularizer and integrated into RPCA. Besides, the regularizer inherently possesses a low-rank property, adeptly substituting the nuclear norm in traditional RPCA and hence significantly reducing computational costs. SuperRPCA demonstrates easily identifiable visual qualities and state-of-the-art quantitative performance with all the closed-form algorithmic expressions explicitly derived.
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-18
CODE-IF: A Convex/Deep Image Fusion Algorithm for Efficient Hyperspectral Super-Resolution
Super-resolving remotely acquired hyperspectral images, often with low resolution (LR), is a critical signal processing technique, as it greatly affects the subsequent material classification and identification tasks. An economical approach in the remote sensing area is to fuse the spatial details extracted from the high-resolution (HR) counterpart multispectral image into the LR hyperspectral image, thereby inferring the desired HR hyperspectral image. Convex analysis has been shown to be an effective tool for the fusion mission, but it often relies on sophisticated regularization schemes to tackle this challenging inverse problem. In the existing literature, the deep plug-and-play strategy was proposed for fast implementation of those sophisticated regularizers, but just approximately without convergence guarantees. Thus, we introduce deep learning (in an alternative approach) to tailor a simple convex regularizer for efficient super-resolution. Remarkably, though typical deep fusion methods can tackle non-linear effect presented in real hyperspectral data, they often rely on big data and sophisticated network structures, which are often time-consuming and resource-intensive. Instead, our deep regularizer just needs a small-data-driven simple network architecture that implies better stability and tractability; we achieve so by reconsidering the role of deep learning as simply to guide the convex algorithm to search the fusion solution, rather than directly serving as the final solution. The proposed convex deep image fusion (CODE-IF) algorithm, with all the closed-form algorithmic expressions derived, achieves state-of-the-art hyperspectral super-resolution performance.
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-18
CODE-IF: A Convex/Deep Image Fusion Algorithm for Efficient Hyperspectral Super-Resolution
Super-resolving remotely acquired hyperspectral images, often with low resolution (LR), is a critical signal processing technique, as it greatly affects the subsequent material classification and identification tasks. An economical approach in the remote sensing area is to fuse the spatial details extracted from the high-resolution (HR) counterpart multispectral image into the LR hyperspectral image, thereby inferring the desired HR hyperspectral image. Convex analysis has been shown to be an effective tool for the fusion mission, but it often relies on sophisticated regularization schemes to tackle this challenging inverse problem. In the existing literature, the deep plug-and-play strategy was proposed for fast implementation of those sophisticated regularizers, but just approximately without convergence guarantees. Thus, we introduce deep learning (in an alternative approach) to tailor a simple convex regularizer for efficient super-resolution. Remarkably, though typical deep fusion methods can tackle non-linear effect presented in real hyperspectral data, they often rely on big data and sophisticated network structures, which are often time-consuming and resource-intensive. Instead, our deep regularizer just needs a small-data-driven simple network architecture that implies better stability and tractability; we achieve so by reconsidering the role of deep learning as simply to guide the convex algorithm to search the fusion solution, rather than directly serving as the final solution. The proposed convex deep image fusion (CODE-IF) algorithm, with all the closed-form algorithmic expressions derived, achieves state-of-the-art hyperspectral super-resolution performance.
- Open Access
- 30 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 37477-37494
Optimization-Based Hyperspectral Spatiotemporal Super-Resolution
Due to hardware limitations and financial considerations, it is challenging to acquire fine spatial and temporal resolution (FSFT) images, which leads to the interest in spatiotemporal fusion problems. Instead of directly obtaining costly FSFT images, an alternative is to fuse fine spatial, coarse temporal resolution (FSCT) images with coarse spatial, fine temporal resolution (CSFT) images. Unlike existing spatiotemporal methods which are only designed for multispectral images, this paper first proposes a new fusion framework for hyperspectral spatiotemporal super-resolution, termed HSTSR. In this paper, we first deal with the coarse temporal resolution issue by adopting the fast iterative shrinkage-thresholding algorithm (FISTA) to estimate the missing images at the intermediate time series. Then, we fuse the hyperspectral image and the multispectral image in each time series via coupled nonnegative matrix factorization (CNMF) to get FSFT hyperspectral images. Importantly, we can automatically estimate the associated spatial blurring and spectral downsampling matrices without prior satellite hardware information. Compared with other extended multispectral spatiotemporal methods, our method not only attains satisfying qualities significantly faster, but also requires much less input data.
- 30 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 37477-37494
Open AccessOptimization-Based Hyperspectral Spatiotemporal Super-Resolution
Due to hardware limitations and financial considerations, it is challenging to acquire fine spatial and temporal resolution (FSFT) images, which leads to the interest in spatiotemporal fusion problems. Instead of directly obtaining costly FSFT images, an alternative is to fuse fine spatial, coarse temporal resolution (FSCT) images with coarse spatial, fine temporal resolution (CSFT) images. Unlike existing spatiotemporal methods which are only designed for multispectral images, this paper first proposes a new fusion framework for hyperspectral spatiotemporal super-resolution, termed HSTSR. In this paper, we first deal with the coarse temporal resolution issue by adopting the fast iterative shrinkage-thresholding algorithm (FISTA) to estimate the missing images at the intermediate time series. Then, we fuse the hyperspectral image and the multispectral image in each time series via coupled nonnegative matrix factorization (CNMF) to get FSFT hyperspectral images. Importantly, we can automatically estimate the associated spatial blurring and spectral downsampling matrices without prior satellite hardware information. Compared with other extended multispectral spatiotemporal methods, our method not only attains satisfying qualities significantly faster, but also requires much less input data.