arXiv subjects

Chun Tung Chou

Publications and source records attributed to Chun Tung Chou.

At least 19 recordsLinked to original sources

arXiv2026

SweetFruit: A Two-Stage Mobile Sensing System for Real-Time Fruit Sugar Estimation

Accurate prediction of fruit sugar content is essential for quality control and market valuation in agriculture. Conventional measurement techniques rely on destructive, time-consuming processes (e.g., juicing and refractometry) or direct contact instruments, which hinder high-throughput operations. This paper introduces SweetFruit, a mobile two-stage system that leverages low-cost sensors to estimate fruit sugar content without contact. In Stage 1, we implement a lightweight 3D deep learning model (SF-PointNet) that uses point clouds from a Time-of-Flight (ToF) depth camera to classify fruit as high or low sugar. In Stage 2, a regression network (SF-Net) predicts the fruit's Brix value using measurements from a compact 18-channel near-infrared (NIR) spectrometer. The system uses simple off-the-shelf sensors (AS7265x NIR and Arducam ToF) with efficient processing pipelines for real-time execution on embedded platforms. Experiments on green 'Granny Smith' apples and strawberries demonstrate the system's effectiveness. Stage 1 achieves over 90% classification accuracy, enabling rapid prescreening, while Stage 2 delivers precise sugar estimates, with a root mean square error (RMSE) of 0.57 Brix, reducing error by 22% compared to using NIR sensing alone. SweetFruit offers a scalable, field-ready solution for rapid fruit quality screening, showcasing the benefits of task-specific multimodal sensing in mobile agricultural applications.

eess.SP↗

arXiv2025

Scale What Counts, Mask What Matters: Evaluating Foundation Models for Zero-Shot Cross-Domain Wi-Fi Sensing

While Wi-Fi sensing offers a compelling, privacy-preserving alternative to cameras, its practical utility has been fundamentally undermined by a lack of robustness across domains. Models trained in one setup fail to generalize to new environments, hardware, or users, a critical "domain shift" problem exacerbated by modest, fragmented public datasets. We shift from this limited paradigm and apply a foundation model approach, leveraging Masked Autoencoding (MAE) style pretraining on the largest and most heterogeneous Wi-Fi CSI datasets collection assembled to date. Our study pretrains and evaluates models on over 1.3 million samples extracted from 14 datasets, collected using 4 distinct devices across the 2.4/5/6 GHz bands and bandwidths from 20 to 160 MHz. Our large-scale evaluation is the first to systematically disentangle the impacts of data diversity versus model capacity on cross-domain performance. The results establish scaling trends on Wi-Fi CSI sensing. First, our experiments show log-linear improvements in unseen domain performance as the amount of pretraining data increases, suggesting that data scale and diversity are key to domain generalization. Second, based on the current data volume, larger model can only provide marginal gains for cross-domain performance, indicating that data, rather than model capacity, is the current bottleneck for Wi-Fi sensing generalization. Finally, we conduct a series of cross-domain evaluations on human activity recognition, human gesture recognition and user identification tasks. The results show that the large-scale pretraining improves cross-domain accuracy ranging from 2.2% to 15.7%, compared to the supervised learning baseline. Overall, our findings provide insightful direction for designing future Wi-Fi sensing systems that can eventually be robust enough for real-world deployment.

cs.CV↗

arXiv2025

CARTS: Cooperative and Adaptive Resource Triggering and Stitching for 5G ISAC

This paper presents CARTS, an adaptive 5G uplink sensing scheme designed to provide Integrated Sensing and Communication (ISAC) services. The performance of both communication and sensing fundamentally depends on the availability of accurate and up-to-date channel state information (CSI). In modern 5G networks, uplink CSI is derived from two reference signals: the demodulation reference signal (DMRS) and the sounding reference signal (SRS). However, current base station implementations treat these CSI measurements as separate information streams. The key innovation of CARTS is to fuse these two CSI streams, thereby increasing the frequency of CSI updates and extending sensing opportunities to more users. CARTS addresses two key challenges: (i) a novel channel stitching and compensation method that integrates asynchronous CSI estimates from DMRS and SRS, despite their different time and frequency allocations, and (ii) a real-time SRS triggering algorithm that complements the inherently uncontrollable DMRS schedule, ensuring sufficient and non-redundant sensing opportunities for all users. Our trace-driven evaluation shows that CARTS significantly improves scalability, achieving a channel estimation error (NMSE) of 0.167 and UE tracking accuracy of 85 cm while supporting twice the number of users as a periodic SRS-only baseline with similar performance. By opportunistically combining DMRS and SRS, CARTS therefore provides a practical, standard-compliant solution to improve CSI availability for ISAC without requiring additional radio resources.

