Mathematical Problems in Engineering

Volume 2013, Article ID 960421, 17 pages

http://dx.doi.org/10.1155/2013/960421

## Bayesian Estimation Applied to Stochastic Localization with Constraints due to Interfaces and Boundaries

^{1}Department of Radiation Oncology, Regensburg University Medical Center, Franz-Josef-Strauss-Allee 11, 93053 Regensburg, Germany^{2}Department of Computer Science and Mathematics, University of Applied Sciences, Universitaetsstraße 31, 93053 Regensburg, Germany^{3}Department of Radiation Oncology, Brigham and Women’s Hospital and Harvard Medical School, 75 Francis Street, Boston, MA 02115, USA

Received 21 December 2012; Accepted 13 March 2013

Academic Editor: Marcelo Moreira Cavalcanti

Copyright © 2013 Wolfgang Hoegele et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

*Purpose*. We present a systematic Bayesian formulation of the stochastic localization/triangulation problem close to constraining interfaces. *Methods*. For this purpose, the terminology of Bayesian estimation is summarized suitably for applied researchers including the presentation of Maximum Likelihood (ML), Maximum A Posteriori (MAP), and Minimum Mean Square Error (MMSE) estimation. Explicit estimators for triangulation are presented for the linear 2D parallel beam and the nonlinear 3D cone beam model. The priors in MAP and MMSE optionally incorporate (A) the hard constraints about the interface and (B) knowledge about the probability of the object with respect to the interface. All presented estimators are compared in several simulation studies for live acquisition scenarios with 10,000 samples each.
*Results*. First, the presented application shows that MAP and MMSE perform considerably better, leading to lower Root Mean Square Errors (RMSEs) in the simulation studies compared to the ML approach by typically introducing a bias. Second, utilizing priors including (A) and (B) is very beneficial compared to just including (A). Third, typically MMSE leads to better results than MAP, by the cost of significantly higher computational effort. *Conclusion*. Depending on the specific application and prior knowledge, MAP and MMSE estimators strongly increase the estimation accuracy for localization close to interfaces.

#### 1. Introduction

Due to their inherent ability to use prior knowledge, Bayesian approaches have gained interest in many fields in the recent years, such as in computer vision [1, 2] and medical applications [3–6], as well as robotics (Kalman-Filter, Particle-Filter) [7, 8] and metrology [9]. In this work, we present a Bayesian framework for the localization of objects with constraints derived from interfaces (surfaces) or boundaries specific to a given localization problem.

Methods to find the locations of objects based on several projections are known from photogrammetry for a long time. These methods are also called triangulation in a multiple view geometry (e.g., see Hartley and Zisserman [1] for an overview of established methods). Introducing probabilities in order to deal with the Gaussian measurement noise is a well-known approach for estimating a 3-dimensional (3D) point based on two 2-dimensional (2D) projections, for example, see Hartley and Sturm [10]. In this context, Bedekar and Haralick [11] provided a Maximum A Posteriori (MAP) estimator by introducing prior knowledge independent of the observation for the estimation based on a set of 2D projections, which represents a starting point for this Paper but does not provide a more general perspective on estimation which is required to bring it to the level described in this paper. We are following this probabilistic interpretation of the inverse problem of triangulation and present explicit solutions in order to characterize the triangulation problem as well as embed it into the general framework of Bayesian estimation. In particular, we demonstrate the benefit of including soft and hard constraints about the solution space into the *prior* of the Bayesian triangulation problem. We compare three stochastic estimation methods: Maximum Likelihood (ML), Maximum A Posteriori (MAP), and Minimum Mean Square Error (MMSE), and show that, depending on the prior knowledge, MAP or MMSE is a suitable approach for this kind of problem. We show how the estimation methods can be utilized for a 3D nonlinear/non-Gaussian geometrical model in physical space without modifications or approximations of the observation geometry.

In the localization problem the input data consists of 2D projections (or images) of the 3D objects and the goal is the optimal localization of features contained in these objects, by employing prior knowledge. In general, projections of 3D objects onto 2D planes contain information about their coordinates, but due to the experimental conditions these coordinates may not be accurate or may not be easily extractable from these projections. Thus the localization problem is typically an ill-posed inverse problem. Fortunately, in many applications there exists prior knowledge about the probability densities of these uncertainties. Furthermore, if there is a general probabilistic knowledge about the position of the observed object or additional constraints about the domain of its coordinates, the total prior knowledge becomes difficult to be incorporated into the localization model. Such localizations close to a constraining interface or boundary can be modeled and solved in the Bayesian approach. For instance, in the field of medicine, during image-guided procedures (interventional radiology, radiotherapy, and surgical procedures with C-arm CBXT scanners) there is often a need to obtain 3D coordinates of anatomical features or implanted markers instantly from multiple X-ray projections, which are constrained by external or internal anatomical interfaces (e.g., patient surface) and form a hard or semi-flexible barrier. Both, the general Bayesian framework and its application to a specific localization problem presented herein can also be utilized for other applications in image or data processing, such as computer vision or metrology.

The general aim of this paper is to provide a pragmatic foundation for the Bayesian estimation in a compact way suitable for applied sciences utilizing a concise and uniform mathematical notation (general parts about the Bayesian methodology of this paper are partly taken from the doctoral thesis of the first author, which is submitted (and not yet published) at the Regensburg University, Germany, at the time of this paper submission), which is difficult to find in more theoretical formulations and whose full understanding is required for the localization problem at stake. This brief introduction to Bayesian estimation may benefit several research fields in which there is a gap between the general mathematical concepts and direct applications of Bayesian methods. Thus the major motivation of presenting the Bayesian estimation theory is the linking of these two areas by providing the Bayesian formalism for researches in applied sciences. The second aim of this work is to demonstrate that a Bayesian framework can be effectively utilized for more accurate localization of features close to interfaces, which may have many applications.

