arXiv subjects

Heung-No Lee

Publications and source records attributed to Heung-No Lee.

At least 19 recordsLinked to original sources

arXiv2025

AI-Driven HSI: Multimodality, Fusion, Challenges, and the Deep Learning Revolution

Hyperspectral imaging (HSI) captures spatial and spectral data, enabling analysis of features invisible to conventional systems. The technology is vital in fields such as weather monitoring, food quality control, counterfeit detection, healthcare diagnostics, and extending into defense, agriculture, and industrial automation at the same time. HSI has advanced with improvements in spectral resolution, miniaturization, and computational methods. This study provides an overview of the HSI, its applications, challenges in data fusion and the role of deep learning models in processing HSI data. We discuss how integration of multimodal HSI with AI, particularly with deep learning, improves classification accuracy and operational efficiency. Deep learning enhances HSI analysis in areas like feature extraction, change detection, denoising unmixing, dimensionality reduction, landcover mapping, data augmentation, spectral construction and super resolution. An emerging focus is the fusion of hyperspectral cameras with large language models (LLMs), referred as highbrain LLMs, enabling the development of advanced applications such as low visibility crash detection and face antispoofing. We also highlight key players in HSI industry, its compound annual growth rate and the growing industrial significance. The purpose is to offer insight to both technical and non-technical audience, covering HSI's images, trends, and future directions, while providing valuable information on HSI datasets and software libraries.

cs.CV↗

arXiv2022

Green Bitcoin: Global Sound Money

Modern societies have adopted government-issued fiat currencies many of which exist today mainly in the form of digits in credit and bank accounts. Fiat currencies are controlled by central banks for economic stimulation and stabilization. Boom-and-bust cycles are created. The volatility of the cycle has become increasingly extreme. Social inequality due to the concentration of wealth is prevalent worldwide. As such, restoring sound money, which provides stored value over time, has become a pressing issue. Currently, cryptocurrencies such as Bitcoin are in their infancy and may someday qualify as sound money. Bitcoin today is considered as a digital asset for storing value. But Bitcoin has problems. The first issue of the current Bitcoin network is its high energy consumption consensus mechanism. The second is the cryptographic primitives which are unsafe against post-quantum (PQ) attacks. We aim to propose Green Bitcoin which addresses both issues. To save energy in consensus mechanism, we introduce a post-quantum secure (self-election) verifiable coin-toss function and novel PQ secure proof-of-computation primitives. It is expected to reduce the rate of energy consumption more than 90 percent of the current Bitcoin network. The elliptic curve cryptography will be replaced with PQ-safe versions. The Green Bitcoin protocol will help Bitcoin evolve into a post-quantum secure network.

cs.CR↗

arXiv2022

Deep learning-based single-shot computational spectrometer using multilayer thin films

Computational spectrometers have mobile application potential, such as on-site detection and self-diagnosis, by offering compact size, fast operation time, high resolution, wide working range, and low-cost production. Although these spectrometers have been extensively studied, demonstrations are confined to a few examples of straightforward spectra. This study demonstrates deep learning (DL)-based single-shot computational spectrometer for narrow and broad spectra using a multilayer thin-film filter array. For measuring light intensities, the device was built by attaching the filter array, fabricated using a wafer-level stencil lithography process, to a complementary metal-oxide-semiconductor image sensor. All the intensities were extracted from a monochrome image captured with a single exposure. A DL architecture comprising a dense layer and a U-Net backbone with residual connections was employed for spectrum reconstruction. The measured intensities were fed into the DL architecture for reconstruction as spectra. We reconstructed 323 continuous spectra with an average root mean squared error of 0.0288 in a 500-850 nm wavelength range with 1-nm spacing. Our computational spectrometer achieved a compact size, fast measuring time, high resolution, and wide working range.

physics.optics↗

arXiv2020

Blockchain-Based Distributed Patient-Centric Image Management System

In recent years, many researchers have focused on developing a feasible solution for storing and exchanging medical images in the field of health care. Current practices are deployed on cloud-based centralized data centers, which increase maintenance costs, require massive storage space, and raise privacy concerns about sharing information over a network. Therefore, it is important to design a framework to enable sharing and storing of big medical data efficiently within a trustless environment. In the present paper, we propose a novel proof-of-concept design for a distributed patient-centric image management (PCIM) system that is aimed to ensure safety and control of patient private data without using a centralized infrastructure. In this system, we employed an emerging Ethereum blockchain and a distributed file system technology called InterPlanetary File System (IPFS). Then, we implemented an Ethereum smart contract called the patientcentric access control protocol to enable a distributed and trustworthy access control policy. IPFS provides the means for decentralized storage of medical images with global accessibility. We describe how the PCIM system architecture facilitates the distributed and secured patient-centric data access across multiple entities such as hospitals, patients, and image requestors. Finally, we deployed a smart contract prototype on an Ethereum testnet blockchain and evaluated the proposed framework within the Windows environment. The evaluation results demonstrated that the proposed scheme is efficient and feasible.

