Type Definition opencv::types::PtrOfEdgeAwareInterpolator

type PtrOfEdgeAwareInterpolator = Ptr<dyn EdgeAwareInterpolator>;

Implementations

impl PtrOfEdgeAwareInterpolator

pub fn as_raw_PtrOfEdgeAwareInterpolator(&self) -> *const c_void

pub fn as_raw_mut_PtrOfEdgeAwareInterpolator(&mut self) -> *mut c_void

Trait Implementations

impl AlgorithmTrait for PtrOfEdgeAwareInterpolator

pub fn as_raw_Algorithm(&self) -> *const c_void

pub fn as_raw_mut_Algorithm(&mut self) -> *mut c_void

pub fn clear(&mut self) -> Result<()>

Clears the algorithm state

pub fn write(&self, fs: &mut FileStorage) -> Result<()>

Stores algorithm parameters in a file storage

pub fn write_with_name(&self, fs: &Ptr<FileStorage>, name: &str) -> Result<()>

simplified API for language bindings Stores algorithm parameters in a file storage

pub fn read(&mut self, fn_: &FileNode) -> Result<()>

Reads algorithm parameters from a file storage

pub fn empty(&self) -> Result<bool>

Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read

pub 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).

pub 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.

impl EdgeAwareInterpolator for PtrOfEdgeAwareInterpolator

pub fn as_raw_EdgeAwareInterpolator(&self) -> *const c_void

pub fn as_raw_mut_EdgeAwareInterpolator(&mut self) -> *mut c_void

pub fn set_cost_map(&mut self, _cost_map: &Mat) -> Result<()>

Interface to provide a more elaborated cost map, i.e. edge map, for the edge-aware term. This implementation is based on a rather simple gradient-based edge map estimation. To used more complex edge map estimator (e.g. StructuredEdgeDetection that has been used in the original publication) that may lead to improved accuracies, the internal edge map estimation can be bypassed here.

pub fn set_k(&mut self, _k: i32) -> Result<()>

Parameter to tune the approximate size of the superpixel used for oversegmentation.

pub fn get_k(&mut self) -> Result<i32>

See also

pub fn set_sigma(&mut self, _sigma: f32) -> Result<()>

Sigma is a parameter defining how fast the weights decrease in the locally-weighted affine fitting. Higher values can help preserve fine details, lower values can help to get rid of noise in the output flow.

pub fn get_sigma(&mut self) -> Result<f32>

See also

pub fn set_lambda(&mut self, _lambda: f32) -> Result<()>

Lambda is a parameter defining the weight of the edge-aware term in geodesic distance, should be in the range of 0 to 1000.

pub fn get_lambda(&mut self) -> Result<f32>

See also

pub fn set_use_post_processing(&mut self, _use_post_proc: bool) -> Result<()>

Sets whether the fastGlobalSmootherFilter() post-processing is employed. It is turned on by default.

pub fn get_use_post_processing(&mut self) -> Result<bool>

See also

pub fn set_fgs_lambda(&mut self, _lambda: f32) -> Result<()>

Sets the respective fastGlobalSmootherFilter() parameter.

pub fn get_fgs_lambda(&mut self) -> Result<f32>

See also

pub fn set_fgs_sigma(&mut self, _sigma: f32) -> Result<()>

See also

pub fn get_fgs_sigma(&mut self) -> Result<f32>

See also

impl SparseMatchInterpolator for PtrOfEdgeAwareInterpolator

pub fn as_raw_SparseMatchInterpolator(&self) -> *const c_void

pub fn as_raw_mut_SparseMatchInterpolator(&mut self) -> *mut c_void

pub fn interpolate(
    &mut self,
    from_image: &dyn ToInputArray,
    from_points: &dyn ToInputArray,
    to_image: &dyn ToInputArray,
    to_points: &dyn ToInputArray,
    dense_flow: &mut dyn ToOutputArray
) -> Result<()>

Interpolate input sparse matches.