This file is indexed.

/usr/include/mia-2.2/mia/core/splineparzenmi.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
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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
/* -*- 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_core_splineparzenmi_hh
#define mia_core_splineparzenmi_hh

#include <boost/concept/requires.hpp>
#include <boost/concept_check.hpp>
#include <mia/core/splinekernel.hh>
#include <mia/core/histogram.hh>

NS_MIA_BEGIN

/**
   \ingroup registration
   \brief Implementation of mutual information based on B-splines 

This class implements a spline parzen windows based evaluation of the 
mutual information between two images and its gradient w.r.t. to one image. 

For details see 
 	P. Thévenaz, M. Unser, "Optimization of Mutual Information 
	for Multiresolution Image Registration," IEEE Tran on Img Proc, 
	vol. 9, no. 12, pp. 2083-2099, December 2000. 

*/
class EXPORT_CORE CSplineParzenMI {
public: 
	/**
	   Constructor of the mutual information class 
	   @param rbins number of bins in reference intensity range
	   @param rkernel B-spline kernel for filling and evaluating reference intensities 
	   @param mbins number of bins in moving intensity range
	   @param mkernel B-spline kernel for filling and evaluating moving intensities
	   @param cut_histogram the percentage of the histogram to clamp at the lower and upper 
	   end in order to eliminate outliers [0, 40] 
	*/
	CSplineParzenMI(size_t rbins, PSplineKernel rkernel,
			size_t mbins, PSplineKernel mkernel, double cut_histogram); 
	

	/**
	   Fill the histogram structures and caches
	   @tparam MovIterator forward iterator type for moving image 
	   @tparam RefIterator forward iterator type for reference image 
	   @param mov_begin begin of moving image range 
	   @param mov_end end of moving image range 
	   @param ref_begin begin of reference image range 
	   @param ref_end end of reference image range 
	 */

	template <typename MovIterator, typename RefIterator>
	BOOST_CONCEPT_REQUIRES( ((::boost::ForwardIterator<MovIterator>))
				((::boost::ForwardIterator<RefIterator>)),
				(void)
				)
		fill(MovIterator mov_begin, MovIterator mov_end, 
		     RefIterator ref_begin, RefIterator ref_end); 


	/**
	   Fill the histogram structures and caches by using a mask 
	   @tparam MovIterator forward iterator type for moving image 
	   @tparam RefIterator forward iterator type for reference image 
	   @param mov_begin begin of moving image range 
	   @param mov_end end of moving image range 
	   @param ref_begin begin of reference image range 
	   @param ref_end end of reference image range 
	   @param mask_begin begin of mask image range 
	   @param mask_end end of mask image range 
	   
	 */

	template <typename MovIterator, typename RefIterator, typename MaskIterator>
		void fill(MovIterator mov_begin, MovIterator mov_end, 
			  RefIterator ref_begin, RefIterator ref_end, 
			  MaskIterator mask_begin, MaskIterator mask_end);
	

	/**
	   @returns the value of the mutual information that is maximized if the 
	   given input images are equal. 
	 */
	double value() const; 

	/**
	   Evaluate the gradient of the MI with respect to a given intensity pair using 
	   an approximation  
	   @param moving intensity in the moving image 
	   @param reference intensity in the moving image 
	   @returns gradient 
	 */
	double get_gradient(double moving, double reference) const; 

	/**
	   Evaluate the gradient of the MI with respect to a given intensity pair 
	   @param moving intensity in the moving image 
	   @param reference intensity in the moving image 
	   @returns gradient 
	 */

	double get_gradient_slow(double moving, double reference) const; 
	/**
	   reset the ranges to force a new evaluation
	*/
	void reset(); 
protected: 
	/** these function is for test purpouses only */ 
	void fill_histograms(const std::vector<double>& values, 
				      double rmin, double rmax,
				      double mmin, double mmax); 
private: 
       
	double scale_moving(double x) const; 
	double scale_reference(double x) const; 

	void evaluate_histograms(); 	
	void evaluate_log_cache();  
        
        size_t m_ref_bins;
	PSplineKernel  m_ref_kernel; 
	size_t m_ref_border; 
	size_t m_ref_real_bins; 
        double m_ref_max;
	double m_ref_min;
        double m_ref_scale; 

	size_t m_mov_bins;
	
	PSplineKernel  m_mov_kernel; 
	size_t m_mov_border; 
	size_t m_mov_real_bins; 
        double m_mov_max;
	double m_mov_min;
        double m_mov_scale; 

		
	std::vector<double> m_joined_histogram; 
	std::vector<double> m_ref_histogram; 
	std::vector<double> m_mov_histogram; 

