Related Experiment Video
Updated: Jul 13, 2026
13:04
Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
Published on: January 18, 2022
Evaluation of smoothing in an iterative lp-norm minimization algorithm for surface-based source localization of MEG
Jooman Han1, June Sic Kim, Chun Kee Chung
1Interdisciplinary Program in Biomedical Engineering, Seoul National University, Seoul, Korea. jmhan@bmsil.snu.ac.kr
Physics in Medicine and Biology
|August 3, 2007
Summary
This study enhances the FOCUSS algorithm for magnetoencephalography (MEG) source imaging by adding a smoothing technique. This improved method accurately reconstructs neural activity, even with high noise levels, using geodesic distances for better results.
Area of Science:
- Neuroimaging
- Biophysics
- Computational Neuroscience
Background:
- Magnetoencephalography (MEG) source imaging is ill-posed, requiring constraints for plausible solutions.
- Minimum l(p) norm (0 < p ≤ 1) constraints aid in reconstructing focal sources.
- The FOCUSS algorithm is a common method for l(p)-norm minimization but struggles with high noise.
Purpose of the Study:
- To develop and evaluate a smoothing technique integrated into the FOCUSS algorithm for improved MEG source imaging.
- To compare different smoothing kernels, including geodesic and Euclidean distances, in a cortical source space.
Main Methods:
- Incorporated a smoothing procedure into the FOCUSS algorithm.
- Tested smoothing kernels (geodesic vs. Euclidean distance) within a surface-based cortical source space.
- Validated the enhanced FOCUSS algorithm using simulations and real auditory MEG data.
Main Results:
- The smoothing technique significantly improved FOCUSS algorithm performance, reducing spurious sources in noisy conditions.
- Geodesic distance-based smoothing kernels outperformed Euclidean ones in cortical source space.
- Successfully applied the method to real MEG data, localizing sources in the superior temporal gyrus.
Conclusions:
- The proposed smoothing technique enhances the robustness and accuracy of FOCUSS-based MEG source imaging.
- Geodesic smoothing is recommended for surface-based cortical source analysis.
- The improved algorithm is effective for realistic neuroimaging applications.
Related Concept Videos
01:29Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
01:29Application of Linearization and Approximation
A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
01:23Linear Approximations
For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
01:26Linearization and Approximation
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
01:28Lagrange Multipliers: Two Constraints
The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
01:11Residuals and Least-Squares Property
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...