cs.NI↗

arXiv2025

mmMirror: Device Free mmWave Indoor NLoS Localization Using Van-Atta-Array IRS

Industry 4.0 is transforming manufacturing and logistics by integrating robots into shared human environments, such as factories, warehouses, and healthcare facilities. However, the risk of human-robot collisions, especially in Non-Line-of-Sight (NLoS) scenarios like around corners, remains a critical challenge. Existing solutions, such as vision-based and LiDAR systems, often fail under occlusion, lighting constraints, or privacy concerns, while RF-based systems are limited by range and accuracy. To address these limitations, we propose mmMirror, a novel system leveraging a Van Atta Array-based millimeter-wave (mmWave) reconfigurable intelligent reflecting surface (IRS) for precise, device-free NLoS localization. mmMirror integrates seamlessly with existing frequency-modulated continuous-wave (FMCW) radars and offers: (i) robust NLoS localization with centimeter-level accuracy at ranges up to 3 m, (ii) seamless uplink and downlink communication between radar and IRS, (iii) support for multi-radar and multi-target scenarios via dynamic beam steering, and (iv) reduced scanning latency through adaptive time slot allocation. Implemented using commodity 24 GHz radars and a PCB-based IRS prototype, mmMirror demonstrates its potential in enabling safe human-robot interactions in dynamic and complex environments.

cs.NI↗

arXiv2025

N$^2$LoS: Single-Tag mmWave Backscatter for Robust Non-Line-of-Sight Localization

The accuracy of traditional localization methods significantly degrades when the direct path between the wireless transmitter and the target is blocked or non-penetrable. This paper proposes N2LoS, a novel approach for precise non-line-of-sight (NLoS) localization using a single mmWave radar and a backscatter tag. N2LoS leverages multipath reflections from both the tag and surrounding reflectors to accurately estimate the targets position. N2LoS introduces several key innovations. First, we design HFD (Hybrid Frequency-Hopping and Direct Sequence Spread Spectrum) to detect and differentiate reflectors from the target. Second, we enhance signal-to-noise ratio (SNR) by exploiting the correlation properties of the designed signals, improving detection robustness in complex environments. Third, we propose FS-MUSIC (Frequency-Spatial Multiple Signal Classification), a super resolution algorithm that extends the traditional MUSIC method by constructing a higher-rank signal matrix, enabling the resolution of additional multipath components. We evaluate N2LoS using a 24 GHz mmWave radar with 250 MHz bandwidth in three diverse environments: a laboratory, an office, and an around-the-corner corridor. Experimental results demonstrate that N2LoS achieves median localization errors of 10.69 cm (X) and 11.98 cm (Y) at a 5 m range in the laboratory setting, showcasing its effectiveness for real-world NLoS localization.

eess.SP↗

arXiv2024

Enzymatic cycle-based receivers for approximate maximum a posteriori demodulation of concentration modulated signals

Molecular communication is a bio-inspired communication paradigm where molecules are used as the information carrier. This paper considers a molecular communication network where the transmitter uses concentration modulated signals for communication. Our focus is to design receivers that can demodulate these signals. We want the receivers to use enzymatic cycles as their building blocks and can work approximately as a maximum a posteriori (MAP) demodulator. No receivers with all these features exist in the current molecular communication literature. We consider enzymatic cycles because they are a very common class of chemical reactions that are found in living cells. In addition, a MAP receiver has good statistical performance. In this paper, we study the operating regime of an enzymatic cycle and how the parameters of the enzymatic cycles can be chosen so that the receiver can approximately implement a MAP demodulator. We use simulation to study the performance of this receiver. We show that we can reduce the bit-error ratio of the demodulator if the enzymatic cycle operates in specific parameter regimes.

cs.IT↗

arXiv2024

MotionLeaf: Fine-grained Multi-Leaf Damped Vibration Monitoring for Plant Water Stress using Low-Cost mmWave Sensors