	std::vector<std::vector<double> > m_pdfLogCache; 
	double  m_cut_histogram; 
	
	template <typename Iterator>
	std::pair<double,double> get_reduced_range(Iterator begin, Iterator end)const; 

	template <typename DataIterator, typename MaskIterator>
        std::pair<double,double> 
		get_reduced_range_masked(DataIterator dbegin, 
					 DataIterator dend, 
					 MaskIterator mbegin)const; 
		
};   

template <typename MovIterator, typename RefIterator>
BOOST_CONCEPT_REQUIRES( ((::boost::ForwardIterator<MovIterator>))
			((::boost::ForwardIterator<RefIterator>)),
			(void)
			)
	CSplineParzenMI::fill(MovIterator mov_begin, MovIterator mov_end, 
				       RefIterator ref_begin, RefIterator ref_end)
{
	std::fill(m_joined_histogram.begin(), m_joined_histogram.end(), 0.0); 

	assert(mov_begin != mov_end); 
	assert(ref_begin != ref_end); 

	if (m_mov_max < m_mov_min) {
		// (re)evaluate the ranges 
		auto mov_range = get_reduced_range(mov_begin, mov_end); 
		if (mov_range.second  ==  mov_range.first) 
			throw std::invalid_argument("relevant moving image intensity range is zero"); 
		m_mov_min = mov_range.first; 
		m_mov_max = mov_range.second;
		m_mov_scale = (m_mov_bins - 1) / (m_mov_max - m_mov_min); 
		cvdebug() << "Mov Range = [" << m_mov_min << ", " << m_mov_max << "]\n"; 
	}


	if (m_ref_max < m_ref_min) {
		auto ref_range = get_reduced_range(ref_begin, ref_end); 
		if (ref_range.second  ==  ref_range.first) 
			throw std::invalid_argument("relevant reference image intensity range is zero"); 
		
		m_ref_min = ref_range.first; 
		m_ref_max = ref_range.second; 
		m_ref_scale = (m_ref_bins - 1) / (m_ref_max - m_ref_min); 
		cvdebug() << "Ref Range = [" << m_ref_min << ", " << m_ref_max << "]\n"; 
	}

       
	std::vector<double> mweights(m_mov_kernel->size()); 
        std::vector<double> rweights(m_ref_kernel->size()); 
	
	size_t N = 0;         
	while (ref_begin != ref_end && mov_begin != mov_end) {
                
		const double mov = scale_moving(*mov_begin); 
		const double ref = scale_reference(*ref_begin); 
		
		const int mov_start = m_mov_kernel->get_start_idx_and_value_weights(mov, mweights) + m_mov_border; 
                const int ref_start = m_ref_kernel->get_start_idx_and_value_weights(ref, rweights) + m_ref_border;  
		
                for (size_t r = 0; r < m_ref_kernel->size(); ++r) {
                        auto inbeg = m_joined_histogram.begin() + 
				m_mov_real_bins * (ref_start + r) + mov_start; 
			double rw = rweights[r]; 
                        std::transform(mweights.begin(), mweights.end(), inbeg, inbeg, 
				       [rw](double mw, double jhvalue){ return mw * rw + jhvalue;});
                }
		
                ++N; 
		++mov_begin; 
		++ref_begin; 
	}

	cvdebug() << "CSplineParzenMI::fill: counted " << N << " pixels\n"; 
	// normalize joined histogram 
	const double nscale = 1.0/N; 
	transform(m_joined_histogram.begin(), m_joined_histogram.end(), m_joined_histogram.begin(), 
		  [&nscale](double jhvalue){return jhvalue * nscale;}); 
	
	evaluate_histograms();  
	evaluate_log_cache(); 
}


