# Developing image processing meta-algorithms with data mining of multiple metrics.

1. IntroductionEvery year many articles are published in the area of biomedical image registration that introduce new metrics for biomedical images, covering both distance/difference measures and similarity measures. There are many reasons for this interest in metrics. However, the abundance of methods creates a basic dilemma for practitioners seeking high-performance imaging systems: which metric should be used?

This paper reports on an effort spanning five years at UCLA, studying this question, and developing schemes that use multiple methods and multiple evaluation metrics to obtain better image processing results. In much the same way that ensemble methods yield better results in data mining, this effort explored software combinations of metrics that yielded improved methods for registration in neuroimaging.

In this paper we consider two families of image similarity metrics: intensity-based metrics (metrics of the intensity or luminosity values of voxels) and statistical metrics (metrics of their distributions). There are at least three reasons why use of multiple metrics can be important in image processing as follows.

(i) Metrics are performance measures, so awareness of them is a prerequisite for good performance. Although it is common to commit ab initio to a single registration algorithm and metric, algorithms and metrics differ significantly, and choices among them can have important consequences.

(ii) There are inherent limits to image processing performance. From this perspective, image processing methods are little more than optimizers that rest on assumptions about prior distributions of images and validation as experimental verification of these distributions. However, if metric values can be treated as samples of prior distributions on performance measures, we can mitigate some of these limits.

(iii) The key point of this paper is that the results of different image processing algorithms and parameter settings can be evaluated under multiple metrics, and the metric values can then be analyzed with data mining to identify the best results. The tracking of metric value results permits investigation of which image processing methods give better results for images from a given source. It also permits flexible on-demand analysis of arbitrary performance measures.

Every metric has strengths and weaknesses when applied to categories of image modalities. In fact, some metrics are designed for or biased towards specific categories and therefore cannot encompass some images in real-world applications; no algorithm can be better than the metric used to evaluate it. Equivalently, proper evaluation of the performance of an algorithm can require consideration of multiple metrics.

Having multiple metric values is also important for development of image meta-processing, processing that analyzes the results of diverse algorithms, parameter settings, and metrics. In this paper we consider the use of a meta-algorithm in image registration, but the approach can be applied with many image processing algorithms. Data mining methods permit identification of relationships across algorithms and metrics.

2. Image Metrics

If R and S are two images we wish to compare, we compute a measure D(R, S), where D is a measure of similarity that we refer to as a metric. Although there are many metrics [1-3], the similarity between images either is commonly defined as a function of the intensities (luminosities) or intensity distributions of corresponding voxels across images or is based on the morphology of the features present in both images.

Every year many articles are published in the area of medical image registration that introduce new metrics. In the ideal case this multitude of options could be condensed into a set of metrics that are effective, comprehensive, and compact. We have implemented an initial approximation of this ideal. The metrics we consider here can be broadly divided into intensity-based metrics, which rely solely on the intensities of voxels, and statistical metrics, which are based on distributions of these intensities. These are simple and there are many others, but our implementation is open and representative and can in principle accommodate any metric.

Table 2 lists a few basic metrics. A survey covering the derivation and use of entropy-related metrics is in [4], and the Correlation metric and Woods metrics are summarized in [5]. Throughout this list, N is the size of the images (total number of voxels), and x ranges over the set of image voxels.

Metrics often depend on the application itself and on the modalities of the input images. Both intensity- and morphology-based metrics have been largely employed in the implementation of registration algorithms to attend different needs including comparing images with different modalities.

The metrics in Table 2 illustrate how each metric has strengths and weaknesses when applied to categories of image modalities. Some metrics are designed for or biased towards specific categories and therefore cannot encompass all possible image types and qualities present in a given application. To permit comparison across metrics, we have forced all values to be scores in [0,1], with 1 being optimal.

Figure 1 shows all metric values for 186 variants of image E4863S4I produced by four registration tools.

3. Issues Raised by Use of Multiple Metrics

3.1. Metrics Measure Different Things and Can Be Inappropriate. There are many notions of similarity. This set of intensity-based and statistical metrics in Table 2 is not appropriate for some problems. For example, registration of images exhibiting neurodegeneration or brain trauma may yield counterintuitive results with these metrics and "better" metric values may not reflect more satisfactory alignment, since voxel-level measures may not capture global or semantic similarity. Metrics used should be suited to the problem.