In this paper, we introduce MotionLeaf , a novel mmWave base multi-point vibration frequency measurement system that can estimate plant stress by analyzing the surface vibrations of multiple leaves. MotionLeaf features a novel signal processing pipeline that accurately estimates fine-grained damped vibration frequencies based on noisy micro-displacement measurements from a mmWave radar. Specifically we explore the Interquartile Mean (IQM) of coherent phase differences from neighboring Frequency-Modulated Continuous Wave (FMCW) radar chirps to calculate micro-displacements. Furthermore, we use the measurements from multiple received antennas in the radar to estimate the vibration signals of different leaves via a Blind Source Separation (BSS) method. Experimental results demonstrate that MotionLeaf can accurately measure the frequency of multiple leaves in a plant with average error of 0.0176 Hz, which is less than 50% of that (0.0416 Hz) of the state-of-the-art approach (mmVib). Additionally, the estimated natural vibration frequencies from MotionLeaf are shown to be an excellent feature to detect the water stress in the plant during 7-day drought experiments.

eess.SP↗

arXiv2024

A New Architecture for Energy Efficient Fault Detection Using Energy Harvesters

The current battery-powered fault detection system for vibration monitoring has a rather limited lifetime. This is because the high-frequency sampling (typically tens of kilo-Hertz) required for vibration monitoring results in high energy consumption in both the analog-to-digital (ADC) converter and wireless transmissions. This paper proposes a new fault detection architecture that can significantly reduce the energy consumption of the ADC and wireless transmission. Our inspiration for the new architecture is based on the observation that the many tens of thousand of data samples collected for fault detection are ultimately transformed into a small number of features. If we can generate these features directly without high frequency sampling, then we can avoid the the energy cost for ADC and wireless transmissions. We propose to use piezoelectric energy harvesters (which can be designed to have different frequency responses) and integrators to obtain these features in an energy-efficient manner. By using a publicly available data set for ball bearing fault detection (which was originally sampled at 51.2kHz) and piezoelectric energy harvester models, we can produce features, which when sampled at 0.33Hz, give a fault detection accuracy of 89% while reducing the sampling requirement by 4 orders-of-magnitude.

eess.SP↗

arXiv2022

Using transcription-based detectors to emulate the behaviour of sequential probability ratio-based concentration detectors

The sequential probability ratio test (SPRT) from statistics is known to have the least mean decision time compared to other sequential or fixed-time tests for given error rates. In some circumstances, cells need to make decisions accurately and quickly, therefore it has been suggested the SPRT may be used to understand the speed-accuracy tradeoff in cellular decision making. It is generally thought that in order for cells to make use of the SPRT, it is necessary to find biochemical circuits that can compute the log-likelihood ratio needed for the SPRT. However, this paper takes a different approach. We recognise that the high-level behaviour of the SPRT is defined by its positive detection or hit rate, and the computation of the log-likelihood ratio is just one way to realise this behaviour. In this paper, we will present a method which uses a transcription-based detector to emulate the hit rate of the SPRT without computing the exact log-likelihood ratio. We consider the problem of using a promoter with multiple binding sites to accurately and quickly detect whether the concentration of a transcription factor is above a target level. We show that it is possible to find binding and unbinding rates of the transcription factor to the promoter's binding sites so that the probability that the amount of mRNA produced will be higher than a threshold is approximately equal to the hit rate of the SPRT detector. Moreover, we show that the average time that this transcription-based detector needs to make a positive detection is less than or equal to that of the SPRT for a wide range of concentrations. We remark that the last statement does not contradict Wald's optimality result because our transcription-based detector uses an open-ended test.

q-bio.MN↗

arXiv2021

Using biochemical circuits to approximately compute log-likelihood ratio for detecting persistent signals

Given that biochemical circuits can process information by using analog computation, a question is: What can biochemical circuits compute? This paper considers the problem of using biochemical circuits to distinguish persistent signals from transient ones. We define a statistical detection problem over a reaction pathway consisting of three species: an inducer, a transcription factor (TF) and a gene promoter, where the inducer can activate the TF and an active TF can bind to the gene promoter. We model the pathway using the chemical master equation so the counts of bound promoters over time is a stochastic signal. We consider the problem of using the continuous-time stochastic signal of the counts of bound promoters to infer whether the inducer signal is persistent or not. We use statistical detection theory to derive the solution to this detection problem, which is to compute the log-likelihood ratio of observing a persistent signal to a transient one. We then show, using time-scale separation and other assumptions, that this log-likelihood ratio can be approximately computed by using the continuous-time signals of the number of active TF molecules and the number of bound promoters when the input is persistent. Finally, we show that the coherent feedforward gene circuits can be used to approximately compute this log-likelihood ratio when the inducer signal is persistent.