The structure of the paper is as follows: first, we present the basic terminology of Bayesian estimation required to derive the solutions presented in the subsequent sections based on a concise summary of the books of Lehmann and Casella [12] and Robert [13]. Second, we specifically present the application of stochastic localization applied to 1D and 2D projections of 2D and 3D objects. Besides such a structured presentation of Bayesian triangulation, the hope is that this course of explanation will help the readers to develop their own Bayesian estimators for their specific problems at hand.

#### 2. General Bayesian Theory

##### 2.1. Introduction to the Terminology of Estimation

The goal of estimation theory is to determine a concrete set of unknown real-valued parameters (e.g., the 2D/3D position coordinates of the observed object in triangulation) from real-valued observations (e.g., the detected or measured 1D/2D projections of the object), which are imperfectly or ambiguously related to each other (bold fonts of symbols are utilized to emphasize multidimensional vectors). Their ambiguous relation is due to the experimental uncertainties of the given problem, such as an imperfect Radon transform, or similar transforms. The estimation of parameters from observables demands a set of definitions which will be briefly introduced in this section. The concrete parameters and observations are associated with *continuous random variables * and , respectively (denoted by corresponding capital letters), which are further associated with the underlying probability distributions describing the sources of uncertainties. With this concept a connection between the deterministic and probabilistic quantities is established. For instance, the probability that takes a value lower than is defined by
with the corresponding Probability Density Function (PDF) . This fact is summarized by stating that .

In general, the occurrence of one event can influence the probability of another. It is possible to define such a residual probability by conditional probabilities, and for the corresponding PDF describing the random variable under the condition of this is formulated by In this formula, the expression describes the joint PDF of and . Based on this concept, the most important quantities for estimation are defined in the next subsections.

###### 2.1.1. Likelihood, Prior, and Posterior

In Table 1 the most important types of PDFs for estimation are presented and interpreted in the following paragraphs. The PDF defines the probability of the current observations if the true values are known. In a typical observation scenario this corresponds to the accuracy of the observation device with respect to a specific true parameter . It is common to define the likelihood function describing the same probabilities of the observation but this time with the focus on the conditioning parameter . Therefore the likelihood is regarded as a *similarity measure* between the current observation and possibly “true” parameters .

The PDF of the *prior * defines how probable the occurrence of is; that is, . The use of the *prior* is an intensely discussed topic, since one could derive arbitrary conclusions by utilizing a specific and strong prior knowledge which supports a certain point of view which may be just one of many possible options. Although this is generally valid, the utilization of appropriate prior knowledge (noninformative priors, priors based on actual observations of the same or similar situations, or priors derived from knowledge about the range of ) can reduce the uncertainties inherent to in addition to making observations .

In *Bayesian* statistics the most important PDF is the *posterior *, which defines the probabilities of under the condition of the observation . Similar to the *likelihood* this quantity is also often regarded as a *similarity measure* between the observation and .

The aforementioned PDFs are related to each other by * Bayes’ Theorem*, which is expressed as
The benefit of this theorem is that it allows to reverse the condition by introducing prior knowledge about the parameter of interest. In practical use, with this theorem the *posterior * can be determined by having only knowledge about the *likelihood * and the *prior *, since the denominator on the right side is typically determined indirectly by normalizing the posterior to the integral value of 1.

###### 2.1.2. Loss and Risk

An *estimator* is any function , which utilizes the current observations in order to find an approximation to the true parameter . In order to decide on the use of an estimator compared to another, one needs a quality criterion, which depends on the true value for the parameters and an estimate based on the observation . In estimation theory this is realized with the concept of the * loss function *. An important subset is *strictly convex loss functions*, such as the popular * quadratic loss*,
since they lead to unique Bayesian estimators. An example for a *not strictly* but still convex loss is the * constant loss*
for a constant , which is of technical interest for the derivation of the MAP estimator. In this context, a very attractive thought is to find an optimal estimator by minimizing the loss function . Unfortunately, the naive minimization of the loss would lead to , which is a practically useless estimator since it demands knowledge about the true . Essentially, the loss itself does not contain any information about the relation between the parameter and the measurements and, therefore, represents an incomplete description of the estimation problem. Due to this observation, in classical estimation theory the concept of the *risk function* is introduced, which is defined here by the conditional expectation value.

*Definition 1. *The risk function (or alternatively average loss) is defined as (It is inherent to the classical frequentist’s approach that the parameters are not interpreted as random variables . Since in this work a general Bayesian perspective is focused on, in the definition of the frequentist risk, the parameters are written as random variables but simultaneously conditioned on , which essentially leads to the same risk function.)

The risk function incorporates all possible outcomes of the observation and weights them with their likelihood . For this reason, the long-term average loss of a given estimator is obtained by the risk function of (6). In consequence, based on the risk function a reasonable comparison of estimators can be performed using the concept of * admissibility * (see Lehmann and Casella [12, pp. 309–376] or Robert [13, pp. 74–77, 391–415] for details). On the other side, the risk function still depends on the unknown parameter , and, therefore, direct minimization of the risk function can only be performed for a fixed . In order to incorporate all possible values of into a single quality criterion an extension of the concept of the risk function is introduced by incorporating (possibly noninformative) prior knowledge about by .

*Definition 2. *The integrated risk function is defined as the expectation value taken over and

