The EIT Forward Map commutes with several transformations. This is useful both for analysis and for designing neural networks that respect the physics (see Invariant and Equivariant Functions).

Rigid motions (Euclidean group ). Let with . If solves in , then solves the equation with conductivity in . The normal derivative is preserved because is an isometry, so

Rotating or reflecting the body and the boundary data together rotates or reflects the measured currents. The forward map is equivariant, not invariant: an interior feature is reconstructed the same way wherever it sits, provided the whole setup (domain and electrodes) is transformed with it. On a square domain the relevant finite subgroup is the Dihedral Group D4.

Scaling. For (), gradients scale by , so the DtN map of the dilated problem is times the transported one. Multiplying the conductivity by a constant gives .

Conformal maps (2D). For a conformal map , . The push-forward of an isotropic conductivity is therefore again isotropic, (see Anisotropic Conductivities). The 2D conductivity equation is conformally invariant. The boundary operators transform by composition with and multiplication by the boundary stretching factor . This much larger (infinite-dimensional) symmetry is special to two dimensions and is used, for example, to map arbitrary simply connected domains to the unit disc.

Mesh permutations. Renumbering the nodes of a finite element mesh (the symmetric group ) changes nothing physically. Graph neural networks are permutation-equivariant by construction.

Complex EIT. A global phase rotation () of the complex potentials leaves the admittivity problem unchanged (see Complex Conductivity).

References

  1. R. V. Kohn, M. Vogelius (1984). Determining conductivity by boundary measurements. Comm. Pure Appl. Math. 37(3), 289–298. doi:10.1002/cpa.3160370302
  2. J. Sylvester (1990). An anisotropic inverse boundary value problem. Comm. Pure Appl. Math. 43(2), 201–232. doi:10.1002/cpa.3160430203
  3. M. M. Bronstein, J. Bruna, T. Cohen, P. Veličković (2021). Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges. arXiv:2104.13478