Search

Although numerous spatiotemporal approaches have been presented to address the problem of missing spatiotemporal data, there are still limitations in concurrently capturing the underlying spatiotemporal dependence of spatiotemporal graph data. Furthermore, most imputation methods miss the hidden dynamic connection associations that exist between graph nodes over time. To address the aforementioned spatiotemporal data imputation challenge, we present an attention-based message passing and dynamic graph convolution network (ADGCN). Specifically, this paper uses attention mechanisms to unify temporal and spatial continuity and aggregate node neighbor information in multiple directions. Furthermore, a dynamic graph convolution module is designed to capture constantly changing spatial correlations in sensors utilizing a new dynamic graph generation method with gating to transmit node information. Extensive imputation tests in the air quality and traffic flow domains were carried out on four real missing data sets. Experiments show that the ADGCN outperforms the state-of-the-art baseline.

The dynamic recommender system realizes the real-time recommendation for users by learning the dynamic interest characteristics, which is especially suitable for the scenarios of rapid transfer of user interests, such as e-commerce and social media. The dynamic recommendation model mainly depends on the user-item history interaction sequence with timestamp, which contains historical records that reflect changes in the true interests of users and the popularity of items. Previous methods usually model interaction sequences to learn the dynamic embedding of users and items. However, these methods can not directly capture the excitation effects of different historical information on the evolution process of both sides of the interaction, i.e., the ability of events to influence the occurrence of another event. In this work, we propose a Dynamic Graph Hawkes Process based on Linear complexity Self-Attention (DGHP-LISA) for dynamic recommender systems, which is a new framework for modeling the dynamic relationship between users and items at the same time. Specifically, DGHP-LISA is built on dynamic graph and uses Hawkes process to capture the excitation effects between events. In addition, we propose a new self-attention with linear complexity to model the time correlation of different historical events and the dynamic correlation between different update mechanisms, which drives more accurate modeling of the evolution process of both sides of the interaction. Extensive experiments on three real-world datasets show that our model achieves consistent improvements over state-of-the-art baselines.

Fringe projection profilometry technique has attracted more and more attention in the computer vision and found wide applications in the areas of high-precision measurement. This paper presents an accurate and robust system calibration method to formulate the phase-to-height conversion. This method uses the Levenberg-Marquardt nonlinear optimization algorithm to fit the phase value of a virtual reference plane, which is parallel to the line between the optical centers of the camera and the projector. The final expression just has three coefficients. With no need to manually adjust the position of components, several experiments were conducted to evaluate the performance of proposed method and demonstrated that the novel system calibration outperforms state-of-the-art methods in terms of stability and accuracy.

The accuracy of camera calibration depends significantly on the control point detection which customarily subjects to image noise, distortion and resolution. This paper uses concentric circle grids as the calibration pattern and accordingly proposes a robust and accurate control point detection method for camera calibration. Each set of concentric circles on the grids pattern consists of multiple circles whose radii decrease progressively. The geometric structure of multi-hierarchies can not only robustly extract control points from complicated scenarios but also build a voting scheme to avoid numerical instability resulting from the estimation of projected centers. According to the common self-polar triangle of concentric circles and the local sub-pixel edge detection algorithm, we efficiently estimated sub-pixel coordinates of control points under projective transformation. Simulations and real experiments were conducted to demonstrate that the performance of calibration using concentric circle grids is superior to the popular grid patterns with respect to the image noise, distortion and resolution.