IP Library Granted Patent US 12,399,266
Granted Patent B2
US 12,399,266 · App. 18/645,174 · Granted Aug 26, 2025

Multi-target detection using convex sparsity prior

Inventors: Jason Kyle Johnson (Fort Collins, CO); Dylan Scott Eustice (Boston, MA); Evan Jackson Everett (Fort Collins, CO); Shawn Michael Herman (Fort Collins, CO)
Assignee: Anduril Industries, Inc.
G01S13/581G01S7/292G01S13/726
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,399,266
App. No.
18/645,174
Granted
Aug 26, 2025
Kind
B2
Abstract

Provided is a method for detecting the trajectories of one or more targets in the field of view of one or more sensors, the method comprising: receiving one or more sensor frames corresponding to the one or more sensors; defining a space of allowable target states for the one or more sensor frames; specifying a set of potential target trajectories, each comprising one allowable target state for each of the one or more sensor frames; specifying target signal parameters for each of the allowable target states, such that the target signal parameters predict the expected target signal contribution corresponding to the one or more sensor frames; specifying a data fidelity objective to quantify how well the target signal parameters match the one or more sensor frames; specifying a sequence of one or more sparsity objectives to penalize a number of detected targets; determine the trajectories of one or more targets as follows: obtain values for all the target signal parameters in all the sensor frames, the obtained values being initialized values or previously optimized values, for each sparsity objective of the sequence, starting with the obtained target signal parameters, determine new target signal parameters to optimize the sum of the data fidelity objective and the sparsity objective; and storing the final trajectories in memory.

Claims (59)

1. A non-transitory machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:

receiving one or more sensor frames corresponding to the one or more sensors;

defining a space of allowable target states for the one or more sensor frames;

specifying a set of potential target trajectories, each comprising one allowable target state for each of the one or more sensor frames;

specifying target signal parameters for each of the allowable target states, such that the target signal parameters predict an expected target signal contribution corresponding to the one or more sensor frames;

specifying a data fidelity objective to quantify how well the target signal parameters match the one or more sensor frames;

specifying a sequence of one or more sparsity objectives to penalize a number of detected targets;

determining trajectories of one or more targets as follows:

obtaining values for all the target signal parameters in all the one or more sensor frames, the obtained values being initialized values or previously optimized values,

for each sparsity objective of the sequence, starting with the obtained values for the target signal parameters, determining new values for target signal parameters to optimize a sum of the data fidelity objective and the given sparsity objective; and

storing final determined trajectories in memory.

2. The non-transitory machine-readable medium of claim 1 wherein the one or more sparsity objectives of the sequence become increasingly non-convex.

3. The non-transitory machine-readable medium of claim 2 wherein the sequence of one or more sparsity objectives begins with a convex objective.

4. The non-transitory machine-readable medium of claim 1 wherein the data fidelity objective is convex.

5. The non-transitory machine-readable medium of claim 1 wherein the one or more sparsity objectives are each a mixture of a convex sparsity objective and a non-convex sparsity objective, with a weight of the non-convex sparsity objective being increased in the sequence.

6. The non-transitory machine-readable medium of claim 5 wherein the convex sparsity objective is a weighted group sparsity prior, corresponding to a sum over all potential target trajectories of a norm of weighted target parameters of each trajectory.

7. The non-transitory machine-readable medium of claim 5 wherein the non-convex sparsity objective is a number of target trajectories with one or more non-zero target signal parameters.

8. The non-transitory machine-readable medium of claim 4 wherein the convex data fidelity objective is a squared norm of a difference between data of the one or more sensor frames and a sum of all target signal contributions predicted by the target signal parameters.

9. The non-transitory machine-readable medium of claim 1 wherein the optimization of the sum of the data fidelity objective and the given sparsity objective is obtained by performing a sequence of optimizations over subspaces of the target signal parameters associated to a subset of all potential target trajectories, until one or more termination conditions are met.

10. The non-transitory machine-readable medium of claim 9 wherein the subset of all potential target trajectories being optimized is incrementally grown by selecting a next best trajectory to include by solving a maximum-weight path problem in a graph of allowable state transitions.

11. The non-transitory machine-readable medium of claim 10 wherein a trajectory from the subset of all potential target trajectories being optimized is updated as follows:

remove the trajectory from the subset and set the target signal parameters of the trajectory to zero;

reoptimize the target signal parameters of remaining trajectories of the subset in the absence of the removed trajectory; and

