Struct Obs

Source
pub struct Obs<'a> {
    pub intrinsics: &'a Intrinsics,
    pub template: &'a DMatrix<u8>,
    pub image: &'a DMatrix<u8>,
    pub coordinates: &'a Vec<(usize, usize)>,
    pub _z_candidates: &'a Vec<Float>,
    pub jacobians: &'a Vec<Vec6>,
    pub hessians: &'a Vec<Mat6>,
}
Expand description

Precomputed data available for the optimizer iterations:

Fields§

§intrinsics: &'a Intrinsics

Intrinsic parameters of the camera.

§template: &'a DMatrix<u8>

Reference (“keyframe”) image.

§image: &'a DMatrix<u8>

Current image to track.

§coordinates: &'a Vec<(usize, usize)>

Coordinates of the points used for the tracking.

§_z_candidates: &'a Vec<Float>

Inverse depth of the points used for the tracking.

§jacobians: &'a Vec<Vec6>

Jacobians precomputed for the points used for the tracking.

§hessians: &'a Vec<Mat6>

Hessian matrices precomputed for the points used for the tracking.

Trait Implementations§

Source§

impl<'a> State<Obs<'a>, Result<EvalData, f32>, Isometry<f32, U3, Unit<Quaternion<f32>>>, String> for LMOptimizerState

impl<'a> optimizer::State<Obs<'a>, EvalState, Iso3, String> for LMOptimizerState.

Source§

fn init(obs: &Obs<'_>, model: Iso3) -> Self

Initialize the optimizer state.

Source§

fn step(&self) -> Result<Iso3, String>

Compute the step using Levenberg-Marquardt. Apply the step in an inverse compositional approach to compute the next motion estimation. May return an error at the Cholesky decomposition of the hessian.

Source§

fn eval(&self, obs: &Obs<'_>, model: Iso3) -> EvalState

Compute residuals and energy of the new model. Then, evaluate the new hessian and gradient if the energy has decreased.

Source§

fn stop_criterion( self, nb_iter: usize, eval_state: EvalState, ) -> (Self, Continue)

Stop after too many iterations, or if the energy variation is too low.

Also update the Levenberg-Marquardt coefficient depending on if the energy increased or decreased.

Source§

fn iterative_solve( obs: &Observations, initial_model: Model, ) -> Result<(Self, usize), Error>

Iteratively solve your optimization problem, with the provided functions by the trait implementation. Return the final state and the number of iterations. May return an error if a step computation failed.

Auto Trait Implementations§

§

impl<'a> Freeze for Obs<'a>

§

impl<'a> RefUnwindSafe for Obs<'a>

§

impl<'a> Send for Obs<'a>

§

impl<'a> Sync for Obs<'a>

§

impl<'a> Unpin for Obs<'a>

§

impl<'a> UnwindSafe for Obs<'a>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> SetParameter for T

Source§

fn set<T>(&mut self, value: T) -> <T as Parameter<Self>>::Result
where T: Parameter<Self>,

Sets value as a parameter of self.
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

unsafe 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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.