IP Library › Granted Patent US 12,675,638
Granted Patent B2
US 12,675,638 · App. 19/329,533 · Granted Jul 7, 2026

Systems and methods for temporal acceleration encoding in geodesic latent space for event forecasting

Inventor: Brian Galvin (Silverdale, WA)
Assignee: ATOMBEAM TECHNOLOLGIES INC.
G06F40/30G06F16/3325G06F16/3329
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,675,638
App. No.
19/329,533
Filed
Sep 15, 2025
Granted
Jul 7, 2026
Kind
B2
Art Unit
2657
USPC
704/9
Abstract

A system and method for temporal acceleration encoding in Lorentzian latent space enables real-time event forecasting within navigable spatiotemporal media. The system encodes media data into compact Lorentzian latent patches using variational autoencoders and organizes them within a multi-dimensional hyperspace spanning spatial, temporal, orientation, scale, and spectral coordinates. Temporal acceleration encoding computes velocity and acceleration vectors along geodesic trajectories, extracting event signatures through multi-scale aggregation over sliding windows. An acceleration-indexed memory stores dynamic descriptors with composite keys comprising hyperspace coordinates and motion characteristics. Event forecasting retrieves similar historical patterns and conditions a forecast head to produce event probabilities and time-to-event estimates with uncertainty calibration. The system streams forecast metadata to edge devices for real-time prediction and adaptive navigation, supporting applications in surveillance, autonomous systems, predictive media exploration, and anomaly detection where both temporal forecasting and multidimensional navigation capabilities are essential.

Claims (32)

1 . A computer system comprising: a hardware memory, wherein the computer system is configured to execute software instructions stored on nontransitory machine-readable storage media that:

encode media data into Lorentzian latent patches using a variational autoencoder and organize the patches in a multi-dimensional hyperspace indexed by spatial, temporal, orientation, scale, and spectral coordinates;

compute temporal dynamics along geodesic trajectories by calculating velocity and acceleration vectors from the latent patches and extracting event signatures through multi-scale aggregation over sliding temporal windows;

maintain an acceleration-indexed memory storing dynamic descriptors with keys comprising hyperspace coordinates and motion characteristics;

generate event forecasts by retrieving similar historical patterns from the acceleration-indexed memory and conditioning a forecast head to produce event probabilities and time-to-event estimates with uncertainty calibration;

perform counterfactual analysis by perturbing geodesic trajectories with potential fields and computing sensitivity metrics for alternative forecast outcomes; and

stream forecast metadata to edge devices for real-time event prediction and navigation.

2 . The computer system of claim 1 , wherein the variational autoencoder processes kernel-sized tensor inputs that capture spatial regions, temporal frames, and spectral bands, and outputs two-dimensional latent arrays that preserve spatial structure while enabling geodesic computation.

3 . The computer system of claim 1 , wherein computing temporal dynamics comprises applying smoothing filters to velocity and acceleration vectors to suppress sensor noise while preserving rapid onset detection for event prediction.

4 . The computer system of claim 1 , wherein the acceleration-indexed memory implements time-to-live based eviction policies and stores descriptors with composite keys comprising velocity magnitude, acceleration magnitude, and normalized acceleration direction.

5 . The computer system of claim 1 , wherein retrieving similar historical patterns comprises performing approximate nearest neighbor search using cosine similarity on event signatures and re-ranking results based on coordinate proximity and temporal relevance.

6 . The computer system of claim 1 , wherein the forecast head outputs event class probabilities over a predefined set of event types and time-to-event estimates with calibrated confidence intervals using temperature scaling or Monte Carlo dropout.

7 . The computer system of claim 1 , wherein counterfactual analysis comprises integrating perturbed trajectories using numerical methods with adaptive step sizes while enforcing soft constraints through barrier functions.

8 . The computer system of claim 1 , wherein streaming forecast metadata comprises transmitting path identifiers, waypoints, dynamics vectors, event probabilities, and time-to-event estimates in compressed binary payloads with quality-of-service prioritization.

9 . The computer system of claim 1 , further comprising a generative fill-in module that synthesizes plausible latent patches for sparse regions using conditional diffusion based on neighboring context and hyperspace displacement vectors.

10 . The computer system of claim 1 , wherein the system operates on edge devices with resource constraints by implementing adaptive quality management, intelligent caching of latent patches, and real-time decoder optimization for maintaining target frame rates.

11 . A method for temporal acceleration encoding in a Lorentzian latent space for event forecasting, comprising the steps of:

encoding media data into Lorentzian latent patches using a variational autoencoder and organizing the patches in a multi-dimensional hyperspace indexed by spatial, temporal, orientation, scale, and spectral coordinates;

computing temporal dynamics along geodesic trajectories by calculating velocity and acceleration vectors from the latent patches and extracting event signatures through multi-scale aggregation over sliding temporal windows;

maintaining an acceleration-indexed memory storing dynamic descriptors with keys comprising hyperspace coordinates and motion characteristics;

