Searcharxiv⌕ Search

arXiv subjects

Lu Xu

Publications and source records attributed to Lu Xu.

At least 91 records · Page 5Linked to original sources

ComboLoss for Facial Attractiveness Analysis with Squeeze-and-Excitation Networks

Loss function is crucial for model training and feature representation learning, conventional models usually regard facial attractiveness recognition task as a regression problem, and adopt MSE loss or Huber variant loss as supervision to train a deep convolutional neural network (CNN) to predict facial attractiveness score. Little work has been done to systematically compare the performance of diverse loss functions. In this paper, we firstly systematically analyze model performance under diverse loss functions. Then a novel loss function named ComboLoss is proposed to guide the SEResNeXt50 network. The proposed method achieves state-of-the-art performance on SCUT-FBP, HotOrNot and SCUT-FBP5500 datasets with an improvement of 1.13%, 2.1% and 0.57% compared with prior arts, respectively. Code and models are available at https://github.com/lucasxlu/ComboLoss.git.

cs.MM↗

Hyperbolic scaling limit of non-equilibrium fluctuations for a weakly anharmonic chain

We consider a chain of $n$ coupled oscillators placed on a one-dimensional lattice with periodic boundary conditions. The interaction between particles is determined by a weakly anharmonic potential $V_n = r^2/2 + σ_nU(r)$, where $U$ has bounded second derivative and $σ_n$ vanishes as $n \to \infty$. The dynamics is perturbed by noises acting only on the positions, such that the total momentum and length are the only conserved quantities. With relative entropy technique, we prove for dynamics out of equilibrium that, if $σ_n$ decays sufficiently fast, the fluctuation field of the conserved quantities converges in law to a linear $p$-system in the hyperbolic space-time scaling limit. The transition speed is spatially homogeneous due to the vanishing anharmonicity. We also present a quantitative bound for the speed of convergence to the corresponding hydrodynamic limit.

math.PR↗

Optimization of a multi-TW few-cycle 1.7-$μ$m source based on Type-I BBO dual-chirped optical parametric amplification

This paper presents the optimization of a dual-chirped optical parametric amplification (DC-OPA) scheme for producing an ultrafast intense infrared (IR) pulse. By employing a total energy of 0.77 J Ti:sapphire pump laser and type-I BBO crystals, an IR pulse energy at the center wavelength of 1.7 $μ$m exceeded 0.1 J using the optimized DC-OPA. By adjusting the injected seed spectrum and prism pair compressor with a gross throughput of over 70 \%, the 1.7-$μ$m pulse was compressed to 31 fs, which resulted in a peak power of up to 2.3 TW. Based on the demonstration of the BBO type-I DC-OPA, we propose a novel OPA scheme called the $dual~pump$ DC-OPA for producing a high-energy IR pulse with a two-cycle duration.

physics.optics↗

XCloud: Design and Implementation of AI Cloud Platform with RESTful API Service

In recent years, artificial intelligence (AI) has aroused much attention among both industrial and academic areas. However, building and maintaining efficient AI systems are quite difficult for many small business companies and researchers if they are not familiar with machine learning and AI. In this paper, we first evaluate the difficulties and challenges in building AI systems. Then an cloud platform termed XCloud, which provides several common AI services in form of RESTful APIs, is constructed. Technical details are discussed in Section 2. This project is released as open-source software and can be easily accessed for late research. Code is available at https://github.com/lucasxlu/XCloud.git.

cs.DC↗

Knowing What, How and Why: A Near Complete Solution for Aspect-based Sentiment Analysis

Target-based sentiment analysis or aspect-based sentiment analysis (ABSA) refers to addressing various sentiment analysis tasks at a fine-grained level, which includes but is not limited to aspect extraction, aspect sentiment classification, and opinion extraction. There exist many solvers of the above individual subtasks or a combination of two subtasks, and they can work together to tell a complete story, i.e. the discussed aspect, the sentiment on it, and the cause of the sentiment. However, no previous ABSA research tried to provide a complete solution in one shot. In this paper, we introduce a new subtask under ABSA, named aspect sentiment triplet extraction (ASTE). Particularly, a solver of this task needs to extract triplets (What, How, Why) from the inputs, which show WHAT the targeted aspects are, HOW their sentiment polarities are and WHY they have such polarities (i.e. opinion reasons). For instance, one triplet from "Waiters are very friendly and the pasta is simply average" could be ('Waiters', positive, 'friendly'). We propose a two-stage framework to address this task. The first stage predicts what, how and why in a unified model, and then the second stage pairs up the predicted what (how) and why from the first stage to output triplets. In the experiments, our framework has set a benchmark performance in this novel triplet extraction task. Meanwhile, it outperforms a few strong baselines adapted from state-of-the-art related methods.

cs.CL↗

Control of Structured Light Enables Nearly Perfect Noise-filtering

