Chen Feng

Dr. Chen Feng


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 December 2017 in Journal of the Optical Society of America A
Verified
Journal Article
Closed access
PDF file
LBLiheng Bian
Liheng Bian
JSJinli Suo
Jinli Suo
QDQionghai Dai
Qionghai Dai
CFChen Feng
Chen Feng
Single-pixel imaging (SPI) is a novel technique that captures 2D images using a photodiode, instead of conventional 2D array sensors. SPI has high signal-to-noise ratio, wide spectral range, low cost, and robustness to light scattering. Various algorithms have been proposed for SPI reconstruction, including linear correlation methods, the alternating projection (AP) method, and compressive sensing (CS) based methods. However, there has been no comprehensive review discussing respective advantages, which is important for SPI’s further applications and development. In this paper, we review and compare these algorithms in a unified reconstruction framework. We also propose two other SPI algorithms, including a conjugate gradient descent (CGD) based method and a Poisson maximum-likelihood-based method. Both simulations and experiments validate the following conclusions: to obtain comparable reconstruction accuracy, the CS-based total variation (TV) regularization method requires the fewest measurements and consumes the least running time for small-scale reconstruction, the CGD and AP methods run fastest in large-scale cases, and the TV and AP methods are the most robust to measurement noise. In a word, there are trade-offs in capture efficiency, computational complexity, and robustness to noise among different SPI algorithms. We have released our source code for non-commercial use.

9 May 2018 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
FDFei Deng
Fei Deng
JDJianwu Dong
Jianwu Dong
XWXiangyu Wang
Xiangyu Wang
YFYing Fang
Ying Fang
YLYu Liu
Yu Liu
CFChen Feng
Chen Feng
Quality sleep is essential for human health. Recent developments in sleep monitoring techniques show great promise of detecting sleep disorders and improving sleep quality. Two important indicators for sleep disorders are breathing and posture, but existing methods deal with them separately, and hardly any effort has been devoted to head posture. In this paper, we present the design and implementation of a novel sleep monitoring system that simultaneously analyzes respiration, head posture, and body posture. The system consists solely of cost-effective vision-based devices, operating in a quiet and noncontact way with a little disturbance to natural sleep. Specifically, we use an infrared camera to record the sleep process. From the infrared video, the region of breathing movement is automatically determined and the intensity estimated, yielding a waveform indicating respiratory rhythms. Five additional infrared cameras are employed to capture the subject's face from different orientations, and we exploit template matching to perform head tracking. A Kinect motion sensor is also utilized to obtain skeleton description of body posture that is robust to self-occlusion, and after noise being filtered, we apply machine learning techniques for body posture classification. Experimental results show that elementary breathing and posture analysis are feasible based on the information acquired by the proposed system, and high accuracy can be achieved: 96% in recognizing abnormal breathing and body movements, 87.6% in head tracking, and over 90% in classifying most body postures.

9 November 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
SGShangqi Guo
Shangqi Guo
ZYZhaofei Yu
Zhaofei Yu
FDFei Deng
Fei Deng
XHXiaolin Hu
Xiaolin Hu
CFChen Feng
Chen Feng
Numerous experimental data from neuroscience and psychological science suggest that human brain utilizes Bayesian principles to deal the complex environment. Furthermore, hierarchical Bayesian inference has been proposed as an appropriate theoretical framework for modeling cortical processing. However, it remains unknown how such a computation is organized in the network of biologically plausible spiking neurons. In this paper, we propose a hierarchical network of winner-take-all circuits which can carry out hierarchical Bayesian inference and learning through a spike-based variational expectation maximization (EM) algorithm. Particularly, we show how the firing activities of spiking neurons in response to the input stimuli and the spike-timing-dependent plasticity rule can be understood, respectively, as variational E-step and M-step of variational EM. Finally, we demonstrate the utility of this spiking neural network on the MNIST benchmark for unsupervised classification of handwritten digits.

1 May 2020 in Journal of Electroanalytical Chemistry
Verified
Journal Article
Closed access
LLLingling Lin
Lingling Lin
SWShaohuang Weng
Shaohuang Weng
YZYanjie Zheng
Yanjie Zheng
Xiyao LiuXiyao Liu
Xiyao Liu
SYShaoming Ying
Shaoming Ying
DYDonghong You
Donghong You

19 July 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
TZTianren Zhang
Tianren Zhang
SGShangqi Guo
Shangqi Guo
TTTian Tan
Tian Tan
XHXiaolin Hu
Xiaolin Hu
CFChen Feng
Chen Feng
Goal-conditioned Hierarchical Reinforcement Learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is large. Searching in a large goal space poses difficulty for both high-level subgoal generation and low-level policy learning. In this paper, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a $k$-step adjacent region of the current state using an adjacency constraint. We theoretically prove that in a deterministic Markov Decision Process (MDP), the proposed adjacency constraint preserves the optimal hierarchical policy, while in a stochastic MDP the adjacency constraint induces a bounded state-value suboptimality determined by the MDP’s transition structure. We further show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks including challenging simulated robot locomotion and manipulation tasks show that incorporating the adjacency constraint significantly boosts the performance of state-of-the-art goal-conditioned HRL approaches.

3 October 2024
Verified
Book Chapter
Closed access
PDF file
YJYuxuan Jiang
Yuxuan Jiang
CFChen Feng
Chen Feng
FZFan Zhang
Fan Zhang
DBDavid Bull
David Bull