Searcharxiv⌕ Search

arXiv subjects

Xinpeng Li

Publications and source records attributed to Xinpeng Li.

At least 55 records · Page 3Linked to original sources
arXiv2023

Functional central limit theorem with mean-uncertainty under sublinear expectation

In this paper, we introduce a fundamental model for independent and identically distributed sequence with model uncertainty on the canonical space $(\mathbb{R}^\mathbb{N},\mathcal{B}(\mathbb{R}^\mathbb{N}))$ via probability kernels. Thanks to the well-defined upper and lower variances, we obtain a new functional central limit theorem with mean-uncertainty on the canonical space by the method based on the martingale central limit theorem and stability of stochastic integral in the classical probability theory. Then we extend it to the general sublinear expectation space through a new representation theorem. Our results generalize Peng's central limit theorem with zero-mean to the case of mean-uncertainty and provides a purely probabilistic proof instead of the existing nonlinear partial differential equation approach. As an application, we consider the two-armed bandit problem and generalize the corresponding central limit theorem from the case of mean-certainty to mean-uncertainty.

math.PR↗
arXiv2023

SAM-IQA: Can Segment Anything Boost Image Quality Assessment?

Image Quality Assessment (IQA) is a challenging task that requires training on massive datasets to achieve accurate predictions. However, due to the lack of IQA data, deep learning-based IQA methods typically rely on pre-trained networks trained on massive datasets as feature extractors to enhance their generalization ability, such as the ResNet network trained on ImageNet. In this paper, we utilize the encoder of Segment Anything, a recently proposed segmentation model trained on a massive dataset, for high-level semantic feature extraction. Most IQA methods are limited to extracting spatial-domain features, while frequency-domain features have been shown to better represent noise and blur. Therefore, we leverage both spatial-domain and frequency-domain features by applying Fourier and standard convolutions on the extracted features, respectively. Extensive experiments are conducted to demonstrate the effectiveness of all the proposed components, and results show that our approach outperforms the state-of-the-art (SOTA) in four representative datasets, both qualitatively and quantitatively. Our experiments confirm the powerful feature extraction capabilities of Segment Anything and highlight the value of combining spatial-domain and frequency-domain features in IQA tasks. Code: https://github.com/Hedlen/SAM-IQA

cs.CV↗
arXiv2023

DIPNet: Efficiency Distillation and Iterative Pruning for Image Super-Resolution

Efficient deep learning-based approaches have achieved remarkable performance in single image super-resolution. However, recent studies on efficient super-resolution have mainly focused on reducing the number of parameters and floating-point operations through various network designs. Although these methods can decrease the number of parameters and floating-point operations, they may not necessarily reduce actual running time. To address this issue, we propose a novel multi-stage lightweight network boosting method, which can enable lightweight networks to achieve outstanding performance. Specifically, we leverage enhanced high-resolution output as additional supervision to improve the learning ability of lightweight student networks. Upon convergence of the student network, we further simplify our network structure to a more lightweight level using reparameterization techniques and iterative network pruning. Meanwhile, we adopt an effective lightweight network training strategy that combines multi-anchor distillation and progressive learning, enabling the lightweight network to achieve outstanding performance. Ultimately, our proposed method achieves the fastest inference time among all participants in the NTIRE 2023 efficient super-resolution challenge while maintaining competitive super-resolution performance. Additionally, extensive experiments are conducted to demonstrate the effectiveness of the proposed components. The results show that our approach achieves comparable performance in representative dataset DIV2K, both qualitatively and quantitatively, with faster inference and fewer number of network parameters.

cs.CV↗
arXiv2023

Rail Detection: An Efficient Row-based Network and A New Benchmark

