Quantization is an important technique to transform the input sample values from a large set (or a continuous range) into the output sample values in a small set (or a finite set). It has been applied broadly for loss...
详细信息
Quantization is an important technique to transform the input sample values from a large set (or a continuous range) into the output sample values in a small set (or a finite set). It has been applied broadly for lossy-data compression, pattern recognition, probability density estimation, and clustering. Vector quantization (VQ) is a prevalent image-compression technique, which treats image matrices as stretched vectors and then finds the representative stretched vectors accordingly for a given image data set. One can use tensor data representation to directly characterize the original two-dimensional image data rather than stretch the image matrix into a long vector so as to destroy the original two-dimensional data structure. In this work, we propose a new tensor quantization (TQ) framework which does not need to reduce the dimensionality of the original image data and destroy the original two-dimensional spatial relationship among data;these two serious drawbacks of vector quantization are well known. We first present tensor calculus and then propose a new parallel tensor-inversion algorithm for TQ thereupon. We also establish the pertinent theoretical proof to justify that our proposed new TQ approach is superior to the existing VQ approach especially as the image dimension becomes large. Finally, numerical experiments to evaluate the image-compression performances of VQ and TQ are demonstrated and their corresponding computational-complexities are also compared.
Brain-computer interface (BCI), a communication technology between brain and computer developed for a long time since the 1970s, can be incorporated into wearable devices by developing powerful signalprocessing algor...
详细信息
Brain-computer interface (BCI), a communication technology between brain and computer developed for a long time since the 1970s, can be incorporated into wearable devices by developing powerful signal processing algorithms and semiconductor technologies. For a satisfactory user experience based on BCI, high information transfer rate and low power consumption should be considered together without losing accuracy. Although many existing BCI algorithms have been mainly focused solely on the accuracy, their deployment on wearable devices is not straightforward due to the limited hardware resources and computational capabilities. This tutorial summarizes recent advances in wearable BCI algorithms and hardware implementations from an algorithm-hardware co-design perspective and discusses future directions.
This paper studies an intelligent reflecting surface (IRS)-aided multiple-input-multiple-output (MIMO) full-duplex (FD) wireless-powered communication network (WPCN), where a hybrid access point (HAP) operating in FD ...
详细信息
This paper studies an intelligent reflecting surface (IRS)-aided multiple-input-multiple-output (MIMO) full-duplex (FD) wireless-powered communication network (WPCN), where a hybrid access point (HAP) operating in FD broadcasts energy signals to multiple devices for their energy harvesting (EH) in the downlink (DL) and meanwhile receives information signals from devices in the uplink (UL) with the help of an IRS. Taking into account the practical finite self-interference (SI) and the non-linear EH model, we formulate the weighted sum throughput maximization optimization problem by jointly optimizing DL/UL time allocation, precoding matrices at devices, transmit covariance matrices at the HAP, and phase shifts at the IRS. Since the resulting optimization problem is non-convex, there are no standard methods to solve it optimally in general. To tackle this challenge, we first propose an element-wise (EW) based algorithm, where each IRS phase shift is alternately optimized in an iterative manner. To reduce the computational complexity, a minimum mean-square error (MMSE) based algorithm is proposed, where we transform the original problem into an equivalent form based on the MMSE method, which facilities the design of an efficient iterative algorithm. In particular, the IRS phase shift optimization problem is recast as an second-order cone program (SOCP), where all the IRS phase shifts are simultaneously optimized. For comparison, we also study two suboptimal IRS beamforming configurations in simulations, namely partially dynamic IRS beamforming (PDBF) and static IRS beamforming (SBF), which strike a balance between the system performance and practical complexity. Simulation results demonstrate the effectiveness of proposed two algorithms. Besides, the results show the superiority of our proposed scheme over other benchmark schemes and also unveil the importance of the joint design of passive beamforming and resource allocation for achieving energy efficient MIMO FD-WPCN
This paper explores the potential of the intelligent reflecting surface (IRS) in realizing multi-user concurrent communication and localization, using the same time-frequency resources. Specifically, we propose an IRS...
详细信息
This paper explores the potential of the intelligent reflecting surface (IRS) in realizing multi-user concurrent communication and localization, using the same time-frequency resources. Specifically, we propose an IRS-enabled multi-user integrated sensing and communication (ISAC) framework, where a distributed semi-passive IRS assists the uplink data transmission from multiple users to the base station (BS) and conducts multi-user localization, simultaneously. We first design an ISAC transmission protocol, where the whole transmission period consists of two periods, i.e., the ISAC period for simultaneous uplink communication and multi-user localization, and the pure communication (PC) period for only uplink data transmission. For the ISAC period, we propose a multi-user location sensing algorithm, which utilizes the uplink communication signals unknown to the IRS, thus removing the requirement of dedicated positioning reference signals in conventional location sensing methods. Based on the sensed users' locations, we propose two novel beamforming algorithms for the ISAC period and PC period, respectively, which can work with discrete phase shifts and require no channel state information (CSI) acquisition. Numerical results show that the proposed multi-user location sensing algorithm can achieve up to millimeter-level positioning accuracy, indicating the advantage of the IRS-enabled ISAC framework. Moreover, the proposed beamforming algorithms with sensed location information and discrete phase shifts can achieve comparable performance to the benchmark considering perfect CSI acquisition and continuous phase shifts, demonstrating how the location information can ensure the communication performance.
Accurate and speedy detection of power system events is critical to enhancing the reliability and resiliency of power systems. Although supervised deep learning algorithms show great promise in identifying power syste...
详细信息
Accurate and speedy detection of power system events is critical to enhancing the reliability and resiliency of power systems. Although supervised deep learning algorithms show great promise in identifying power system events, they require a large volume of high-quality event labels for training. This paper develops a bidirectional anomaly generative adversarial network (GAN)-based algorithm to detect power system events using streaming PMU data, which does not rely on a huge amount of event labels. By introducing conditional entropy constraint in the objective function of GAN and graph signalprocessing-based PMU sorting technique, our proposed algorithm significantly outperforms state-of-the-art event detection algorithms in terms of accuracy. To facilitate the adoption of the proposed algorithm, a prototype online platform is also developed using Apache Hadoop, Kafka, and Spark to enable real-time event detection. The accuracy and computational efficiency of the proposed algorithm are validated using a large-scale real-world PMU dataset from the Eastern Interconnection of the United States.
In this work, we present a photoplethy smography-based blood pressure monitoring algorithm (PPG-BPM) that solely requires a photoplethysmography (PPG) signal. The technology is based on pulse wave analysis (PWA) of PP...
详细信息
In this work, we present a photoplethy smography-based blood pressure monitoring algorithm (PPG-BPM) that solely requires a photoplethysmography (PPG) signal. The technology is based on pulse wave analysis (PWA) of PPG signals retrieved from different body locations to continuously estimate the systolic blood pressure (SBP) and the diastolic blood pressure (DBP). The proposed algorithm extracts morphological features from the PPG signal and maps them to SBP and DBP values using a multiple linear regression (MLR) model. The performance of the algorithm is evaluated on the publicly available Multiparameter Intelligent Monitoring in Intensive Care (MIMIC I) database. We utilize 28 data-sets (records) that contain both PPG and brachial arterial blood pressure (ABP) signals. The collected PPG and ABP signals are synchronized and divided into intervals of 30 seconds, called epochs. In total, we utilize 47153 clean 30-second epochs for the performance analysis. Out of the 28 data-sets, we use only 2 data-sets with a total of 2677 clean 30-second epochs to build the MLR model of the algorithm. For the SBP, a mean absolute error (MAE) of 6.10 mmHg between the arterial line and the PPG-based values are achieved, with a Pearson correlation coefficient r = 0.90, p = .001. For the DBP, and an MAE of 4.65 mmHg between the arterial line and the PPG-based values are achieved, with a Pearson correlation coefficient r = 0.85, p < .001. We also use a binary classifier for the BP values with the positives indicating SBP = 130 mmHg and/or DBP = 80 mmHg and the negatives indicating otherwise. The classifier results generated by the PPG-based SBP and DBP estimates achieve a sensitivity and a specificity of 79.11% and 92.37%, respectively.
Recently, the reconfigurable intelligent surface (RIS) aided communication system has emerged as a promising candidate for future wireless communications. The existing channel estimation methods for RIS-aided millimet...
详细信息
Recently, the reconfigurable intelligent surface (RIS) aided communication system has emerged as a promising candidate for future wireless communications. The existing channel estimation methods for RIS-aided millimeter-wave systems assume that the RIS is ideal without blockage. However, in practice, RIS may be blocked by the rain, snow, or dust, which will cause absorption and scattering of the incident/reflected signals and change the channel characteristics. In this paper, we formulate the system model of RIS-aided multi-user communications considering the blocked RIS. Then, we propose a variational Bayesian based channel estimation algorithm that is robust to RIS blockage, where we can simultaneously estimate the channel information and the RIS blockage. Simulation results demonstrate the superior performance of the proposed algorithm to existing ones.
This paper proposes efficient batch-based and online strategies for kernel regression over graphs (KRG). The proposed algorithms do not require the input signal to be a graph signal, whereas the target signal is defin...
详细信息
This paper proposes efficient batch-based and online strategies for kernel regression over graphs (KRG). The proposed algorithms do not require the input signal to be a graph signal, whereas the target signal is defined over the graph. We first use random Fourier features (RFF) to tackle the complexity issues associated with kernel methods employed in the conventional KRG. For batch-based approaches, we also propose an implementation that reduces complexity by avoiding the inversion of large matrices. Then, we derive two distinct online strategies using RFF, namely, the mini-batch gradient KRG (MGKRG) and the recursive least squares KRG (RLSKRG). The stochastic-gradient KRG (SGKRG) is introduced as a particular case of the MGKRG. The MGKRG and the SGKRG are low-complexity algorithms that employ stochastic gradient approximations in the regression-parameter update. The RLSKRG is a recursive implementation of the RFF-based batch KRG. A detailed stability analysis is provided for the proposed online algorithms, including convergence conditions in both mean and mean-squared senses. A discussion on complexity is also provided. Numerical simulations include a synthesized-data experiment and real-data experiments on temperature prediction, brain activity estimation, and image reconstruction. Results show that the RFF-based batch implementation offers competitive performance with a reduced computational burden when compared to the conventional KRG. The MGKRG offers a convenient trade-off between performance and complexity by varying the number of mini-batch samples. The RLSKRG has a faster convergence than the MGKRG and matches the performance of the batch implementation.
Zeroing neural network (ZNN) is an effective neural solution to time-varying problems, including time-varying complex Sylvester equations. Generally, a ZNN model involves a convergence design parameter (CDP) that infl...
详细信息
Zeroing neural network (ZNN) is an effective neural solution to time-varying problems, including time-varying complex Sylvester equations. Generally, a ZNN model involves a convergence design parameter (CDP) that influences its convergence rate. In traditional fixed-parameter ZNNs (FP-ZNNs), the CDPs are set to be constant, which is not realistic since the CDPs are actually time-varying in practical hardware environments. By considering this fact, varying-parameter ZNNs (VP-ZNNs) with time-varying CDPs have been researched in the literature. Although these VP-ZNNs have been demonstrated to deliver superior convergence as compared with FP-ZNNs, they have one drawback, that is, their CDPs usually keep increasing with time, meaning that the CDPs tend to be infinity large with time progresses. Evidently, infinity large CDPs are unacceptable in practice. Moreover, computing resources will be wasted by growing the CDPs with time after the VP-ZNNs become convergent. To tackle the above issues, this article, for the first time, proposes an arctan-type VP-ZNN (ATVP-ZNN) with finite-time convergence for solving time-varying complex Sylvester equations. The ATVP-ZNN is able to adjust its CDPs that finally converge to be constant when the ATVP-ZNN becomes convergent in finite time. In theory, the finite-time convergence of the ATVP-ZNN and the upper bound of the CDPs are mathematically analyzed. Numerical studies are comparatively performed with the superior convergence of the ATVP-ZNN substantiated.
This work tackles the issue of noise removal from images, focusing on the well-known DCT image denoising algorithm. The latter, stemming from signalprocessing, has been well studied over the years. Though very simple...
详细信息
This work tackles the issue of noise removal from images, focusing on the well-known DCT image denoising algorithm. The latter, stemming from signalprocessing, has been well studied over the years. Though very simple, it is still used in crucial parts of state-of-the-art "traditional" denoising algorithms such as BM3D. For a few years however, deep convolutional neural networks (CNN), especially DnCNN, have outperformed their traditional counterparts, making signalprocessing methods less attractive. In this paper, we demonstrate that a DCT denoiser can be seen as a shallow CNN and thereby its original linear transform can be tuned through gradient descent in a supervised manner, improving considerably its performance. This gives birth to a fully interpretable CNN called DCT2net. To deal with remaining artifacts induced by DCT2net, an original hybrid solution between DCT and DCT2net is proposed combining the best that these two methods can offer;DCT2net is selected to process non-stationary image patches while DCT is optimal for piecewise smooth patches. Experiments on artificially noisy images demonstrate that two-layer DCT2net provides comparable results to BM3D and is as fast as DnCNN algorithm.
暂无评论