cs.CR↗

arXiv2020

Profitable Double-Spending Attacks

Our aim in this paper is to investigate the profitability of double-spending (DS) attacks that manipulate an a priori mined transaction in a blockchain. It was well understood that a successful DS attack is established when the proportion of computing power an attacker possesses is higher than that the honest network does. What is not yet well understood is how threatening a DS attack with less than 50% computing power used can be. Namely, DS attacks at any proportion can be of a threat as long as the chance to making a good profit exists. Profit is obtained when the revenue from making a successful DS attack is greater than the cost of carrying out one. We have developed a novel probability theory for calculating a finite time attack probability. This can be used to size up attack resources needed to obtain the profit. The results enable us to derive a sufficient and necessary condition on the value of a transaction targeted by a DS attack. Our result is quite surprising: we theoretically show that DS attacks at any proportion of computing power can be made profitable. Given one's transaction size, the results can also be used to assess the risk of a DS attack. An example of the attack resources is provided for the BitcoinCash network.

cs.CR↗

arXiv2020

Time-Variant Proof-of-Work Using Error-Correction Codes

The protocol for cryptocurrencies can be divided into three parts, namely consensus, wallet, and networking overlay. The aim of the consensus part is to bring trustless rational peer-to-peer nodes to an agreement to the current status of the blockchain. The status must be updated through valid transactions. A proof-of-work (PoW) based consensus mechanism has been proven to be secure and robust owing to its simple rule and has served as a firm foundation for cryptocurrencies such as Bitcoin and Ethereum. Specialized mining devices have emerged, as rational miners aim to maximize profit, and caused two problems: i) the re-centralization of a mining market and ii) the huge energy spending in mining. In this paper, we aim to propose a new PoW called Error-Correction Codes PoW (ECCPoW) where the error-correction codes and their decoder can be utilized for PoW. In ECCPoW, puzzles can be intentionally generated to vary from block to block, leading to a time-variant puzzle generation mechanism. This mechanism is useful in repressing the emergence of the specialized mining devices. It can serve as a solution to the two problems of recentralization and energy spending.

cs.CR↗

arXiv2018

Intentional Aliasing Method to Improve Sub-Nyquist Sampling System

A modulated wideband converter (MWC) has been introduced as a sub-Nyquist sampler that exploits a set of fast alternating pseudo random (PR) signals. Through parallel sampling branches, an MWC compresses a multiband spectrum by mixing it with PR signals in the time domain, and acquires its sub-Nyquist samples. Previously, the ratio of compression was fully dependent on the specifications of PR signals. That is, to further reduce the sampling rate without information loss, faster and longer-period PR signals were needed. However, the implementation of such PR signal generators results in high power consumption and large fabrication area. In this paper, we propose a novel aliased modulated wideband converter (AMWC), which can further reduce the sampling rate of MWC with fixed PR signals. The main idea is to induce intentional signal aliasing at the analog-to-digital converter (ADC). In addition to the first spectral compression by the signal mixer, the intentional aliasing compresses the mixed spectrum once again. We demonstrate that AMWC reduces the number of sampling branches and the rate of ADC for lossless sub-Nyquist sampling without needing to upgrade the speed or period of PR signals. Conversely, for a given fixed number of sampling branches and sampling rate, AMWC improves the performance of signal reconstruction.

eess.SP↗

arXiv2016

Circular Sphere Decoding: A Low Complexity Detection for MIMO Systems with General Two-dimensional Signal Constellations

We propose a low complexity complex valued Sphere Decoding (CV-SD) algorithm, referred to as Circular Sphere Decoding (CSD) which is applicable to multiple-input multiple-output (MIMO) systems with arbitrary two dimensional (2D) constellations. CSD provides a new constraint test. This constraint test is carefully designed so that the element-wise dependency is removed in the metric computation for the test. As a result, the constraint test becomes simple to perform without restriction on its constellation structure. By additionally employing this simple test as a prescreening test, CSD reduces the complexity of the CV-SD search. We show that the complexity reduction is significant while its maximum-likelihood (ML) performance is not compromised. We also provide a powerful tool to estimate the pruning capacity of any particular search tree. Using this tool, we propose the Predict-And-Change strategy which leads to a further complexity reduction in CSD. Extension of the proposed methods to soft output SD is also presented.