Rail detection, essential for railroad anomaly detection, aims to identify the railroad region in video frames. Although various studies on rail detection exist, neither an open benchmark nor a high-speed network is available in the community, making algorithm comparison and development difficult. Inspired by the growth of lane detection, we propose a rail database and a row-based rail detection method. In detail, we make several contributions: (i) We present a real-world railway dataset, Rail-DB, with 7432 pairs of images and annotations. The images are collected from different situations in lighting, road structures, and views. The rails are labeled with polylines, and the images are categorized into nine scenes. The Rail-DB is expected to facilitate the improvement of rail detection algorithms. (ii) We present an efficient row-based rail detection method, Rail-Net, containing a lightweight convolutional backbone and an anchor classifier. Specifically, we formulate the process of rail detection as a row-based selecting problem. This strategy reduces the computational cost compared to alternative segmentation methods. (iii) We evaluate the Rail-Net on Rail-DB with extensive experiments, including cross-scene settings and network backbones ranging from ResNet to Vision Transformers. Our method achieves promising performance in terms of both speed and accuracy. Notably, a lightweight version could achieve 92.77% accuracy and 312 frames per second. The Rail-Net outperforms the traditional method by 50.65% and the segmentation one by 5.86%. The database and code are available at: https://github.com/Sampson-Lee/Rail-Detection.

cs.CV↗
arXiv2023

Efficient Quantum Circuit Cutting by Neglecting Basis Elements

Quantum circuit cutting has been proposed to help execute large quantum circuits using only small and noisy machines. Intuitively, cutting a qubit wire can be thought of as classically passing information of a quantum state along each element in a basis set. As the number of cuts increase, the number of quantum degrees of freedom needed to be passed through scales exponentially. We propose a simple reduction scheme to lower the classical and quantum resources required to perform a cut. Particularly, we recognize that for some cuts, certain basis element might pass "no information" through the qubit wire and can effectively be neglected. We empirically demonstrate our method on circuit simulators as well as IBM quantum hardware, and we observed up to 33 percent reduction in wall time without loss of accuracy.

quant-ph↗
arXiv2023

Maximum Likelihood Estimation for Maximal Distribution under Sublinear Expectation

Maximum likelihood estimation is a common method of estimating the parameters of the probability distribution from a given sample. This paper aims to introduce the maximum likelihood estimation in the framework of sublinear expectation. We find the maximum likelihood estimator for the parameters of the maximal distribution via the solution of the associated minimax problem, which coincides with the optimal unbiased estimation given by Jin and Peng \cite{JP21}. A general estimation method for samples with dependent structure is also provided. This result provides a theoretical foundation for the estimator of upper and lower variances, which is widely used in the G-VaR prediction model in finance.

math.PR↗
arXiv2022

AU-Aware Vision Transformers for Biased Facial Expression Recognition

Studies have proven that domain bias and label bias exist in different Facial Expression Recognition (FER) datasets, making it hard to improve the performance of a specific dataset by adding other datasets. For the FER bias issue, recent researches mainly focus on the cross-domain issue with advanced domain adaption algorithms. This paper addresses another problem: how to boost FER performance by leveraging cross-domain datasets. Unlike the coarse and biased expression label, the facial Action Unit (AU) is fine-grained and objective suggested by psychological studies. Motivated by this, we resort to the AU information of different FER datasets for performance boosting and make contributions as follows. First, we experimentally show that the naive joint training of multiple FER datasets is harmful to the FER performance of individual datasets. We further introduce expression-specific mean images and AU cosine distances to measure FER dataset bias. This novel measurement shows consistent conclusions with experimental degradation of joint training. Second, we propose a simple yet conceptually-new framework, AU-aware Vision Transformer (AU-ViT). It improves the performance of individual datasets by jointly training auxiliary datasets with AU or pseudo-AU labels. We also find that the AU-ViT is robust to real-world occlusions. Moreover, for the first time, we prove that a carefully-initialized ViT achieves comparable performance to advanced deep convolutional networks. Our AU-ViT achieves state-of-the-art performance on three popular datasets, namely 91.10% on RAF-DB, 65.59% on AffectNet, and 90.15% on FERPlus. The code and models will be released soon.

