arXiv subjects

Lei Chu

Publications and source records attributed to Lei Chu.

At least 37 records · Page 2Linked to original sources

arXiv2023

Self-Supervised Point Cloud Registration with Deep Versatile Descriptors

As a fundamental yet challenging problem in intelligent transportation systems, point cloud registration attracts vast attention and has been attained with various deep learning-based algorithms. The unsupervised registration algorithms take advantage of deep neural network-enabled novel representation learning while requiring no human annotations, making them applicable to industrial applications. However, unsupervised methods mainly depend on global descriptors, which ignore the high-level representations of local geometries. In this paper, we propose to jointly use both global and local descriptors to register point clouds in a self-supervised manner, which is motivated by a critical observation that all local geometries of point clouds are transformed consistently under the same transformation. Therefore, local geometries can be employed to enhance the representation ability of the feature extraction module. Moreover, the proposed local descriptor is flexible and can be integrated into most existing registration methods and improve their performance. Besides, we also utilize point cloud reconstruction and normal estimation to enhance the transformation awareness of global and local descriptors. Lastly, extensive experimental results on one synthetic and three real-world datasets demonstrate that our method outperforms existing state-of-art unsupervised registration methods and even surpasses supervised ones in some cases. Robustness and computational efficiency evaluations also indicate that the proposed method applies to intelligent vehicles.

cs.CV↗

arXiv2022

Multi-level Contrast Network for Wearables-based Joint Activity Segmentation and Recognition

Human activity recognition (HAR) with wearables is promising research that can be widely adopted in many smart healthcare applications. In recent years, the deep learning-based HAR models have achieved impressive recognition performance. However, most HAR algorithms are susceptible to the multi-class windows problem that is essential yet rarely exploited. In this paper, we propose to relieve this challenging problem by introducing the segmentation technology into HAR, yielding joint activity segmentation and recognition. Especially, we introduce the Multi-Stage Temporal Convolutional Network (MS-TCN) architecture for sample-level activity prediction to joint segment and recognize the activity sequence. Furthermore, to enhance the robustness of HAR against the inter-class similarity and intra-class heterogeneity, a multi-level contrastive loss, containing the sample-level and segment-level contrast, has been proposed to learn a well-structured embedding space for better activity segmentation and recognition performance. Finally, with comprehensive experiments, we verify the effectiveness of the proposed method on two public HAR datasets, achieving significant improvements in the various evaluation metrics.

cs.CV↗

arXiv2022

Self-Supervised Image Representation Learning with Geometric Set Consistency

We propose a method for self-supervised image representation learning under the guidance of 3D geometric consistency. Our intuition is that 3D geometric consistency priors such as smooth regions and surface discontinuities may imply consistent semantics or object boundaries, and can act as strong cues to guide the learning of 2D image representations without semantic labels. Specifically, we introduce 3D geometric consistency into a contrastive learning framework to enforce the feature consistency within image views. We propose to use geometric consistency sets as constraints and adapt the InfoNCE loss accordingly. We show that our learned image representations are general. By fine-tuning our pre-trained representations for various 2D image-based downstream tasks, including semantic segmentation, object detection, and instance segmentation on real-world indoor scene datasets, we achieve superior performance compared with state-of-the-art methods.

cs.CV↗

arXiv2022

Learning Efficient Representations for Enhanced Object Detection on Large-scene SAR Images

It is a challenging problem to detect and recognize targets on complex large-scene Synthetic Aperture Radar (SAR) images. Recently developed deep learning algorithms can automatically learn the intrinsic features of SAR images, but still have much room for improvement on large-scene SAR images with limited data. In this paper, based on learning representations and multi-scale features of SAR images, we propose an efficient and robust deep learning based target detection method. Especially, by leveraging the effectiveness of adversarial autoencoder (AAE) which influences the distribution of the investigated data explicitly, the raw SAR dataset is augmented into an enhanced version with a large quantity and diversity. Besides, an auto-labeling scheme is proposed to improve labeling efficiency. Finally, with jointly training small target chips and large-scene images, an integrated YOLO network combining non-maximum suppression on sub-images is used to realize multiple targets detection of high resolution images. The numerical experimental results on the MSTAR dataset show that our method can realize target detection and recognition on large-scene images accurately and efficiently. The superior anti-noise performance is also confirmed by experiments.