template <typename MovIterator, typename RefIterator, typename MaskIterator>
void CSplineParzenMI::fill(MovIterator mov_begin, MovIterator mov_end, 
			   RefIterator ref_begin, RefIterator ref_end, 
			   MaskIterator mask_begin, MaskIterator mask_end)
{
	std::fill(m_joined_histogram.begin(), m_joined_histogram.end(), 0.0); 

	assert(mov_begin != mov_end); 
	assert(ref_begin != ref_end); 
	
	// no mask 
	if (mask_begin == mask_end) 
		fill(mov_begin, mov_end, ref_begin, ref_end); 
	
	if (m_mov_max < m_mov_min) {
		// (re)evaluate the ranges 
		
		auto mov_range = get_reduced_range_masked(mov_begin, mov_end, mask_begin); 
		if (mov_range.second  ==  mov_range.first) 
			throw std::invalid_argument("relevant moving image intensity range is zero"); 
		m_mov_min = mov_range.first; 
		m_mov_max = mov_range.second;
		m_mov_scale = (m_mov_bins - 1) / (m_mov_max - m_mov_min); 
		cvdebug() << "Mov Range = [" << m_mov_min << ", " << m_mov_max << "]\n"; 
	}


	if (m_ref_max < m_ref_min) {

		auto ref_range = get_reduced_range_masked(ref_begin, ref_end, mask_begin); 
		if (ref_range.second  ==  ref_range.first) 
			throw std::invalid_argument("relevant reference image intensity range is zero"); 
		
		m_ref_min = ref_range.first; 
		m_ref_max = ref_range.second; 
		m_ref_scale = (m_ref_bins - 1) / (m_ref_max - m_ref_min); 
		cvdebug() << "Ref Range = [" << m_ref_min << ", " << m_ref_max << "]\n"; 
	}

       
	std::vector<double> mweights(m_mov_kernel->size()); 
        std::vector<double> rweights(m_ref_kernel->size()); 
	
	size_t N = 0;         
	while (ref_begin != ref_end && mov_begin != mov_end) {

		if (*mask_begin) {
			const double mov = scale_moving(*mov_begin); 
			const double ref = scale_reference(*ref_begin); 
			
			const int mov_start = m_mov_kernel->get_start_idx_and_value_weights(mov, mweights) + m_mov_border; 
			const int ref_start = m_ref_kernel->get_start_idx_and_value_weights(ref, rweights) + m_ref_border;  
			
			for (size_t r = 0; r < m_ref_kernel->size(); ++r) {
				auto inbeg = m_joined_histogram.begin() + 
					m_mov_real_bins * (ref_start + r) + mov_start; 
				double rw = rweights[r]; 
				std::transform(mweights.begin(), mweights.end(), inbeg, inbeg, 
					       [rw](double mw, double jhvalue){ return mw * rw + jhvalue;});
			}
			
			++N; 
		}
		++mask_begin; 
		++mov_begin; 
		++ref_begin; 
	}

	cvdebug() << "CSplineParzenMI::fill: counted " << N << " pixels\n"; 
	// normalize joined histogram 
	const double nscale = 1.0/N; 
	transform(m_joined_histogram.begin(), m_joined_histogram.end(), m_joined_histogram.begin(), 
		  [&nscale](double jhvalue){return jhvalue * nscale;}); 
	
	evaluate_histograms();  
	evaluate_log_cache(); 
}

template <typename Iterator>
std::pair<double,double> CSplineParzenMI::get_reduced_range(Iterator begin, Iterator end)const
{
        auto range = std::minmax_element(begin, end); 	
	typedef THistogramFeeder<typename Iterator::value_type> Feeder; 
	THistogram<Feeder> h(Feeder(*range.first, *range.second, 4096));
	h.push_range(begin, end); 
	auto reduced_range = h.get_reduced_range(m_cut_histogram); 
	cvinfo() << "CSplineParzenMI: reduce range by "<< m_cut_histogram
		<<"% from [" << *range.first << ", " << *range.second 
		<< "] to [" << reduced_range.first << ", " << reduced_range.second << "]\n"; 
	return std::make_pair(reduced_range.first, reduced_range.second); 
       
}

template <typename DataIterator, typename MaskIterator>
std::pair<double,double> 
CSplineParzenMI::get_reduced_range_masked(DataIterator dbegin, 
					  DataIterator dend, 
					  MaskIterator mbegin)const
{
	auto ib = dbegin; 
	auto im = mbegin; 
	
	while (! *im++ && ib != dend) 
		++ib; 
	
	if (ib == dend) 
		throw std::runtime_error("CSplineParzenMI: empty mask"); 
	
	double range_max = *ib; 
	double range_min = *ib; 
	++ib; ++im; 
	
	while (ib != dend)  {
		if (*im) {
			if (*ib < range_min) 
				range_min = *ib; 
			if (*ib > range_max) 
				range_max = *ib; 
		}
		++ib; 
		++im; 
	}
	
	
	typedef THistogramFeeder<typename DataIterator::value_type> Feeder; 
	THistogram<Feeder> h(Feeder(range_min, range_max, 4096));

	ib = dbegin; 
	im = mbegin; 
	while (ib != dend)  {
		if (*im)
			h.push(*ib); 
		++ib; 
		++im; 
	}

	auto reduced_range = h.get_reduced_range(m_cut_histogram); 
	cvinfo() << "CSplineParzenMI: reduce range by "<< m_cut_histogram
		 << "% from [" << range_min << ", " << range_max
		 << "] to [" << reduced_range.first << ", " << reduced_range.second << "]\n"; 
	return std::make_pair(reduced_range.first, reduced_range.second); 
       
}

NS_MIA_END
#endif