With this criterion one gets a single real value for a given estimator which incorporates all parameters and possible observations and allows a straight comparison between different estimators (and especially a meaningful optimization). Unfortunately, to find an optimal estimator directly from the minimization of the integrated risk of (7) is a nontrivial problem but can be solved by Bayesian estimation as presented in Section 2.2. Further, a delicate point is the introduction of a prior distribution before any measurement is performed since this could bias the estimation result in a disadvantageous way. On the other side, if is bounded and . for all , all possible values are treated equally likely in order to erase the subjective notion when introducing the prior. In consequence, the application of the integrated risk function in order to derive estimators could also be of interest in cases in which one wants to avoid such a subjective notion and still get an estimator working best for all possible values and in average.

##### 2.2. Maximum Likelihood, Maximum A Posteriori, and Bayesian Estimation

In this section, three central estimation methods are introduced in a general way (for a brief characterization of these approaches, see Section 2.3).

###### 2.2.1. Maximum Likelihood (ML)

Maximum Likelihood estimation is typically applied in situations in which no prior knowledge about is available.

*Definition 3. *A Maximum Likelihood (ML) estimator for a given observation is
where “arg max” means that we want to find the position which maximizes the likelihood . This is also valid for the logarithm of the likelihood since the logarithm is a strictly increasing function, and the likelihood is positive. Since the ML estimation depends on the shape of the likelihood function which is problem-specific, under fairly general assumptions, the existence but not uniqueness of the estimate can be guaranteed. The theorem by Lehmann and Casella [12, p. 463] assures the existence of an asymptotically unbiased, consistent, and asymptotically efficient estimator which is the solution of , the so-called likelihood equations. If there is a unique solution to these equations, then in consequence, the corresponding ML fulfills these properties. From a practical perspective the determination of the estimate results in an optimization problem, and numerically this may lead to problems with respect to running into local maxima instead of global maxima.

###### 2.2.2. Bayesian Estimator (BE)

Bayesian estimation utilizes prior knowledge about , and focuses on the given observation. For this reason, a modified risk function needs to be introduced at first.

*Definition 4. *The Bayesian risk function is defined for a given loss , observation and the posterior as

The main difference between the Bayesian risk (9) and the integrated risk (7) is that the integrated risk does average over all possible observations , and the Bayesian risk utilizes only the concretely acquired observation .

*Definition 5. *A Bayesian estimator (BE) for a given observation is the estimator which minimizes the Bayesian risk function

At the first glance, the Bayesian estimator therefore looks unrelated to the optimization of the previously introduced risk functions in Section 2.1. A powerful statement is achieved by the following theorem.

Theorem 6. *The estimation function which minimizes the integrated risk can be obtained by selecting for every specific observation the estimate which minimizes the Bayesian risk . *

For the proof see Robert [13, p. 63]. A major property of Bayesian estimators is that if the loss is strictly convex, then the corresponding BE is unique. This will be shown explicitly in the next paragraph for the quadratic loss. For this loss the properties are similar as for the ML estimator, leading to consistent and asymptotically efficient estimators under some weak assumptions on the prior; see Lehmann and Casella [12, p. 490]. From a practical point of view, the numerical computation of the integral might be limiting the applications of BE if analytical solutions cannot be derived. Compared to the optimization problem in ML, the general calculation of these multiple integrals is typically computationally more challenging.

###### 2.2.3. The Minimum Mean Square Error (MMSE)

The Bayesian estimator utilizing the quadratic loss is called the Minimum Mean Square Error (MMSE). The derivation leads to
Since the loss is strictly convex and (11) represents a parameter integral with respect to , the unique solution can be derived from
This means for every coordinate
This leads to the corresponding MMSE for each coordinate with
which is the *expectation value of the posterior* for every coordinate , with the normalization constant . This example already points out the importance of the shape of the posterior for the Bayesian approach.

###### 2.2.4. Maximum A Posteriori (MAP)

An alternative approach, conceptually in between ML and BE, is the Maximum A Posteriori (MAP) estimation which already utilizes prior knowledge about , but has many characteristics of the ML approach.

*Definition 7. *The Maximum A Posteriori estimator (MAP) for a given observation is
since the marginal distribution is positive and independent of . In other words, MAP is the mode of the posterior.

When applying the logarithm to , this approach can be identified with a specific Tikhonov regularization of the ML approach (also known as penalized Maximum Likelihood), as discussed in Eldar [14]. Since the MAP estimation depends on the shape of the likelihood and prior function which is problem specifically defined, under fairly general assumptions, the existence but not uniqueness of the estimate can be guaranteed. The asymptotic properties are the same as for the ML case, with some further regularity conditions on and ; for example, see Robert [13, p. 166]. Although MAP utilizes prior knowledge about , the numerical problem is the same as for ML, that is, resulting in a numerical optimization problem with the problem of identifying local and global maxima.

In the context of Bayesian estimation, the MAP estimation can be derived as a limit of Bayesian estimators with respect to the constant loss function (5). It is shown that with as the -dimensional cube with side length and midpoint . In other words, the aim is to find the midpoint of the -dimensional cube , so that the volume under the graph of the posterior is maximized. By assuming an at least continuous posterior and letting , the best midpoint is the mode of the posterior, that is, the MAP estimator. This is illustrated in Figure 1. Since the constant loss function is not strictly convex, the corresponding BEs are not necessarily unique, and this implicates the nonuniqueness of the MAP as a limit of these BEs.

##### 2.3. Characterization of the Estimators

