pub struct LMSolver { /* private fields */ }
Expand description
Levenberg-Marquardt solver. Starting with the specified vector of parameters it optimizes the target vector criteria “err” (finds local minima of each target vector component absolute value).
When needed, it calls user-provided callback.
Implementations§
source§impl LMSolver
impl LMSolver
sourcepub fn create(
cb: &Ptr<LMSolver_Callback>,
max_iters: i32
) -> Result<Ptr<LMSolver>>
pub fn create( cb: &Ptr<LMSolver_Callback>, max_iters: i32 ) -> Result<Ptr<LMSolver>>
Creates Levenberg-Marquard solver
Parameters
- cb: callback
- maxIters: maximum number of iterations that can be further modified using setMaxIters() method.
pub fn create_ext( cb: &Ptr<LMSolver_Callback>, max_iters: i32, eps: f64 ) -> Result<Ptr<LMSolver>>
Trait Implementations§
source§impl AlgorithmTrait for LMSolver
impl AlgorithmTrait for LMSolver
source§impl AlgorithmTraitConst for LMSolver
impl AlgorithmTraitConst for LMSolver
fn as_raw_Algorithm(&self) -> *const c_void
source§fn write(&self, fs: &mut FileStorage) -> Result<()>
fn write(&self, fs: &mut FileStorage) -> Result<()>
Stores algorithm parameters in a file storage
source§fn write_1(&self, fs: &mut FileStorage, name: &str) -> Result<()>
fn write_1(&self, fs: &mut FileStorage, name: &str) -> Result<()>
Stores algorithm parameters in a file storage Read more
source§fn write_with_name(&self, fs: &Ptr<FileStorage>, name: &str) -> Result<()>
fn write_with_name(&self, fs: &Ptr<FileStorage>, name: &str) -> Result<()>
@deprecated Read more
source§fn empty(&self) -> Result<bool>
fn empty(&self) -> Result<bool>
Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read
source§fn save(&self, filename: &str) -> Result<()>
fn save(&self, filename: &str) -> Result<()>
Saves the algorithm to a file.
In order to make this method work, the derived class must implement Algorithm::write(FileStorage& fs).
source§fn get_default_name(&self) -> Result<String>
fn get_default_name(&self) -> Result<String>
Returns the algorithm string identifier.
This string is used as top level xml/yml node tag when the object is saved to a file or string.
source§impl Boxed for LMSolver
impl Boxed for LMSolver
source§impl LMSolverTrait for LMSolver
impl LMSolverTrait for LMSolver
source§impl LMSolverTraitConst for LMSolver
impl LMSolverTraitConst for LMSolver
fn as_raw_LMSolver(&self) -> *const c_void
source§fn run(&self, param: &mut impl ToInputOutputArray) -> Result<i32>
fn run(&self, param: &mut impl ToInputOutputArray) -> Result<i32>
Runs Levenberg-Marquardt algorithm using the passed vector of parameters as the start point.
The final vector of parameters (whether the algorithm converged or not) is stored at the same
vector. The method returns the number of iterations used. If it’s equal to the previously specified
maxIters, there is a big chance the algorithm did not converge. Read more
source§fn get_max_iters(&self) -> Result<i32>
fn get_max_iters(&self) -> Result<i32>
Retrieves the current maximum number of iterations
impl Send for LMSolver
Auto Trait Implementations§
impl RefUnwindSafe for LMSolver
impl !Sync for LMSolver
impl Unpin for LMSolver
impl UnwindSafe for LMSolver
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