q-bio.MN↗

arXiv2019

Designing molecular circuits for approximate maximum a posteriori demodulation of concentration modulated signals

Motivated by the fact that living cells use molecular circuits (i.e. a set of chemical reactions) for information processing, this paper investigates the problem of designing molecular circuits for demodulation. In our earlier work, we use a Markovian approach to derive a demodulator for diffusion-based molecular communication. The demodulation filters take the form of an ordinary differential equation which computes the log-posteriori probability of a transmission symbol being sent. This work considers the realisation of these demodulation filters using molecular circuits assuming the transmission symbols are rectangular pulses of the same duration but different amplitudes, i.e. concentration modulation. This paper makes a number of contributions. First, we use time-scale separation and renewal theory to analytically derive an approximation of the demodulation filter from our earlier work. Second, we present a method to turn this approximation into a molecular circuit. By using simulation, we show that the output of the derived molecular circuit is approximately equal to the log-posteriori probability calculated by the exact demodulation filter if the log-posteriori probability is positive. Third, we demonstrate that a biochemical circuit in yeast behaves similarly to the derived molecular demodulation filter and is therefore a candidate for implementing the derived filter.

cs.IT↗

arXiv2019

Using spatial partitioning to reduce the bit error rate of diffusion-based molecular communications

This work builds on our earlier work on designing demodulators for diffusion-based molecular communications using a Markovian approach. The demodulation filters take the form of an ordinary differential equation (ODE) which computes the log-posteriori probability of observing a transmission symbol given the continuous history of receptor activities. A limitation of our earlier work is that the receiver is assumed to be a small cubic volume called a voxel. In this work, we extend the maximum a-posteriori demodulation to the case where the receiver may consist of multiple voxels and derive the ODE for log-posteriori probability calculation. This extension allows us to study receiver behaviour of different volumes and shapes. In particular, it also allows us to consider spatially partitioned receivers where the chemicals in the receiver are not allowed to mix. The key result of this paper is that spatial partitioning can be used to reduce bit-error rate in diffusion-based molecular communications.

cs.IT↗

arXiv2018

Detection of persistent signals and its relation to coherent feedforward loops

Many studies have shown that cells use temporal dynamics of signalling molecules to encode information. One particular class of temporal dynamics is persistent and transient signals, i.e. signals of long and short durations respectively. It has been shown that the coherent type-1 feedforward loop with an AND logic at the output (or C1-FFL for short) can be used to discriminate a persistent input signal from a transient one. This has been done by modelling the C1-FFL, and then use the model to show that persistent and transient input signals give, respectively, a non-zero and zero output. Instead of assuming the structure of C1-FFL, this paper shows that it is possible to deduce the C1-FFL model from the requirement of discriminating a persistent signal. We do this by first formulating a statistical detection problem of distinguishing persistent signals from transient ones. The solution of the detection problem is to compute the log-likelihood ratio of observing a persistent signal to a transient signal. We show that, if this log-likelihood ratio is positive, which happens when the signal is likely to be persistent, then it can be approximately computed by a C1-FFL. Although the capability of C1-FFL to discriminate persistent signals is known, this paper adds an information processing interpretation on how a C1-FFL works as a detector of persistent signals.

q-bio.MN↗

arXiv2018

From Real to Complex: Enhancing Radio-based Activity Recognition Using Complex-Valued CSI

Activity recognition is an important component of many pervasive computing applications. Radio-based activity recognition has the advantage that it does not have the privacy concern and the subjects do not have to carry a device on them. Recently, it has been shown channel state information (CSI) can be used for activity recognition in a device-free setting. With the proliferation of wireless devices, it is important to understand how radio frequency interference (RFI) can impact on pervasive computing applications. In this paper, we investigate the impact of RFI on device-free CSI-based location-oriented activity recognition. We present data to show that RFI can have a significant impact on the CSI vectors. In the absence of RFI, different activities give rise to different CSI vectors that can be differentiated visually. However, in the presence of RFI, the CSI vectors become much noisier and activity recognition also becomes harder. Our extensive experiments show that the performance of state-of-the-art classification methods may degrade significantly with RFI. We then propose a number of counter measures to mitigate the impact of RFI and improve the location-oriented activity recognition performance. We are also the first to use complex-valued CSI to improve the performance in the environment with RFI.