The presented estimators are closely related which is graphically illustrated in Figure 2. A major distinction is drawn in between the use of prior knowledge about or not, which is shown as a thick boundary in Figure 2. In detail, the main connections are summarized in the following list. BE MMSE: the general BE reduces to the MMSE when applying the quadratic loss of (4). MMSE MAP: if the posterior distribution is symmetric, that is, around the global maximum , then the MMSE estimator is identical with the MAP estimator. In this case, due to symmetry the expectation and the maximum of the posterior coincide. BE MAP: the BE converges to the MAP estimator when applying the constant loss of (5) with . MAP ML: if the prior is noninformative, that is, constant for a finite or asymptotically noninformative for an infinite as the deviation parameters of the prior go to infinity, then MAP coincides with the ML estimate.

Of course, the combination of the stated properties is possible, for example, for a symmetric posterior distribution around a global maximum and a noninformative prior the ML and MMSE coincide. There are several other concepts utilized in the literature for deriving non-Bayesian estimators, that is, without (possibly noninformative) prior knowledge about , such as the following. * Unbiasedness*, that is, the search of an unbiased estimator which minimizes the frequentist risk locally or uniformly. This property has been regarded as very important from the beginning of estimation theory (e.g., see Cramér [15]), although it could be shown that an unbiased estimator does not always exist (see, e.g., Lehmann and Casella [12, p. 83]), and lower risk function values (6) can be achieved when introducing a suitable bias (Eldar [16]). In this context, the Minimum Variance Unbiased Estimator (MVUE) is of special interest, since it represents the efficient unbiased estimator. * Minimaxity*, that is, the minimization of the maximum value of the risk function of (6), which typically leads to rather conservative estimates, since they can be approximated by Bayesian estimators with a prior distributions concentrated at the worst case (Robert [13, p. 67]). Unfortunately, these estimates do not always exist (Robert [13, p. 69]). * Equivariance*, that is, the invariance of the estimation problem under certain transformations of the estimator. This property is important for cases in which a given estimator is applied to modified estimation situations, but the subsequent investigation of the optimality of the modified estimator should be avoided. This is important for practical cases, in which the estimator is modified routinely or a certain symmetry of the estimator is demanded by the nature of the parameters one wants to estimate. For details, see Lehmann and Casella [12, p. 147–225].

#### 3. Application to Stochastic Localization in Euclidean Space

The general Bayesian framework described in the previous section will be applied to a localization problem in which 2D (3D) objects are projected onto 1D (2D) planes, and the projection signals (images) are detected for multiple views around these objects. This localization problem will be referred to as multiple view triangulation close to interfaces with a 2D or 3D observation model. In principle, multiple projections can be measured for views adjacent to each other and forming a contiguous arc or could be separated by larger angles (e.g., 90 deg). The formalism works for all sets of projections and all input data containing information about the projected coordinates of the objects. Two cases are presented in the following: linear parallel projections of 2D objects and nonlinear cone beam projection of 3D objects in a convex solution space . All transformations are purposefully presented in Euclidean space (instead of the projective space with homogeneous coordinates [1]) in order to allow intuitive interpretations of the model and the results, as well as demonstrate direct solutions for the nonlinear 3D case, and utilize straightforwardly interpretable priors. Further, we exactly know the geometry of image acquisition (i.e., use calibrated cameras) in order to specifically focus on the noisy measurements and the incorporation of prior knowledge, instead of the challenging problem of camera calibration [1, pp. 434–457].

The 2D geometry is presented in Figure 3 and shows a region which contains a feature within a larger object with interfaces, whose coordinates we want to estimate. It is known that might be at a different position, but it cannot be outside the region (e.g., is constrained by the surface of the object or regional interfaces). Furthermore, the PDFs are assumed to be Gaussians or truncated Gaussians (or uniform distributions in the Results section), since these are valid assumptions in many applications [1], and the resulting estimators can partly be presented in terms of explicit relationships. In general, the estimation we present works for arbitrary PDFs and can be directly applied to nonlinear/non-Gaussian problems.

Constraints due to interfaces or surfaces, for example, might occur in radiotherapy (or interventional radiology, image-guided surgical procedure) where the location of an implanted fiducial marker or another feature has to be determined in real-time based on X-ray projections (radiographs or tomosynthesis projections) [3, 4]. Let us focus on a specific application of breast cancer patient setup in radiotherapy. In this case, surgical clips implanted during tumor resection are used for localization of the tumor bed. Due to deformations of the breast in between the original CT images and the treatment, the markers might be at arbitrary locations, but they will never be outside of the patient's body, and they will not be inside the chest defined by the ribs. Also it is likely that they will not be displaced by more than a given range known from clinical practice (e.g., 2 cm from the original location in the planning CT scan). In radiotherapy, the goal is to localize the tumor (or the tumor surrogate such as the marker) with 1 mm accuracy. This is achievable by performing a CT scan. But such a CT scan is not possible in many clinical situations either due to undesired dose from the imaging or due to time constraints or other practical concerns. Additionally, in the case of a given marker within the flexible breast tissue, the surface can be measured with optical or infrared cameras in real-time or based on a tomosynthesis reconstruction, which is an intensely discussed topic [17–19]. We can thus assume that the knowledge about the breast surface is available for the given posture of the patient. In a similar context, in interventional radiology or image based surgeries there is a need to work with a few projections or even single images in order to find the location of certain objects in 3D. Many other applications are thinkable, such as robotic arm position estimation in a closed room or computer vision approaches with spatial restrictions [1].

##### 3.1. Parallel Beam in 2D

In this case . The observation is performed by projecting the feature in a detector plane at different angles . The aim of this example is to estimate the coordinate based on the observed coordinates at different angles between and , which are merged to a single vector .