generating event forecasts by retrieving similar historical patterns from the acceleration-indexed memory and conditioning a forecast head to produce event probabilities and time-to-event estimates with uncertainty calibration;

performing counterfactual analysis by perturbing geodesic trajectories with potential fields and computing sensitivity metrics for alternative forecast outcomes; and

streaming forecast metadata to edge devices for real-time event prediction and navigation.

12 . The method of claim 11 , wherein the variational autoencoder processes kernel-sized tensor inputs that capture spatial regions, temporal frames, and spectral bands, and outputs two-dimensional latent arrays that preserve spatial structure while enabling geodesic computation.

13 . The method of claim 11 , wherein computing temporal dynamics comprises applying smoothing filters to velocity and acceleration vectors to suppress sensor noise while preserving rapid onset detection for event prediction.

14 . The method of claim 11 , wherein the acceleration-indexed memory implements time-to-live based eviction policies and stores descriptors with composite keys comprising velocity magnitude, acceleration magnitude, and normalized acceleration direction.

15 . The method of claim 11 , wherein retrieving similar historical patterns comprises performing approximate nearest neighbor search using cosine similarity on event signatures and re-ranking results based on coordinate proximity and temporal relevance.

16 . The method of claim 11 , wherein the forecast head outputs event class probabilities over a predefined set of event types and time-to-event estimates with calibrated confidence intervals using temperature scaling or Monte Carlo dropout.

17 . The method of claim 11 , wherein counterfactual analysis comprises integrating perturbed trajectories using numerical methods with adaptive step sizes while enforcing soft constraints through barrier functions.

18 . The method of claim 11 , wherein streaming forecast metadata comprises transmitting path identifiers, waypoints, dynamics vectors, event probabilities, and time-to-event estimates in compressed binary payloads with quality-of-service prioritization.

19 . The method of claim 11 , further comprising synthesizing plausible latent patches for sparse regions using conditional diffusion based on neighboring context and hyperspace displacement vectors.