cs.NI↗

arXiv2017

Improving the capacity of molecular communication using enzymatic reaction cycles

This paper considers the capacity of a diffusion-based molecular communication link assuming the receiver uses chemical reactions. The key contribution is we show that enzymatic reaction cycles, which is a class of chemical reactions commonly found in cells consisting of a forward and a backward enzymatic reaction, can improve the capacity of the communication link. The technical difficulty in analysing enzymatic reaction cycles is that their reaction rates are nonlinear. We deal with this by assuming that the amount of certain chemicals in the enzymatic reaction cycle is large. In order to simplify the problem further, we use singular perturbation to study a particular operating regime of the enzymatic reaction cycles. This allows us to derive a closed-form expression of the channel gain. This expression suggests that we can improve the channel gain by increasing the total amount of substrate in the enzymatic reaction cycle. By using numerical calculations, we show that the effect of the enzymatic reaction cycle is to increase the channel gain and to reduce the noise, which results in a better signalto- noise ratio and in turn a higher communication capacity. Furthermore, we show that we can increase the capacity by increasing the total amount of substrate in the enzymatic reaction cycle.

cs.IT↗

arXiv2016

Generalized Solution for the Demodulation of Reaction Shift Keying Signals in Molecular Communication Networks

This paper considers a diffusion-based molecular communication system where the transmitter uses Reaction Shift Keying (RSK) as the modulation scheme. We focus on the demodulation of RSK signal at the receiver. The receiver consists of a front-end molecular circuit and a back-end demodulator. The front-end molecular circuit is a set of chemical reactions consisting of multiple chemical species. The optimal demodulator computes the posteriori probability of the transmitted symbols given the history of the observation. The derivation of the optimal demodulator requires the solution to a specific Bayesian filtering problem. The solution to this Bayesian filtering problem had been derived for a few specific molecular circuits and specific choice(s) of observed chemical species. The derivation of such solution is also lengthy. The key contribution of this paper is to present a general solution to this Bayesian filtering problem which can be applied to any molecular circuit and any choice of observed species.

cs.IT↗

arXiv2015

A Markovian Approach to the Optimal Demodulation of Diffusion-based Molecular Communication Networks

In a diffusion-based molecular communication network, transmitters and receivers communicate by using signalling molecules (or ligands) in a fluid medium. This paper assumes that the transmitter uses different chemical reactions to generate different emission patterns of signalling molecules to represent different transmission symbols, and the receiver consists of receptors. When the signalling molecules arrive at the receiver, they may react with the receptors to form ligand-receptor complexes. Our goal is to study the demodulation in this setup assuming that the transmitter and receiver are synchronised. We derive an optimal demodulator using the continuous history of the number of complexes at the receiver as the input to the demodulator. We do that by first deriving a communication model which includes the chemical reactions in the transmitter, diffusion in the transmission medium and the ligand-receptor process in the receiver. This model, which takes the form of a continuous-time Markov process, captures the noise in the receiver signal due to the stochastic nature of chemical reactions and diffusion. We then adopt a maximum a posterior framework and use Bayesian filtering to derive the optimal demodulator. We use numerical examples to illustrate the properties of this optimal demodulator.

cs.IT↗

arXiv2014

SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks

Some mobile sensor network applications require the sensor nodes to transfer their trajectories to a data sink. This paper proposes an adaptive trajectory (lossy) compression algorithm based on compressive sensing. The algorithm has two innovative elements. First, we propose a method to compute a deterministic projection matrix from a learnt dictionary. Second, we propose a method for the mobile nodes to adaptively predict the number of projections needed based on the speed of the mobile nodes. Extensive evaluation of the proposed algorithm using 6 datasets shows that our proposed algorithm can achieve sub-metre accuracy. In addition, our method of computing projection matrices outperforms two existing methods. Finally, comparison of our algorithm against a state-of-the-art trajectory compression algorithm show that our algorithm can reduce the error by 10-60 cm for the same compression ratio.

cs.IT↗