Please note that although the presented situation might have several applications, the numerical example in the Results section uses arbitrary dimensionless parameters in order to demonstrate the principal differences of the estimation methods. Furthermore, the linear relation between observation and the coordinate in the parallel beam model allows to derive explicit estimators, which is not possible for the nonlinear cone beam geometry in Section 3.2.

###### 3.1.1. Observation without Uncertainties and Prior Knowledge

If it is assumed that the observation is without any errors, then no prior knowledge is necessary because there is no ambiguity in the detection, and the linear relation between and a single observation can be derived from This is a linear equation in the two coordinates of and; therefore, two equations need to be derived for a unique solution, that is, two observations and at angles and with modulo . The explicit solution for this straightforward estimation is given by the estimator In the numerical examples we will assume the two angles to be and which represents the best separation between two projections. In the further text the estimator of (18) will be denoted by the approach.

###### 3.1.2. Observation with Uncertainties and without Prior Knowledge

If we know that there are observational uncertainties, that is, errors in determining , then one can assume an error distribution, which is represented in this example by the normally distributed random variable at angle
In the geometrical model, this means we are adding a random error to the observed projected coordinate at every angle
which makes now the observation itself to a random variable with the PDF
By acquiring stochastically independent observations at angles , one can summarize these observations in a single PDF, which is the 2D *likelihood function* in
In consequence, by applying the logarithm the *Maximum Likelihood* estimator is determined by
which is exactly the *least squares* solution. This is a well-known result in estimation theory and indicates the success of *least squares*, since the sum of many independent errors can often be approximated well by a normal distribution [1, pp. 102, 121, 134, 434, and 568]. An important observation is that in this approach the solution is totally independent of the knowledge about the measurement uncertainty . The explicit solution is derived from solving (23) analytically, and it follows (cp. (18) )

###### 3.1.3. Observation with Uncertainties and Prior Knowledge

If it is further known that is stochastically distributed, that is, a random variable , one can additionally introduce prior knowledge about this distribution into the estimation model. In the 2D example the prior is defined as follows
with a normalization constant , the characteristic function which has the value 1 in the circle with midpoint and radius , and 0 elsewhere (representing an example of a convex region), and the mean of the normal distribution, and
This is essentially a Gaussian density function which is truncated by the circle , which is illustrated in Figure 4. In the geometrical model now also the parameters become random variables; that is,
Utilizing Bayes’ theorem, the *posterior* PDF can be calculated by ( is the normalization constant of the posterior)
Based on the posterior the *Maximum A Posteriori* estimator is therefore defined as
This formula essentially shows explicitly how the compromise between measurement and prior knowledge, as two different sources of information, is gained: the measurement is weighted with against the prior knowledge with (), which is the case of the Tikhonov regularization for the constrained least squares problem. Since this is a convex function on a convex domain , there is a guaranteed global minimum. If this maximum is in the interior of , the explicit solution is determined by solving (31), and it follows (cp. (18) and (24))
From a practical perspective, if the calculated by (32) is outside of , then the maximum of (31) must be on the border (circle in Figure 4), which can then be solved by *Lagrangian multipliers* applied to (31) or directly by solving (31) with a general optimization algorithm. The explicit solution for the interior of depends now on the ratios of (), which again shows a weighting of the measurement uncertainties and the prior knowledge. Particularly, if , the prior gets noninformative, and the interior estimator converges to the ML estimator.

Based on the posterior also the Minimum* Mean Square Error* estimator can be determined by
for with the posterior in (29), which cannot be calculated elementarily anymore. For the specific case of , the MMSE estimator is coinciding with the MAP estimator of (32) due to the symmetry of the posterior around its global maximum when using Gaussians. The difference between MAP and MMSE will therefore be enhanced by the estimation close to the boundary. Please note that both MAP and MMSE guarantee an estimate which is not outside of the (convex) circle , effectively bounding the feasibility region with the prior. In contrast, for the and ML approach no bounded feasibility region is possible.

##### 3.2. Cone Beam in 3D

In this case . The observation is again performed by projecting the feature in a detector plane at different angles . There are observed coordinates at different angles between and , which are merged to a single matrix (which can be identified with a vector in ).

If it is assumed that the observation is without error and no prior knowledge is available to the estimation, the nonlinear relation between and a single observation at angle is with the imaging source to isocenter of rotation distance and isocenter to detection plane distance ; see Figure 5 for an illustration of this geometry. This projection excludes points which are on the plane orthogonal to the beam through the imaging source. It is directly recognizable that is nonlinear (in Euclidean space), since . We recognize that this projection can be represented as a linear transformation in homogeneous coordinates (e.g., see Hartley and Zisserman [1]), but we purposefully ignore this in order to show how one can apply the proposed estimation approaches directly to a nonlinear situation as well as define intuitive priors in Euclidean space.

A direct solution, such as the case in 2D, is not uniquely possible since there are equation numbers as a multiple of , but we have unknowns. We avoid this ambiguity by not defining a corresponding case.

###### 3.2.1. Observation with Uncertainties and without Prior Knowledge

The observation uncertainty at angle is in this case described by
with the identity matrix . The geometrical model is therefore modified to
In consequence, the observation PDF is
By acquiring stochastically independent observations at angles , one can summarize these observation in a single PDF, which is the 3D *likelihood function* in
This leads then to the *Maximum Likelihood* estimator
which is the nonlinear *least squares* solution. Due to the nonlinearity, no elementary solution can be derived, and this expression is directly minimized.

###### 3.2.2. Observation with Uncertainties and Prior Knowledge