The performance of laser-based active sensing has been severely limited by two types of noise: electrical noise, stemming from elements; optical noise, laser jamming from an eavesdropper and background from environment. Conventional methods to filter optical noise take advantage of the differences between signal and noise in time, wavelength, and polarization. However, they may be limited when the noise and signal share the same information on these degrees of freedoms (DoFs). In order to overcome this drawback, we experimentally demonstrate a groundbreaking noise-filtering method by controlling orbital angular momentum (OAM) to distinguish signal from noise. We provide a proof-of-principle experiment and discuss the dependence of azimuthal index of OAM and detection aperture on signal-to-noise ratio (SNR). Our results suggest that using OAM against noise is an efficient method, offering a new route to optical sensing immersed in high-level noise.

physics.optics↗

The Gursky-Streets equation and its application to the $σ_k$ Yamabe problem

The Gursky-Streets equation are introduced as the geodesic equation of a metric structure in conformal geometry. This geometric structure has played a substantial role in the proof of uniqueness of $σ_2$ Yamabe problem in dimension four. In this paper we solve the Gursky-Streets equations with uniform $C^{1, 1}$ estimates for $2k\leq n$. An important new ingredient is to show the concavity of the operator which holds for all $k\leq n$. Our proof of the concavity heavily relies on Garding's theory of hyperbolic polynomials and results from the theory of real roots for (interlacing) polynomials. Together with this concavity, we are able to solve the equation with the uniform $C^{1, 1}$ \emph{a priori estimates} for all the cases $n\geq 2k$. Moreover, we establish the uniqueness of the solution to the degenerate equations for the first time. As an application, we prove that if $k\geq 3$ and $M^{2k}$ is conformally flat, any solution solution of $σ_k$ Yamabe problem is conformal diffeomorphic to the round sphere $S^{2k}$.

math.AP↗

Equilibrium fluctuation for an anharmonic chain with boundary conditions in the Euler scaling limit

We study the evolution in equilibrium of the fluctuations for the conserved quantities of a chain of anharmonic oscillators in the hyperbolic space-time scaling. Boundary conditions are determined by applying a constant tension at one side, while the position of the other side is kept fixed. The Hamiltonian dynamics is perturbed by random terms conservative of such quantities. We prove that these fluctuations evolve macroscopically following the linearized Euler equations with the corresponding boundary conditions, even in some time scales larger than the hyperbolic one.

math.PR↗

An optical all-pass filter realized by using self-compensation of loss

Filters are key devices in optical systems and are usually applied to signal suppression or selection based on their amplitude frequency responses. Different from amplitude filtering, an all-pass filter (APF) is a unique type of filter that exhibits a uniform amplitude and variable phase in the frequency response. Traditionally, an APF is designed to be ideal and lossless, which is impossible in practice. Here we demonstrate a method of realizing an APF even when transmission loss exists, and a possible structure for realizing the lossy APF is proposed. The method indicates that a lossy APF can be realized by introducing self-compensation of loss to the structure of an ideal single-stage APF, and an APF based on silicon-on-insulator (SOI) foundry is fabricated and demonstrated. The method of self-compensation of loss can also be used to realize APFs in the electrical domain. We anticipate that our work will inspire realizations of more APF-related devices that once seemed impossible in practice.

physics.optics↗

Data-driven Approach for Quality Evaluation on Knowledge Sharing Platform

In recent years, voice knowledge sharing and question answering (Q&A) platforms have attracted much attention, which greatly facilitate the knowledge acquisition for people. However, little research has evaluated on the quality evaluation on voice knowledge sharing. This paper presents a data-driven approach to automatically evaluate the quality of a specific Q&A platform (Zhihu Live). Extensive experiments demonstrate the effectiveness of the proposed method. Furthermore, we introduce a dataset of Zhihu Live as an open resource for researchers in related areas. This dataset will facilitate the development of new methods on knowledge sharing services quality evaluation.

cs.SI↗

An invariance principle for stochastic heat equations with periodic coefficients

We investigate the asymptotic behaviors of the solution $u(t, \cdot)$ to a stochastic heat equation with a periodic, gradient-type nonlinear term. We extend the central limit theorem for finite-dimensional diffusions to infinite-dimensional settings. Due to our results, $\frac{1}{\sqrt t}u(t, \cdot)$ converges weakly to a centered Gaussian variable whose covariance operator is described through Poisson equations. Different from the finite-dimensional case, the fluctuation in space vanishes in the limit distribution. Furthermore, we verify the tightness and present an invariance principle for $\{εu(ε^{-2}t, \cdot)\}_{t \in [0, T]}$ as $ε\downarrow 0$.

math.PR↗

Transferring Rich Deep Features for Facial Beauty Prediction

Feature extraction plays a significant part in computer vision tasks. In this paper, we propose a method which transfers rich deep features from a pretrained model on face verification task and feeds the features into Bayesian ridge regression algorithm for facial beauty prediction. We leverage the deep neural networks that extracts more abstract features from stacked layers. Through simple but effective feature fusion strategy, our method achieves improved or comparable performance on SCUT-FBP dataset and ECCV HotOrNot dataset. Our experiments demonstrate the effectiveness of the proposed method and clarify the inner interpretability of facial beauty perception.