cs.CV↗
arXiv2022

G-capacity under degenerate case and its application

In this paper, we first find a type of viscosity solution of $G$-heat equation under degenerate case, and then obtain the related $G$-capacity $c(\{B_{T}\in A\})$ for any Borel set $A$. Furthermore, we prove that $I_{A}(B_{T})$ has no quasi-continuous version when it is not a constant function.

math.AP↗
arXiv2022

AU-Supervised Convolutional Vision Transformers for Synthetic Facial Expression Recognition

The paper describes our proposed methodology for the six basic expression classification track of Affective Behavior Analysis in-the-wild (ABAW) Competition 2022. In Learing from Synthetic Data(LSD) task, facial expression recognition (FER) methods aim to learn the representation of expression from the artificially generated data and generalise to real data. Because of the ambiguous of the synthetic data and the objectivity of the facial Action Unit (AU), we resort to the AU information for performance boosting, and make contributions as follows. First, to adapt the model to synthetic scenarios, we use the knowledge from pre-trained large-scale face recognition data. Second, we propose a conceptually-new framework, termed as AU-Supervised Convolutional Vision Transformers (AU-CVT), which clearly improves the performance of FER by jointly training auxiliary datasets with AU or pseudo AU labels. Our AU-CVT achieved F1 score as $0.6863$, accuracy as $0.7433$ on the validation set. The source code of our work is publicly available online: https://github.com/msy1412/ABAW4

cs.CV↗
arXiv2022

NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results

This paper reviews the challenge on constrained high dynamic range (HDR) imaging that was part of the New Trends in Image Restoration and Enhancement (NTIRE) workshop, held in conjunction with CVPR 2022. This manuscript focuses on the competition set-up, datasets, the proposed methods and their results. The challenge aims at estimating an HDR image from multiple respective low dynamic range (LDR) observations, which might suffer from under- or over-exposed regions and different sources of noise. The challenge is composed of two tracks with an emphasis on fidelity and complexity constraints: In Track 1, participants are asked to optimize objective fidelity scores while imposing a low-complexity constraint (i.e. solutions can not exceed a given number of operations). In Track 2, participants are asked to minimize the complexity of their solutions while imposing a constraint on fidelity scores (i.e. solutions are required to obtain a higher fidelity score than the prescribed baseline). Both tracks use the same data and metrics: Fidelity is measured by means of PSNR with respect to a ground-truth HDR image (computed both directly and with a canonical tonemapping operation), while complexity metrics include the number of Multiply-Accumulate (MAC) operations and runtime (in seconds).

cs.CV↗
arXiv2022

On the functional central limit theorem with mean-uncertainty

We introduce a new basic model for independent and identical distributed sequence on the canonical space $(\mathbb{R}^\mathbb{N},\mathcal{B}(\mathbb{R}^\mathbb{N}))$ via probability kernels with model uncertainty. Thanks to the well-defined upper and lower variances, we obtain a new functional central limit theorem with mean-uncertainty by the means of martingale central limit theorem and stability of stochastic integral in the classical probability theory. Then we extend it from the canonical space to the general sublinear expectation space. The corresponding proofs are purely probabilistic and do not rely on the nonlinear partial differential equation.

math.PR↗
arXiv2022

Maximally distributed random fields under sublinear expectation

This paper focuses on the maximal distribution on sublinear expectation space and introduces a new type of random fields with the maximally distributed finite-dimensional distribution. The corresponding spatial maximally distributed white noise is constructed, which includes the temporal-spatial situation as a special case due to the symmetrical independence property of maximal distribution. In addition, the stochastic integrals with respect to the spatial or temporal-spatial maximally distributed white noises are established in a quite direct way without the usual assumption of adaptability for integrand.

math.PR↗
arXiv2022

On the necessary and sufficient conditions for Peng's law of large numbers under sublinear expectations