The prior knowledge is in the 3D case modeled with
with a normalization constant , the characteristic function which has the value 1 in the sphere with midpoint and radius , and 0 elsewhere (again as an example of a convex region), and the mean of the normal distribution, and
This is essentially a Gaussian density function which is truncated by the sphere . A sample from this prior is illustrated in Figure 6. The geometrical model is then
The posterior distribution then gets ( is the normalization constant of the posterior)
In consequence, the *Maximum A Posteriori* estimator is
representing a constrained and regularized nonlinear least squares optimization problem. The corresponding *Minimum Mean Square Error* estimator is analogously
for with the posterior of (43), which again cannot be calculated elementarily anymore.

#### 4. Results

In order to show the practical differences, we present 5 different cases for the comparison of the estimators with 10,000 sample points each (recall that is a random variable), in 2D parallel beam and 3D cone beam geometry. The standard parameter set (A) is as follows: with projections equidistantly distributed in between and and , , , or , respectively, or respectively, , and .

Besides the standard parameter set presented above, four other parameter sets (cases) are investigated (by changing only one parameter at a time while setting all other parameters to the standard): (B) applying only projections, (C) applying projections, (D) narrowing the prior by , and (E) reducing the measurement uncertainties . In addition, for the 2D parallel beam case, we present the results of the MAP and MMSE estimations if there is a noninformative prior (np) utilized, that is, uniform distribution inside the circle and zero outside, which are denoted with and accordingly. This means, only the hard constraints about the feasibility region are utilized in these estimations, without prior knowledge about the concentration of at the border (circle in Figure 4). In a broader context, such a noninformative estimator can be identified with a ML estimator that has ad hoc constraints about the solution space in optimization.

##### 4.1. Parallel Beam in 2D

For the standard parameters of case (A), in Figure 7 an example of the posterior PDF in 2D for a single sample point is presented. In this plot on the right side a profile of the likelihood and the posterior function is presented, which demonstrates the general behavior: the width of the posterior is reduced compared to the likelihood function by the cost of introducing a shift (bias) of the maximum position by prior knowledge. Further, in the posterior profile the circular boundary is presented by the truncation of the profile. By incorporating the truncation into the prior distribution, the MMSE (which for simplicity one can think of as the expectation value of the posterior profile) is compensating for the bias of the maximum position in MAP.

In Figure 8 the estimation performance, for case (A) of the approach of (18), the ML of (24), the MAP of (32) and (31), and the MMSE of (33) (with noninformative prior and truncated Gaussian prior) are presented. The complete estimation results for all five cases (A)–(E) are presented in Table 2. In addition to Table 2 the RMSEs of a broader variation of the essential parameters are illustrated in Figure 9 by starting with case (A) and varying only the specified parameter of each subfigure. Examples for the posterior distributions cases (A)–(E) (for the same specific sample ) are presented in Figure 10, in order to see the qualitative differences due to the according changes in the parameter set.

Based on Table 2 and Figure 9 several characteristic observations can be made: at first, in all cases the estimation accuracy, which can be summarized with the RMSE, is improving mainly along the chain .

Second, in order to compare the empirical bias of each estimator one has to focus on the mean values of the coordinate directions and which are presented in brackets in the third column of Table 2. In theory, the and the ML approaches are (asymptotically) unbiased, which was also observed in this empirical evaluation (i.e., a bias of 0.0 in each coordinate direction). MAP and MMSE estimators are typically biased estimators, which is certainly true in this application for the MAP estimation and partly true for the MMSE estimator. In detail, for the estimators with uniform priors, and , a bias towards the center of the constraining circle can be recognized (e.g., negative bias values in each coordinate direction). This is plausible, since estimates outside the circle are prohibited with this prior and, on the other side, no information about the concentration of at the border of the circle is introduced. When focusing on the full prior (constraining circle and the concentration at the border) with MAP, a bias in the opposite direction, towards the border, is introduced (e.g., see Figure 7 for an illustration of this effect). Please note that the introduction of a significant bias in these three estimations, , , and MAP, still leads to better results compared to the unbiased and ML estimations, which is a characteristic behavior in Bayesian estimation. Remarkably, the use of the Bayesian MMSE with the full prior leads to an empirically unbiased estimator in this application. This can be understood by realizing that the bias is in balance between the concentration of at the border (leading to a bias towards the border) and the constraints of the border (leading to a bias towards the center of the circle) when averaging over the whole posterior distribution (e.g., see Figure 7 again for an illustration). This allows to conclude that for the spatial estimation at constraining interfaces a highly accurate and practically unbiased estimator can be constructed with MMSE estimation.

Third, compared to the standard parameter set, utilizing projections reduces the observation information and increases the RMSE. Specifically, ML is converging exactly to the approach, increasing its RMSE from 3.05 to 4.28. Compared to the uniform prior in and , the full prior in MAP and MMSE leads to robuster estimates with much less increasing RMSEs.

Fourth, by utilizing projections, the performances of all estimators are improved. Essentially, the relative use of the prior knowledge is decreased since it is weighted less by the MAP and MMSE estimators, which, for example, can be seen in (32).

Fifth, when the sample distribution is getting narrower and simultaneously the corresponding prior PDF is utilized, the RMSEs of MAP and MMSE decrease significantly. The relative benefit from MAP to MMSE is decreased in this case, since, for the narrower prior, the influence of the truncation of the posterior by the boundary is reduced. On the other side, and lead to RMSEs much closer to ML, since they introduce a strong bias (not knowing the concentration of at the border). In this context, the increase in the bias is much stronger for compared to , leading overall to even worse RMSE values.