cs.CV↗

A central limit theorem for stochastic heat equations in random environment

In this article, we investigate the asymptotic behavior of the solution to a one-dimensional stochastic heat equation with random nonlinear term generated by a stationary, ergodic random field. We extend the well-known central limit theorem for finite-dimensional diffusions in random environment to this infinite-dimensional setting. Due to our result, a central limit theorem in $L^1$ sense with respect to the randomness of the environment holds under a diffusive time scaling. The limit distribution is a centered Gaussian law whose covariance operator is explicitly described. It concentrates only on the space of constant functions.

math.PR↗

Micro-optical Tandem Luminescent Solar Concentrators

Traditional concentrating photovoltaic (CPV) systems utilize multijunction cells to minimize thermalization losses, but cannot efficiently capture diffuse sunlight, which contributes to a high levelized cost of energy (LCOE) and limits their use to geographical regions with high direct sunlight insolation. Luminescent solar concentrators (LSCs) harness light generated by luminophores embedded in a light-trapping waveguide to concentrate light onto smaller cells. LSCs can absorb both direct and diffuse sunlight, and thus can operate as flat plate receivers at a fixed tilt and with a conventional module form factor. However, current LSCs experience significant power loss through parasitic luminophore absorption and incomplete light trapping by the optical waveguide. Here we introduce a tandem LSC device architecture that overcomes both of these limitations, consisting of a PLMA polymer layer with embedded CdSe/CdS quantum dot (QD) luminophores and InGaP micro-cells, which serve as a high bandgap absorber on top of a conventional Si photovoltaic. We experimentally synthesize CdSe/CdS QDs with exceptionally high quantum-yield (99%) and ultra-narrowband emission optimally matched to fabricated III-V InGaP micro-cells. Using a Monte Carlo ray-tracing model, we show the radiative limit power conversion efficiency for a module with these components to be 30.8% diffuse sunlight conditions. These results indicate that a tandem LSC-on-Si architecture could significantly improve upon the efficiency of a conventional Si photovoltaic module with simple and straightforward alterations of the module lamination steps of a Si photovoltaic manufacturing process, with promise for widespread module deployment across diverse geographical regions and energy markets.

physics.app-ph↗

Computer-aided implant design for the restoration of cranial defects

Patient-specific cranial implants are important and necessary in the surgery of cranial defect restoration. However, traditional methods of manual design of cranial implants are complicated and time-consuming. Our purpose is to develop a novel software named EasyCrania to design the cranial implants conveniently and efficiently. The process can be divided into five steps, which are mirroring model, clipping surface, surface fitting, the generation of the initial implant and the generation of the final implant. The main concept of our method is to use the geometry information of the mirrored model as the base to generate the final implant. The comparative studies demonstrated that the EasyCrania can improve the efficiency of cranial implant design significantly. And, the intra- and inter-rater reliability of the software were stable, which were 87.07+/-1.6% and 87.73+/-1.4% respectively.

cs.CV↗

Development of a computer-aided design software for dental splint in orthognathic surgery

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated.

physics.med-ph↗

A semi-automatic computer-aided method for surgical template design

This paper presents a generalized integrated framework of semi-automatic surgical template design. Several algorithms were implemented including the mesh segmentation, offset surface generation, collision detection, ruled surface generation, etc., and a special software named TemDesigner was developed. With a simple user interface, a customized template can be semi- automatically designed according to the preoperative plan. Firstly, mesh segmentation with signed scalar of vertex is utilized to partition the inner surface from the input surface mesh based on the indicated point loop. Then, the offset surface of the inner surface is obtained through contouring the distance field of the inner surface, and segmented to generate the outer surface. Ruled surface is employed to connect inner and outer surfaces. Finally, drilling tubes are generated according to the preoperative plan through collision detection and merging. It has been applied to the template design for various kinds of surgeries, including oral implantology, cervical pedicle screw insertion, iliosacral screw insertion and osteotomy, demonstrating the efficiency, functionality and generality of our method.

cs.GR↗

On the uniqueness of $L_p$-Minkowski problems: the constant $p$-curvature case in $\mathbb{R}^3$

We study the $C^4$ smooth convex bodies $\mathbb{K}\subset\mathbb{R}^{n+1}$ satisfying $K(x)=u(x)^{1-p}$, where $x\in\mathbb{S}^n$, $K$ is the Gauss curvature of $\partial\mathbb{K}$, $u$ is the support function of $\mathbb{K}$, and $p$ is a constant. In the case of $n=2$, either when $p\in[-1,0]$ or when $p\in(0,1)$ in addition to a pinching condition, we show that $\mathbb{K}$ must be the unit ball. This partially answers a conjecture of Lutwak, Yang, and Zhang about the uniqueness of the $L_p$-Minkowski problem in $\mathbb{R}^3$. Moreover, we give an explicit pinching constant depending only on $p$ when $p\in(0,1)$.

math.AP↗