SearcharxivSearch

arXiv subjects

Trung-Kien Le

Publications and source records attributed to Trung-Kien Le.

5 recordsLinked to original sources

ALER-TI: Aligned Latent Embedding Retrieval for Time Series Imputation

Deep learning has significantly advanced time series imputation, yet most existing architectures primarily rely on localized temporal context within the corrupted input sequence. This reliance can be limiting in real-world scenarios, where time series often exhibit non-stationary dynamics, weak temporal correlations, and infrequent patterns that are difficult to reconstruct from nearby observations alone. In this paper, we propose ALER-TI, Aligned Latent Embedding Retrieval for Time Series Imputation, a retrieval-augmented framework that explicitly leverages historical patterns to supplement degraded local context for more reliable missing-value reconstruction. The core of ALER-TI is Latent Embedding Alignment (LEA), which mitigates the representation mismatch between corrupted queries and complete historical candidates. By applying post-hoc masking in the latent space, LEA aligns candidates with the query's missingness pattern while allowing historical embeddings to be pre-computed and cached for efficient retrieval. ALER-TI is model-agnostic and can be integrated with various imputation backbones through a lightweight adaptation module. Extensive experiments on six real-world datasets under different missing rates demonstrate that ALER-TI consistently improves strong baseline models and enhances robustness across diverse imputation settings.

cs.LG

From a few Accurate 2D Correspondences to 3D Point Clouds

Key points, correspondences, projection matrices, point clouds and dense clouds are the skeletons in image-based 3D reconstruction, of which point clouds have the important role in generating a realistic and natural model for a 3D reconstructed object. To achieve a good 3D reconstruction, the point clouds must be almost everywhere in the surface of the object. In this article, with a main purpose to build the point clouds covering the entire surface of the object, we propose a new feature named a geodesic feature or geo-feature. Based on the new geo-feature, if there are several (given) initial world points on the object's surface along with all accurately estimated projection matrices, some new world points on the geodesics connecting any two of these given world points will be reconstructed. Then the regions on the surface bordering by these initial world points will be covered by the point clouds. Thus, if the initial world points are around the surface, the point clouds will cover the entire surface. This article proposes a new method to estimate the world points and projection matrices from their correspondences. This method derives the closed-form and iterative solutions for the world points and projection matrices and proves that when the number of world points is less than seven and the number of images is at least five, the proposed solutions are global optimal. We propose an algorithm named World points from their Correspondences (WPfC) to estimate the world points and projection matrices from their correspondences, and another algorithm named Creating Point Clouds (CrPC) to create the point clouds from the world points and projection matrices given by the first algorithm.

cs.CV

Multi-view Geometry: Correspondences Refinement Based on Algebraic Properties

Correspondences estimation or feature matching is a key step in the image-based 3D reconstruction problem. In this paper, we propose two algebraic properties for correspondences. The first is a rank deficient matrix construct from the correspondences of at least nine key-points on two images (two-view correspondences) and the second is also another rank deficient matrix built from the other correspondences of six key-points on at least five images (multi-view correspondences). To our knowledge, there are no theoretical results for multi-view correspondences prior to this paper. To obtain accurate correspondences, multi-view correspondences seem to be more useful than two-view correspondences. From these two algebraic properties, we propose an refinement algorithm for correspondences. This algorithm is a combination of correspondences refinement, outliers recognition and missing key-points recovery. Real experiments from the project of reconstructing Buddha statue show that the proposed refinement algorithm can reduce the average error from 77 pixels to 55 pixels on the correspondences estimation. This drop is substantial and it validates our results.

cs.CG

Frame based equipment channel access enhancements in NR unlicensed spectrum for the URLLC transmissions

Ultra-reliable low-latency communication (URLLC) in 5G New Radio has been originally defined only for licensed spectrum. However, due to new use cases in the Industry 4.0 scenarios, URLLC operation is currently being extended to unlicensed spectrum in the ongoing Release 17 of the 3rd Generation Partnership Project. Although in such controlled environments we can guarantee the absence of any other technology sharing the channel on a long-term basis, the uncertainty of obtaining channel access through load based equipment (LBE) or frame based equipment (FBE) can impede with the latency requirements of URLLC. In FBE, the transmitters can be prioritized to support data with different requirements and have lower energy consumption and latency compared to LBE with a big contention window size. In this paper we analyze the performance of FBE in an unlicensed controlled environment through a Markov chain. Based on this analysis, we propose two schemes to improve the URLLC performance in FBE: The first scheme allows the transmitters to use multiple fixed frame period (FFP) configurations while the second scheme configures the FFP's starting point of each transmitter based on its priority. The simulations show the benefits of these schemes compared to the URLLC transmission of existing schemes.

cs.NI

An overview of physical layer design for Ultra-Reliable Low-Latency Communications in 3GPP Release 15 and Release 16

For the fifth generation (5G) wireless network technology, the most important design goals were improved metrics of reliability and latency, in addition to network resilience and flexibility so as to best adapt the network operation for new applications such as augmented virtual reality, industrial automation and autonomous vehicles. That led to design efforts conducted under the subject of ultra-reliable low-latency communication (URLLC). The technologies integrated in Release 15 of the 3rd Generation Partnership Project (3GPP) finalized in December 2017 provided the foundation of physical layer design for URLLC. New features such as numerologies, new transmission schemes with sub-slot interval, configured grant resources, etc., were standardized to improve mainly the latency aspects. 5G evolution in Release 16, PHY version finalized in December 2019, allows achieving improved metrics for latency and reliability by standardizing a number of new features. This article provides a detailed overview of the URLLC features from 5G Release 15 and Release 16, describing how these features permit URLLC operation in 5G networks.

eess.SP