Edge-Guided Attention Mechanism

• Edge-guided attention mechanisms are techniques that use edge or relation signals to modulate feature propagation in image and graph models, enhancing structural detail preservation.
• They employ edge-derived maps—via gradients, Laplacian, or wavelet transforms—to guide attention weights, normalization, and feature fusion in encoder–decoder and graph architectures.
• Applications include semantic segmentation, depth estimation, inpainting, and graph relation learning, with studies showing improved accuracy and robustness in boundary-sensitive tasks.

Edge-guided attention mechanism denotes a family of attention, gating, and fusion designs in which edge-related signals are used to control feature propagation, refinement, or interaction. In computer vision, the guiding signal may be an edge map, gradient image, Laplacian or wavelet response, predicted contour, or completed boundary prior; in graph-based models, it may be an explicit edge feature or relation embedding. The common objective is to preserve or recover structure that is often weakened by convolution, pooling, generic feature fusion, or task interference. Representative formulations include geometry-aware local boundary refinement (Polansky et al., 2024), sigmoid edge-transfer gating for semantic image synthesis (Tang et al., 2020), edge-guided spatial attention for transparent-object depth and segmentation (Omotara et al., 18 Nov 2025), Laplacian- and wavelet-driven decoder attention for weak-boundary segmentation (Bui et al., 2023, Tan, 3 Jul 2025), structure-sensitive guided filtering (Zhang et al., 2019), learnable mask propagation for inpainting (Wang et al., 2021), and edge-featured graph attention (Chen et al., 2021).

1. Conceptual scope

In the literature represented here, edge-guided attention has two major meanings. The first is boundary-guided attention in image models: edge information is injected into semantic image synthesis, segmentation, depth estimation, salient object detection, inpainting, super-resolution, and infrared target detection. The second is relation-guided attention in graph models: attention weights are computed not only from node features but also from edge or relation features, or from graph-structured interaction patterns (Tang et al., 2020, Chen et al., 2021, Wang et al., 2018, Priyam et al., 2024).

In image models, the stated motivation is recurrent. Semantic labels are described as too coarse to specify local structure; downsampling, normalization, and ordinary decoder fusion remove useful structural information; and generic attention may fail to respect boundaries or thin structures. Consequently, edge guidance is introduced as an explicit structural prior. ECGAN uses edge as an intermediate representation because semantic labels do not encode detailed local geometry (Tang et al., 2020). AG-Net uses a guided filter as a “structural sensitive expanding path” because standard convolution and pooling filter out useful structural information (Zhang et al., 2019). MEGANet and MEGANet-W are explicitly targeted at “weak boundary” polyp segmentation, where decoder features alone tend to blur fine contour cues (Bui et al., 2023, Tan, 3 Jul 2025). EGD-Net and EGSA-PT make the same point for depth estimation, especially around object borders and transparent regions (Dong et al., 2022, Omotara et al., 18 Nov 2025).

A more geometrically explicit variant appears in Boundary Attention, which defines a geometry-aware local attention operation that is applied densely and repeatedly to refine a pixel-resolution field of variables specifying boundary structure in overlapping patches. Its abstract emphasizes curves, corners, junctions, grouping, local scale, and spatial consistency, and describes the system as bottom-up and analogous to classical sub-pixel edge localization and edge-linking, but learned rather than hand-designed (Polansky et al., 2024).

2. Core computational patterns

A central pattern is multiplicative modulation of features by an edge-derived map, usually followed by a residual or identity-preserving addition. In ECGAN, the edge generator produces intermediate edge features $F_e$ and a generated edge map $I'_e$; both are converted into attention masks by a sigmoid. Feature-level transfer is

$$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$

and image-level transfer is

$I' = \mathrm{Sigmoid}(I'_e)\times I'_i + I'_i.$

The paper explicitly notes that this is not a query-key-value transformer and uses no softmax over spatial positions; attention is sigmoid gating in $[0,1]$ (Tang et al., 2020).

EGSA-PT uses a closely related but cross-task formulation. At decoder scale $k$, depth and segmentation spatial attention maps are amplified by an edge map: $$gated\_seg^{k} = S^{k}_{s} \cdot \big(1 + \beta_{s2d}^{k} \cdot E^{k}\big), \qquad gated\_depth^{k} = S^{k}_{d} \cdot \big(1 + \beta_{d2s}^{k} \cdot E^{k}\big),$$ and then applied cross-wise,

