pith. sign in

arxiv: 2504.15770 · v1 · submitted 2025-04-22 · 💻 cs.CV

Multi-Scale Tensorial Summation and Dimensional Reduction Guided Neural Network for Edge Detection

Pith reviewed 2026-05-22 18:21 UTC · model grok-4.3

classification 💻 cs.CV
keywords edge detectionneural networksmulti-scale tensorial summationdimensional reductioncomputer visiondeep learningimage processing
0
0 comments X

The pith

A neural network for edge detection applies multi-scale tensorial summation followed by dimensional reduction blocks to discard redundant subspaces early and focus on essential edge features.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes MTS-DR-Net, a new architecture that integrates multi-scale tensorial summation layers to create large receptive fields from the very first layers without building deep stacks. It then inserts MTS-DR blocks that perform dimensional reduction by removing redundant information, letting the network attend only to the subspaces needed for accurate edge detection. A weight U-shaped refinement module processes the output afterward. Experiments on the BSDS500 and BIPEDv2 datasets are used to show that this backbone improves focus on relevant features for the task.

Core claim

The central claim is that MTS layers combined with MTS-DR blocks form an effective backbone that removes redundant information at the outset, enabling the network to concentrate specifically on necessary subspaces for edge detection rather than processing all information uniformly.

What carries the argument

MTS Dimensional Reduction (MTS-DR) blocks, which apply the multi-scale tensorial summation factorization operator and then reduce dimensions to prune redundant subspaces while keeping edge-relevant information.

If this is right

  • Large receptive fields become available in early layers without adding many consecutive convolutions.
  • The network can prioritize subspaces that carry edge information instead of processing full feature volumes.
  • A refinement stage after the MTS-DR blocks can produce cleaner edge maps on benchmark datasets.
  • The overall structure offers an alternative to deep networks for tasks that need wide context from the start.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same early pruning approach could be tested on related pixel-wise tasks such as semantic segmentation or depth estimation to see if redundant subspace removal transfers.
  • Real-time applications on resource-limited devices might benefit from measuring whether the reduced feature volumes lower memory use while holding detection quality steady.
  • Future versions could make the reduction strength depend on local image content rather than fixed blocks.

Load-bearing premise

That the MTS factorization operator together with the dimensional reduction blocks will keep all necessary edge information and discard only redundant subspaces without creating artifacts that hurt detection on real images.

What would settle it

If MTS-DR-Net produces lower edge detection scores than standard convolutional networks on noisy or finely detailed real-world images, that would indicate loss of critical information during the reduction step.

Figures

Figures reproduced from arXiv: 2504.15770 by Lei Xu, Mehmet Yamac, Mete Ahishali, Moncef Gabbouj.

