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
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkVnlFFTCommon_h
#define itkVnlFFTCommon_h
#include "itkIntTypes.h"
#include "vnl/algo/vnl_fft_base.h"
namespace itk
{
/** \class VnlFFTCommon
* \brief Common routines related to Vnl's FFT implementation.
*
* \ingroup ITKFFT
*/
struct VnlFFTCommon
{
/** Vnl's FFT supports discrete Fourier transforms for images whose
sizes have a prime factorization consisting of 2's, 3's, and 5's. */
template< typename TSizeValue >
static bool IsDimensionSizeLegal(TSizeValue n);
static ITK_CONSTEXPR_VAR SizeValueType GREATEST_PRIME_FACTOR = 5;
/** Convenience struct for computing the discrete Fourier
Transform. */
template< typename TImage >
struct VnlFFTTransform:
public vnl_fft_base< TImage::ImageDimension, typename TImage::PixelType >
{
typedef vnl_fft_base< TImage::ImageDimension, typename TImage::PixelType > Base;
//: constructor takes size of signal.
VnlFFTTransform(const typename TImage::SizeType & s);
};
};
} // namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkVnlFFTCommon.hxx"
#endif
#endif // itkVnlFFTCommon_h
|