Sixth, if the measurement accuracy is increased, all estimators benefit from it significantly. Particularly, the benefit of using (partial) prior knowledge (in , , MAP, and MMSE) compared to not using it (in and ML) is decreased but still not negligible.

##### 4.2. Cone Beam in 3D

In Figure 11 the estimation performances for this standard parameter set of the ML of (39), the MAP of (45), and the MMSE of (46) are presented. Further, in Table 3, the results of the three estimators are presented for all five cases (A)–(E), similar to the results of 2D parallel beam geometry.

Several observations can be made: at first, in general the same behavior as for the 2D parallel beam geometry can be made regarding the presented five cases, and, therefore, the mentioned statements remain valid; especially, the estimation improves in the order ML MAP MMSE.

Second, when focusing on the RMSE column, for all three methods the estimation of the third coordinate is in general more accurate than the estimation of and . This can be understood by the fact that is almost directly observed in the cone beam geometry of (34) and, therefore, is estimated with higher confidence.

Third, the estimation of and is slightly better in the 3D cone beam geometry than in the 2D parallel beam geometry. This is due to the fact that also in the third coordinate there is a slight information about the first two coordinates due to the scaling in cone beam geometry. Therefore, the information content about the first two coordinates is higher in 3D cone beam geometry, having two measurements per projection for three unknowns .

Fourth, the calculation times on the test computer (Intel(R) Core2 Quad CPU, 4 Cores, 3.00 GHz, 4.00 GB RAM) for a single data point were the same for ML and MAP with in average seconds utilizing the MATLAB implemented Nelder-Mead simplex method and for the MMSE implementation in average seconds utilizing 1/3 Simpson's rule for integration. The optimization in ML and MAP was terminated if the difference of the estimated position between iterations was less than , and for the MMSE integration a grid with a constant spatial step size of was utilized. It could be observed that a further refinement of these criteria did not lead to practically better results. Several ways for a further speedup of the MMSE estimator can be implemented, for example, taking symmetries into account when utilizing Gaussians, more adaptive grid generation in the numerical integration, more effectively utilizing parallel programming and a full implementation in C compared to MATLAB.

#### 5. Discussion

We presented briefly the general Bayesian framework for point estimation and its application to the stochastic localization/triangulation problem. This compact presentation of the estimation methods is suitable for a broad group of applications. In the general introduction, we presented the foundations of Maximum Likelihood, Maximum A Posteriori, and Bayesian estimation applied to the Minimum Mean Square Error and how they are related to each other and other popular estimation methods.

Several points can be made considering the specific application to stochastic localization/triangulation, which hold true in general for Bayesian approaches as well: as seen in the proposed application, there is a tradeoff between benefit and effort. The more the information is contained in observations (= quality of observation, e.g., more projections or higher quality measurement/detection), the smaller the benefit is due to prior knowledge. The other way round is true as well: the less the information in observations, the more important is the prior knowledge. With the Bayesian estimation (, , MAP, or MMSE), these two probabilistic sources of information can be naturally included in the model.

The introduction of a *prior* can be utilized to benefit the estimation in two ways: it can place more weight on possible values of locations and effectively restrict by setting the prior probabilities to zeros outside of the feasibility region (boundaries). If the constrained region of interest for is a convex region (as in the example), then the MMSE and the MAP will derive estimates in the constrained region, and, therefore, this imposes an effective constraint. However, if the region is nonconvex, only the MAP will still lead to an estimate within the restricted region, while MMSE will lead to an estimate in the convex hull of the constrained region (possibly outside the constrained region). In a broader context, the prior can also be interpreted as a regularizing influence to the presented inverse problem, such as the Tikhonov regularization as in MAP or in a more interweaved form in MMSE.

It is pointed out that in this simulation study the standard deviations of the probabilistic knowledge about the prior knowledge ( for ) and the observation uncertainties () are known before estimation. In some practical applications these parameters are not known and have to be estimated or assumed, which would introduce additional uncertainties to the presented estimation methods. The investigation of these additional uncertainties is not part of this study, and it is recommended to extend the presented methods for this purpose utilizing *hierarchical Bayesian models* [13].

Focusing on the presented 2D study, the following statements can be formulated: if no prior knowledge is available, utilizing ML with 5 or 10 projections compared to a single with 2 projections decreases effectively the measurement uncertainties and increases the estimation accuracy by about . If only information about the constraints of is available but no information about its possible distribution (e.g., truncated Gaussian), should be preferred to since it achieves a similar accuracy (case (A): increase for relative to ML compared to for ) with less bias and much faster calculation times. In contrast to this, if both information are available, information about the constraints and concentration of , then utilizing MMSE should be preferred to MAP since it allows finding a better compromise close to the surfaces between constraints and concentration. This is due to the fact that MAP neglects the constraints totally as long as the estimates are inside the circle, leading to worse results in average (case (A): increase for MMSE relative to ML compared to for MAP). In general, it is shown in this application that with the utilization of the MMSE for spatial coordinate estimation at constraining interfaces it is possible to construct an empirically unbiased estimator with high accuracy.

Further testing of these methods in medical imaging or other practical applications of stochastic localization at boundaries is highly encouraged. This paper summarizes the basic theory for this purpose and provides clearly interpretable results in the simulation studies. However, in each practical application the true benefit of the estimation methods has to be evaluated separately or individually. For instance, in radiotherapy due to differences in patient anatomy, the problem of breast tumor localization is dramatically different from prostate localization. For breast the boundary is the breast surface, and, for prostate, hard constraints can arise from the bony anatomy or an endorectal balloon which fixes the anatomy differently.

