Searcharxiv⌕ Search

arXiv subjects

Xuhong Li

Publications and source records attributed to Xuhong Li.

45 records · Page 3Linked to original sources

Practical Assessment of Generalization Performance Robustness for Deep Networks via Contrastive Examples

Training images with data transformations have been suggested as contrastive examples to complement the testing set for generalization performance evaluation of deep neural networks (DNNs). In this work, we propose a practical framework ContRE (The word "contre" means "against" or "versus" in French.) that uses Contrastive examples for DNN geneRalization performance Estimation. Specifically, ContRE follows the assumption in contrastive learning that robust DNN models with good generalization performance are capable of extracting a consistent set of features and making consistent predictions from the same image under varying data transformations. Incorporating with a set of randomized strategies for well-designed data transformations over the training set, ContRE adopts classification errors and Fisher ratios on the generated contrastive examples to assess and analyze the generalization performance of deep models in complement with a testing set. To show the effectiveness and the efficiency of ContRE, extensive experiments have been done using various DNN models on three open source benchmark datasets with thorough ablation studies and applicability analyses. Our experiment results confirm that (1) behaviors of deep models on contrastive examples are strongly correlated to what on the testing set, and (2) ContRE is a robust measure of generalization performance complementing to the testing set in various settings.

cs.LG↗

Representation Transfer by Optimal Transport

Learning generic representations with deep networks requires massive training samples and significant computer resources. To learn a new specific task, an important issue is to transfer the generic teacher's representation to a student network. In this paper, we propose to use a metric between representations that is based on a functional view of neurons. We use optimal transport to quantify the match between two representations, yielding a distance that embeds some invariances inherent to the representation of deep networks. This distance defines a regularizer promoting the similarity of the student's representation with that of the teacher. Our approach can be used in any learning context where representation transfer is applicable. We experiment here on two standard settings: inductive transfer learning, where the teacher's representation is transferred to a student network of same architecture for a new related task, and knowledge distillation, where the teacher's representation is transferred to a student of simpler architecture for the same task (model compression). Our approach also lends itself to solving new learning problems; we demonstrate this by showing how to directly transfer the teacher's representation to a simpler architecture student for a new related task.

cs.LG↗

Cross-Task Transfer for Geotagged Audiovisual Aerial Scene Recognition

Aerial scene recognition is a fundamental task in remote sensing and has recently received increased interest. While the visual information from overhead images with powerful models and efficient algorithms yields considerable performance on scene recognition, it still suffers from the variation of ground objects, lighting conditions etc. Inspired by the multi-channel perception theory in cognition science, in this paper, for improving the performance on the aerial scene recognition, we explore a novel audiovisual aerial scene recognition task using both images and sounds as input. Based on an observation that some specific sound events are more likely to be heard at a given geographic location, we propose to exploit the knowledge from the sound events to improve the performance on the aerial scene recognition. For this purpose, we have constructed a new dataset named AuDio Visual Aerial sceNe reCognition datasEt (ADVANCE). With the help of this dataset, we evaluate three proposed approaches for transferring the sound event knowledge to the aerial scene recognition task in a multimodal learning framework, and show the benefit of exploiting the audio information for the aerial scene recognition. The source code is publicly available for reproducibility purposes.

cs.CV↗

Massive MIMO-based Localization and Mapping Exploiting Phase Information of Multipath Components

In this paper, we present a robust multipath-based localization and mapping framework that exploits the phases of specular multipath components (MPCs) using a massive multiple-input multiple-output (MIMO) array at the base station. Utilizing the phase information related to the propagation distances of the MPCs enables the possibility of localization with extraordinary accuracy even with limited bandwidth. The specular MPC parameters along with the parameters of the noise and the dense multipath component (DMC) are tracked using an extended Kalman filter (EKF), which enables to preserve the distance-related phase changes of the MPC complex amplitudes. The DMC comprises all non-resolvable MPCs, which occur due to finite measurement aperture. The estimation of the DMC parameters enhances the estimation quality of the specular MPCs and therefore also the quality of localization and mapping. The estimated MPC propagation distances are subsequently used as input to a distance-based localization and mapping algorithm. This algorithm does not need prior knowledge about the surrounding environment and base station position. The performance is demonstrated with real radio-channel measurements using an antenna array with 128 ports at the base station side and a standard cellular signal bandwidth of 40 MHz. The results show that high accuracy localization is possible even with such a low bandwidth.

cs.IT↗

Massive MIMO Extensions to the COST 2100 Channel Model: Modeling and Validation

