pub struct SortTracker { /* private fields */ }Expand description
A SORT (Simple Online and Realtime Tracking) multi-object tracker.
Each call to SortTracker::update advances every active track’s
Kalman filter by one frame, solves the assignment between predicted
track boxes and the frame’s detections by intersection-over-union, and
writes the resulting identity into each detection’s
tracker_id:
- Matched detections update their track’s filter and keep its id.
- Unmatched detections spawn a new track with a freshly allocated id.
- Tracks left unmatched for more than
max_ageconsecutive frames are dropped.
Implementations§
Source§impl SortTracker
impl SortTracker
Sourcepub fn new(max_age: usize, iou_threshold: f32) -> Self
pub fn new(max_age: usize, iou_threshold: f32) -> Self
Creates a tracker.
max_age: number of consecutive missed frames a track tolerates before being dropped.iou_threshold: minimum IoU between a predicted track box and a detection for them to be considered a match.
Sourcepub fn active_tracks(&self) -> usize
pub fn active_tracks(&self) -> usize
Number of tracks currently being maintained (including ones missed this frame but not yet aged out).
Sourcepub fn update(&mut self, detections: &mut Detections)
pub fn update(&mut self, detections: &mut Detections)
Advances the tracker by one frame, assigning tracker_id to every
detection in place.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SortTracker
impl RefUnwindSafe for SortTracker
impl Send for SortTracker
impl Sync for SortTracker
impl Unpin for SortTracker
impl UnsafeUnpin for SortTracker
impl UnwindSafe for SortTracker
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.