In this paper, we firstly establish the weak laws of large numbers on the canonical space $(\br^\bn,\cb(\br^\bn))$ by traditional truncation method and Chebyshev's inequality as in the classical probability theory. Then we extend them from the canonical space to the general sublinear expectation space. The necessary and sufficient conditions for Peng's law of large numbers are obtained.

math.PR↗
arXiv2021

Pseudo-independence, independence and related limit theorems under sublinear expectations

This paper introduces the notion of pseudo-independence on the sublinear expectation space $(Ω,\mathcal{F},\mathcal{P})$ via the classical conditional expectation, and the relations between pseudo-independence and Peng's independence are detailed discussed. Law of large numbers and central limit theorem for pseudo-independent random variables are obtained, and a purely probabilistic proof of Peng's law of large numbers is also given. In the end, some relevant counterexamples are indicated that Peng's law of large numbers and central limit theorem are invalid only with the first and second moment conditions respectively.

math.PR↗
arXiv2021

ADNet: Attention-guided Deformable Convolutional Network for High Dynamic Range Imaging

In this paper, we present an attention-guided deformable convolutional network for hand-held multi-frame high dynamic range (HDR) imaging, namely ADNet. This problem comprises two intractable challenges of how to handle saturation and noise properly and how to tackle misalignments caused by object motion or camera jittering. To address the former, we adopt a spatial attention module to adaptively select the most appropriate regions of various exposure low dynamic range (LDR) images for fusion. For the latter one, we propose to align the gamma-corrected images in the feature-level with a Pyramid, Cascading and Deformable (PCD) alignment module. The proposed ADNet shows state-of-the-art performance compared with previous methods, achieving a PSNR-$l$ of 39.4471 and a PSNR-$μ$ of 37.6359 in NTIRE 2021 Multi-Frame HDR Challenge.

cs.CV↗
arXiv2020

Improving Generalized Zero-Shot Learning by Semantic Discriminator

It is a recognized fact that the classification accuracy of unseen classes in the setting of Generalized Zero-Shot Learning (GZSL) is much lower than that of traditional Zero-Shot Leaning (ZSL). One of the reasons is that an instance is always misclassified to the wrong domain. Here we refer to the seen and unseen classes as two domains respectively. We propose a new approach to distinguish whether the instances come from the seen or unseen classes. First the visual feature of instance is projected into the semantic space. Then the absolute norm difference between the projected semantic vector and the class semantic embedding vector, and the minimum distance between the projected semantic vectors and the semantic embedding vectors of the seen classes are used as discrimination basis. This approach is termed as SD (Semantic Discriminator) because domain judgement of instance is performed in the semantic space. Our approach can be combined with any existing ZSL method and fully supervision classification model to form a new GZSL method. Furthermore, our approach is very simple and does not need any fixed parameters.

cs.CV↗
arXiv2020

Disentanglement Then Reconstruction: Learning Compact Features for Unsupervised Domain Adaptation

Recent works in domain adaptation always learn domain invariant features to mitigate the gap between the source and target domains by adversarial methods. The category information are not sufficiently used which causes the learned domain invariant features are not enough discriminative. We propose a new domain adaptation method based on prototype construction which likes capturing data cluster centers. Specifically, it consists of two parts: disentanglement and reconstruction. First, the domain specific features and domain invariant features are disentangled from the original features. At the same time, the domain prototypes and class prototypes of both domains are estimated. Then, a reconstructor is trained by reconstructing the original features from the disentangled domain invariant features and domain specific features. By this reconstructor, we can construct prototypes for the original features using class prototypes and domain prototypes correspondingly. In the end, the feature extraction network is forced to extract features close to these prototypes. Our contribution lies in the technical use of the reconstructor to obtain the original feature prototypes which helps to learn compact and discriminant features. As far as we know, this idea is proposed for the first time. Experiment results on several public datasets confirm the state-of-the-art performance of our method.

cs.CV↗