20 . The method of claim 11 , wherein the method operates on edge devices with resource constraints by implementing adaptive quality management, intelligent caching of latent patches, and real-time decoder optimization for maintaining target frame rates.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 26, 2026
From: GALVIN, BRIAN
To: ATOMBEAM TECHNOLOGIES INC.
Reel/Frame 073915/0786 →
Continuity (22)
Continuation In Part 19329369 · Sep 15, 2025
Continuation In Part 19328199 · Sep 14, 2025
Continuation In Part 19328179 · Sep 14, 2025
Continuation In Part 19328103 · Sep 13, 2025
Continuation In Part 19326730 · Sep 12, 2025
Continuation In Part 19321173 · Sep 6, 2025
Continuation In Part 19284115 · Jul 29, 2025
Continuation In Part 19245366 · Jun 22, 2025
Continuation In Part 19204525 · May 10, 2025
Continuation In Part 19192215 · Apr 28, 2025
Continuation 19051193 · Feb 12, 2025
Continuation In Part 18972797 · Dec 6, 2024
Continuation In Part 18648340 · Apr 27, 2024
Continuation In Part 18427716 · Jan 30, 2024
Continuation In Part 18410980 · Jan 11, 2024
Continuation In Part 18537728 · Dec 12, 2023
Provisional Application 63847889 · Jul 21, 2025
Provisional Application 63847082 · Jul 19, 2025
Provisional Application 63847096 · Jul 19, 2025
Provisional Application 63847091 · Jul 19, 2025
Provisional Application 63847101 · Jul 19, 2025
Related Publication 20260017459A1 · Jan 15, 2026
References Cited (84)
US 7629922B2 · Winstead et al. · 2009 [cited by applicant]
US 7876257B2 · Vetro et al. · 2011 [cited by applicant]
US 9942254B1 · Averbuch · 2018 [cited by examiner]
US 10706356B1 · Doyle · 2020 [cited by examiner]
US 10984030B2 · Bordawekar · 2021 [cited by examiner]
US 11037531B2 · Kaplanyan · 2021 [cited by examiner]
US 11082438B2 · Peinador · 2021 [cited by examiner]
US 11218498B2 · Hajimirsadeghi · 2022 [cited by examiner]
US 11234006B2 · Wang · 2022 [cited by examiner]
US 11436246B2 · Lee · 2022 [cited by examiner]
US 11451565B2 · Zhou · 2022 [cited by examiner]
US 11656353B2 · Li et al. · 2023 [cited by applicant]
US 11729406B2 · Habibian et al. · 2023 [cited by applicant]
US 11770984B2 · Hendrickson · 2023 [cited by examiner]
US 11847536B2 · Chawla · 2023 [cited by examiner]
US 11915690B1 · Chang et al. · 2024 [cited by applicant]
US 11934752B1 · Nordmark · 2024 [cited by examiner]
US 11989657B2 · Chavoshi · 2024 [cited by examiner]
US 20070063548A1 · Eipper · 2007 [cited by examiner]
US 20100251101A1 · Haussecker · 2010 [cited by examiner]
US 20160005281A1 · Laska · 2016 [cited by examiner]
US 20170351941A1 · Mishra · 2017 [cited by examiner]
US 20180018557A1 · Esser · 2018 [cited by examiner]
US 20190179896A1 · Anisimovich · 2019 [cited by examiner]
US 20190213277A1 · DeLuca · 2019 [cited by examiner]
US 20190325342A1 · Sikka · 2019 [cited by examiner]
US 20200081445A1 · Stetson · 2020 [cited by examiner]
US 20200143259A1 · Lindsley · 2020 [cited by examiner]
US 20200234446A1 · Mischi · 2020 [cited by examiner]
US 20200272605A1 · More · 2020 [cited by applicant]
US 20200404340A1 · Xu et al. · 2020 [cited by applicant]
US 20200410164A1 · Seow · 2020 [cited by examiner]
US 20210012162A1 · Huang · 2021 [cited by examiner]
US 20210027862A1 · Wei · 2021 [cited by examiner]
US 20210103733A1 · Jiang · 2021 [cited by examiner]
US 20210125583A1 · Kaplanyan · 2021 [cited by examiner]
US 20210158184A1 · Weber · 2021 [cited by examiner]
US 20220246158A1 · Nam et al. · 2022 [cited by applicant]
US 20220253633A1 · Bertasius · 2022 [cited by examiner]
US 20220307819A1 · Kadambi · 2022 [cited by examiner]
US 20220318831A1 · Marvaniya · 2022 [cited by examiner]
US 20230118401A1 · Xu · 2023 [cited by examiner]
US 20230142467A1 · Kaplanyan · 2023 [cited by examiner]
US 20230177281A1 · Kamath · 2023 [cited by examiner]
US 20230229722A1 · Ishii · 2023 [cited by examiner]
US 20230306162A1 · Mehr · 2023 [cited by examiner]
US 20230325678A1 · Fradkin · 2023 [cited by examiner]
US 20240036599A1 · Bowen · 2024 [cited by examiner]
US 20240046318A1 · Muriqi · 2024 [cited by examiner]
US 20240086493A1 · Lee · 2024 [cited by examiner]
US 20240126811A1 · Law · 2024 [cited by examiner]
US 20240127041A1 · Smith · 2024 [cited by examiner]
US 20240161933A1 · Baharloo · 2024 [cited by examiner]
US 20240193419A1 · Liang · 2024 [cited by examiner]
US 20240296665A1 · Nissenboim · 2024 [cited by examiner]
US 20240386015A1 · Crabtree · 2024 [cited by examiner]
US 20250131284A1 · Guillot · 2025 [cited by examiner]
US 20250156633A1 · Auchar · 2025 [cited by examiner]
US 20250165865A1 · Ardis · 2025 [cited by examiner]
US 20250249585A1 · Rozo · 2025 [cited by examiner]
US 20250259043A1 · Crabtree · 2025 [cited by examiner]
US 20250259085A1 · Crabtree · 2025 [cited by examiner]
US 20250259724A1 · Crabtree · 2025 [cited by examiner]
US 20250306680A1 · Zhou · 2025 [cited by examiner]
US 20250328754A1 · Srinivas · 2025 [cited by examiner]
US 20250363593A1 · Li · 2025 [cited by examiner]
US 20250371354A1 · Kamkari · 2025 [cited by examiner]
US 20250378647A1 · Elgort · 2025 [cited by examiner]
US 20260023955A1 · Fortkort · 2026 [cited by examiner]
US 20260044212A1 · Zhou · 2026 [cited by examiner]
US 20260046317A1 · Crabtree · 2026 [cited by examiner]
AU 2021105030A4 · 2022 [cited by examiner]
CN 112732939A · 2021 [cited by examiner]
CN 112905807A · 2021 [cited by examiner]
CN 113297395B · 2021 [cited by examiner]
CN 114860884A · 2022 [cited by examiner]
CN 116885844A · 2023 [cited by examiner]
CN 118051793A · 2024 [cited by examiner]
CN 116311503B · 2025 [cited by examiner]
Moing et al., CCVS: Context-aware Controllable Video Synthesis, journal={Advances in Neural Information Processing Systems}, {vol. 34}, {pp. 14042-14055}, year={2021} (Year: 2021). [cited by examiner]
Vlontzos, title={Causal future prediction in a minkowski space-time}, journal={arXiv preprint arXiv:2008.09154}, year={2020}, pp. 1-15 (Year: 2020). [cited by examiner]
Cai, Yuanhao et al; “Mask-guided Spectral-wise Transformer for Efficient Hyperspectral Image Reconstruction”, Conference on Computer Vision and Pattern Recognition, pp. 17502-17511, 2022. [cited by applicant]
Cai, Yuanhao et al; “MST++: Multi-stage Spectral-wise Transformer for Efficient Spectral Reconstruction”, Conference on Computer Vision and Pattern Recognition, 2022. [cited by applicant]
He, Kaiming et al; “Deep Residual Learning for Image Recognition”, Conference on Computer Vision and Pattern Recognition, pp. 770-778, 2016. [cited by applicant]