Cheng-Yu Sie

dblp:303/9711 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2026 DATT: Dimension-Augmented Tensor-Train Decomposition for Neural Network Compression
Yu-Chuan Tai, Cheng-Yu Sie, Che-Rung Lee
COMPSAC2
2026 FEDA: Fast Exponential Decay Approach for Multivariate Time Series Forecasting
Ming-Ting Zhong, Cheng-Yu Sie, Che-Rung Lee
COMPSAC2
2024 LPSD: Low-Rank Plus Sparse Decomposition for Highly Compressed CNN Models
Kuei-Hsiang Huang, Cheng-Yu Sie, Jhong-En Lin, Che-Rung Lee
PAKDD (1)2
2021 Fast Unsupervised Spatiotemporal Super-Resolution for Multispectral Satellite Imaging Using Plug-and-Play Machinery Strategy
abstract
Acquiring high-spatial-resolution (HSR) images at high temporal sampling rate is not economical and even not achievable using contemporary multispectral satellite imaging hardware. An alternative is to fuse a set of HSR images acquired at low sampling rate, with another set of low-spatial-resolution images acquired at high sampling rate, and such fusion problem is referred to as spatiotemporal super-resolution (STSR). We mitigate the ill-posedness of the STSR problem by incorporating the image self-similarity prior (S2P), which is the key behind the design of several state-of-the-art imaging inverse problems. Unlike most super-resolution works in the computer vision area, our method does not rely on collecting big data. Instead, we propose a fully unsupervised STSR method by adopting the popular strategy in machine learning, known as plug-and-play optimization, and by carefully refining the required matrix computation/inversion. We term our method as STSRS2P, whose superiority and low computational complexity will be experimentally verified.
Chia-Hsiang Lin, Cheng-Yu Sie, Pang-Yu Lin, Jhao-Ting Lin
IGARSS2