cs.CV↗

arXiv2021

A Robust and Reliable Point Cloud Recognition Network Under Rigid Transformation

Point cloud recognition is an essential task in industrial robotics and autonomous driving. Recently, several point cloud processing models have achieved state-of-the-art performances. However, these methods lack rotation robustness, and their performances degrade severely under random rotations, failing to extend to real-world scenarios with varying orientations. To this end, we propose a method named Self Contour-based Transformation (SCT), which can be flexibly integrated into various existing point cloud recognition models against arbitrary rotations. SCT provides efficient rotation and translation invariance by introducing Contour-Aware Transformation (CAT), which linearly transforms Cartesian coordinates of points to translation and rotation-invariant representations. We prove that CAT is a rotation and translation-invariant transformation based on the theoretical analysis. Furthermore, the Frame Alignment module is proposed to enhance discriminative feature extraction by capturing contours and transforming self contour-based frames into intra-class frames. Extensive experimental results show that SCT outperforms the state-of-the-art approaches under arbitrary rotations in effectiveness and efficiency on synthetic and real-world benchmarks. Furthermore, the robustness and generality evaluations indicate that SCT is robust and is applicable to various point cloud processing models, which highlights the superiority of SCT in industrial applications.

cs.CV↗

arXiv2021

Unsupervised Shape Completion via Deep Prior in the Neural Tangent Kernel Perspective

We present a novel approach for completing and reconstructing 3D shapes from incomplete scanned data by using deep neural networks. Rather than being trained on supervised completion tasks and applied on a testing shape, the network is optimized from scratch on the single testing shape, to fully adapt to the shape and complete the missing data using contextual guidance from the known regions. The ability to complete missing data by an untrained neural network is usually referred to as the deep prior. In this paper, we interpret the deep prior from a neural tangent kernel (NTK) perspective and show that the completed shape patches by the trained CNN are naturally similar to existing patches, as they are proximate in the kernel feature space induced by NTK. The interpretation allows us to design more efficient network structures and learning mechanisms for the shape completion and reconstruction task. Being more aware of structural regularities than both traditional and other unsupervised learning-based reconstruction methods, our approach completes large missing regions with plausible shapes and complements supervised learning-based methods that use database priors by requiring no extra training data set and showing flexible adaptation to a particular shape instance.

cs.CV↗

arXiv2020

MARS: Mixed Virtual and Real Wearable Sensors for Human Activity Recognition with Multi-Domain Deep Learning Model

Together with the rapid development of the Internet of Things (IoT), human activity recognition (HAR) using wearable Inertial Measurement Units (IMUs) becomes a promising technology for many research areas. Recently, deep learning-based methods pave a new way of understanding and performing analysis of the complex data in the HAR system. However, the performance of these methods is mostly based on the quality and quantity of the collected data. In this paper, we innovatively propose to build a large database based on virtual IMUs and then address technical issues by introducing a multiple-domain deep learning framework consisting of three technical parts. In the first part, we propose to learn the single-frame human activity from the noisy IMU data with hybrid convolutional neural networks (CNNs) in the semi-supervised form. For the second part, the extracted data features are fused according to the principle of uncertainty-aware consistency, which reduces the uncertainty by weighting the importance of the features. The transfer learning is performed in the last part based on the newly released Archive of Motion Capture as Surface Shapes (AMASS) dataset, containing abundant synthetic human poses, which enhances the variety and diversity of the training dataset and is beneficial for the process of training and feature transfer in the proposed method. The efficiency and effectiveness of the proposed method have been demonstrated in the real deep inertial poser (DIP) dataset. The experimental results show that the proposed methods can surprisingly converge within a few iterations and outperform all competing methods.

cs.CV↗

arXiv2020

LEMO: Learn to Equalize for MIMO-OFDM Systems with Low-Resolution ADCs

