Chris@49
|
1 // Copyright (C) 2012 NICTA (www.nicta.com.au)
|
Chris@49
|
2 // Copyright (C) 2012 Conrad Sanderson
|
Chris@49
|
3 //
|
Chris@49
|
4 // This Source Code Form is subject to the terms of the Mozilla Public
|
Chris@49
|
5 // License, v. 2.0. If a copy of the MPL was not distributed with this
|
Chris@49
|
6 // file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
Chris@49
|
7
|
Chris@49
|
8
|
Chris@49
|
9
|
Chris@49
|
10 //! \addtogroup op_hist
|
Chris@49
|
11 //! @{
|
Chris@49
|
12
|
Chris@49
|
13
|
Chris@49
|
14
|
Chris@49
|
15 template<typename T1>
|
Chris@49
|
16 inline
|
Chris@49
|
17 void
|
Chris@49
|
18 op_hist::apply(Mat<uword>& out, const mtOp<uword, T1, op_hist>& X)
|
Chris@49
|
19 {
|
Chris@49
|
20 arma_extra_debug_sigprint();
|
Chris@49
|
21
|
Chris@49
|
22 typedef typename T1::elem_type eT;
|
Chris@49
|
23
|
Chris@49
|
24 const uword n_bins = X.aux_uword_a;
|
Chris@49
|
25
|
Chris@49
|
26 const unwrap_check_mixed<T1> tmp(X.m, out);
|
Chris@49
|
27 const Mat<eT>& A = tmp.M;
|
Chris@49
|
28
|
Chris@49
|
29
|
Chris@49
|
30 uword A_n_elem = A.n_elem;
|
Chris@49
|
31 const eT* A_mem = A.memptr();
|
Chris@49
|
32
|
Chris@49
|
33 eT min_val = priv::most_pos<eT>();
|
Chris@49
|
34 eT max_val = priv::most_neg<eT>();
|
Chris@49
|
35
|
Chris@49
|
36 uword i,j;
|
Chris@49
|
37 for(i=0, j=1; j < A_n_elem; i+=2, j+=2)
|
Chris@49
|
38 {
|
Chris@49
|
39 const eT val_i = A_mem[i];
|
Chris@49
|
40 const eT val_j = A_mem[j];
|
Chris@49
|
41
|
Chris@49
|
42 if(min_val > val_i) { min_val = val_i; }
|
Chris@49
|
43 if(min_val > val_j) { min_val = val_j; }
|
Chris@49
|
44
|
Chris@49
|
45 if(max_val < val_i) { max_val = val_i; }
|
Chris@49
|
46 if(max_val < val_j) { max_val = val_j; }
|
Chris@49
|
47 }
|
Chris@49
|
48
|
Chris@49
|
49 if(i < A_n_elem)
|
Chris@49
|
50 {
|
Chris@49
|
51 const eT val_i = A_mem[i];
|
Chris@49
|
52
|
Chris@49
|
53 if(min_val > val_i) { min_val = val_i; }
|
Chris@49
|
54 if(max_val < val_i) { max_val = val_i; }
|
Chris@49
|
55 }
|
Chris@49
|
56
|
Chris@49
|
57 if(arma_isfinite(min_val) == false) { min_val = priv::most_neg<eT>(); }
|
Chris@49
|
58 if(arma_isfinite(max_val) == false) { max_val = priv::most_pos<eT>(); }
|
Chris@49
|
59
|
Chris@49
|
60 if(n_bins >= 1)
|
Chris@49
|
61 {
|
Chris@49
|
62 Col<eT> c(n_bins);
|
Chris@49
|
63 eT* c_mem = c.memptr();
|
Chris@49
|
64
|
Chris@49
|
65 for(uword ii=0; ii < n_bins; ++ii)
|
Chris@49
|
66 {
|
Chris@49
|
67 c_mem[ii] = (0.5 + ii) / double(n_bins); // TODO: may need to be modified for integer matrices
|
Chris@49
|
68 }
|
Chris@49
|
69
|
Chris@49
|
70 c = ((max_val - min_val) * c) + min_val;
|
Chris@49
|
71
|
Chris@49
|
72 out = hist(A, c);
|
Chris@49
|
73 }
|
Chris@49
|
74 else
|
Chris@49
|
75 {
|
Chris@49
|
76 out.reset();
|
Chris@49
|
77 }
|
Chris@49
|
78 }
|
Chris@49
|
79
|
Chris@49
|
80
|
Chris@49
|
81
|
Chris@49
|
82 //! @}
|