/usr/include/dlib/matrix/matrix_conv.h is in libdlib-dev 18.18-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 | // Copyright (C) 2011 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_MATRIx_CONV_Hh_
#define DLIB_MATRIx_CONV_Hh_
#include "matrix_conv_abstract.h"
#include "matrix.h"
namespace dlib
{
// ----------------------------------------------------------------------------------------
namespace impl
{
template <typename T>
const T& conj(const T& item) { return item; }
template <typename T>
std::complex<T> conj(const std::complex<T>& item) { return std::conj(item); }
}
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <typename M1, typename M2, bool flip_m2 = false>
struct op_conv
{
op_conv( const M1& m1_, const M2& m2_) :
m1(m1_),
m2(m2_),
nr_(m1.nr()+m2.nr()-1),
nc_(m1.nc()+m2.nc()-1)
{
if (nr_ < 0 || m1.size() == 0 || m2.size() == 0)
nr_ = 0;
if (nc_ < 0 || m1.size() == 0 || m2.size() == 0)
nc_ = 0;
}
const M1& m1;
const M2& m2;
long nr_;
long nc_;
const static long cost = (M1::cost+M2::cost)*10;
const static long NR = (M1::NR*M2::NR==0) ? (0) : (M1::NR+M2::NR-1);
const static long NC = (M1::NC*M2::NC==0) ? (0) : (M1::NC+M2::NC-1);
typedef typename M1::type type;
typedef type const_ret_type;
typedef typename M1::mem_manager_type mem_manager_type;
typedef typename M1::layout_type layout_type;
const_ret_type apply (long r, long c) const
{
type temp = 0;
const long min_rr = std::max<long>(r-m2.nr()+1, 0);
const long max_rr = std::min<long>(m1.nr()-1, r);
const long min_cc = std::max<long>(c-m2.nc()+1, 0);
const long max_cc = std::min<long>(m1.nc()-1, c);
for (long rr = min_rr; rr <= max_rr; ++rr)
{
for (long cc = min_cc; cc <= max_cc; ++cc)
{
if (flip_m2)
temp += m1(rr,cc)*dlib::impl::conj(m2(m2.nr()-r+rr-1, m2.nc()-c+cc-1));
else
temp += m1(rr,cc)*m2(r-rr,c-cc);
}
}
return temp;
}
long nr () const { return nr_; }
long nc () const { return nc_; }
template <typename U> bool aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
template <typename U> bool destructively_aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
};
template <
typename M1,
typename M2
>
const matrix_op<op_conv<M1,M2> > conv (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv<M1,M2> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
template <
typename M1,
typename M2
>
const matrix_op<op_conv<M1,M2,true> > xcorr (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv<M1,M2,true> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <typename M1, typename M2, bool flip_m2 = false>
struct op_conv_same
{
op_conv_same( const M1& m1_, const M2& m2_) : m1(m1_),m2(m2_),nr_(m1.nr()),nc_(m1.nc())
{
if (m1.size() == 0 || m2.size() == 0)
nr_ = 0;
if (m1.size() == 0 || m2.size() == 0)
nc_ = 0;
}
const M1& m1;
const M2& m2;
long nr_;
long nc_;
const static long cost = (M1::cost+M2::cost)*10;
const static long NR = M1::NR;
const static long NC = M1::NC;
typedef typename M1::type type;
typedef type const_ret_type;
typedef typename M1::mem_manager_type mem_manager_type;
typedef typename M1::layout_type layout_type;
const_ret_type apply (long r, long c) const
{
r += m2.nr()/2;
c += m2.nc()/2;
type temp = 0;
const long min_rr = std::max<long>(r-m2.nr()+1, 0);
const long max_rr = std::min<long>(m1.nr()-1, r);
const long min_cc = std::max<long>(c-m2.nc()+1, 0);
const long max_cc = std::min<long>(m1.nc()-1, c);
for (long rr = min_rr; rr <= max_rr; ++rr)
{
for (long cc = min_cc; cc <= max_cc; ++cc)
{
if (flip_m2)
temp += m1(rr,cc)*dlib::impl::conj(m2(m2.nr()-r+rr-1, m2.nc()-c+cc-1));
else
temp += m1(rr,cc)*m2(r-rr,c-cc);
}
}
return temp;
}
long nr () const { return nr_; }
long nc () const { return nc_; }
template <typename U> bool aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
template <typename U> bool destructively_aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
};
template <
typename M1,
typename M2
>
const matrix_op<op_conv_same<M1,M2> > conv_same (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv_same<M1,M2> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
template <
typename M1,
typename M2
>
const matrix_op<op_conv_same<M1,M2,true> > xcorr_same (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv_same<M1,M2,true> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <typename M1, typename M2, bool flip_m2 = false>
struct op_conv_valid
{
op_conv_valid( const M1& m1_, const M2& m2_) :
m1(m1_),m2(m2_),
nr_(m1.nr()-m2.nr()+1),
nc_(m1.nc()-m2.nc()+1)
{
if (nr_ < 0 || nc_ <= 0 || m1.size() == 0 || m2.size() == 0)
nr_ = 0;
if (nc_ < 0 || nr_ <= 0 || m1.size() == 0 || m2.size() == 0)
nc_ = 0;
}
const M1& m1;
const M2& m2;
long nr_;
long nc_;
const static long cost = (M1::cost+M2::cost)*10;
const static long NR = (M1::NR*M2::NR==0) ? (0) : (M1::NR-M2::NR+1);
const static long NC = (M1::NC*M2::NC==0) ? (0) : (M1::NC-M2::NC+1);
typedef typename M1::type type;
typedef type const_ret_type;
typedef typename M1::mem_manager_type mem_manager_type;
typedef typename M1::layout_type layout_type;
const_ret_type apply (long r, long c) const
{
r += m2.nr()-1;
c += m2.nc()-1;
type temp = 0;
const long min_rr = std::max<long>(r-m2.nr()+1, 0);
const long max_rr = std::min<long>(m1.nr()-1, r);
const long min_cc = std::max<long>(c-m2.nc()+1, 0);
const long max_cc = std::min<long>(m1.nc()-1, c);
for (long rr = min_rr; rr <= max_rr; ++rr)
{
for (long cc = min_cc; cc <= max_cc; ++cc)
{
if (flip_m2)
temp += m1(rr,cc)*dlib::impl::conj(m2(m2.nr()-r+rr-1, m2.nc()-c+cc-1));
else
temp += m1(rr,cc)*m2(r-rr,c-cc);
}
}
return temp;
}
long nr () const { return nr_; }
long nc () const { return nc_; }
template <typename U> bool aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
template <typename U> bool destructively_aliases ( const matrix_exp<U>& item) const { return m1.aliases(item) || m2.aliases(item); }
};
template <
typename M1,
typename M2
>
const matrix_op<op_conv_valid<M1,M2> > conv_valid (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv_valid<M1,M2> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
template <
typename M1,
typename M2
>
const matrix_op<op_conv_valid<M1,M2,true> > xcorr_valid (
const matrix_exp<M1>& m1,
const matrix_exp<M2>& m2
)
{
COMPILE_TIME_ASSERT((is_same_type<typename M1::type,typename M2::type>::value == true));
typedef op_conv_valid<M1,M2,true> op;
return matrix_op<op>(op(m1.ref(),m2.ref()));
}
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_MATRIx_CONV_Hh_
|