This paper develops a new deep neural network optimized equalization framework for massive multiple input multiple output orthogonal frequency division multiplexing (MIMOOFDM) systems that employ low-resolution analog-to-digital converters (ADCs) at the base station (BS). The use of lowresolution ADCs could largely reduce hardware complexity and circuit power consumption, however, it makes the channel station information almost blind to the BS, hence causing difficulty in solving the equalization problem. In this paper, we consider a supervised learning architecture, where the goal is to learn a representative function that can predict the targets (constellation points) from the inputs (outputs of the low-resolution ADCs) based on the labeled training data (pilot signals). Especially, our main contributions are two-fold: 1) First, we design a new activation function, whose outputs are close to the constellation points when the parameters are finally optimized, to help us fully exploit the stochastic gradient descent method for the discrete optimization problem. 2) Second, an unsupervised loss is designed and then added to the optimization objective, aiming to enhance the representation ability (so-called generalization). Lastly, various experimental results confirm the superiority of the proposed equalizer over some existing ones, particularly when the statistics of the channel state information are unclear.

eess.SP↗

arXiv2020

Improving Power System State Estimation Based on Matrix-Level Cleaning

Power system state estimation is heavily subjected to measurement error, which comes from the noise of measuring instruments, communication noise, and some unclear randomness. Traditional weighted least square (WLS), as the most universal state estimation method, attempts to minimize the residual between measurements and the estimation of measured variables, but it is unable to handle the measurement error. To solve this problem, based on random matrix theory, this paper proposes a data-driven approach to clean measurement error in matrix-level. Our method significantly reduces the negative effect of measurement error, and conducts a two-stage state estimation scheme combined with WLS. In this method, a Hermitian matrix is constructed to establish an invertible relationship between the eigenvalues of measurements and their covariance matrix. Random matrix tools, combined with an optimization scheme, are used to clean measurement error by shrinking the eigenvalues of the covariance matrix. With great robustness and generality, our approach is particularly suitable for large interconnected power grids. Our method has been numerically evaluated using different testing systems, multiple models of measured noise and matrix size ratios.

eess.SP↗

arXiv2020

Early Anomaly Detection and Location in Distribution Network: A Data-Driven Approach