The presented estimation with constraints incorporated into the prior is very general and not limited to linear acquisition geometries, as demonstrated for the nonlinear 3D case. Further, the results of the 3D study show that the scaling of the 3D cone beam geometry increases the estimation accuracy for the first two coordinates of compared to the parallel beam geometry in 2D. Eventually, ML and MAP estimations lead to fast optimization problems and the MMSE estimator to a more challenging high-dimensional integration. In practical situations it depends on the specific application, such as real-time imaging, to find a suitable compromise between computational effort and accuracy.

#### 6. Conclusion

With the 2D parallel beam and 3D cone beam geometry examples it is illustrated that the general framework of Bayesian estimation can be applied to a variety of estimation problems even when no explicit formulas can be derived, such as for nonlinear/non-Gaussian distributions of the uncertainties or prior knowledge. In this context, it is demonstrated that constraints about the solution space can be efficiently incorporated into the prior for stochastic localization by utilizing Maximum A Posteriori and Minimum Mean Square Error estimation.

#### Acknowledgment

This work was supported by the German Research Foundation (DFG) within the funding programme Open Access Publishing.

#### References

- R. Hartley and A. Zisserman,
*Multiple. View Geometry in Computer Vision*, Cambridge University Press, 2003. View at Zentralblatt MATH - D. E. Clark and S. Ivekovič, “The Cramer-Rao Lower Bound for 3-D state estimation from rectified stereo cameras,” in
*Proceedings of the 13th Conference on Information Fusion (Fusion '10)*, pp. 1–8, July 2010. View at Scopus - W. Hoegele, R. Loeschel, B. Dobler, J. Hesser, O. Koelbl, and P. Zygmanski, “Stochastic formulation of patient positioning using linac-mounted cone beam imaging with prior knowledge,”
*Medical Physics*, vol. 38, no. 2, pp. 668–681, 2011. View at Publisher · View at Google Scholar · View at Scopus - W. Hoegele, P. Zygmanski, B. Dobler, M. Kroiss, O. Koelbl, and R. Loeschel, “Localization of deformable tumors from short-arc projections using bavesian estimation,”
*Medical Physics*, vol. 39, no. 12, pp. 7205–7214, 2012. View at Publisher · View at Google Scholar - W. Hoegele, R. Loeschel, B. Dobler, O. Koelbl, C. Beard, and P. Zygmanski, “Stochastic triangulation for prostate positioning during radiotherapy using short ebet arcs,”
*Radiotherapy & Oncology*, 2013. View at Publisher · View at Google Scholar - C. B. Guure, N. A. Ibrahim, and A. O. M. Ahmed, “Bayesian estimation of two-parameter weibull distribution using extension of Jeffreys' prior information with three loss functions,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 589640, 13 pages, 2012. View at Publisher · View at Google Scholar - N. J. Gordon, D. J. Salmond, and A. F. M. Smith, “Novel approach to nonlinear/non-gaussian Bayesian state estimation,”
*IEE Proceedings F*, vol. 140, no. 2, pp. 107–113, 1993. View at Google Scholar · View at Scopus - M. S. Arulampalam, S. Maskell, N. Gordon, and T. Clapp, “A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking,”
*IEEE Transactions on Signal Processing*, vol. 50, no. 2, pp. 174–188, 2002. View at Publisher · View at Google Scholar · View at Scopus - A. Weckenmann, X. Jiang, K.-D. Sommer et al., “Multisensor data fusion in dimensional metrology,”
*CIRP Annals - Manufacturing Technology*, vol. 58, no. 2, pp. 701–721, 2009. View at Publisher · View at Google Scholar · View at Scopus - R. I. Hartley and P. Sturm, “Triangulation,”
*Computer Vision and Image Understanding*, vol. 68, no. 2, pp. 146–157, 1997. View at Google Scholar · View at Scopus - A. S. Bedekar and R. M. Haralick, “A Bayesian method for triangulation and its application to finding corresponding points,” in
*Proceedings of the IEEE International Conference on Image Processing*, vol. 2, pp. 362–365, October 1995. View at Scopus - E. L. Lehmann and G. Casella,
*Theory of Point Estimation*, Springer, New York, NY, USA, 1998. - C. P. Robert,
*The Bayesian Choice*, Springer, New York, NY, USA, 2007. - Y. C. Eldar, “Minimum variance in biased estimation: bounds and asymptotically optimal estimators,”
*IEEE Transactions on Signal Processing*, vol. 52, no. 7, pp. 1915–1930, 2004. View at Publisher · View at Google Scholar · View at Scopus - H. Cramér,
*Mathematical Methods of Statistics*, Asia Publishing House, 1946. - Y. C. Eldar, “Rethinking biased estimation: improving maximum likelihood and the cramér-rao bound,”
*Foundations and Trends in Signal Processing*, vol. 1, pp. 305–449, 2008. View at Google Scholar - S. Rohl, S. Bodenstedt, S. Suwelack et al., “Dense gpu-enhanced surface reconstruction from stereo endoscopic images for intraoperative registration,”
*Medical Physics*, vol. 39, no. 3, pp. 1632–1645, 2012. View at Google Scholar - G. Zheng, “Statistical shape model-based reconstruction of a scaled, patient-specific surface model of the pelvis from a single standard AP x-ray radiograph,”
*Medical Physics*, vol. 37, no. 4, pp. 1424–1439, 2010. View at Publisher · View at Google Scholar · View at Scopus - R. Schulze, U. Heil, O. Weinheimer et al., “Accurate registration of random radiographic projections based on three spherical references for the purpose of few-view 3D reconstruction,”
*Medical Physics*, vol. 35, no. 2, pp. 546–555, 2008. View at Publisher · View at Google Scholar · View at Scopus