You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
\noindent where $\Omega_{k}$ is the surface on which the sources are located.
96
+
\noindent where $\Omega_{k}$ is the surface on which the sources are located,
97
+
$V_k$ are the potentials on that surface, and $\hat{n}$ are the surface normals
98
+
of the surface.
96
99
97
100
As an alternative to solving this problem directly, a (weighted) integral
98
101
can be taken over the solution domain on both sides of Eq.~(\ref{eq:eq})
@@ -105,8 +108,9 @@ \section{Solutions to the Forward Problem in the Forward/Inverse Toolkit}
105
108
In a tractable geometry, such as a set of concentric or even eccentric
106
109
spheres, this PDE can be solved via analytical expansions. However in
107
110
complex geometries such as realistic torso models, numerical solutions must
108
-
be applied. Again there is a large literature on such numerical
109
-
methods. Two of these methods have predominated in the literature for
111
+
be applied.
112
+
%Again there is a large literature on such numerical methods.
113
+
Two of these methods have predominated in the literature for
110
114
forward electrocardiography: the Finite Element Method (FEM) and the
111
115
Boundary Element Method (BEM). It is these two methods which have been
112
116
implemented in this toolkit. Thus, in the rest of this subsection, we give a
@@ -123,9 +127,9 @@ \section{Solutions to the Forward Problem in the Forward/Inverse Toolkit}
123
127
these surfaces is then discretized into a mesh. In other words, in both FEM
124
128
and BEM there exists a collection of points, called nodes, which define the
125
129
respective volume or surface elements. The potential $\Phi$ (and the
126
-
current, $\BM{\sigma} \nabla\Phi)$, is approximated by interpolation of
127
-
potential and current across those elements, based on its value at the
128
-
nodes, using known (usually polynomial) interpolation functions. Thus,
130
+
current, $\BM{\sigma} \nabla\Phi)$, is approximated by interpolating the
131
+
potential and current across those elements based on its value at the
132
+
nodes using known (usually polynomial) interpolation functions. Thus,
129
133
numerical integration can be applied to the weak form, and the node values
130
134
come out of the integrals, leaving subintegrals over known functions which
131
135
result in a set of weights. The result in either case is a system of
@@ -243,12 +247,10 @@ \subsection{FEM in the Forward/Inverse Toolkit}
243
247
this reduces to replacing the $0$'s on the right hand side by known
244
248
currents or fixing some values of the vector $\BM{\Phi}$ to correspond to
245
249
known voltages. There are a variety of ways to accomplish this to preserve
246
-
certain numerical properties of the matrix equation, and again we refer the
247
-
reader to the vast literature on this subject for details. If the
250
+
certain numerical properties of the matrix equation. If the
248
251
measurement electrodes are treated as being larger than one node in size,
249
252
this can lead to additional boundary conditions which in turn leads to
250
-
additional modifications of the equations, and again we refer the reader to
251
-
the literature.
253
+
additional modifications of the equations.
252
254
253
255
The result is a matrix equation whose size is the total number of nodes in
254
256
the volume, which tends to result in a relatively large system. However, as
@@ -282,10 +284,10 @@ \subsection{FEM in the Forward/Inverse Toolkit}
282
284
provided an example SCIRun network to implement one of them, the so-called
283
285
``lead field'' method, which solves the matrix equation repeatedly for
284
286
source vectors consisting of a $1$ at each source node in turn and $0$ at
285
-
all other source nodes. From this collection of solutions we can obtain the
286
-
desired transfer matrix, which we will denote a$\mathbf{A}$. This network is described below in
287
-
Ch.~\ref{ch:fwd} and once again the details are available to the interested
288
-
reader in the literature.
287
+
all other source nodes\cite{JDT:Gul97}. From this collection of solutions we
288
+
can obtain the desired transfer matrix, which we will denote as$\mathbf{A}$
289
+
as used in eq.~\ref{eg:TransMat}.
290
+
This network is described below in Ch.~\ref{ch:fwd}.
289
291
290
292
\subsection{BEM in the Forward/Inverse Toolkit}
291
293
@@ -298,10 +300,9 @@ \subsection{BEM in the Forward/Inverse Toolkit}
298
300
that assumption, the surfaces of those subdomains become a sufficient
299
301
domain upon which to solve the problem for the entire domain.
300
302
301
-
Briefly (and once again we refer the reader to the literature for the
302
-
details and complications), one of the Green's Theorems from vector
303
+
Briefly, one of the Green's Theorems from vector
303
304
calculus is applied to an integrated form of Laplace's equation to transform the
304
-
differential problem into a Fredholm integral problem. The surfaces are
305
+
differential problem into a Fredholm integral problem\cite{RSM:Bar77}. The surfaces are
305
306
each subdivided (tessellated) into a collection of small surface (or
306
307
boundary) elements. Then (two-dimensional) basis functions (again usually
307
308
low-order polynomials) are used to
@@ -314,7 +315,8 @@ \subsection{BEM in the Forward/Inverse Toolkit}
314
315
In the BEM method, these integrals involve as unknowns the
315
316
potential and its gradient. The integration involves the computation of the
316
317
distance between each node within the surface and to all others surfaces.
317
-
In complicated geometries, and in all cases when the node is integrated against the points on its ``own''
318
+
In complicated geometries, and in all cases when the node is integrated
319
+
against the points on its ``own''
318
320
surface, there are numerical difficulties computing these integrals. In those cases
319
321
there are a number of sophisticated solutions which have been proposed in the literature (and
320
322
some of them are adopted in the SCIRun implementation).
@@ -388,8 +390,8 @@ \section{Solutions to the Inverse Problem in the Forward/Inverse Toolkit}
388
390
389
391
\subsection{Activation-based Inverse Solutions in the Forward/Inverse Toolkit}
390
392
391
-
Since this problem is non-linear, iterative solutions are employed. An
392
-
``initial guess'', or starting point, is required. Then
393
+
Since the acitvation-based inverse problem is non-linear, iterative solutions
394
+
are employed. An ``initial guess'', or starting point, is required. Then
393
395
solutions are iteratively re-computed until a desired convergence criterion
394
396
is met. Currently in the toolkit, we have a Matlab version of a Gauss-Newton
395
397
iterative solver which can be called from within SCIRun. The starting
@@ -409,8 +411,17 @@ \subsection{Potential-based Inverse Solutions in the Forward/Inverse Toolkit}
409
411
410
412
\subsubsection{Standard Tikhonov regularization}
411
413
412
-
The Tikhonov regularization minimizes $\| Ax - y \|$ in order to solve $Ax=y$, where $x$ is the unknown solution and $y$ the given measurement. The forward solution matrix $\mathbf{A}$ is of size $m\times n$, where $m$ is the number of measurement channels and $n$ is the number of source reconstruction points).
413
-
The system $Ax$ can be overdetermined ($m > n$), underdetermined ($m <n$) or $m=n$. $A$ is often ill-conditioned or singular, so it needs to be regularized. The Tikhonov regularization is often used to overcome those problems by introducing a minimum solution norm constraint, such as $\lambda\|Lx\|_2^2$. The solution of the problem can be found by minimizing the following function:
414
+
The Tikhonov regularization minimizes $\| Ax - y \|$ in order to solve $Ax=y$,
415
+
which is the same as eq.~\ref{eq:TransMat} with $x$ replacing $x(t)$ for the
416
+
unknown solution and $y$ replacing $y(t)$ for the given measurement. The
417
+
forward solution matrix $\mathbf{A}$ is of size $m\times n$, where $m$ is the
418
+
number of measurement channels and $n$ is the number of source reconstruction
419
+
points). The system $Ax$ can be overdetermined ($m > n$), underdetermined
420
+
($m <n$) or $m=n$. $A$ is often ill-conditioned or singular, so it needs to be
421
+
regularized. The Tikhonov regularization is often used to overcome those
422
+
problems by introducing a minimum solution norm constraint, such as
423
+
$\lambda\|Lx\|_2^2$. The solution of the problem can be found by
424
+
minimizing the following function:
414
425
\begin{center}
415
426
\begin{eqnarray}
416
427
f (x) = \| P (y - A x) \|^{2}_{2} + \lambda^{2} \| Lx \|^{2}_{2},
\noindent where $\lambda$ is the regularization parameter, which is a user defined scalar value. The matrix $\mathbf{P}$ represents the \textit{a priori} knowledge of the measurements. The matrix $\mathbf{L}$ describes the property of the solution $x$ to be constrained.
422
-
%The following sentence doesn't fit here and is removed. (Dafang)
423
-
%as well as the posed \textit{a prior knowledge} expressed as a weighting of the measurements $P$ (also $C$ see below, e.g. sensor covariance matrix) and $L$ (also $W$ see below) which constraints the solution $x$.
424
433
Conceptually, $\lambda$ trades off between the misfit between predicted and measured data (the first term in the equation) and the \textit{a priori} constraint.
425
434
An approximate solution $\hat{x}$ of \ref{tik_problem} is given for the
0 commit comments