1 /*=========================================================================
2 Program: vv http://www.creatis.insa-lyon.fr/rio/vv
5 - University of LYON http://www.universite-lyon.fr/
6 - Léon Bérard cancer center http://www.centreleonberard.fr
7 - CREATIS CNRS laboratory http://www.creatis.insa-lyon.fr
9 This software is distributed WITHOUT ANY WARRANTY; without even
10 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
11 PURPOSE. See the copyright notices for more information.
13 It is distributed under dual licence
15 - BSD See included LICENSE.txt file
16 - CeCILL-B http://www.cecill.info/licences/Licence_CeCILL-B_V1-en.html
17 ===========================================================================**/
18 #ifndef _clitkVectorBSplineDecompositionImageFilter_txx
19 #define _clitkVectorBSplineDecompositionImageFilter_txx
20 #include "clitkVectorBSplineDecompositionImageFilter.h"
21 #include "itkImageRegionConstIteratorWithIndex.h"
22 #include "itkImageRegionIterator.h"
23 #include "itkProgressReporter.h"
24 #include "itkVector.h"
32 template <class TInputImage, class TOutputImage>
33 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
34 ::VectorBSplineDecompositionImageFilter()
38 m_Tolerance = 1e-10; // Need some guidance on this one...what is reasonable?
39 m_IteratorDirection = 0;
40 this->SetSplineOrder(SplineOrder);
45 * Standard "PrintSelf" method
47 template <class TInputImage, class TOutputImage>
49 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
52 itk::Indent indent) const
54 Superclass::PrintSelf( os, indent );
55 os << indent << "Spline Order: " << m_SplineOrder << std::endl;
60 template <class TInputImage, class TOutputImage>
62 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
63 ::DataToCoefficients1D()
66 // See Unser, 1993, Part II, Equation 2.5,
67 // or Unser, 1999, Box 2. for an explaination.
71 if (m_DataLength[m_IteratorDirection] == 1) { //Required by mirror boundaries
75 // Compute overall gain
76 for (int k = 0; k < m_NumberOfPoles; k++) {
77 // Note for cubic splines lambda = 6
78 c0 = c0 * (1.0 - m_SplinePoles[k]) * (1.0 - 1.0 / m_SplinePoles[k]);
82 for (unsigned int n = 0; n < m_DataLength[m_IteratorDirection]; n++) {
86 // loop over all poles
87 for (int k = 0; k < m_NumberOfPoles; k++) {
88 // causal initialization
89 this->SetInitialCausalCoefficient(m_SplinePoles[k]);
91 for (unsigned int n = 1; n < m_DataLength[m_IteratorDirection]; n++) {
92 m_Scratch[n] += m_SplinePoles[k] * m_Scratch[n - 1];
95 // anticausal initialization
96 this->SetInitialAntiCausalCoefficient(m_SplinePoles[k]);
97 // anticausal recursion
98 for ( int n = m_DataLength[m_IteratorDirection] - 2; 0 <= n; n--) {
99 m_Scratch[n] = m_SplinePoles[k] * (m_Scratch[n + 1] - m_Scratch[n]);
107 template <class TInputImage, class TOutputImage>
109 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
110 ::SetSplineOrder(unsigned int SplineOrder)
112 if (SplineOrder == m_SplineOrder) {
115 m_SplineOrder = SplineOrder;
122 template <class TInputImage, class TOutputImage>
124 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
127 /* See Unser, 1997. Part II, Table I for Pole values */
128 // See also, Handbook of Medical Imaging, Processing and Analysis, Ed. Isaac N. Bankman,
130 switch (m_SplineOrder) {
133 m_SplinePoles[0] = vcl_sqrt(3.0) - 2.0;
143 m_SplinePoles[0] = vcl_sqrt(8.0) - 3.0;
147 m_SplinePoles[0] = vcl_sqrt(664.0 - vcl_sqrt(438976.0)) + vcl_sqrt(304.0) - 19.0;
148 m_SplinePoles[1] = vcl_sqrt(664.0 + vcl_sqrt(438976.0)) - vcl_sqrt(304.0) - 19.0;
152 m_SplinePoles[0] = vcl_sqrt(135.0 / 2.0 - vcl_sqrt(17745.0 / 4.0)) + vcl_sqrt(105.0 / 4.0)
154 m_SplinePoles[1] = vcl_sqrt(135.0 / 2.0 + vcl_sqrt(17745.0 / 4.0)) - vcl_sqrt(105.0 / 4.0)
158 // SplineOrder not implemented yet.
159 itk::ExceptionObject err(__FILE__, __LINE__);
160 err.SetLocation( ITK_LOCATION);
161 err.SetDescription( "SplineOrder must be between 0 and 5. Requested spline order has not been implemented yet." );
168 template <class TInputImage, class TOutputImage>
170 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
171 ::SetInitialCausalCoefficient(double z)
173 /* begining InitialCausalCoefficient */
174 /* See Unser, 1999, Box 2 for explaination */
176 itk::Vector<double, VectorDimension> sum;
177 double zn, z2n, iz; //sum
178 unsigned long horizon;
180 /* this initialization corresponds to mirror boundaries */
181 horizon = m_DataLength[m_IteratorDirection];
183 if (m_Tolerance > 0.0) {
184 horizon = (long)vcl_ceil(log(m_Tolerance) / vcl_log(fabs(z)));
186 if (horizon < m_DataLength[m_IteratorDirection]) {
187 /* accelerated loop */
188 sum = m_Scratch[0]; // verify this
189 for (unsigned int n = 1; n < horizon; n++) {
190 sum += zn * m_Scratch[n];
197 z2n = vcl_pow(z, (double)(m_DataLength[m_IteratorDirection] - 1L));
198 sum = m_Scratch[0] + z2n * m_Scratch[m_DataLength[m_IteratorDirection] - 1L];
200 for (unsigned int n = 1; n <= (m_DataLength[m_IteratorDirection] - 2); n++) {
201 sum += (zn + z2n) * m_Scratch[n];
205 m_Scratch[0] = sum / (1.0 - zn * zn);
210 template <class TInputImage, class TOutputImage>
212 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
213 ::SetInitialAntiCausalCoefficient(double z)
215 // this initialization corresponds to mirror boundaries
216 /* See Unser, 1999, Box 2 for explaination */
217 // Also see erratum at http://bigwww.epfl.ch/publications/unser9902.html
218 m_Scratch[m_DataLength[m_IteratorDirection] - 1] =
219 (z / (z * z - 1.0)) *
220 (z * m_Scratch[m_DataLength[m_IteratorDirection] - 2] + m_Scratch[m_DataLength[m_IteratorDirection] - 1]);
224 template <class TInputImage, class TOutputImage>
226 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
227 ::DataToCoefficientsND()
229 OutputImagePointer output = this->GetOutput();
231 itk::Size<ImageDimension> size = output->GetBufferedRegion().GetSize();
233 unsigned int count = output->GetBufferedRegion().GetNumberOfPixels() / size[0] * ImageDimension;
235 itk::ProgressReporter progress(this, 0, count, 10);
237 // Initialize coeffient array
238 this->CopyImageToImage(); // Coefficients are initialized to the input data
240 for (unsigned int n=0; n < ImageDimension; n++) {
241 m_IteratorDirection = n;
242 // Loop through each dimension
244 // Initialize iterators
245 OutputLinearIterator CIterator( output, output->GetBufferedRegion() );
246 CIterator.SetDirection( m_IteratorDirection );
247 // For each data vector
248 while ( !CIterator.IsAtEnd() ) {
249 // Copy coefficients to scratch
250 this->CopyCoefficientsToScratch( CIterator );
253 // Perform 1D BSpline calculations
254 this->DataToCoefficients1D();
256 // Copy scratch back to coefficients.
257 // Brings us back to the end of the line we were working on.
258 CIterator.GoToBeginOfLine();
259 this->CopyScratchToCoefficients( CIterator ); // m_Scratch = m_Image;
260 CIterator.NextLine();
261 progress.CompletedPixel();
268 * Copy the input image into the output image
270 template <class TInputImage, class TOutputImage>
272 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
276 typedef itk::ImageRegionConstIteratorWithIndex< TInputImage > InputIterator;
277 typedef itk::ImageRegionIterator< TOutputImage > OutputIterator;
278 typedef typename TOutputImage::PixelType OutputPixelType;
280 InputIterator inIt( this->GetInput(), this->GetInput()->GetBufferedRegion() );
281 OutputIterator outIt( this->GetOutput(), this->GetOutput()->GetBufferedRegion() );
284 outIt = outIt.Begin();
286 while ( !outIt.IsAtEnd() ) {
287 for (unsigned int i=0; i< VectorDimension; i++) {
288 v[i]= static_cast<typename OutputPixelType::ComponentType>( inIt.Get()[i] );
299 * Copy the scratch to one line of the output image
301 template <class TInputImage, class TOutputImage>
303 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
304 ::CopyScratchToCoefficients(OutputLinearIterator & Iter)
306 typedef typename TOutputImage::PixelType OutputPixelType;
309 while ( !Iter.IsAtEndOfLine() ) {
310 for(unsigned int i=0; i<VectorDimension; i++) v[i]=static_cast<typename OutputPixelType::ComponentType>( m_Scratch[j][i]);
320 * Copy one line of the output image to the scratch
322 template <class TInputImage, class TOutputImage>
324 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
325 ::CopyCoefficientsToScratch(OutputLinearIterator & Iter)
328 itk::Vector<double, VectorDimension> v;
329 while ( !Iter.IsAtEndOfLine() ) {
330 for(unsigned int i=0; i<VectorDimension; i++)v[i]=static_cast<double>( Iter.Get()[i] );
339 * GenerateInputRequestedRegion method.
341 template <class TInputImage, class TOutputImage>
343 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
344 ::GenerateInputRequestedRegion()
346 // this filter requires the all of the input image to be in
348 InputImagePointer inputPtr = const_cast< TInputImage * > ( this->GetInput() );
350 inputPtr->SetRequestedRegionToLargestPossibleRegion();
356 * EnlargeOutputRequestedRegion method.
358 template <class TInputImage, class TOutputImage>
360 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
361 ::EnlargeOutputRequestedRegion( itk::DataObject *output )
364 // this filter requires the all of the output image to be in
366 TOutputImage *imgData;
367 imgData = dynamic_cast<TOutputImage*>( output );
369 imgData->SetRequestedRegionToLargestPossibleRegion();
377 template <class TInputImage, class TOutputImage>
379 VectorBSplineDecompositionImageFilter<TInputImage, TOutputImage>
382 DD("VectorBSplineDecompositionImageFilter GenerateData()");
383 // Allocate scratch memory
384 InputImageConstPointer inputPtr = this->GetInput();
385 m_DataLength = inputPtr->GetBufferedRegion().GetSize();
387 unsigned long maxLength = 0;
388 for ( unsigned int n = 0; n < ImageDimension; n++ ) {
389 if ( m_DataLength[n] > maxLength ) {
390 maxLength = m_DataLength[n];
393 m_Scratch.resize( maxLength );
395 // Allocate memory for output image
396 OutputImagePointer outputPtr = this->GetOutput();
397 outputPtr->SetBufferedRegion( outputPtr->GetRequestedRegion() );
398 outputPtr->Allocate();
400 // Calculate actual output
401 this->DataToCoefficientsND();