select the next best trajectory to include by solving the maximum-weight path problem in the graph of allowable state transitions.

12. The non-transitory machine-readable medium of claim 11 wherein the maximum-weight path problem is solved via a Viterbi algorithm.

13. The non-transitory machine-readable medium of claim 10 wherein the termination condition is that a weight of the next best trajectory to add is below a threshold.

14. The non-transitory machine-readable medium of claim 9 wherein the optimization over the subspace of associated target signal parameters is performed by iterative group coordinate descent, where at each iteration the set of all target signal parameters associated to a given target trajectory are jointly optimized while holding all other target signal parameters fixed.

15. The non-transitory machine-readable medium of claim 14 wherein the group coordinate descent is computed using a group shrinkage operation.

16. The non-transitory machine-readable medium of claim 1 , wherein:

the data fidelity objective is a squared norm of a difference between data of the one or more sensor frames and a sum of all target signal contributions predicted by the target signal parameters; and

the one or more sparsity objectives are each a mixture of a weighted group sparsity prior, corresponding to a sum over all potential target trajectories of a norm of weighted target parameters of each trajectory, and a number of target trajectories with one or more non-zero target signal parameters, with the weight on the number of target trajectories being increased in the sequence.

17. The non-transitory machine-readable medium of claim 1 , wherein the instructions, when executed by one or more processors, effectuate further operations comprising steps for displaying the final trajectories to a user.

18. A system comprising:

one or more sensors;

memory; and

one or more processors coupled to the one or more sensors, the one or more processors being configured to:

receive one or more sensor frames corresponding to the one or more sensors;

define a space of allowable target states for the one or more sensor frames;

specify a set of potential target trajectories, each comprising one allowable target state for each of the one or more sensor frames;

specify target signal parameters for each of the allowable target states, such that the target signal parameters predict an expected target signal contribution corresponding to the one or more sensor frames;

specify a data fidelity objective to quantify how well the target signal parameters match the one or more sensor frames;

specify a sequence of one or more sparsity objectives to penalize a number of detected targets;

determine trajectories of one or more targets as follows:

obtain values for all the target signal parameters in all the one or more sensor frames, the obtained values being initialized values or previously optimized values,

for each sparsity objective of the sequence, starting with the obtained target signal parameters, determine values for new target signal parameters to optimize a sum of the data fidelity objective and the given sparsity objective; and

store final determined trajectories in the memory.

19. The system of claim 18 , wherein the one or more sensors are electro-optical/infrared cameras.

20. The system of claim 18 , wherein the one or more sensors are radar sensors.

21. A non-transitory machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:

receiving one or more sensor frames corresponding to the one or more sensors;

defining a space of allowable target states for the one or more sensor frames;

specifying a set of potential target trajectories, each comprising one allowable target state for each of the one or more sensor frames;

specifying target signal parameters for each of the allowable target states, such that the target signal parameters predict an expected target signal contribution corresponding to the one or more sensor frames;

specifying a data fidelity objective to quantify how well the target signal parameters match the one or more sensor frames;

specifying a sequence of one or more sparsity objectives to penalize a number of detected targets, wherein at least part of some of the one or more sparsity objectives are convex;

determining trajectories of one or more targets as follows:

obtaining values for all the target signal parameters in all the one or more sensor frames, the obtained values being initialized values or previously optimized values,

for each sparsity objective of the sequence, starting with the obtained values for the target signal parameters, determining new values for target signal parameters to optimize a sum of the data fidelity objective and the given sparsity objective; and

