/usr/include/vigra/polynomial_registration.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-2+b5.
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 | /************************************************************************/
/* */
/* Copyright 2007-2013 by Benjamin Seppke */
/* */
/* This file is part of the VIGRA computer vision library. */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_POLYNOMIAL_REGISTRATION_HXX
#define VIGRA_POLYNOMIAL_REGISTRATION_HXX
#include "mathutil.hxx"
#include "matrix.hxx"
#include "linear_solve.hxx"
#include "tinyvector.hxx"
#include "splineimageview.hxx"
namespace vigra
{
/** \addtogroup Registration Image Registration
*/
//@{
/**
* Iterative function for determinination of the polynom weights:
*
* Example: order=2, x, y
* ----->
* [1,
* x, y,
* x^2, x*y, y^2]
*
* This function is needed, because the polynomial transformation Matrix
* has the the same number of rows. the target position is then determined
* by multiplying each x- and y-transformation result value with the
* corresponding weight for the current x- and y-coordinate, given by this
* function.
*/
std::vector<double> polynomialWarpWeights(double x, double y, unsigned int polynom_order)
{
unsigned int poly_count = (polynom_order+1)*(polynom_order+2)/2;
std::vector<double> weights(poly_count);
unsigned int weight_idx=0;
for (unsigned int order=0; order<=polynom_order; order++)
{
for(unsigned int i=0; i<=order; i++, weight_idx++)
{
weights[weight_idx] = pow(x,(double)order-i)*pow(y,(double)i);
}
}
return weights;
}
/********************************************************/
/* */
/* polynomialMatrix2DFromCorrespondingPoints */
/* */
/********************************************************/
/** \brief Create polynomial matrix of a certain degree that maps corresponding points onto each other.
For use with \ref polynomialWarpImage() of same degree.
Since polynoms are usually non-linear functions, a special semantics is embedded to define
a matrix here. Each matrix consist of two rows, containing x- and y-factors of the polynom.
The meaning of the matrix is explained at the example of a polynom of 2nd order:
First Row = [a_x b_x c_x d_x e_x f_x]
Second Row = [a_y b_y c_y d_y e_y f_y]
The transformed coordinate p'=[x' y'] of a position p=[x y] is then:
x' = a_x + b_x*x + c_x*y + d_x*x^2 + e_x*x*y + f_x*y^2
y' = a_y + b_y*x + c_y*y + d_y*x^2 + e_y*x*y + f_y*y^2
Note that the order of the polynom's factors is directly influenced by the
\ref polynomialWarpWeights() function and follows the intuitive scheme.
*/
template <int PolynomOrder,
class SrcPointIterator,
class DestPointIterator>
linalg::TemporaryMatrix<double>
polynomialMatrix2DFromCorrespondingPoints(SrcPointIterator s, SrcPointIterator s_end,
DestPointIterator d)
{
int point_count = s_end - s;
int poly_count = (PolynomOrder+1)*(PolynomOrder+2)/2;
vigra::Matrix<double> A(point_count,poly_count), b1(point_count,1), res1(poly_count,1), b2(point_count,1), res2(poly_count,1);
std::vector<double> weights;
for (int i =0; i<point_count; ++i, ++s, ++d)
{
weights = polynomialWarpWeights((*d)[0], (*d)[1], PolynomOrder);
for(int c=0; c<poly_count; c++)
{
A(i,c) = weights[c];
}
b1(i,0)=(*s)[0];b2(i,0)=(*s)[1];
}
if(!vigra::linearSolve( A, b1, res1 ) || !vigra::linearSolve( A, b2, res2 ))
vigra_fail("polynomialMatrix2DFromCorrespondingPoints(): singular solution matrix.");
vigra::Matrix<double> res(poly_count,2);
for(int c=0; c<poly_count; c++)
{
res(c,0) = res1(c,0);
res(c,1) = res2(c,0);
}
return res;
}
/********************************************************/
/* */
/* polynomialWarpImage */
/* */
/********************************************************/
/** \brief Warp an image according to an polynomial transformation.
To get more information about the structure of the matrix,
see \ref polynomialMatrix2DFromCorrespondingPoints().
<b>\#include</b> \<vigra/polynomial_registration.hxx\><br>
Namespace: vigra
pass 2D array views:
\code
namespace vigra {
template <int ORDER, class T,
class T2, class S2,
class C>
void
polynomialWarpImage(SplineImageView<ORDER, T> const & src,
MultiArrayView<2, T2, S2> dest,
MultiArrayView<2, double, C> const & polynomialMatrix);
}
\endcode
\deprecatedAPI{polynomialWarpImage}
pass arguments explicitly:
\code
namespace vigra {
template <int ORDER, class T,
class DestIterator, class DestAccessor,
class C>
void polynomialWarpImage(SplineImageView<ORDER, T> const & src,
DestIterator dul, DestIterator dlr, DestAccessor dest,
MultiArrayView<2, double, C> const & polynomialMatrix);
}
\endcode
use argument objects in conjunction with \ref ArgumentObjectFactories :
\code
namespace vigra {
template <int ORDER, class T,
class DestIterator, class DestAccessor,
class C>
void polynomialWarpImage(SplineImageView<ORDER, T> const & src,
triple<DestIterator, DestIterator, DestAccessor> dest,
MultiArrayView<2, double, C> const & polynomialMatrix);
}
\endcode
\deprecatedEnd
*/
doxygen_overloaded_function(template <...> void polynomialWarpImage)
template <int PolynomOrder,
int ORDER, class T,
class DestIterator, class DestAccessor,
class C>
void polynomialWarpImage(SplineImageView<ORDER, T> const & src,
DestIterator dul, DestIterator dlr, DestAccessor dest,
MultiArrayView<2, double, C> const & polynomialMatrix)
{
int poly_count = (PolynomOrder+1)*(PolynomOrder+2)/2;
vigra_precondition(rowCount(polynomialMatrix) == poly_count && columnCount(polynomialMatrix) == 2,
"polynomialWarpImage(): matrix doesn't represent a polynomial transformation of given degreee in 2D coordinates.");
double w = dlr.x - dul.x;
double h = dlr.y - dul.y;
std::vector<double> weights(poly_count);
for(double y = 0.0; y < h; ++y, ++dul.y)
{
typename DestIterator::row_iterator rd = dul.rowIterator();
for(double x=0.0; x < w; ++x, ++rd)
{
weights = polynomialWarpWeights(x,y, PolynomOrder);
double sx=0;
double sy=0;
for(int c=0; c<poly_count; c++)
{
sx += weights[c]*polynomialMatrix(c,0);
sy += weights[c]*polynomialMatrix(c,1);
}
if(src.isInside(sx, sy))
dest.set(src(sx, sy), rd);
}
}
}
template <int PolynomOrder,
int ORDER, class T,
class DestIterator, class DestAccessor,
class C>
inline
void polynomialWarpImage(SplineImageView<ORDER, T> const & src,
triple<DestIterator, DestIterator, DestAccessor> dest,
MultiArrayView<2, double, C> const & polynomialMatrix)
{
polynomialWarpImage<PolynomOrder>(src, dest.first, dest.second, dest.third, polynomialMatrix);
}
template <int PolynomOrder,
int ORDER, class T,
class T2, class S2,
class C>
inline
void polynomialWarpImage(SplineImageView<ORDER, T> const & src,
MultiArrayView<2, T2, S2> dest,
MultiArrayView<2, double, C> const & polynomialMatrix)
{
polynomialWarpImage<PolynomOrder>(src, destImageRange(dest), polynomialMatrix);
}
//@}
} // namespace vigra
#endif /* VIGRA_POLYNOMIAL_REGISTRATION_HXX */
|