$$\tilde{F}_s^k = F_s^k \odot gated\_depth^{k}, \qquad \tilde{F}_d^k = F_d^k \odot gated\_seg^{k}.$$

The $1+\ldots$ term is emphasized because it preserves the original spatial attention when no edge is present (Omotara et al., 18 Nov 2025).

A second pattern is edge-conditioned normalization. In the super-resolution model with Normalized Edge Attention, an encoded edge representation produces channel-wise affine parameters $(\gamma,\beta)$ and a spatial mask $I'_e$0. The normalized branch is

$I'_e$1

the spatial branch yields $I'_e$2, and the block fuses normalized and spatially attended responses before a residual addition $I'_e$3 (Rao et al., 18 Sep 2025). This suggests a common design preference across several papers: edge guidance is usually implemented as modulation that preserves a base representation rather than replacing it outright.

Graph models instantiate the same principle in a different form. EGAT computes node-attention coefficients from concatenated endpoint-node and edge features,

$I'_e$4

so the relation itself changes the neighbor weight (Chen et al., 2021). LGRANs similarly define separate intra-class and inter-class edge attention distributions conditioned by different language components, making the selected relation structure part of the attention mechanism rather than a post hoc context feature (Wang et al., 2018).

3. Edge sources and structural representations

The edge signal used to guide attention varies substantially across models. Some works rely on classical operators. ECGAN compares edge extraction methods and reports that Canny is better than HED for its setting, because HED edges are described as too thick and prone to artifacts (Tang et al., 2020). EGD-Net uses Sobel $I'_e$5 gradients as input to its edge guidance branch and generates binary edge labels from depth maps using the Laplacian operator (Dong et al., 2022). MEGANet extracts a high-frequency cue from a Laplacian pyramid and propagates it across decoder stages via

$I'_e$6

rather than recomputing deeper pyramid levels, in order to preserve stronger base-level high-frequency information (Bui et al., 2023).

Other works replace single-scale classical operators with richer fixed transforms. MEGANet-W substitutes the Laplacian extractor with a parameter-free two-level Haar wavelet head. The level-$I'_e$7 detail subbands are concatenated as

$I'_e$8

upsampled, and summed into a multi-scale edge signal $I'_e$9. The paper emphasizes directional, multi-resolution boundary evidence and explicitly states that the wavelet head introduces no learnable parameters (Tan, 3 Jul 2025).

A further class predicts edges internally and then uses them for guidance. Edge-LBAM first completes edges with a multi-scale edge completion network and then uses those predicted edges to control mask evolution in the encoder. The key edge-guided mask combination is

$$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$0

so mask propagation is conditioned jointly on the current mask and edge evidence rather than on a handcrafted binary update (Wang et al., 2021). TRACER derives explicit boundary information from shallow features by applying an FFT-based high-pass filter,

$$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$1

then refines it with a receptive-field block before injecting it back into the encoder stream (Lee et al., 2021).

Boundary Attention departs from rasterized edge maps altogether. Its abstract states that the model does not output a rasterized binary edge map but instead a “rich, unrasterized representation of the geometric structure in every local region,” with grouping and local boundary structure represented in overlapping patches (Polansky et al., 2024).

4. Architectural placement and task-specific roles

In encoder-decoder vision models, edge-guided attention is most often placed in the decoder or in a fusion block between encoder and decoder features. MEGANet inserts its Edge-Guided Attention module between the contracting and expanding paths at every resolution level, where it fuses the current encoder feature, a Laplacian-derived high-frequency cue, and an upsampled higher-level decoder prediction (Bui et al., 2023). MEGANet-W preserves this decoder-centric placement but replaces the edge source and expands the fusion into reverse attention, wavelet boundary attention, and input-edge attention, followed by CBAM refinement (Tan, 3 Jul 2025). AG-Net places attention inside a guided-filter-based expanding path, so the attention weights directly reweight the local linear fitting that transfers structural information from low-level to high-level features (Zhang et al., 2019).