Figure 1
Figure 1. Figure 1: ODS vs. GFLOPs on BSDS500 dataset under “Thin” [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An Example of the MTS Layer with Window Scales [8, [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Overall framework of the proposed MTS-DR-Net. It consists of two modules: a MTS-DR backbone and a refinement network. [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: MHG layer and MTS Dimension Reduction (MTS-DR) [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The architecture of the Refinement Network [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Some examples of feature maps on BSDS500 with MTS-DR-1. 5.2. Implementation Details We carry out our experiments with Pytorch on the NVIDIA GPU cluster platform. The proposed models are trained for 30 epochs on BIPEDv2 and 20 epochs on BSDS500 with a batch size of 4. The models are trained with the Adam optimizer [15]. The learning rate is initially set to 0.005 and decays at epoch 15 with an exponential s… view at source ↗
Figure 7
Figure 7. Figure 7: Some examples of feature maps on BIPEDv2 with MTS-DR-1. Method Thin Raw mean Precision mean IOU Params GFLOPs ODS OIS ODS OIS TEED [32] 0.704 0.711 0.614 0.614 0.8294 0.5378 58.91K 0.955 Pidinet [36] 0.691 0.693 0.612 0.613 0.7926 0.5848 710.149K 10.56 DexiNed [34] 0.707 0.710 0.636 0.642 0.8073 0.5913 35.215M 66.943 XYW-Net [24] 0.720 0.737 0.639 0.648 0.8202 0.5861 808.831K 11.042 MTS-DR-1 (M = 2, C = 32… view at source ↗
Figure 9
Figure 9. Figure 9: Visual results on BIPEDv2. (a) Input image. (b) Ground truth. (c) MTS-DR-1. (d) TEED [32]. (e) XYW-Net [24]. (f) Pidinet [36]. (g) DexiNed [34]. ting. The MTS-DR-3 obtains 2.6% higher Mean Precision and 2.8% higher mean IOU than XYW-Net but with 40.9% less parameters and 56.9% lower GFLOPs. As shown in [PITH_FULL_IMAGE:figures/full_fig_p007_9.png] view at source ↗
read the original abstract

Edge detection has attracted considerable attention thanks to its exceptional ability to enhance performance in downstream computer vision tasks. In recent years, various deep learning methods have been explored for edge detection tasks resulting in a significant performance improvement compared to conventional computer vision algorithms. In neural networks, edge detection tasks require considerably large receptive fields to provide satisfactory performance. In a typical convolutional operation, such a large receptive field can be achieved by utilizing a significant number of consecutive layers, which yields deep network structures. Recently, a Multi-scale Tensorial Summation (MTS) factorization operator was presented, which can achieve very large receptive fields even from the initial layers. In this paper, we propose a novel MTS Dimensional Reduction (MTS-DR) module guided neural network, MTS-DR-Net, for the edge detection task. The MTS-DR-Net uses MTS layers, and corresponding MTS-DR blocks as a new backbone to remove redundant information initially. Such a dimensional reduction module enables the neural network to focus specifically on relevant information (i.e., necessary subspaces). Finally, a weight U-shaped refinement module follows MTS-DR blocks in the MTS-DR-Net. We conducted extensive experiments on two benchmark edge detection datasets: BSDS500 and BIPEDv2 to verify the effectiveness of our model. The implementation of the proposed MTS-DR-Net can be found at https://github.com/LeiXuAI/MTS-DR-Net.git.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces MTS-DR-Net, a neural network for edge detection that uses Multi-Scale Tensorial Summation (MTS) layers combined with novel MTS Dimensional Reduction (MTS-DR) blocks as a backbone. These blocks are intended to remove redundant information early, enabling the network to focus on necessary subspaces for edges, followed by a weighted U-shaped refinement module. Experiments are reported on the BSDS500 and BIPEDv2 benchmarks to demonstrate effectiveness.

Significance. If the central performance claims hold with proper validation, the approach could provide a useful alternative backbone for edge detection by achieving large receptive fields without deep layer stacking and by explicitly incorporating dimensional reduction to prune subspaces. The reproducibility via the provided GitHub link is a positive factor.

major comments (2)
  1. [§3 (MTS-DR blocks description)] The core claim that MTS-DR blocks remove only redundant subspaces while fully preserving necessary edge information (abstract and §3) is load-bearing but unsupported. The MTS operator performs linear summation over scales, and the subsequent DR projects to lower dimensions; no subspace preservation analysis, reconstruction metrics on edge features, or ablation isolating DR's effect on fine textures/low-contrast boundaries is presented to rule out irreversible loss of edge cues.
  2. [Experiments section / Table 1] Table 1 or equivalent results section: without reported quantitative metrics (ODS, OIS, AP), ablation studies on the DR component, or error analysis comparing MTS-DR-Net against MTS-only variants on BSDS500 and BIPEDv2, the effectiveness claim cannot be assessed and the experiments do not yet substantiate the architectural novelty.
minor comments (2)
  1. [Abstract] The abstract mentions 'extensive experiments' but omits all numerical results; including key metrics would strengthen the summary.
  2. [§3] Notation for the MTS factorization and the exact form of the dimensional reduction operator should be defined with equations in §3 to improve clarity and allow readers to verify the projection properties.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and constructive suggestions. We address the major comments below and outline the revisions planned for the manuscript.

read point-by-point responses
  1. Referee: [§3 (MTS-DR blocks description)] The core claim that MTS-DR blocks remove only redundant subspaces while fully preserving necessary edge information (abstract and §3) is load-bearing but unsupported. The MTS operator performs linear summation over scales, and the subsequent DR projects to lower dimensions; no subspace preservation analysis, reconstruction metrics on edge features, or ablation isolating DR's effect on fine textures/low-contrast boundaries is presented to rule out irreversible loss of edge cues.

    Authors: We agree that additional supporting analysis would strengthen the manuscript. The MTS-DR block is designed to perform dimensional reduction after multi-scale tensorial summation to focus on relevant subspaces for edge detection. To address this, we will add a new subsection in the revised paper with subspace preservation analysis, including reconstruction error metrics on edge-related features and an ablation study isolating the effect of the DR component on fine textures and low-contrast boundaries. revision: yes

  2. Referee: [Experiments section / Table 1] Table 1 or equivalent results section: without reported quantitative metrics (ODS, OIS, AP), ablation studies on the DR component, or error analysis comparing MTS-DR-Net against MTS-only variants on BSDS500 and BIPEDv2, the effectiveness claim cannot be assessed and the experiments do not yet substantiate the architectural novelty.

    Authors: We acknowledge that the current experimental section would benefit from more detailed quantitative reporting and ablations. While our experiments demonstrate effectiveness on the mentioned datasets, we will revise the results section to include standard metrics such as ODS, OIS, and AP in Table 1, add ablation studies specifically on the DR component, and include error analysis or comparative visualizations against MTS-only variants to better highlight the contribution of the dimensional reduction. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper cites a recently presented MTS factorization operator to motivate large receptive fields from initial layers and then introduces MTS-DR blocks as a novel dimensional reduction module for edge detection. This is framed as an empirical engineering decision, with effectiveness verified through standard benchmark experiments on BSDS500 and BIPEDv2. No equations, predictions, or central claims reduce by construction to fitted parameters, self-definitions, or unverified self-citation chains; the derivation remains self-contained with independent content from the new DR module and external validation.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claim rests on the effectiveness of the MTS operator (taken from recent prior work) and the assumption that dimensional reduction preserves edge-relevant subspaces. No new physical entities are postulated; standard neural-network training assumptions apply.

free parameters (1)
  • Network hyperparameters and layer dimensions
    Typical learned or tuned parameters in any deep network; their specific values are not enumerated in the abstract.
axioms (2)
  • domain assumption MTS factorization operator achieves very large receptive fields from initial layers
    Invoked in the abstract as the foundation for the new backbone.
  • ad hoc to paper Dimensional reduction removes only redundant information while retaining necessary subspaces for edges
    Central modeling choice introduced by the MTS-DR module.

pith-pipeline@v0.9.0 · 5785 in / 1295 out tokens · 52783 ms · 2026-05-22T18:21:11.762602+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

53 extracted references · 53 canonical work pages · 1 internal anchor

  1. [1]

    Arbel ´aes, M

    P. Arbel ´aes, M. Maire, C. Fowlkes, and J. Malik. Contour Detection and Hierarchical Image Segmentaion.IEEE Trans. Pattern Anal. Mach. Intell., 33(5):898–916, 2011

  2. [2]

    Bertasius, J

    G. Bertasius, J. Shi, and L. Torresani. Deepedge: A multi- scale bifurcated deep network for top-down contour detec- tion. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 4380–4389, 2015

  3. [3]

    J. Canny. A Computational Approach to Edge Detection. IEEE Transactions on Pattern Analysis and Machine Intelli- gence, PAMI-8(6):679–698, 1986

  4. [4]

    Cetinkaya, S

    B. Cetinkaya, S. Kalkan, and E. Akbas. Ranked: Addressing imbalance and uncertainty in edge detection using ranking- based losses. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 3239– 3249, 2024

  5. [5]

    L. Chen, X. Chu, X. Zhang, and J. Sun. Simple baselines for image restoration. In European conference on computer vision, pages 17–33. Springer, 2022

  6. [6]

    X. Chen, X. Wang, Y . Lu, W. Li, Z. Wang, and Z. Huang. RBPNET: An asymptotic Residual Back-Projection Network for super-resolution of very low-resolution face image. Neu- rocomputing, 376:119–127, 2020

  7. [7]

    Y . N. Dauphin, A. Fan, M. Auli, and D. Grangier. Language modeling with gated convolutional networks. In D. Precup and Y . W. Teh, editors,Proceedings of the 34th International Conference on Machine Learning, volume 70 ofProceedings of Machine Learning Research, pages 933–941. PMLR, 06– 11 Aug 2017

  8. [8]

    N. Du, Y . Huang, A. M. Dai, S. Tong, D. Lepikhin, Y . Xu, M. Krikun, Y . Zhou, A. W. Yu, O. Firat, et al. Glam: Effi- cient scaling of language models with mixture-of-experts. In International conference on machine learning, pages 5547–

  9. [9]

    W. Gao, L. Yang, X. Zhang, and H. Liu. An improved Sobel edge detection. Proceedings - 2010 3rd IEEE International Conference on Computer Science and Information Technol- ogy, ICCSIT 2010, 5:67–71, 2010

  10. [10]

    K. Han, Y . Wang, Q. Tian, J. Guo, C. Xu, and C. Xu. Ghost- net: More features from cheap operations. 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 1577–1586, 2019

  11. [11]

    K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learn- ing for image recognition. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 770–778, 2016

  12. [12]

    Gaussian Error Linear Units (GELUs)

    D. Hendrycks and K. Gimpel. Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415, 2016

  13. [13]

    R. A. Jacobs, M. I. Jordan, S. J. Nowlan, and G. E. Hin- ton. Adaptive mixtures of local experts. Neural Computa- tion, 3:79–87, 1991

  14. [14]

    Kalra and R

    A. Kalra and R. L. Chhokar. A hybrid approach using so- bel and canny operator for digital image edge detection. Proceedings - 2016 International Conference on Micro- Electronics and Telecommunication Engineering, ICMETE 2016, pages 305–310, 2016

  15. [15]

    D. P. Kingma and J. Ba. Adam: A method for stochastic op- timization. In Y . Bengio and Y . LeCun, editors,3rd Interna- tional Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Pro- ceedings, 2015

  16. [16]

    Y . Liu, M. M. Cheng, X. Hu, J. W. Bian, L. Zhang, X. Bai, and J. Tang. Richer Convolutional Features for Edge Detec- tion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(8):1939–1946, 2019

  17. [17]

    D. R. Martin, C. C. Fowlkes, and J. Malik. Learning to de- tect natural image boundaries using local brightness, color, and texture cues. IEEE Trans. Pattern Anal. Mach. Intell. , 26(5):530–549, May 2004

  18. [18]

    D. A. M ´ely, J. Kim, M. McGill, Y . Guo, and T. Serre. A sys- tematic comparison between visual cues for boundary detec- tion. Vision research, 120:93–107, 2016

  19. [19]

    Nair and G

    V . Nair and G. E. Hinton. Rectified linear units improve restricted boltzmann machines. In Proceedings of the 27th international conference on machine learning (ICML-10) , pages 807–814, 2010

  20. [20]

    Novikov, D

    A. Novikov, D. Podoprikhin, A. Osokin, and D. P. Vetrov. Tensorizing neural networks. Advances in neural informa- tion processing systems, 28, 2015

  21. [21]

    S. Oh, N. Park, J.-G. Jang, L. Sael, and U. Kang. High- performance tucker factorization on heterogeneous plat- forms. IEEE Transactions on Parallel and Distributed Sys- tems, 30(10):2237–2248, 2019

  22. [22]

    I. V . Oseledets. Tensor-train decomposition. SIAM Journal on Scientific Computing, 33(5):2295–2317, Jan. 2011

  23. [23]

    Panagakis, J

    Y . Panagakis, J. Kossaifi, G. G. Chrysos, J. Oldfield, M. A. Nicolaou, A. Anandkumar, and S. Zafeiriou. Tensor methods in computer vision and deep learning. Proceedings of the IEEE, 109(5):863–890, 2021

  24. [24]

    X. Pang, C. Lin, F. Li, and Y . Pan. Bio-inspired xyw par- allel pathway edge detection network. Expert Systems with Applications, 237:121649, 2024

  25. [25]

    A.-H. Phan, K. Sobolev, K. Sozykin, D. Ermilov, J. Gusak, P. Tichavsk`y, V . Glukhov, I. Oseledets, and A. Cichocki. Sta- ble low-rank tensor decomposition for compression of con- volutional neural network. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XXIX 16, pages 522–539. Springer, 2020

  26. [26]

    M. Pu, Y . Huang, Q. Guan, and H. Ling. RINDNet: Edge De- tection for Discontinuity in Reflectance, Illumination, Nor- mal and Depth. Proceedings of the IEEE International Con- ference on Computer Vision, pages 6859–6868, 2021

  27. [27]

    M. Pu, Y . Huang, Y . Liu, Q. Guan, and H. Ling. Edter: Edge detection with transformer. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pages 1402–1412, 2022

  28. [28]

    X. Ren, C. C. Fowlkes, and J. Malik. Scale-invariant contour completion using conditional random fields. In Tenth IEEE International Conference on Computer Vision (ICCV’05) Volume 1, volume 2, pages 1214–1221. IEEE, 2005

  29. [29]

    N. S. Sanjay and A. Ahmadinia. Mobilenet-tiny: A deep neural network-based real-time object detection for rasberry 4329 pi. 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA), pages 647–652, 2019

  30. [30]

    SIfre and S

    L. SIfre and S. Mallat. Rigid-motion scattering for texture classiflcation. International Journal of Computer Vision , 2014

  31. [31]

    Singh and R

    S. Singh and R. Singh. Comparison of various edge detec- tion techniques. 2015 International Conference on Comput- ing for Sustainable Global Development, INDIACom 2015 , 9(2):393–396, 2015

  32. [32]

    Soria, Y

    X. Soria, Y . Li, M. Rouhani, and A. D. Sappa. Tiny and Effi- cient Model for the Edge Detection Generalization.Proceed- ings - 2023 IEEE/CVF International Conference on Com- puter Vision Workshops, ICCVW 2023 , pages 1356–1365, 2023

  33. [33]

    Soria, G

    X. Soria, G. Pomboza-Junez, and A. D. Sappa. Ldc: Lightweight dense cnn for edge detection. IEEE Access , 10:68281–68290, 2022

  34. [34]

    Soria, E

    X. Soria, E. Riba, and A. Sappa. Dense extreme inception network: Towards a robust CNN model for edge detection. Proceedings - 2020 IEEE Winter Conference on Applications of Computer Vision, WACV 2020, pages 1912–1921, 2020

  35. [35]

    Z. Su, L. Fang, W. Kang, D. Hu, M. Pietik ¨ainen, and L. Liu. Dynamic group convolution for accelerating convolutional neural networks. In Computer Vision–ECCV 2020: 16th Eu- ropean Conference, Glasgow, UK, August 23–28, 2020, Pro- ceedings, Part VI 16, pages 138–155. Springer, 2020

  36. [36]

    Z. Sun, W. Liu, Z. Yu, D. Hu, Q. Liao, Q. Tian, M. Pietik ¨ainen, and L. Liu. Pixel Difference Networks for Efficient Edge Detection. Proceedings of the IEEE Inter- national Conference on Computer Vision, pages 5097–5107, 2021

  37. [37]

    L. R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31:279–311, 1966

  38. [38]

    Y . Wang, X. Zhao, Y . Li, and K. Huang. Deep crisp bound- aries: From boundaries to higher-level tasks. IEEE Transac- tions on Image Processing, 28(3):1285–1298, 2019

  39. [39]

    Xie and Z

    S. Xie and Z. Tu. Holistically-Nested Edge Detection. Inter- national Journal of Computer Vision, 125(1-3):3–18, 2017

  40. [40]

    D. Xu, W. Ouyang, X. Alameda-Pineda, E. Ricci, X. Wang, and N. Sebe. Learning deep structured multi-scale features using attention-gated crfs for contour prediction. Advances in neural information processing systems, 30, 2017

  41. [41]

    Xu and M

    L. Xu and M. Gabbouj. Revisiting Generative Adversarial Networks for Binary Semantic Segmentation on Imbalanced Datasets. pages 1–14, 2024

  42. [42]

    W. Xuan, S. Zhao, Y . Yao, J. Liu, T. Liu, Y . Chen, B. Du, and D. Tao. Pnt-edge: Towards robust edge detection with noisy labels by learning pixel-level noise transitions. In Proceed- ings of the 31st ACM International Conference on Multime- dia, pages 1924–1932, 2023

  43. [43]

    Yamac, U

    M. Yamac, U. Akpinar, E. Sahin, S. Kiranyaz, and M. Gab- bouj. Generalized tensor summation compressive sensing network (gtsnet): An easy to learn compressive sensing op- eration. IEEE Transactions on Image Processing, 32:5637– 5651, 2023. Publisher Copyright: © 2023 IEEE

  44. [44]

    Yamac ¸, M

    M. Yamac ¸, M. N. Yousaf, S. Kiranyaz, and M. Gabbouj. Multiscale tensor summation factorization as a new neural network layer (mts layer) for multidimensional data process- ing. In arXiv: 2504.13975, 2025

  45. [45]

    B. Yang, G. Bender, Q. V . Le, and J. Ngiam. Condconv: Conditionally parameterized convolutions for efficient infer- ence. Advances in neural information processing systems , 32, 2019

  46. [46]

    F. Yang, L. Zhang, S. Yu, D. Prokhorov, X. Mei, and H. Ling. Feature Pyramid and Hierarchical Boosting Network for Pavement Crack Detection.IEEE Transactions on Intelligent Transportation Systems, pages 1–11, 2019

  47. [47]

    Y . Ye, K. Xu, Y . Huang, R. Yi, and Z. Cai. Diffusionedge: Diffusion probabilistic model for crisp edge detection. In Proceedings of the AAAI conference on artificial intelli- gence, volume 38, pages 6675–6683, 2024

  48. [48]

    Y . Ye, R. Yi, Z. Gao, Z. Cai, and K. Xu. Delving into crisp- ness: Guided label refinement for crisp edge detection.IEEE Transactions on Image Processing, 32:4199–4211, 2023

  49. [49]

    M. Yin, Y . Sui, S. Liao, and B. Yuan. Towards efficient ten- sor decomposition-based dnn model compression with opti- mization framework. In Proceedings of the IEEE/CVF Con- ference on Computer Vision and Pattern Recognition, pages 10674–10683, 2021

  50. [50]

    C. You, L. Jiao, X. Liu, L. Li, F. Liu, W. Ma, and S. Yang. Boundary-Aware Multiscale Learning Perception for Re- mote Sensing Image Segmentation. IEEE Transactions on Geoscience and Remote Sensing, 61:1–15, 2023

  51. [51]

    Zhang, R

    M. Zhang, R. Zhang, Y . Yang, H. Bai, J. Zhang, and J. Guo. ISNet: Shape Matters for Infrared Small Target Detection. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition , 2022-June:867– 876, 2022

  52. [52]

    C. Zhou, Y . Huang, M. Pu, Q. Guan, R. Deng, and H. Ling. Muge: Multiple granularity edge detection. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 25952–25962, 2024

  53. [53]

    Zniyed, T

    Y . Zniyed, T. P. Nguyen, et al. Enhanced network com- pression through tensor decompositions and pruning. IEEE transactions on neural networks and learning systems, 2024. 4330