HomeDocs-Technical WhitePaper26-EFT.WP.STG.Lensing v1.0

Chapter 6 — Feature Lenses and Saliency (Bands / Morphology / Path Sparsity)


One-sentence goal: Construct feature lenses on graph spectra to extract salient structure by unifying three mechanisms—band filtering, morphological operators, and path sparsity—under parallel spectral–variational formulations, with auditable saliency measures and selection.


I. Scope & Objects

  1. Inputs
    • Graph & operators: G = (V, E, w), L or L^vis / L_ani (see Chapters 4/5), with unit(L) = 1, dim(L) = [1].
    • Signal: x_in ∈ R^{|V|} (scalar, or per-channel independently).
    • Band design: band set B = { b }, per-band kernel g_b(λ) and weights a_b ≥ 0.
    • Morphological structuring element: S_r (geodesic ball of radius r on the graph).
    • Candidate path set: Γ = { gamma_k(ell) }, or spline candidates from shortest paths / manifold tangents.
    • Runtime parameters: mode ∈ { offline, streaming }, window win = { Δt_win, Δt_slide }.
  2. Outputs
    • Band responses x_b = g_b(L_*) x_in, morphological response x_morph, selected sparse paths Γ_sel ⊆ Γ with coefficients α.
    • Saliency map Sal ∈ R^{|V|}_{≥0}, mask Mask ∈ {0,1}^{|V|}.
    • Dual-form gap delta_form_lens (spectral kernels vs. variational forms).
  3. Constraints & boundaries
    • unit(x_b) = unit(x_in); morphological residuals share the same units; path measures are explicit as ( ∫_{gamma_k(ell)} • d ell ).
    • Anisotropy/visibility are optional; unify with L_* ∈ { L, L^vis, L_ani }.

II. Terms & Variables


III. Postulates P716-*


IV. Minimal Equations S716-*

  1. S716-1 (Band feature lenses)
    • Band-pass kernels: g_b(λ) = exp( − τ_{b,lo} λ ) − exp( − τ_{b,hi} λ ) or g_b(λ) = (1+β_{b,lo}λ)^{−1} − (1+β_{b,hi}λ)^{−1}, with τ_{b,hi} > τ_{b,lo}.
    • Spectral realization: x_b = U g_b(Λ) U^T x_in;
    • Variational equivalence (quadratic case):
      x_b = argmin_x ( (1/2)||x − x_in||_2^2 + (β_{b,lo}/2) x^T L_* x ) − argmin_x ( (1/2)||x − x_in||_2^2 + (β_{b,hi}/2) x^T L_* x ).
  2. S716-2 (Morphological saliency)
    • grad_m(i; r) = dilate(x_in; r)_i − erode(x_in; r)_i;
    • Top-hat: top_hat(i; r) = x_in(i) − open(x_in; r)_i;
    • Normalization: Sal_morph = norm( grad_m ⊙ mask_vis ), where mask_vis(i) = 1_{ vis_i > 0 }.
  3. S716-3 (Path sparsity & selection)
    • Sparse coding: α = argmin_{α} ( (1/2)|| x_in − D_P α ||_2^2 + λ ||α||_1 );
    • Path-wise saliency: Sal_path(i) = ∑_{k: i∈gamma_k} |α_k| / L_k;
    • Variational equivalence (TV–path): x' = argmin_x ( (1/2)||x − x_in||_2^2 + λ || B_P x ||_1 ).
  4. S716-4 (Bandwise saliency aggregation)
    • Spectral energy density: Sal_spec(i) = ∑_{b∈B} a_b * ( x_b(i) )^2;
    • Normalized decision: Mask(i) = 1_{ Sal(i) ≥ τ_s }, with Sal = w_spec*Sal_spec + w_morph*Sal_morph + w_path*Sal_path.
  5. S716-5 (Dual-form gap & stability)
    • Per-band gap: delta_b = || x_{b,spec} − x_{b,var} ||_2;
    • Total gap: delta_form_lens = ( ∑_b delta_b^2 )^{1/2 }; require ρ( g_b(L_*) ) ≤ 1 + ε_b to keep energy bounded.

V. Metrology Pipeline M71-6 (Design → Solve → Aggregate → Verify → Persist)

  1. Design bands: choose B, g_b(λ), and weights a_b; choose L_* (visible/anisotropic).
  2. Spectral approximation: generate Chebyshev or Lanczos approximations for each g_b; set order_b and λ_max.
  3. Solve in dual forms:
    • Spectral: use polynomial–vector iterations to obtain each x_b;
    • Variational: solve the corresponding quadratic/TV problems via CG / primal–dual to get x_{b,var} and path-sparsity α.
  4. Morphology: compute grad_m / top_hat for r ∈ R_set, and multiply by the vis mask to suppress occlusion artifacts.
  5. Path sparsity: build D_P / B_P, solve for α and Sal_path; optionally perform non-maximum suppression along gamma_k.
  6. Saliency aggregation: form Sal and Mask; choose adaptive threshold τ_s = median(Sal) + κ * mad(Sal).
  7. Checks & publication: evaluate coverage_s, δ overlap, err_spec∞, delta_form_lens, sparsity_level; write to manifest.lens.

VI. Contracts & Assertions C71-6x (suggested thresholds)


VII. Implementation Bindings I71-6* (interfaces, I/O, invariants)


VIII. Cross-References


IX. Quality & Risk Control


Summary


Copyright & License (CC BY 4.0)

Copyright: Unless otherwise noted, the copyright of “Energy Filament Theory” (text, charts, illustrations, symbols, and formulas) belongs to the author “Guanglin Tu”.
License: This work is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0). You may copy, redistribute, excerpt, adapt, and share for commercial or non‑commercial purposes with proper attribution.
Suggested attribution: Author: “Guanglin Tu”; Work: “Energy Filament Theory”; Source: energyfilament.org; License: CC BY 4.0.

First published: 2025-11-11|Current version:v5.1
License link:https://creativecommons.org/licenses/by/4.0/