cs.IT↗

arXiv2016

An Information Theoretic Study for Noisy Compressed Sensing With Joint Sparsity Model-2

In this paper, we study a support set reconstruction problem in which the signals of interest are jointly sparse with a common support set, and sampled by joint sparsity model-2 (JSM-2) in the presence of noise. Using mathematical tools, we develop upper and lower bounds on the failure probability of support set reconstruction in terms of the sparsity, the ambient dimension, the minimum signal to noise ratio, the number of measurement vectors and the number of measurements. These bounds can be used to provide a guideline to determine the system parameters in various applications of compressed sensing with noisy JSM-2. Based on the bounds, we develop necessary and sufficient conditions for reliable support set reconstruction. We interpret these conditions to give theoretical explanations about the benefits enabled by joint sparsity structure in noisy JSM-2. We compare our sufficient condition with the existing result of noisy multiple measurement vectors model (MMV). As a result, we show that noisy JSM-2 may require less number of measurements than noisy MMV for reliable support set reconstruction.

cs.IT↗

arXiv2015

Bernoulli-Gaussian Approximate Message-Passing Algorithm for Compressed Sensing with 1D-Finite-Difference Sparsity

This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is low-computational with its fast convergence and cheap per-iteration cost, providing phase transition nearly approaching to the state-of-the-art. The proposed algorithm is originated from a sum-product message-passing rule, applying a Bernoulli-Gaussian (BG) prior, seeking an MMSE solution. The algorithm construction includes not only the conventional AMP technique for the measurement fidelity, but also suggests a simplified message-passing method to promote the signal sparsity in finite-difference. Furthermore, we provide an EM-tuning methodology to learn the BG prior parameters, suggesting how to use some practical measurement matrices satisfying the RIP requirement under the ssAMP-BGFD recovery. Extensive empirical results confirms performance of the proposed algorithm, in phase transition, convergence speed, and CPU runtime, compared to the recent algorithms.

cs.IT↗

arXiv2015

Concise Probability Distributions of Eigenvalues of Real-Valued Wishart Matrices

In this paper, we consider the problem of deriving new eigenvalue distributions of real-valued Wishart matrices that arises in many scientific and engineering applications. The distributions are derived using the tools from the theory of skew symmetric matrices. In particular, we relate the multiple integrals of a determinant, which arises while finding the eigenvalue distributions, in terms of the Pfaffian of skew-symmetric matrices. Pfaffians being the square root of skew symmetric matrices are easy to compute than the conventional distributions that involve Zonal polynomials or beta integrals. We show that the plots of the derived distributions are exactly coinciding with the numerically simulated plots.

cs.IT↗

arXiv2015

Restricted Isometry Random Variables: Probability Distributions, RIC Prediction and Phase Transition Analysis for Gaussian Encoders

In this paper, we aim to generalize the notion of restricted isometry constant (RIC) in compressive sensing (CS) to restricted isometry random variable (RIV). Associated with a deterministic encoder there are two RICs, namely, the left and the right RIC. We show that these RICs can be generalized to a left RIV and a right RIV for an ensemble of random encoders. We derive the probability and the cumulative distribution functions of these RIVs for the most widely used i.i.d. Gaussian encoders. We also derive the asymptotic distributions of the RIVs and show that the distribution of the left RIV converges (in distribution) to the Weibull distribution, whereas that of the right RIV converges to the Gumbel distribution. By adopting the RIV framework, we bring to forefront that the current practice of using eigenvalues for RIC prediction can be improved. We show on the one hand that the eigenvalue-based approaches tend to overestimate the RICs. On the other hand, the RIV-based analysis yields precise estimates of the RICs. We also demonstrate that this precise estimation aids to improve the previous RIC-based phase transition analysis in CS.

cs.IT↗

arXiv2015

Bayesian Hypothesis Test using Nonparametric Belief Propagation for Noisy Sparse Recovery

This paper proposes a low-computational Bayesian algorithm for noisy sparse recovery (NSR), called BHT-BP. In this framework, we consider an LDPC-like measurement matrices which has a tree-structured property, and additive white Gaussian noise. BHT-BP has a joint detection-and-estimation structure consisting of a sparse support detector and a nonzero estimator. The support detector is designed under the criterion of the minimum detection error probability using a nonparametric belief propagation (nBP) and composite binary hypothesis tests. The nonzeros are estimated in the sense of linear MMSE, where the support detection result is utilized. BHT-BP has its strength in noise robust support detection, effectively removing quantization errors caused by the uniform sampling-based nBP. Therefore, in the NSR problems, BHT-BP has advantages over CS-BP which is an existing nBP algorithm, being comparable to other recent CS solvers, in several aspects. In addition, we examine impact of the minimum nonzero value of sparse signals via BHT-BP, on the basis of the results of the recent literature. Our empirical result shows that variation of x_min is reflected to recovery performance in the form of SNR shift.

