Mars: Real-time spatio-temporal queries on microblogs

2014 ◽  
Author(s):  
Amr Magdy ◽  
Ahmed M. Aly ◽  
Mohamed F. Mokbel ◽  
Sameh Elnikety ◽  
Yuxiong He ◽  
...  
Keyword(s):  
Real Time ◽  
Spatio Temporal

Passthrough+

2020 ◽  
Vol 3 (1) ◽  
pp. 1-17
Author(s):  
Gaurav Chaurasia ◽  
Arthur Nieuwoudt ◽  
Alexandru-Eugen Ichim ◽  
Richard Szeliski ◽  
Alexander Sorkine-Hornung
Keyword(s):  
Real Time ◽  
Video Encoding ◽  
View Synthesis ◽  
Performance Constraints ◽  
Trade Offs ◽  
Stereoscopic View ◽  
Target User ◽  
Spatio Temporal ◽  
And Performance ◽  
3D Scene

We present an end-to-end system for real-time environment capture, 3D reconstruction, and stereoscopic view synthesis on a mobile VR headset. Our solution allows the user to use the cameras on their VR headset as their eyes to see and interact with the real world while still wearing their headset, a feature often referred to as Passthrough. The central challenge when building such a system is the choice and implementation of algorithms under the strict compute, power, and performance constraints imposed by the target user experience and mobile platform. A key contribution of this paper is a complete description of a corresponding system that performs temporally stable passthrough rendering at 72 Hz with only 200 mW power consumption on a mobile Snapdragon 835 platform. Our algorithmic contributions for enabling this performance include the computation of a coarse 3D scene proxy on the embedded video encoding hardware, followed by a depth densification and filtering step, and finally stereoscopic texturing and spatio-temporal up-sampling. We provide a detailed discussion and evaluation of the challenges we encountered, as well as algorithm and performance trade-offs in terms of compute and resulting passthrough quality.;AB@The described system is available to users as the Passthrough+ feature on Oculus Quest. We believe that by publishing the underlying system and methods, we provide valuable insights to the community on how to design and implement real-time environment sensing and rendering on heavily resource constrained hardware.

scholarly journals Evaluation of IMERG Level-3 Products in Depicting the July to October Rainfall over Taiwan: Typhoon Versus Non-Typhoon

2021 ◽  
Vol 13 (4) ◽  
pp. 622
Author(s):  
Wan-Ru Huang ◽  
Pin-Yi Liu ◽  
Ya-Hui Chang ◽  
Cheng-An Lee
Keyword(s):  
Real Time ◽  
Tropical Rainfall Measuring Mission ◽  
Temporal Variations ◽  
Rain Gauge ◽  
Advantages And Disadvantages ◽  
Level 3 ◽  
Spatio Temporal ◽  
Typhoon Season ◽  
Early Late ◽  
Better Than

This study assesses the performance of satellite precipitation products (SPPs) from the latest version, V06B, Integrated Multi-satellitE Retrievals for Global Precipitation Mission (IMERG) Level-3 (including early, late, and final runs), in depicting the characteristics of typhoon season (July to October) rainfall over Taiwan within the period of 2000–2018. The early and late runs are near-real-time SPPs, while final run is post-real-time SPP adjusted by monthly rain gauge data. The latency of early, late, and final runs is approximately 4 h, 14 h, and 3.5 months, respectively, after the observation. Analyses focus on the seasonal mean, daily variation, and interannual variation of typhoon-related (TC) and non-typhoon-related (non-TC) rainfall. Using local rain-gauge observations as a reference for evaluation, our results show that all IMERG products capture the spatio-temporal variations of TC rainfall better than those of non-TC rainfall. Among SPPs, the final run performs better than the late run, which is slightly better than the early run for most of the features assessed for both TC and non-TC rainfall. Despite these differences, all IMERG products outperform the frequently used Tropical Rainfall Measuring Mission 3B42 v7 (TRMM7) for the illustration of the spatio-temporal characteristics of TC rainfall in Taiwan. In contrast, for the non-TC rainfall, the final run performs notably better relative to TRMM7, while the early and late runs showed only slight improvement. These findings highlight the advantages and disadvantages of using IMERG products for studying or monitoring typhoon season rainfall in Taiwan.

Robust spatio-temporal descriptors for real-time SVM-based fall detection

2014 ◽  
Author(s):  
Imen Charfi ◽  
Johel Miteran ◽  
Julien Dubois ◽  
Barthelemy Heyrman ◽  
Mohamed Atri
Keyword(s):  
Real Time ◽  
Fall Detection ◽  
Spatio Temporal

Real-time characterization of the spatio-temporal dynamics of deformable mirrors

2016 ◽  
Author(s):  
James Kilpatrick ◽  
Adela Apostol ◽  
Anatoliy Khizhnya ◽  
Vladimir Markov ◽  
Leonid Beresnev
Keyword(s):  
Real Time ◽  
Temporal Dynamics ◽  
Deformable Mirrors ◽  
Spatio Temporal

scholarly journals Space-time clustering-based method to optimize shareability in real-time ride-sharing

PLoS ONE ◽  
2022 ◽  
Vol 17 (1) ◽  
pp. e0262499
Author(s):  
Negin Alisoltani ◽  
Mostafa Ameli ◽  
Mahdi Zargayouna ◽  
Ludovic Leclercq
Keyword(s):  
Real Time ◽  
Large Scale ◽  
Computation Time ◽  
Clustering Method ◽  
Matching Problem ◽  
Solution Quality ◽  
Mobility Service ◽  
Ride Sharing ◽  
Large Scale Problems ◽  
Spatio Temporal

Real-time ride-sharing has become popular in recent years. However, the underlying optimization problem for this service is highly complex. One of the most critical challenges when solving the problem is solution quality and computation time, especially in large-scale problems where the number of received requests is huge. In this paper, we rely on an exact solving method to ensure the quality of the solution, while using AI-based techniques to limit the number of requests that we feed to the solver. More precisely, we propose a clustering method based on a new shareability function to put the most shareable trips inside separate clusters. Previous studies only consider Spatio-temporal dependencies to do clustering on the mobility service requests, which is not efficient in finding the shareable trips. Here, we define the shareability function to consider all the different sharing states for each pair of trips. Each cluster is then managed with a proposed heuristic framework in order to solve the matching problem inside each cluster. As the method favors sharing, we present the number of sharing constraints to allow the service to choose the number of shared trips. To validate our proposal, we employ the proposed method on the network of Lyon city in France, with half-million requests in the morning peak from 6 to 10 AM. The results demonstrate that the algorithm can provide high-quality solutions in a short time for large-scale problems. The proposed clustering method can also be used for different mobility service problems such as car-sharing, bike-sharing, etc.

Sign in / Sign up

Export Citation Format

Share Document