Image metrics can involve image features (and therefore both feature detection and feature matching) as well as models (and therefore model estimation, image resampling, image transformation, and numerical optimization) [6]. Generally speaking, any aspect of image registration can be part of an image metric definition. These feature-based and model-based metrics can be compute-intensive, but the metrics in Table 2 do not impose heavy computational overhead.

3.2. Metrics Can Yield Inconsistent Results. Consistency among these metrics can be visualized with a parallel coordinates plot of the data (Figure 1) or a visual representation of the correlation matrix (Figure 2) and thus the metric value table can be approximated by few dimensions. In this case, the edi metric is least consistent with the others, and this is reflected by the second principal component. More experience with this consistency may make it possible to analyze performance across families of metrics or develop theories concerning convex combinations of selected metrics. However, for dimensionality reduction to work the set of metrics have to be basically consistent, in the sense that their results have to be positively correlated. For example, the Woods metric 5] is given by

woo(R, S) = 1 - [1/N] [summation over i] [N(i)[sigma](i)/[mu](i), (1)

where the index i ranges over intensity values, N(i) is the number of voxels in R having value i, and [mu] and [sigma] are the mean and standard deviation of intensities in S, in the same voxel positions. In our experience this metric has often been anticorrelated with the other metrics. Although often well-suited to medical image registration problems, its inconsistency implies that the Woods metric can often yield very different results than other metrics.

Since metrics can be computed automatically, evaluating a set of them gives us not only an inexpensive way of assessing multiple aspects of similarity but also a strategy for eliminating poor results and a basis for machine learning. Automation will never eliminate the need for expert opinion, but it can help eliminate distractions and improve productivity.

3.3. Metric Values Can Be Stored in a Database for Analysis. In the course of this development we have refined its implementation, in the choice of metrics, in recording of results (with a database), and in various performance enhancements for increasing parallelism and reducing file movement. Specifically, we used a database system to record all metric values obtained by each run and also metadata about program execution. This permits use of other data analysis tools for evaluating the resulting tables of metric values and execution information.

In our implementation, a backend PostgreSQL database is used to record all metric values for later analysis. Using a database to store this information provides three important benefits. First, it endows our meta-algorithm with the ACID properties (atomicity, consistency, isolation, and durability) provided by database systems. This is significant in a world in which tools crash or are unreliable as is unfortunately the case in neuroimaging. It might be possible to provide some of these properties in an ad hoc way, but there is little apparent gain in reimplementing these hard-won database features. Second, it allows our meta-algorithm to operate effectively in parallel computing environments. Using a database to log results independently is an elegant way to meet this need. Third, it allows ad hoc extraction and analysis of data from these executions. Although a given set of executions may not be that large (186 runs in our example), having a database makes this information much easier to work with.

Managing information about metric values in a database presents interesting possibilities for data mining. For example, one not only can determine which algorithms and parameter settings give better results for images from a given source, but also analyze execution times and even differences in performance by different versions of a given algorithm.

4. Developing Meta-Algorithms for Image Processing with Data Mining of Multiple Metrics

We show in this section how image processing methods can be extended by augmenting them with multiple metric computation coupled with data analysis methods from machine learning and data mining. As mentioned earlier, tracking metric value information (such as in a database) permits investigation of which algorithms and parameter settings give better results for images from a given source and permits analysis of execution times and even differences in performance by different versions of a given algorithm.

4.1. Evaluating Image Processing Methods with Multiple Metrics. Augmentation with metric evaluation is a natural evolutionary direction for image processing methods. Given a set of images S = {[S.sub.1], ..., [S.sub.n]} (produced possibly with different methods or parameter settings and possibly with different input images), we can evaluate the similarity of an image R with each [S.sub.i] [member of] S under a battery of metrics [D.sub.j] = 1, ..., p. The result of evaluation is then a n x p table M = ([m.sub.ij]), whose i jth entry is = [D.sub.j](R, [S.sub.i]). With the p = 11 metrics in Table 2, M is a n x 11 table of metric values.

Image processing methods can then be augmented with a final data analysis phase. This analysis can yield deeper understanding of method under the various metrics. As long as performance can be formalized in terms of metrics, we believe that this extension with learning and data mining methods can be important in improving any scientific computational method, because it can rise above assumptions about input data that are tacit in development.

4.2. Example Application: Image Registration. Essentially, image registration is the problem of aligning two images. Since this alignment generally requires measurement of image similarity and optimization of a transformation so as to maximize it, registration is a canonical image processing problem requiring the consideration of multiple metrics.

Let R and T be, respectively, the reference and template images we want to register. In image registration we typically look for a transformation f that minimizes D(R, f(T)), where D is a measure of distance between a pair of images. Thus, we want the transformed image f(T) to be as close as possible to the target image R. In general, if D(R, S) [equivalent] 0, then we say R and S are similar. We want the mapping f to be homeomorphic so that points close together in one image are mapped to points close together in the other image. Also in principle f should have a continuous inverse satisfying D([f.sup.-1](R), T) = D(R, f(T)), although in practice this requirement is weakened [6].

When assessing registration, it is natural to investigate how the edges from the template image are mapped to the corresponding edges in the reference image. In good registrations the mapped and reference edges are perfectly superimposed or very close in shape and space. The same applies to surfaces in three dimensions. This is the morphological view of registration.

Registration also can be approached from an information-theoretic point of view where image intensities are viewed as probability distributions. The analysis of similarity between distributions and intensities governs assessment of how well a registration algorithm performs. This perspective is natural for medical imaging; using a collection of metrics is useful for assessing the quality of registration methods, taking distributions and luminosities into account.

4.3. IRMA: An Image Registration Meta-Algorithm. IRMA is a meta-algorithm for image registration that was developed with the metrics above in mind [7]. As an individual module in distributions of the LONI Pipeline environment [8], it produced the results shown in Figure 1.

Figure 1 shows aggregate results of registering a brain image using several algorithms. The four algorithms here include two--Linear and Warp (nonlinear)--from the AIR registration package [5,9], FLIRT from Oxford's FSL package [10], and the Tracc program from McGill MNI's MINC package [11]. Many different method/parameter combinations are used, as shown in Table 1. These sets of parameters have been chosen based on experience with these algorithms. They produce 5 x 3 x 2 = 30 runs of AIR Linear, 3 x 30 = 90 runs of AIR Warp, 5 x 3 x 4 = 60 runs of FSL FLIRT, and 6 runs of MINC Tracc. Altogether these 186 registration runs required about 1.5 hours to complete on a lightly loaded grid.

The values of all metrics were computed for the result of each run, and the tabulated results are shown in Figure 1. Thus the plot highlights some interesting aspects of the relative performance of these methods. However, the values for each metric have been rescaled independently, so that the spread in metric values covers the entire vertical scale. Thus the plot highlights the relative ordering among metric values. Of course, little about the relative merit of the four algorithms can be determined from one registration problem.

Figure 1 shows metric values for the 186 registration results produced by IRMA for the image E4863S4I. They show dramatically that the four image registration algorithms considered are not robust, in the sense that small changes in their parameters can produce very different results. Experienced users are aware of this sensitivity to parameter values, and that good registration results can require effort to produce. Some of this sensitivity is due to the difficulty of formalizing registration as an optimization problem, given the facts that each of the many metrics is a possible objective function, and all algorithms make assumptions about the input data that might fail to hold.

Figure 4 presents actual images produced by IRMA for the image E4863S4I. These examples show that IRMA both can detect poor registration results and can be used to improve the robustness of registration for significant classes of input problems. Notice that in the cases shown the data is well-approximated by a one-dimensional projection; the data spreads out horizontally more than vertically. In the third and fourth row of the plots, the best results are outliers (relatively isolated points at the right) produced by AIR Warp; that is, for these images, the best results are significantly different from most results produced by other algorithms. Thus we see again that the algorithms are not robust: minor changes in parameters can produce not only much better results but also very different results.

IRMA demonstrates how dimensionality reduction methods can be used to mine tables of metric values. Specifically, IRMA uses robust PCA [12,13]--analyzing the principal components of Spearman rank correlation to extract latent ranking structure. As explained in Figure 1, differences in metric values are not necessarily as significant as the relative ordering among these values. Replacing the values in a dataset column by their relative ranking in that column removes scaling concerns and permits comparison of values across columns. Figures 1 and 3 show the result of making this nonparametric replacement. The clusters of results exhibit more structure, and the observations spread out more. In our experience this replacement can give useful perspective on the metric data. It also has the benefit that the covariance structure is identical to the correlation result, because the variance of each column is identical and known a priori.

Many dimensionality reduction methods are available--including alternative PCA methods and multidimensional scaling [13]. All these methods have potential applications with multiple metrics. Furthermore new meta-algorithm approaches could be developed using transformations of metric data.

If the performance of a given image processing method can be formalized in terms of the similarity metrics considered here, however, the multiple metric approach provides a more formal and more robust framework for validation. We can then extend the method to include a validation stage, which records computed metric values (e.g., in a database) and analyzes them (e.g., with PCA). Having multiple metrics as objectives formalizes them and avoids instabilities due to quirks of individual metrics.

By integrating data mining into our meta-algorithm we can increase sophistication of image processing algorithms. For example, IRMAs evaluation process can be extended to learn about the strengths and weaknesses of image processing methods and about the kinds of images encountered. IRMA also gains robustness from not relying on any single method or metric.

5. Conclusions

We have argued that many image processing methods can be beneficially extended to a meta-algorithm with standardized computation and data mining of multiple metric values. Although a metric can be any figure of merit, that is, useful in evaluating the performance of the method, we have considered the situation where each metric is an image similarity measure. In this approach, basic image processing algorithms are used to produce a collection of results (e.g., for a variety of alternative parameter settings); these results are evaluated with multiple metrics, and a data mining postprocessing phase is used to extract good results. The approach described here could lead to more formal and robust image processing methods that exploit machine learning, leading to better understanding of performance in many dimensions.

As a demonstration, in this paper we have described the IRMA image registration meta-algorithm. IRMA is a neuroimaging module in the LONI Pipeline workflow environment [14]. Image registration, the basic problem of aligning two images, rests fundamentally on the idea of a metric and immediately raises the issues discussed here about the choice of metrics. The ability to mine these data is consistent with learning methods and has compelling possibilities in fields like neuroimaging that involve many algorithms and diverse objectives. IRMA was developed with these possibilities in mind.

http://dx.doi.org/10.1155/2014/383465

Conflict of Interests

The authors declare that there is no conflict of interests.

Acknowledgments

The authors thank reviewers for their valuable comments. This work was supported by NIH Grant 1U54RR021813 (Center for Computational Biology).

References

[1] J. H. Hipwell, G. P. Penney, T. C. Cox, J. V. Byrne, and D. J. Hawkes, "2D-3D intensity based registration of DSA and MRA--a comparison of similarity measures," in Proceedings of the Medical Image Computing and Computer-Assisted Intervention (MICCAI '02), T. Dohi and R. Kikinis, Eds., vol. 2489 of Lecture Notes in Computer Science, pp. 501-508, 2002.

[2] G. P. Penney, J. Weese, J. A. Little, P. Desmedt, D. L. G. Hill, and D. J. Hawkes, "A comparison of similarity measures for use in 2-D-3-D medical image registration," IEEE Transactions on Medical Imaging, vol. 17, no. 4, pp. 586-595, 1998.

[3] A. Roche, G. Malandin, N. Ayache, and S. Prima, "Towards a better comprehension of similarity measures used in medical image registration," in Proceedings of the 2nd International Conference on Medical Image Computingand Computer-Assisted Intervention (MICCAI '99), vol. 1679 of Lecture Notes in Computer Science, pp. 555-566, Springer, 1999.

[4] J. P W. Pluim, J. B. A. A. Maintz, and M. A. Viergever, "Mutual-information-based registration of medical images: a survey," IEEE Transactions on Medical Imaging, vol. 22, no. 8, pp. 986-1004, 2003.

[5] R. P Woods, S. T. Grafton, C. J. Holmes, S. R. Cherry, and J. C. Mazziotta, "Automated image registration: I. General methods and intrasubject, intramodality validation," Journal of Computer Assisted Tomography, vol. 22, no. 1, pp. 139-152, 1998.

[6] B. Zitova and J. Flusser, "Image registration methods: a survey," Image and Vision Computing, vol. 21, no. 11, pp. 977-1000, 2003.

[7] K. Leung, D. S. Parker, A. Cunha, C. Hojatkashani, I. Dinov, and A. Toga, "IRMA: an image registration meta-algorithm evaluating alternative algorithms with multiple metrics," in Proceedings of the Scientific and Statistical Database Management Conference (SSDBM '08), Springer, 2008.

[8] I. D. Dinov, D. S. Parker, A. Payan et al., "Intelligent graphical work ow pipeline infrastructure for automated analysis of neuroimaging data," 2008.

[9] R. P. Woods, S. T. Grafton, J. D. G. Watson, N. L. Sicotte, and J. C. Mazziotta, "Automated image registration: II. Intersubject validation of linear and nonlinear models," Journal of Computer Assisted Tomography, vol. 22, no. 1, pp. 153-165, 1998.

[10] S. M. Smith, M. Jenkinson, M. W. Woolrich et al., "Advances in functional and structural MR image analysis and implementation as FSL," NeuroImage, vol. 23, no. 1, pp. S208-S219, 2004.

[11] D. L. Collins, P Neelin, T. M. Peters, and A. C. Evans, "Automatic 3D intersubject registration of MR volumetric data in standardized Talairach space," Journal of Computer Assisted Tomography, vol. 18, no. 2, pp. 192-205, 1994.

[12] P J. Huber, Robust Statistics, John Wiley & Sons, 2003.

[13] I. T. Jollie, Principal Components Analysis, Springer, 1986.

[14] I. D. Dinov, J. D. van Horn, K. Lozev et al., "Efficient, distributed and interactive neuroimaging data analysis using the LONI pipeline," Frontiers in Neuroinformatics, vol. 3, article 22, 2009.

Kelvin Leung, (1,2) Alexandre Cunha, (3) A. W. Toga, (4) and D. Stott Parker (3)

(1) Intel Corporation, 3600 Julliette Ln., Mail Stop SC12-301, Santa Clara, CA 95054, USA

(2) UCLA Computer Science Department, Los Angeles, CA 90095-1596, USA

(3) Caltech Center for Advanced Computing Research (CACR), Pasadena, CA 91125, USA

(4) USC Laboratory of Neuroimaging (LONI), Los Angeles, CA 90007, USA

Correspondence should be addressed to Kelvin Leung; kelvin.t.leung@intel.com

Received 7 May 2013; Revised 26 November 2013; Accepted 26 November 2013; Published 5 February 2014

Academic Editor: Facundo Ballester

TABLE 1: Parameter spaces of the four algorithms used in a representative configuration of IRMA, along with the resulting number of runs of each algorithm. Algorithm Options/parameters used Runs AIR warp Airwarp model [member of] {1,2,3} and 90 parameters for AIR linear AIR linear Blur [member of] {11,15,17,19,25}, 30 model [member of] {6,7,9}, cost [member of] {1,3} FSL FLIRT Interpolation e {trilinear, 60 nearestnbr, sinc}, dof [member of] {6,7,8,12}, cost [member of] {mutualinfo, corratio, normcorr, normmi, leastsq} MINC Tracc dof e {3,6,7,9,10,12} 6 TABLE 2: Some intensity-based and statistical image metrics. In the Difference metrics, the index a ranges over voxel positions. In the Correlation and Woods metrics, the index i ranges over intensity values, N(i) is the number of voxels in R having intensity i, and [mu](i) and [[sigma].sup.2](i) are the mean and variance of intensities of S in the same voxel positions. Normalized Cross- Correlation is voxel-wise correlation, with means and standard deviations computed over the entire image. (1) Mean Square Difference of Intensities msd(R, S) = [1/N][summation over x][(R(x) - S (x)).sup.2] (2) Absolute Difference of Intensities adi(R, S) = [1/N][summation over x][absolute value of (R(x) - S(x))] (3) Shannon Entropy of Difference of Intensities edi(R, S) = [1/N][summation over x]p(R(x) - S (x))logp (R(x) - S (x)) (4) Mutual Information mif(R, S) = I(R, S) = H(R) + H(S) - H(R, S) (5) Normalized Mutual Information nmi(R, S) = [I(R, S)/H(R, S)] + 1 = H(R) + H(S)/H(R, S) (6) Normalized Cross-Correlation ncc(R, S) = cov(R, S)/[[sigma].sub.R][[sigma].sub.S] (7) Correlation cor(R, S) = 1 - [1/N][summation over i]N(i)[[sigma].sup.2](i)/ [[sigma].sup.2] (8) Woods woo(R, S) = 1 - [1/N][summation over x][N(i)[sigma](i)/[mu](i]) (9) Redundancy [red(R, S) = I(R, S)/(H(R) + H(S))] = 1 - [H(R, S)/(H(R) + H(S)] (10) A Universal Metric uni(R, S) = 1 - [I(R, S)/H(R, S)] = 2 - [(H(R) + H(S))/(H(R, S)] (11) Another Universal Metric aum(R, S) = 1 - [I (R, S)/max(H(R), H(S))]

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Leung, Kelvin; Cunha, Alexandre; Toga, A.W.; Parker, D. Stott |

Publication: | Computational and Mathematical Methods in Medicine |

Article Type: | Report |

Geographic Code: | 1USA |

Date: | Jan 1, 2014 |

Words: | 4140 |

Previous Article: | Fully automated detection of corticospinal tract damage in chronic stroke patients. |

Next Article: | A pipeline for neuron reconstruction based on spatial sliding volume filter seeding. |

Topics: |