The measurement data collected from the supervisory control and data acquisition (SCADA) system installed in distribution network can reflect the operational state of the network effectively. In this paper, a random matrix theory (RMT) based approach is developed for early anomaly detection and localization by using the data. For every feeder in the distribution network, a corresponding data matrix is formed. Based on the Marchenko-Pastur Law for the empirical spectral analysis of covariance `signal+noise' matrix, the linear eigenvalue statistics are introduced to indicate the anomaly, and the outliers and their corresponding eigenvectors are analyzed for locating the anomaly. As for the low observability feeders in the distribution network, an increasing data dimension algorithm is designed for the formulated low-dimensional matrices being more accurately analyzed. The developed approach can detect and localize the anomaly at an early stage, and it is robust to random disturbance and measurement error. Cases on Matpower simulation data and real SCADA data corroborate the feasibility of the approach.

stat.AP↗

arXiv2020

A Deep Learning Method for Complex Human Activity Recognition Using Virtual Wearable Sensors

Sensor-based human activity recognition (HAR) is now a research hotspot in multiple application areas. With the rise of smart wearable devices equipped with inertial measurement units (IMUs), researchers begin to utilize IMU data for HAR. By employing machine learning algorithms, early IMU-based research for HAR can achieve accurate classification results on traditional classical HAR datasets, containing only simple and repetitive daily activities. However, these datasets rarely display a rich diversity of information in real-scene. In this paper, we propose a novel method based on deep learning for complex HAR in the real-scene. Specially, in the off-line training stage, the AMASS dataset, containing abundant human poses and virtual IMU data, is innovatively adopted for enhancing the variety and diversity. Moreover, a deep convolutional neural network with an unsupervised penalty is proposed to automatically extract the features of AMASS and improve the robustness. In the on-line testing stage, by leveraging advantages of the transfer learning, we obtain the final result by fine-tuning the partial neural network (optimizing the parameters in the fully-connected layers) using the real IMU data. The experimental results show that the proposed method can surprisingly converge in a few iterations and achieve an accuracy of 91.15% on a real IMU dataset, demonstrating the efficiency and effectiveness of the proposed method.

cs.CV↗

arXiv2019

Efficient Nonlinear Precoding for Massive MU-MIMO Downlink Systems with 1-Bit DACs

The power consumption of digital-to-analog converters (DACs) constitutes a significant proportion of the total power consumption in a massive multiuser multiple-input multiple-output (MU-MIMO) base station (BS). Using 1-bit DACs can significantly reduce the power consumption. This paper addresses the precoding problem for the massive narrow-band MU-MIMO downlink system equipped with 1-bit DACs at each BS. In such a system, the precoding problem plays a central role as the precoded symbols are affected by extra distortion introduced by 1-bit DACs. In this paper, we develop a highly-efficient nonlinear precoding algorithm based on the alternative direction method framework. Unlike the classic algorithms, such as the semidefinite relaxation (SDR) and squared-infinity norm Douglas-Rachford splitting (SQUID) algorithms, which solve convex relaxed versions of the original precoding problem, the new algorithm solves the original nonconvex problem directly. The new algorithm is guaranteed to globally converge under some mild conditions. A sufficient condition for its convergence has been derived. Experimental results in various conditions demonstrated that, the new algorithm can achieve state-of-the-art accuracy comparable to the SDR algorithm, while being much more efficient (more than 300 times faster than the SDR algorithm).

eess.SP↗

arXiv2019

A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning

In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning. To achieve sparsity and/or low-rankness inducing, the $\ell_1$ norm and nuclear norm are of the most popular regularization penalties due to their convexity. While the $\ell_1$ and nuclear norm are convenient as the related convex optimization problems are usually tractable, it has been shown in many applications that a nonconvex penalty can yield significantly better performance. In recent, nonconvex regularization based sparse and low-rank recovery is of considerable interest and it in fact is a main driver of the recent progress in nonconvex and nonsmooth optimization. This paper gives an overview of this topic in various fields in signal processing, statistics and machine learning, including compressive sensing (CS), sparse regression and variable selection, sparse signals separation, sparse principal component analysis (PCA), large covariance and inverse covariance matrices estimation, matrix completion, and robust PCA. We present recent developments of nonconvex regularization based sparse and low-rank recovery in these fields, addressing the issues of penalty selection, applications and the convergence of nonconvex algorithms. Code is available at https://github.com/FWen/ncreg.git.

cs.IT↗

arXiv2019

Robust Precoding Design for Coarsely Quantized MU-MIMO Under Channel Uncertainties

Recently, multi-user multiple input multiple output (MU-MIMO) systems with low-resolution digital-to-analog converters (DACs) has received considerable attention, owing to the capability of dramatically reducing the hardware cost. Besides, it has been shown that the use of low-resolution DACs enable great reduction in power consumption while maintain the performance loss within acceptable margin, under the assumption of perfect knowledge of channel state information (CSI). In this paper, we investigate the precoding problem for the coarsely quantized MU-MIMO system without such an assumption. The channel uncertainties are modeled to be a random matrix with finite second-order statistics. By leveraging a favorable relation between the multi-bit DACs outputs and the single-bit ones, we first reformulate the original complex precoding problem into a nonconvex binary optimization problem. Then, using the S-procedure lemma, the nonconvex problem is recast into a tractable formulation with convex constraints and finally solved by the semidefinite relaxation (SDR) method. Compared with existing representative methods, the proposed precoder is robust to various channel uncertainties and is able to support a MUMIMO system with higher-order modulations, e.g., 16QAM.

eess.SP↗

arXiv2019

Eigen-Inference Precoding for Coarsely Quantized Massive MU-MIMO System with Imperfect CSI

This work considers the precoding problem in massive multiuser multiple-input multiple-output (MU-MIMO) systems equipped with low-resolution digital-to-analog converters (DACs). In previous literature on this topic, it is commonly assumed that the channel state information (CSI) is perfectly known. However, in practical applications the CSI is inevitably contaminated by noise. In this paper, we propose, for the first time, an eigen-inference (EI) precoding scheme to improve the error performance of the coarsely quantized massive MU-MIMO systems under imperfect CSI, which is mathematically modeled by a sum of two rectangular random matrices (RRMs). Instead of performing analysis based on the RRM, using Girko's Hermitization trick, the proposed method leverages the block random matrix theory by augmenting the RRM into a block symmetric channel matrix (BSCA). Specially, we derive the empirical distribution of the eigenvalues of the BSCA and establish the limiting spectra distribution connection between the true BSCA and its noisy observation. Then, based on these theoretical results, we propose an EI-based moments matching method for CSI-related noise level estimation and a rotation invariant estimation method for CSI reconstruction. Based on the cleaned CSI, the quantized precoding problem is tackled via the Bussgang theorem and the Lagrangian multiplier method. The prosed methods are lastly verified by numerical simulations and the results demonstrate the effectiveness of the proposed precoder.

eess.SP↗

arXiv2019

Data-driven Estimation of the Power Flow Jacobian Matrix in High Dimensional Space

The Jacobian matrix is the core part of power flow analysis, which is the basis for power system planning and operations. This paper estimates the Jacobian matrix in high dimensional space. Firstly, theoretical analysis and model-based calculation of the Jacobian matrix are introduced to obtain the benchmark value. Then, the estimation algorithms based on least-squared errors and the deviation estimation based on the neural network are studied in detail, including the theories, equations, derivations, codes, advantages and disadvantages, and application scenes. The proposed algorithms are data-driven and sensitive to up-to-date topology parameters and state variables. The efforts are validate by comparing the results to benchmark values.

eess.SY↗

arXiv2018

A New Approach of Exploiting Self-Adjoint Matrix Polynomials of Large Random Matrices for Anomaly Detection and Fault Location

Synchronized measurements of a large power grid enable an unprecedented opportunity to study the spatialtemporal correlations. Statistical analytics for those massive datasets start with high-dimensional data matrices. Uncertainty is ubiquitous in a future's power grid. These data matrices are recognized as random matrices. This new point of view is fundamental in our theoretical analysis since true covariance matrices cannot be estimated accurately in a high-dimensional regime. As an alternative, we consider large-dimensional sample covariance matrices in the asymptotic regime to replace the true covariance matrices. The self-adjoint polynomials of large-dimensional random matrices are studied as statistics for big data analytics. The calculation of the asymptotic spectrum distribution (ASD) for such a matrix polynomial is understandably challenging. This task is made possible by a recent breakthrough in free probability, an active research branch in random matrix theory. This is the very reason why the work of this paper is inspired initially. The new approach is interesting in many aspects. The mathematical reason may be most critical. The real-world problems can be solved using this approach, however.

stat.AP↗

arXiv2018

Individual Recognition in Schizophrenia using Deep Learning Methods with Random Forest and Voting Classifiers: Insights from Resting State EEG Streams

Recently, there has been a growing interest in monitoring brain activity for individual recognition system. So far these works are mainly focussing on single channel data or fragment data collected by some advanced brain monitoring modalities. In this study we propose new individual recognition schemes based on spatio-temporal resting state Electroencephalography (EEG) data. Besides, instead of using features derived from artificially-designed procedures, modified deep learning architectures which aim to automatically extract an individual's unique features are developed to conduct classification. Our designed deep learning frameworks are proved of a small but consistent advantage of replacing the $softmax$ layer with Random Forest. Additionally, a voting layer is added at the top of designed neural networks in order to tackle the classification problem arisen from EEG streams. Lastly, various experiments are implemented to evaluate the performance of the designed deep learning architectures; Results indicate that the proposed EEG-based individual recognition scheme yields a high degree of classification accuracy: $81.6\%$ for characteristics in high risk (CHR) individuals, $96.7\%$ for clinically stable first episode patients with schizophrenia (FES) and $99.2\%$ for healthy controls (HC).

cs.CV↗