iRoCS Toolbox  1.1.0
HoughTransform.hh
Go to the documentation of this file.
1 /**************************************************************************
2  *
3  * Copyright (C) 2015 Thorsten Falk
4  *
5  * Image Analysis Lab, University of Freiburg, Germany
6  *
7  * This program is free software; you can redistribute it and/or modify
8  * it under the terms of the GNU General Public License as published by
9  * the Free Software Foundation; either version 3 of the License, or
10  * (at your option) any later version.
11  *
12  * This program is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15  * GNU General Public License for more details.
16  *
17  * You should have received a copy of the GNU General Public License
18  * along with this program; if not, write to the Free Software Foundation,
19  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  *
21  **************************************************************************/
22 
23 #ifndef ATBHOUGHTRANSFORM_HH
24 #define ATBHOUGHTRANSFORM_HH
25 
26 #ifdef HAVE_CONFIG_H
27 #include <config.hh>
28 #endif
29 
30 #include <vector>
31 #include <map>
32 
33 #include <blitz/array.h>
34 
35 #include "Array.hh"
36 #include "ATBDataSynthesis.hh"
37 #include "CentralGradientFilter.hh"
38 #include "GaussianFilter.hh"
40 
42 
43 namespace atb
44 {
45 
46 /*======================================================================*/
69 /*======================================================================*/
70  template<typename DataT>
72  const blitz::Array<DataT,3>& data,
73  std::vector< blitz::Array<double,3>* >& houghmaps,
74  std::vector< blitz::Array<double,3>* >& houghmapsR,
75  const double rMin, const double rMax,
76  const double rStep, const double preSmoothing,
77  const double postSmoothing, const double minMagnitude);
78 
79 /*======================================================================*/
102 /*======================================================================*/
103  template<typename DataT>
105  const Array<DataT,3>& data,
106  std::vector< Array<double,3>* >& houghmaps,
107  std::vector< Array<double,3>* >& houghmapsR,
108  const double rMin, const double rMax,
109  const double rStep, const double preSmoothing,
110  const double postSmoothing, const double minMagnitude);
111 
112 /*======================================================================*/
144 /*======================================================================*/
145  template<typename DataT>
147  const Array<DataT,3>& data,
148  std::map< int,Array<double,3> > &houghFeatures,
149  const double rMin, const double rMax,
150  const double rStep, const double preSmoothing,
151  const double postSmoothing, const double minMagnitude);
152 
153 /*======================================================================*/
169 /*======================================================================*/
170  void houghTransform(
171  Array<float,3> const &data, Array<float,3> &response,
172  Array<float,3> &radiusUm,
173  blitz::TinyVector<double,2> const &radiusRangeUm, double radiusStepUm,
174  double minMagnitude = 0.0, bool invertGradients = false,
175  iRoCS::ProgressReporter *pr = NULL);
176 
177 }
178 
179 #include "HoughTransform.icc"
180 
181 #endif
Array class derived from blitz++ Arrays for handling microscopic datasets with associated element siz...
The Implementation of the filter computing the gradient of the input data using central differences...
Classes and functions for n-D separable convolution.
The Implementation of the convolution of the input data with a Gaussian.
void computeHoughTransform(const blitz::Array< DataT, 3 > &data, std::vector< blitz::Array< double, 3 > * > &houghmaps, std::vector< blitz::Array< double, 3 > * > &houghmapsR, const double rMin, const double rMax, const double rStep, const double preSmoothing, const double postSmoothing, const double minMagnitude)
Fast implementation of the spherical hough transform for non-overlapping spheres. ...
void houghTransform(Array< float, 3 > const &data, Array< float, 3 > &response, Array< float, 3 > &radiusUm, blitz::TinyVector< double, 2 > const &radiusRangeUm, double radiusStepUm, double minMagnitude=0.0, bool invertGradients=false, iRoCS::ProgressReporter *pr=NULL)
Compute spherical hough transform using Gradient voting.