storing final determined trajectories in memory.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2025
From: NUMERICA CORPORATION
To: ANDURIL INDUSTRIES, INC.
Reel/Frame 069879/0897 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2024
From: JOHNSON, JASON KYLE; EUSTICE, DYLAN SCOTT; EVERETT, EVAN JACKSON; HERMAN, SHAWN MICHAEL
To: NUMERICA CORPORATION
Reel/Frame 068287/0924 →
Continuity (3)
Continuation 18356042 · Jul 20, 2023
Provisional Application 63391605 · Jul 22, 2022
Related Publication 20240377524A1 · Nov 14, 2024
References Cited (62)
US 5210798A · Ekchian · 1993 [cited by examiner]
US 5355325A · Uhlmann · 1994 [cited by examiner]
US 5537119A · Poore, Jr. · 1996 [cited by examiner]
US 5793931A · Hillis · 1998 [cited by examiner]
US 5960097A · Pfeiffer · 1999 [cited by examiner]
US 8314732B2 · Oswald · 2012 [cited by examiner]
US RE44807E · Poore, Jr. · 2014 [cited by examiner]
US 8907841B2 · Sahinoglu · 2014 [cited by examiner]
US 9630318B2 · Ibarz Gabardos · 2017 [cited by examiner]
US 10109057B2 · Benosman et al. · 2018 [cited by applicant]
US 10198823B1 · Agrawal · 2019 [cited by examiner]
US 10531806B2 · Principe · 2020 [cited by examiner]
US 10665115B2 · Fragoso · 2020 [cited by examiner]
US 10802131B2 · Nielsen · 2020 [cited by examiner]
US 10880451B2 · Deshmukh · 2020 [cited by examiner]
US 10943145B2 · Wang · 2021 [cited by examiner]
US 11182592B2 · Li · 2021 [cited by examiner]
US 11330982B2 · Adler, Jr. · 2022 [cited by examiner]
US 11392859B2 · Basu · 2022 [cited by examiner]
US 11449985B2 · Stanitsas · 2022 [cited by examiner]
US 11614508B1 · Wang · 2023 [cited by examiner]
US 11726197B2 · Baskaran · 2023 [cited by examiner]
US 11748897B1 · Burgoyne · 2023 [cited by examiner]
US 12013456B2 · Johnson et al. · 2024 [cited by applicant]
US 20020008657A1 · Poore, Jr. · 2002 [cited by examiner]
US 20030058157A1 · Sassman · 2003 [cited by examiner]
US 20080169968A1 · Easthope · 2008 [cited by examiner]
US 20100109938A1 · Oswald · 2010 [cited by examiner]
US 20100207629A1 · Trzasko · 2010 [cited by examiner]
US 20110085643A1 · Zhu · 2011 [cited by examiner]
US 20120093359A1 · Kurien · 2012 [cited by examiner]
US 20130188856A1 · Adler, Jr. et al. · 2013 [cited by applicant]
US 20130335528A1 · Vishwanath · 2013 [cited by examiner]
US 20140327566A1 · Burgio · 2014 [cited by examiner]
US 20150022390A1 · Mansour · 2015 [cited by examiner]
US 20160096270A1 · Ibarz Gabardos · 2016 [cited by examiner]
US 20160242690A1 · Principe · 2016 [cited by examiner]
US 20170176994A1 · Yedidia · 2017 [cited by examiner]
US 20170193830A1 · Fragoso · 2017 [cited by examiner]
US 20170291301A1 · Ibarz Gabardos · 2017 [cited by examiner]
US 20180106898A1 · Baskaran et al. · 2018 [cited by applicant]
US 20180329034A1 · Bilik · 2018 [cited by examiner]
US 20190107615A1 · Eljarat · 2019 [cited by examiner]
US 20200057090A1 · Stachnik · 2020 [cited by examiner]
US 20210072348A1 · Malas · 2021 [cited by examiner]
US 20210096231A1 · Destefano · 2021 [cited by examiner]
US 20210278517A1 · Takahashi · 2021 [cited by examiner]
US 20210364771A1 · Wetzstein · 2021 [cited by examiner]
US 20220004762A1 · Kottenstette · 2022 [cited by examiner]
US 20220026557A1 · Arbabian · 2022 [cited by examiner]
US 20220067417A1 · Banerjee · 2022 [cited by examiner]
US 20220196798A1 · Chen · 2022 [cited by examiner]
US 20220198611A1 · Jia · 2022 [cited by examiner]
US 20220379478A1 · Raghunathan · 2022 [cited by examiner]
US 20230179285A1 · Su · 2023 [cited by examiner]
US 20230215055A1 · Dai · 2023 [cited by examiner]
US 20240402326A1 · Johnson et al. · 2024 [cited by applicant]
EP 1018033B1 · 2005 [cited by examiner]
EP 3293537A1 · 2018 [cited by examiner]
WO WO2008098915A1 · 2008 [cited by examiner]
Non-Final Office Action issued in corresponding U.S. Appl. No. 18/790,866, dated Sep. 24, 2024. [cited by applicant]
International Preliminary Report on Patentability and Written Opinion in Application No. PCT/US2023/028270, dated Jan. 28, 2025, in 6 pages. [cited by applicant]