Name
Abstract | ||
|---|---|---|
One of the major questions in high-density transcranial electrical stimulation (TES) is: given a region of interest (ROI) and electric current limits for safety, how much current should be delivered by each electrode for optimal targeting of the ROI? Several solutions, apparently unrelated, have been independently proposed depending on how “optimality” is defined and on how this optimization problem is stated mathematically. The least squares (LS), weighted LS (WLS), or reciprocity-based approaches are the simplest ones and have closed-form solutions. An extended optimization problem can be stated as follows: maximize the directional intensity at the ROI, limit the electric fields at the non-ROI, and constrain total injected current and current per electrode for safety. This problem requires iterative convex or linear optimization solvers. We theoretically prove in this work that the LS, WLS and reciprocity-based closed-form solutions are specific solutions to the extended directional maximization optimization problem. Moreover, the LS/WLS and reciprocity-based solutions are the two extreme cases of the intensity-focality trade-off, emerging under variation of a unique parameter of the extended directional maximization problem, the imposed constraint to the electric fields at the non-ROI. We validate and illustrate these findings with simulations on an atlas head model. The unified approach we present here allows a better understanding of the nature of the TES optimization problem and helps in the development of advanced and more effective targeting strategies. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.neuroimage.2019.116403 | NeuroImage |
Keywords | Field | DocType |
Transcranial electrical stimulation (TES),Transcranial direct current stimulation (tDCS),Optimal electrical stimulation,Reciprocity theorem,Least squares | Least squares,Mathematical optimization,Unification,Cognitive psychology,Psychology,Regular polygon,Linear programming,Region of interest,Optimization problem,Maximization | Journal |
Volume | ISSN | Citations |
209 | 1053-8119 | 0 |
PageRank | References | Authors |
0.34 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mariano Fernández-Corazza | 1 | 0 | 0.34 |
| Sergei Turovets | 2 | 0 | 0.34 |
| C. Muravchik | 3 | 543 | 68.59 |