13 research outputs found

    Adaptive Articulation Angle Preview-Based Path-Following Algorithm for Tractor-Semitrailer Using Optimal Control

    No full text
    Most existing Path-Following Algorithms (PFAs) are developed for single-unit vehicles (SUVs) and rarely for articulated vehicles (AVs). Since these PFAs ignore the motion of the trailer, they may cause large tracking deviations and ride stability issues when cornering. To this end, an Adaptive Articulation Angle Preview-based Path-Following Algorithm (AAAP-PFA) is proposed for AVs. Different from previous PFAs, in this model, a simple linear vehicle dynamics model is used as the prediction model, and an offset distance calculated by an articulation angle is used as part of the preview distance. An adaptive posture control strategy is designed to trade off the trajectory tracking performance and lateral stability performance during the path-following process. Considering a large prediction mismatch caused by using a linear vehicle dynamics model, a feedback correction method is proposed to improve the robustness of the steering control. In the comparison simulation experiment with SUV-PFA, it is confirmed that the novel PFA has better adaptability to the contradictory relationship between tracking performance and lateral stability and has strong steering control robustness

    Explicit Facial Expression Transfer via Fine-Grained Representations

    Full text link
    Facial expression transfer between two unpaired images is a challenging problem, as fine-grained expression is typically tangled with other facial attributes. Most existing methods treat expression transfer as an application of expression manipulation, and use predicted global expression, landmarks or action units (AUs) as a guidance. However, the prediction may be inaccurate, which limits the performance of transferring fine-grained expression. Instead of using an intermediate estimated guidance, we propose to explicitly transfer facial expression by directly mapping two unpaired input images to two synthesized images with swapped expressions. Specifically, considering AUs semantically describe fine-grained expression details, we propose a novel multi-class adversarial training method to disentangle input images into two types of fine-grained representations: AU-related feature and AU-free feature. Then, we can synthesize new images with preserved identities and swapped expressions by combining AU-free features with swapped AU-related features. Moreover, to obtain reliable expression transfer results of the unpaired input, we introduce a swap consistency loss to make the synthesized images and self-reconstructed images indistinguishable. Extensive experiments show that our approach outperforms the state-of-the-art expression manipulation methods for transferring fine-grained expressions while preserving other attributes including identity and pose.Comment: This paper has been accepted by IEEE Transactions on Image Processing (TIP

    HLO: Half-kernel Laplacian Operator for surface smoothing

    Full text link
    This paper presents a simple yet effective method for feature-preserving surface smoothing. Through analyzing the differential property of surfaces, we show that the conventional discrete Laplacian operator with uniform weights is not applicable to feature points at which the surface is non-differentiable and the second order derivatives do not exist. To overcome this difficulty, we propose a Half-kernel Laplacian Operator (HLO) as an alternative to the conventional Laplacian. Given a vertex v, HLO first finds all pairs of its neighboring vertices and divides each pair into two subsets (called half windows); then computes the uniform Laplacians of all such subsets and subsequently projects the computed Laplacians to the full-window uniform Laplacian to alleviate flipping and degeneration. The half window with least regularization energy is then chosen for v. We develop an iterative approach to apply HLO for surface denoising. Our method is conceptually simple and easy to use because it has a single parameter, i.e., the number of iterations for updating vertices. We show that our method can preserve features better than the popular uniform Laplacian-based denoising and it significantly alleviates the shrinkage artifact. Extensive experimental results demonstrate that HLO is better than or comparable to state-of-the-art techniques both qualitatively and quantitatively and that it is particularly good at handling meshes with high noise. We will make our source code publicly available.Comment: Accepted to Computer Aided Design; Binary (exe) program avaliable: https://github.com/WillPanSUTD/hl
    corecore