#[repr(C)]pub struct QRCodeDetectorAruco_Params {
pub min_module_size_in_pyramid: f32,
pub max_rotation: f32,
pub max_module_size_mismatch: f32,
pub max_timing_pattern_mismatch: f32,
pub max_penalties: f32,
pub max_colors_mismatch: f32,
pub scale_timing_pattern_score: f32,
}
Fields§
§min_module_size_in_pyramid: f32
The minimum allowed pixel size of a QR module in the smallest image in the image pyramid, default 4.f
max_rotation: f32
The maximum allowed relative rotation for finder patterns in the same QR code, default pi/12
max_module_size_mismatch: f32
The maximum allowed relative mismatch in module sizes for finder patterns in the same QR code, default 1.75f
max_timing_pattern_mismatch: f32
The maximum allowed module relative mismatch for timing pattern module, default 2.f
If relative mismatch of timing pattern module more this value, penalty points will be added. If a lot of penalty points are added, QR code will be rejected.
max_penalties: f32
The maximum allowed percentage of penalty points out of total pins in timing pattern, default 0.4f
max_colors_mismatch: f32
The maximum allowed relative color mismatch in the timing pattern, default 0.2f
scale_timing_pattern_score: f32
The algorithm find QR codes with almost minimum timing pattern score and minimum size, default 0.9f
The QR code with the minimum “timing pattern score” and minimum “size” is selected as the best QR code. If for the current QR code “timing pattern score” * scaleTimingPatternScore < “previous timing pattern score” and “size” < “previous size”, then current QR code set as the best QR code.
Implementations§
Source§impl QRCodeDetectorAruco_Params
impl QRCodeDetectorAruco_Params
pub fn default() -> Result<QRCodeDetectorAruco_Params>
Trait Implementations§
Source§impl Clone for QRCodeDetectorAruco_Params
impl Clone for QRCodeDetectorAruco_Params
Source§fn clone(&self) -> QRCodeDetectorAruco_Params
fn clone(&self) -> QRCodeDetectorAruco_Params
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more