To enable realistic studies of massive multiple-input multiple-output systems, the COST 2100 channel model is extended based on measurements. First, the concept of a base station-side visibility region (BS-VR) is proposed to model the appearance and disappearance of clusters when using a physically-large array. We find that BS-VR lifetimes are exponentially distributed, and that the number of BS-VRs is Poisson distributed with intensity proportional to the sum of the array length and the mean lifetime. Simulations suggest that under certain conditions longer lifetimes can help decorrelating closely-located users. Second, the concept of a multipath component visibility region (MPC-VR) is proposed to model birth-death processes of individual MPCs at the mobile station side. We find that both MPC lifetimes and MPC-VR radii are lognormally distributed. Simulations suggest that unless MPC-VRs are applied the channel condition number is overestimated. Key statistical properties of the proposed extensions, e.g., autocorrelation functions, maximum likelihood estimators, and Cramer-Rao bounds, are derived and analyzed.

eess.SP↗

Explicit Inductive Bias for Transfer Learning with Convolutional Networks

In inductive transfer learning, fine-tuning pre-trained convolutional networks substantially outperforms training from scratch. When using fine-tuning, the underlying assumption is that the pre-trained model extracts generic features, which are at least partially relevant for solving the target task, but would be difficult to extract from the limited amount of data available on the target task. However, besides the initialization with the pre-trained model and the early stopping, there is no mechanism in fine-tuning for retaining the features learned on the source task. In this paper, we investigate several regularization schemes that explicitly promote the similarity of the final solution with the initial model. We show the benefit of having an explicit inductive bias towards the initial model, and we eventually recommend a simple $L^2$ penalty with the pre-trained model being a reference as the baseline of penalty for transfer learning tasks.

cs.LG↗

On Time-of-Arrival Estimation in NB-IoT Systems

We consider time-of-arrival (ToA) estimation of a first arrival-path for a device working in narrowband Internet-of-Things (NB-IoT) systems. Due to a limited 180 KHz bandwidth used in NB-IoT, the time-domain auto-correlation function (ACF) of transmitted NB positioning reference signal (NPRS) has a wide main lobe. Without considering that, the performance of ToA estimation can be degraded for two reasons. Firstly, under multiple-path channel environments, the NPRS corresponding to different received paths are superimposed on each other, and so are the cross-correlations corresponding to them. Secondly, the measured peak-to-average-power-ratio (PAPR) used for detecting the presence of NPRS is inaccurate. Therefore, in this paper we propose a space-alternating generalized expectation-maximization (SAGE) based method to jointly estimate the number of channel taps, the channel coefficients and the corresponding delays in NB-IoT systems, with considering the imperfect ACF of NPRS. Such a proposed method only uses the time-domain cross-correlations between the received signal and the transmitted NPRS, and has a low complexity. We show through simulations that, the ToA estimation of the proposed method performs close to the maximum likelihood (ML) estimation for a single-path channel, and significantly outperforms a traditional ToA estimator that uses signal-to-noise (SNR) or power thresholds based estimation.

cs.IT↗

Improving the Performance of OTDOA based Positioning in NB-IoT Systems

In this paper, we consider positioning with observed-time-difference-of-arrival (OTDOA) for a device deployed in long-term-evolution (LTE) based narrow-band Internet-of-things (NB-IoT) systems. We propose an iterative expectation-maximization based successive interference cancellation (EM-SIC) algorithm to jointly consider estimations of residual frequency-offset (FO), fading-channel taps and time-of-arrival (ToA) of the first arrival-path for each of the detected cells. In order to design a low complexity ToA detector and also due to the limits of low-cost analog circuits, we assume an NB-IoT device working at a low-sampling rate such as 1.92 MHz or lower. The proposed EM-SIC algorithm comprises two stages to detect ToA, based on which OTDOA can be calculated. In a first stage, after running the EM-SIC block a predefined number of iterations, a coarse ToA is estimated for each of the detected cells. Then in a second stage, to improve the ToA resolution, a low-pass filter is utilized to interpolate the correlations of time-domain PRS signal evaluated at a low sampling-rate to a high sampling-rate such as 30.72 MHz. To keep low-complexity, only the correlations inside a small search window centered at the coarse ToA estimates are upsampled. Then, the refined ToAs are estimated based on upsampled correlations. If at least three cells are detected, with OTDOA and the locations of detected cell sites, the position of the NB-IoT device can be estimated. We show through numerical simulations that, the proposed EM-SIC based ToA detector is robust against impairments introduced by inter-cell interference, fading-channel and residual FO. Thus significant signal-to-noise (SNR) gains are obtained over traditional ToA detectors that do not consider these impairments when positioning a device.

cs.IT↗

Deep Convolutional Neural Networks for Massive MIMO Fingerprint-Based Positioning

This paper provides an initial investigation on the application of convolutional neural networks (CNNs) for fingerprint-based positioning using measured massive MIMO channels. When represented in appropriate domains, massive MIMO channels have a sparse structure which can be efficiently learned by CNNs for positioning purposes. We evaluate the positioning accuracy of state-of-the-art CNNs with channel fingerprints generated from a channel model with a rich clustered structure: the COST 2100 channel model. We find that moderately deep CNNs can achieve fractional-wavelength positioning accuracies, provided that an enough representative data set is available for training.

stat.ML↗