/usr/include/mia-2.2/mia/2d/sparse_image_solver.hh is in libmia-2.2-dev 2.2.2-1+b1.
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 | /* -*- mia-c++ -*-
*
* This file is part of MIA - a toolbox for medical image analysis
* Copyright (c) Leipzig, Madrid 1999-2014 Gert Wollny
*
* MIA is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with MIA; if not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef mia_2d_sparse_image_solver_hh
#define mia_2d_sparse_image_solver_hh
#include <mia/core/factory.hh>
#include <mia/core/sparse_solver.hh>
#include <mia/2d/image.hh>
NS_MIA_BEGIN
/// base type for the sparse solvers for 2D images
typedef TSparseSolver<C2DFImage> C2DImageSparseSolver;
/// pointer type for the sparse solvers for 2D images
typedef std::shared_ptr<C2DImageSparseSolver > P2DImageSparseSolver;
/// Plugin handler for sparse image solver plug-ins
typedef THandlerSingleton<TFactoryPluginHandler<TFactory<C2DImageSparseSolver> > > C2DImageSparseSolverPluginHandler;
/// base class for the Matrix-Vector multiplication
typedef C2DImageSparseSolver::A_mult_x C2DImageSolverAmultx;
/// pointer type for the Matrix-Vector multiplication
typedef std::shared_ptr<C2DImageSolverAmultx> P2DImageSolverAmultx;
/// plug-in base for the Matrix-Vector multiplication
typedef TFactory<C2DImageSolverAmultx> C2DImageSolverAmultxPlugin;
/// plug-in handler for the Matrix-Vector multiplication
typedef THandlerSingleton<TFactoryPluginHandler<C2DImageSolverAmultxPlugin> > C2DImageSolverAmultxPluginHandler;
/**
\ingroup traits
Specialize the implementation of multiplying a Matrix with an Image,
\param A the matrix
\param x the input image
\returns A * x, (works like a matrix filter)
\remark maybethis should go into the filter section
*/
template <typename T>
struct multiply<T2DImage<T> > {
/**
The function to apply the multiplication
\param[out] result location to store the result, ususally it should be allocated and of the same size like x
\param[in] A sparse Matrix
\param[in] x the filed to multiply with the matrix
*/
static void apply(T2DImage<T>& result, const typename TSparseSolver<T2DImage<T> >::A_mult_x& A, const T2DImage<T>& x);
};
template <typename T>
void multiply<T2DImage<T> >::apply(T2DImage<T>& result, const typename TSparseSolver<T2DImage<T> >::A_mult_x& A, const T2DImage<T>& X)
{
assert(result.get_size() == X.get_size());
assert(result.get_size() == A.get_size());
long b = A.get_boundary_size();
long nx = X.get_size().x - 2 * b;
long ny = X.get_size().y - 2 * b;
copy(X.begin(), X.begin() + b * X.get_size().x + b, result.begin());
auto ir = result.begin() + b * X.get_size().x + b;
auto ix = X.begin() + b * X.get_size().x + b;
for (int y = 0; y < ny; ++y) {
int x = 0;
for (; x < nx; ++x, ++ix, ++ir)
*ir = static_cast<T>(A(ix));
for (; x < (int)X.get_size().x; ++x, ++ix, ++ir)
*ir = *ix;
}
copy(ix, X.end(), ir);
}
/// @cond NEVER
FACTORY_TRAIT(C2DImageSparseSolverPluginHandler);
FACTORY_TRAIT(C2DImageSolverAmultxPluginHandler);
/// @endcond
NS_MIA_END
#endif
|