In multi-branch models, the mechanism often appears as a dedicated edge branch coupled to a semantic or depth branch. EGD-Net comprises a Multi-scale Feature Extractor, an Edge Guidance Branch, a Transformer-Based Feature Aggregation module, and a decoder. Its Channel Attention-based Feature Fusion module progressively merges edge and backbone features, while TRFA performs bidirectional cross-attention between deep context and edge-attention features (Dong et al., 2022). EGSA-PT also operates in a multi-branch decoder, but its role is specifically to mitigate destructive interactions between transparent-object depth estimation and segmentation by making cross-task fusion boundary-aware (Omotara et al., 18 Nov 2025). DENet generalizes the same idea by fully decoupling semantic modeling and edge refinement into parallel paths and reunifying them through local self-attention, global self-attention, and bidirectional cross-attention at the bottleneck (Zuo et al., 25 Sep 2025).

Generative models use edge-guided attention somewhat differently. ECGAN places the attention-guided edge transfer module between an edge generator and an image generator, using edges to refine both intermediate image features and a coarse image (Tang et al., 2020). The super-resolution model with Normalized Edge Attention inserts edge-conditioned modulation inside a lightweight residual block, using a parallel edge encoder and residual fusion rather than a heavy dual-stream backbone (Rao et al., 18 Sep 2025). Edge-LBAM combines forward edge-guided attention in the encoder with reverse attention in the decoder, making structure-aware hole shrinking and missing-region synthesis part of the same U-Net-like inpainting pipeline (Wang et al., 2021).

Graph formulations move the mechanism from image boundaries to relation structure. EGAT treats edges as first-class learnable entities, with a node attention block and an edge attention block that update node and edge representations in parallel (Chen et al., 2021). LGRANs decompose referring expressions into subject, intra-class relation, and inter-class relation components, then compute separate node and edge attention distributions over a directed object graph (Wang et al., 2018). EDGE-Rec uses Row-Column Separable Attention over a user-item interaction matrix, where the target interaction attends only along its row and column; this is “edge-guided” in the recommender-graph sense because the attended context is defined by the interaction edge being denoised (Priyam et al., 2024).

5. Supervision and training strategies

Edge-guided attention may be trained with explicit edge supervision, indirect architectural pressure, or a curriculum over edge sources. EGD-Net applies binary cross-entropy to the predicted edge map and combines it with a depth loss,

$$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$2

with $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$3 and $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$4 (Dong et al., 2022). Edge-LBAM trains its edge completion network separately and optimizes the full inpainting network with $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$5, adversarial, perceptual, and style losses, while the completed edge prior continues to influence mask updates throughout the encoder-decoder (Wang et al., 2021). TRACER uses an explicit edge loss through its Adaptive Pixel Intensity loss, applied to both saliency outputs and the explicit edge branch (Lee et al., 2021).

Other systems rely more heavily on architectural boundary bias than on a dedicated boundary loss. MEGANet supervises every decoder level with BCE and Dice and states that boundary learning is encouraged indirectly through deep supervision and explicit Laplacian cues rather than by a separate boundary-specific loss (Bui et al., 2023). MEGANet-W likewise retains deep supervision with BCE + Dice while changing the edge extractor and attention block (Tan, 3 Jul 2025). AG-Net integrates attention into the guided-filter objective itself: $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$6 so attention changes the structure-transfer optimization rather than merely weighting a post-filter feature map (Zhang et al., 2019).

A distinctive curriculum appears in EGSA-PT. Training begins with Canny edges from RGB images and later switches progressively to edges extracted from predicted depth maps. The paper frames this as a way to bootstrap learning from stable texture boundaries and then move toward geometry-aware boundaries without requiring ground-truth depth for edge extraction during training (Omotara et al., 18 Nov 2025). This suggests that the source and reliability of edge guidance can itself be scheduled.

6. Empirical behavior

Across tasks, ablations generally support the claim that explicit edge-guided modulation is stronger than omitting the edge path or treating edges as a passive auxiliary signal. In ECGAN’s Cityscapes ablation, B1 $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$7 yields FID 65.7, mIoU 58.6, and Acc 81.4; adding the edge generator in B2 improves them to FID 61.0, mIoU 60.2, and Acc 81.7; adding the attention-guided edge transfer module in B3 further improves them to FID 59.0, mIoU 61.5, and Acc 82.0 (Tang et al., 2020).

