OCT Angiography (OCTA) L1-050
Unclaimed Principle — open for contribution
This Principle is declared in the catalog but has no reference solver, no pinned dataset, and is not registered on-chain. There is no reward pool. Submitting a cert against this Principle today will record the cert for reproducibility but pay zero PWM.
To claim it as a Bounty #7 contribution: open a PR adding (1) a reference solver, (2) ≥1 dataset pinned to IPFS, (3) updates to the L3 manifest with dataset CIDs. After verifier-agent triple-review, the founders' 3-of-5 multisig signs PWMRegistry.register() and the Principle becomes mineable.
Forward model E
OCT Angiography (OCTA): oct angiography produces the measurement through a 4-node primitive DAG L.sd_oct_spectral -> L.decorrelation -> S.scan.repeated -> int.temporal, with time-integrated exposure and additive Gaussian thermal/electronic noise. Recovery is posed as a non-convex inverse problem that inverts the forward operator to estimate the scene-side 3D vascular network. Difficulty tier delta=3 with effective condition number kappa_eff~13; calibration-level mismatch (eye_motion, signal_strength_variation, projection_artifact) sets the accuracy floor at the Omega boundary. See the forward_model field for the closed-form imaging equation.
L-DAG
Well-posedness W
- Existence:
- true
- Uniqueness:
- true
- Stability:
- conditional
- κ:
- 260
Existence of the recovered 3D vascular network is guaranteed within the declared Omega bounds. Uniqueness is local rather than global (non-convex landscape); convergence depends on initialisation and priors. Stability is moderately conditioned (kappa_eff ~= 13); eye_motion dominates the stability cliff; signal_strength_variation and the remaining mismatch parameters contribute higher-order bias terms. Additive gaussian thermal/electronic noise sets the irreducible data-fidelity floor, while mild Tikhonov or analytic inversion is sufficient at the nominal Omega point.
Solvability C
- Solver class:
- linear-operator + convex optimisation [Amplitude-Decorr, SSADA] | linear-operator + deep neural prior [OCTA-Net]
- Convergence rate q:
- 2
- Complexity:
- O(H * W * Z * log(...)) per iteration; learned variants: O(H W Z * F_theta_cost) per forward pass