shutter 0.0.1

Image processing data structures and algorithms
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

use opencv::{core, imgproc};
use crate::image::cvutils::slice_to_mat;
use std::collections::HashMap;
use crate::image::*;
use nalgebra::*;
use std::fmt::Debug;

pub struct TemplateSearch<T>
where
    T : Scalar + Debug + Copy
{
    map : Image<f32>,
    template : Image<T>,
    region_sz : (usize, usize)
}

impl<T> TemplateSearch<T>
where
    T : Scalar + Debug + Copy
{

    /// Returns local maxima over regions with the given size.
    pub fn new(sz : (usize, usize), region_sz : (usize, usize), template : Image<T>) -> Self {
        Self { map : Image::new_constant(sz.0, sz.1, 0.0), region_sz, template }
    }

    pub fn set_template(&mut self, template : Image<T>) {
        self.template = template;
    }

    pub fn search_local(&mut self, src : &Image<T>) -> (usize, usize) {
        self.calculate_match(src);
        search_maximum(&self.map.full_window())
    }

    fn calculate_match(&mut self, src : &Image<T>) {
        let map_width = self.map.width();
        let template_width = self.template.width();
        unsafe {
            template_match(
                src.as_ref(),
                self.map.as_mut(),
                map_width,
                self.template.as_mut(),
                template_width
            );
        }
    }

    /// Returns (region index, maximum) collection
    pub fn search_global(&mut self, src : &Image<T>) -> HashMap<(usize, usize), (usize, usize)> {
        self.calculate_match(src);
        let mut maxima = HashMap::new();
        for i in 0..(self.map.height() / self.region_sz.0) {
            for j in 0..(self.map.width() / self.region_sz.1) {
                let calc_this = maxima.get(&(i,j)).is_none();
                if calc_this {
                    let offset = (i*self.region_sz.0, j*self.region_sz.1);
                    let max_ix = search_maximum(&self.map.window(offset, self.region_sz).unwrap());
                    maxima.insert((i, j), max_ix);
                }
            }
        }
        maxima
    }

}

unsafe fn template_match<T>(src : &[T], result : &mut [f32], src_ncol : usize, template : &mut [T], template_ncol : usize)
where
    T : Scalar + Debug + Copy
{
    assert!(T::is::<u8>() || T::is::<f32>());
    assert!(src.len() == result.len());
    let mut src = slice_to_mat(src, src_ncol, None);
    let mut template = slice_to_mat(template, template_ncol, None);
    let mut dst = slice_to_mat(result, src_ncol, None);

    // Write match correlation map
    imgproc::match_template(
        &mut src,
        &mut template,
        &mut dst,
        imgproc::TM_CCORR_NORMED, 
        &core::no_array().unwrap()
    ).unwrap();
}

fn search_minimum<T>(win : &Window<T>) -> (usize, usize)
where
    T : Scalar + Debug + Copy
{
    search_minimum_maximum(win).1
}

fn search_maximum<T>(win : &Window<T>) -> (usize, usize)
where
    T : Scalar + Debug + Copy
{
    search_minimum_maximum(win).0
}


fn search_minimum_maximum<T>(win : &Window<T>) -> ((usize, usize), (usize, usize))
where
    T : Scalar + Debug + Copy
{
    let mut min_loc = core::Point2i { x : 0, y : 0 };
    let mut max_loc = core::Point2i { x : 0, y : 0 };
    let mut min_val = 0.0;
    let mut max_val = 0.0;
    
    let mut m : core::Mat = win.clone().into();

    // Then find local maxima and minima (If used TM_CCORR, get local maximum; for TM_CCOEFF use minimum).
    core::min_max_loc(
        &mut m,
        &mut min_val,
        &mut max_val,
        &mut min_loc,
        &mut max_loc,
        &core::no_array().unwrap()
    ).unwrap();

    ((min_loc.y as usize, min_loc.x as usize), (max_loc.y as usize, max_loc.x as usize))
}