cs.IT↗

arXiv2014

Holistic random encoding for imaging through multimode fibers

The input numerical aperture (NA) of multimode fiber (MMF) can be effectively increased by placing turbid media at the input end of the MMF. This provides the potential for high-resolution imaging through the MMF. While the input NA is increased, the number of propagation modes in the MMF and hence the output NA remains the same. This makes the image reconstruction process underdetermined and may limit the quality of the image reconstruction. In this paper, we aim to improve the signal to noise ratio (SNR) of the image reconstruction in imaging through MMF. We notice that turbid media placed in the input of the MMF transforms the incoming waves into a better format for information transmission and information extraction. We call this transformation as holistic random (HR) encoding of turbid media. By exploiting the HR encoding, we make a considerable improvement on the SNR of the image reconstruction. For efficient utilization of the HR encoding, we employ sparse representation (SR), a relatively new signal reconstruction framework when it is provided with a HR encoded signal. This study shows for the first time to our knowledge the benefit of utilizing the HR encoding of turbid media for recovery in the optically underdetermined systems where the output NA of it is smaller than the input NA for imaging through MMF.

physics.optics↗

arXiv2013

Phase Transition Analysis of Sparse Support Detection from Noisy Measurements

This paper investigates the problem of sparse support detection (SSD) via a detection-oriented algorithm named Bayesian hypothesis test via belief propagation (BHT-BP). Our main focus is to compare BHT-BP to an estimation-based algorithm, called CS-BP, and show its superiority in the SSD problem. For this investigation, we perform a phase transition (PT) analysis over the plain of the noise level and signal magnitude on the signal support. This PT analysis sharply specifies the required signal magnitude for the detection under a certain noise level. In addition, we provide an experimental validation to assure the PT analysis. Our analytical and experimental results show the fact that BHT-BP detects the signal support against additive noise more robustly than CS-BP does.

cs.IT↗

arXiv2013

Bayesian Hypothesis Test for Sparse Support Recovery using Belief Propagation

In this paper, we introduce a new support recovery algorithm from noisy measurements called Bayesian hypothesis test via belief propagation (BHT-BP). BHT-BP focuses on sparse support recovery rather than sparse signal estimation. The key idea behind BHT-BP is to detect the support set of a sparse vector using hypothesis test where the posterior densities used in the test are obtained by aid of belief propagation (BP). Since BP provides precise posterior information using the noise statistic, BHT-BP can recover the support with robustness against the measurement noise. In addition, BHT-BP has low computational cost compared to the other algorithms by the use of BP. We show the support recovery performance of BHT-BP on the parameters (N; M; K; SNR) and compare the performance of BHT-BP to OMP and Lasso via numerical results.

cs.IT↗

arXiv2012

On the Compressed Measurements over Finite Fields: Sparse or Dense Sampling

We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the finite fields are varied. One of interesting conclusions includes that unless the signal is "ultra" sparse, the sensing matrices do not have to be dense.

cs.IT↗

arXiv2012

Detection-Directed Sparse Estimation using Bayesian Hypothesis Test and Belief Propagation

In this paper, we propose a sparse recovery algorithm called detection-directed (DD) sparse estimation using Bayesian hypothesis test (BHT) and belief propagation (BP). In this framework, we consider the use of sparse-binary sensing matrices which has the tree-like property and the sampled-message approach for the implementation of BP. The key idea behind the proposed algorithm is that the recovery takes DD-estimation structure consisting of two parts: support detection and signal value estimation. BP and BHT perform the support detection, and an MMSE estimator finds the signal values using the detected support set. The proposed algorithm provides noise-robustness against measurement noise beyond the conventional MAP approach, as well as a solution to remove quantization effect by the sampled-message based BP independently of memory size for the message sampling. We explain how the proposed algorithm can have the aforementioned characteristics via exemplary discussion. In addition, our experiments validate such superiority of the proposed algorithm, compared to recent algorithms under noisy setup. Interestingly the experimental results show that performance of the proposed algorithm approaches that of the oracle estimator as SNR becomes higher.

cs.IT↗