EGSA-PT reports that on Syn-TODD, compared with MODEST, $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$8 improves from 65.28 to 68.38, $$F_i^j = \mathrm{Sigmoid}(F_e^j)\times F_i^j + F_i^j,$$9 from 78.23 to 80.16, and $I' = \mathrm{Sigmoid}(I'_e)\times I'_i + I'_i.$0 from 93.05 to 94.45, while RMSE decreases from 0.070 to 0.068, MAE from 0.052 to 0.044, and REL from 0.068 to 0.059. On transparent pixels alone, the gains persist, with $I' = \mathrm{Sigmoid}(I'_e)\times I'_i + I'_i.$1 improving from 90.17 to 91.25 (Omotara et al., 18 Nov 2025). EGD-Net reports that the full model improves a 1.56M-parameter baseline from RMSE 0.520 and REL 0.149 to RMSE 0.486 and REL 0.136 with 2.21M parameters, and runs at about 96 fps on a GTX 1080 GPU (Dong et al., 2022).

Weak-boundary segmentation papers report the same pattern. MEGANet-W states improvements of up to 2.3% mIoU and 1.2% mDice over prior methods while introducing no additional learnable parameters in the wavelet head (Tan, 3 Jul 2025). AG-Net improves over its guided-filter ablation GF-Net on DRIVE by 0.0010 Acc, 0.0019 AUC, 0.0205 Sensitivity, and 0.0126 IOU, which the paper uses as direct evidence that attention adds value on top of structural filtering (Zhang et al., 2019). In graph learning, EGAT reaches best reported accuracies of 92.0% on Trade-B and 85.4% on Trade-M, outperforming GAT variants that manually pool edge features into nodes (Chen et al., 2021).

The reported limitations are also consistent. ECGAN notes that the quality of edge guidance matters and that HED can be too thick and artifact-prone for its setting (Tang et al., 2020). MEGANet reports that on Kvasir the version without the high-frequency feature $I' = \mathrm{Sigmoid}(I'_e)\times I'_i + I'_i.$2 slightly outperforms the full model, which the authors attribute to noisy mucosal background contaminating the Laplacian cue (Bui et al., 2023). Several papers therefore imply that edge-guided attention is beneficial when the edge prior is reliable, but it can amplify nuisance structure when the prior itself is noisy.

7. Conceptual boundaries and recurrent misconceptions

A recurring misconception is to treat any edge-related auxiliary branch as an edge-guided attention mechanism. The surveyed literature distinguishes more sharply. Edge-LBAM reports that simply concatenating edge maps is weaker than explicit edge-guided attention and reverse attention (Wang et al., 2021). DenseMTL explicitly states that it does not propose an edge-guided attention module in the usual sense; it is better described as cross-task attention with edge estimation as one participating task, so it is edge-aware or edge-assisted rather than explicitly edge-guided (Lopes et al., 2022).

Another boundary concerns the meaning of “edge” itself. In computer vision papers such as ECGAN, MEGANet, EGD-Net, TRACER, and DENet, “edge” refers to image boundaries, high-frequency detail, or contour structure (Tang et al., 2020, Bui et al., 2023, Dong et al., 2022, Lee et al., 2021, Zuo et al., 25 Sep 2025). In EGAT and LGRANs, it refers to graph relations or object-object edges in a structured representation (Chen et al., 2021, Wang et al., 2018). In EAT, by contrast, the “attention-guided” component operates on edge-server load and queue state for task scheduling; the term “edge” there refers to edge computing rather than boundary cues (Xu et al., 14 Jul 2025).

The literature therefore supports a narrower technical definition: an edge-guided attention mechanism is not merely an architecture that predicts edges, nor merely one that uses generic attention in an edge-related task. It is a mechanism in which edge, boundary, or relation structure directly modulates attention weights, gating coefficients, normalization parameters, mask evolution, or cross-branch interaction. This narrower reading aligns the otherwise diverse formulations surveyed here, from geometry-aware local boundary refinement and decoder-side contour fusion to graph attention with explicit edge features (Polansky et al., 2024, Omotara et al., 18 Nov 2025, Chen et al., 2021).