Pith. sign in

REVIEW 4 major objections 4 minor 4 cited by

RUN: Reversible Unfolding Network for Concealed Object Segmentation

T0 review · 4 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Deep unfolding with reversible RGB-mask modeling achieves state-of-the-art concealed object segmentation.

desk verdict A solid first deep-unfolding paper for concealed object segmentation whose empirical breadth is real, but the claimed theoretical grounding is overstated because the ℓ1 surrogate step is not a proximal-gradient update. read the letter →

arxiv 2501.18783 v2 pith:ORUYOKR5 submitted 2025-01-30 cs.CV

Chunming He , Rihan Zhang , Fengyang Xiao , Chengyu Fang , Longxiang Tang , Yulun Zhang , Linghe Kong , Deng-Ping Fan
show 2 more authors
Kai Li Sina Farsiu
This is my paper · ORCID
classification cs.CV
keywords concealedobjectsegmentationdeepunfoldingnetworkreversiblemodelingforeground-backgroundseparationresidualsparsityconstraintvisualstatespaceimagereconstructioncamouflageddetection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper sets out to prove that concealed object segmentation, finding objects that blend into their background, improves when the reversible reasoning between foreground and background is carried out not only on prediction masks but also on the RGB image itself. To do this it introduces RUN, a network built by unrolling the proximal-gradient iterations of an explicit image-decomposition model into four stages, each containing a mask-domain module (SOFS) and an image-domain module (ROBE). The paper's central claim is that jointly optimizing segmentation and image reconstruction directs the network to uncertain regions and reduces both false positives and false negatives. If the claim holds, a low-level-vision technique, deep unfolding, transfers to high-level vision, and reconstruction becomes a principled component of segmentation rather than a separate auxiliary output.

What carries the argument

The load-bearing mechanism is the alternating proximal-gradient pair derived from Eq. (4): the mask update $\hat{M}_k = (Q_a)^{-1}(Q_b M_{k-1} + C^2 - C B_{k-1} + Q_c)$ and the background update $\hat{B}_k = ((1+\lambda)I)^{-1}(\lambda B_{k-1} + C - C \cdot M_k)$, whose connections dictate how priors and image combine at every stage and give RUN its interpretability. The residual sparsity certainty map $(f_M, w)$ of Eq. (5) injects the concealed-object inductive bias, pushing masks to high certainty and ignoring the ambiguous band, and it is the component RUN ablates in variants CM1 through CM5. The two learned refiners are the Reversible State Space module, two Visual State Space blocks with small and large receptive fields plus an auxiliary edge output, for the mask domain, and the lightweight U-shaped reconstruction network $\mathcal{B}(\cdot)$ that outputs both the refined background and the reconstructed image for the RGB domain.

What would settle it

A direct test: retrain RUN with the residual sparsity term removed ($\alpha = 0$) and with $f_M$ set to the identity, keeping all other components identical, then compare on COD10K and on the transparent-object datasets GDD and GSD; if the metrics do not degrade, the uncertainty-removal model is not the source of the reported gains.

Watch

Extended reading notes

Core claim

RUN models a concealed image $C$ as a foreground term plus background, $C = C \cdot M + B$, where $M$ is the segmentation mask. To the usual data-fidelity and regularization terms it adds a residual sparsity constraint $S(w \cdot (M - f_M))$ whose target map $f_M$ forces confident pixels toward 0.1 or 0.9 and whose weight $w$ zeroes out ambiguous pixels in [0.4, 0.6]. The alternating proximal-gradient update for $M$ and $B$ is then unfolded into $K$ network stages: SOFS applies the closed-form mask update and refines it with a Reversible State Space module built from two Visual State Space blocks, while ROBE applies the closed-form background update and refines it with a lightweight U-shaped reconstruction network that also outputs the reconstructed image $\hat{C}_k$. Because the foreground and background are estimated by independent modules, their conflicting judgments appear as distortion-prone regions in reconstruction, and resolving those distortions focuses the network on uncertain areas. The paper reports state-of-the-art results across camouflaged object detection, polyp, tubular, transparent, and defect segmentation, plus salient object detection, and shows the framework can refine or integrate with existing methods.

Load-bearing premise

The load-bearing premise is the hand-set certainty rule of Eq. (5): pixels with mask values in [0.4, 0.6] are treated as uninformative and all other pixels are pushed toward 0.1 or 0.9, and if that rule misdescribes how transparent or tubular objects actually appear, the unrolled updates bias the network toward the wrong regions.

Editorial extensions

If this is right

  • If RUN's claim is right, input reconstruction is not a side effect of segmentation but an active mechanism: resolving RGB distortions where foreground and background estimates disagree is what sharpens the mask.
  • The same unfolding recipe transfers across at least five concealed-object tasks and salient object detection, suggesting that hand-designed decomposition models plus proximal-gradient unrolling can compete with task-specific architectures in high-level vision.
  • RUN works as a plug-and-play component: initializing its first mask with another method's output refines that method without retraining, and inserting existing modules into RUN's stages gives larger gains after retraining.
  • In simulated haze, RUN degrades more gracefully than comparable methods, and replacing its reconstruction network with a dehazing-aware one further resists degradation, pointing toward degradation-resistant high-level vision.
  • Four stages are enough: K=2 already beats most compared methods, K=4 is the chosen trade-off, and K=6 through K=8 add only marginal gains.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension the paper leaves open is learning the certainty thresholds, 0.1, 0.9, and the [0.4, 0.6] ambiguity band, per dataset instead of hand-setting them; transparent and tubular targets might benefit most from data-driven thresholds.
  • If the unification of segmentation and reconstruction is the real source of gain, the same alternating unfolding with a reconstruction consistency term could be applied to other high-level tasks with natural decomposition models, such as shadow removal or reflection separation, where foreground-background conflicts also produce distortions.
  • The haze experiments are reported only as curves; a numerical study varying degradation type, low light, blur, and noise, would clarify whether the ROBE/RGB-domain reversible module is broadly degradation-robust or specifically effective against haze.
  • Because the reconstruction loss is plain MSE, the attention-directing effect may depend on the reconstruction network's capacity and loss; testing perceptual or adversarial reconstruction losses could reveal whether the mechanism is loss-agnostic.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript introduces RUN, a deep unfolding network for concealed object segmentation (COS). The task is formulated as a foreground-background decomposition C = C•M + B with an added ℓ1 residual-sparsity penalty on the mask M relative to a hand-crafted uncertainty-removal map fM and attention map w. The alternating optimization is unrolled into K stages; each stage contains a Segmentation-Oriented Foreground Separation (SOFS) module, consisting of a closed-form mask update plus a Reversible State Space (RSS) refinement, and a Reconstruction-Oriented Background Extraction (ROBE) module, consisting of a closed-form background update plus a lightweight U-shaped reconstruction network. The claimed contributions are the first deep unfolding for COS, reversible modeling in both mask and RGB domains, and state-of-the-art results on COD, polyp segmentation, tubular structure segmentation, transparent object detection, concealed defect detection, and salient object detection benchmarks.

Significance. If the mathematical grounding were correct, the paper would demonstrate a genuinely new route for applying deep unfolding to high-level vision, and the reported plug-and-play behavior (Tables 10-11) would be practically valuable. The experimental breadth is a real strength: results span six tasks, with ablations for each architectural choice and an analysis of stage number and small/multi-object subsets. The commitment to release code is also positive. However, the central theoretical claim is not currently supported: the Taylor surrogate for the ℓ1 term is invalid, and the fidelity term of the model is degenerate, so the hand-designed certainty maps carry the segmentation signal. These issues prevent the paper from substantiating the 'theoretically grounded framework' emphasized in the abstract and Figure 3, although the empirical results may still be salvageable through an honest reframing of the contribution as a heuristic unrolled architecture.

major comments (4)
  1. [§3.2.1, Eqs. (10)-(13)] The Taylor expansion of the sparsity term S(wk•(M−fMk)) is mathematically unjustified for the stated ℓ1 norm. The function S(·)=ℓ1 is not differentiable at zero, and its (sub)gradient, the sign function, is not Lipschitz continuous; consequently Eq. (11) is not a valid global majorizing surrogate and Eq. (13) is not the proximal-gradient solution of Eq. (7). The claim that the connections in M̂(·) are 'derived strictly based on mathematical principles' (Fig. 3) is therefore unsupported. Because Eq. (18) later makes ∇S(·) learnable, the unrolled update is a heuristic whose relation to the original model is at best an analogy. To retain the theoretical claim, please replace the ℓ1 penalty with a smooth sparsity-inducing penalty (e.g., a Huber norm) for which a Lipschitz-gradient Taylor surrogate is valid, or use a proper proximal operator and derive the corresponding ISTA-style update.
  2. [§3.1, Eq. (4)] The data-fidelity term ½∥C−C•M−B∥² is degenerate: for any mask M, the choice B = C − C•M gives zero fidelity, so this term imposes no constraint on M. All segmentation information in the model comes from the hand-crafted fM and w maps in Eq. (5) and from the learned regularizers and network modules. The 'residual sparsity constraint' is therefore an a priori certainty heuristic (forcing mask values toward 0.1 or 0.9 and excluding [0.4,0.6]) rather than a derived principle that 'minimizes segmentation uncertainties'. The paper should either provide a justification or sensitivity analysis for the specific thresholds in Eq. (5), or explicitly acknowledge that the model is a hand-designed prior and moderate the corresponding claims.
  3. [§3.2.2, Eqs. (18)-(21)] Only the inner updates M̂k (Eq. 18) and B̂k (Eq. 20) are derived from the optimization; the RSS module (Eq. 19) and the reconstruction network B(•) (Eq. 21) are introduced as heuristic network components. Yet the abstract and Figure 3 imply that the entire stage is 'theoretically grounded'. Please clearly separate the derived and learned parts, and justify the non-derived components against generic alternatives (e.g., replace RSS with a standard residual block, or replace the closed-form update with a learned gated fusion) to establish that the derivation itself contributes to performance. The ablation in Table 5 removes RSS and VSS, but does not test whether the mathematically derived update is superior to a generic feature-fusion baseline.
  4. [Tables 1-4 and S1-S2] Several reported gains over the best competing methods are very small (e.g., 0.001-0.005 in M and Sα on some datasets), and no error bars or statistical significance tests are provided. For the central COD results, please report multiple training runs with variance, or at least a significance test on the main metrics. In addition, the comparisons on polyp, tubular, and transparent object tasks would benefit from a clear statement of the backbone and training protocol used for each compared method, so that the gains cannot be attributed to architectural or preprocessing differences.
minor comments (4)
  1. [Eqs. (13) and (17)] The text states 'I is an all-ones matrix', but the equations use I in an inverse, which requires the identity matrix; an all-ones matrix would be singular. Please correct this typo and define whether operations such as C² and wk² are element-wise.
  2. [Eq. (5) and Section 3.1] The notation M_i in Eq. (5) is not defined; it appears to refer to the pixel value of the previous mask M_{k-1}, but this should be stated explicitly, and the subscripts for the updated maps fMk and wk should be clarified.
  3. [Figure 2 and Figure 3] The captions and panel labels in Figure 2 are difficult to follow (e.g., panels (c)-(k) with mixed use of C, B, M, and hat symbols), and Figure 3 contains many unlabeled arrows and matrix-inverse notations. Please revise the figures for readability.
  4. [References] The citation to Goldstein (1977) for the Taylor expansion is questionable, as that paper works with Lipschitz continuous functions rather than differentiable surrogates for ℓ1; a standard proximal-gradient textbook reference would be more appropriate.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the unfolding is self-contained and benchmark-validated; the hand-set certainty map is a modeling choice, not a fitted prediction.

full rationale

The paper's derivation chain is not circular. The COS model in Eqs. (1)-(4) is an explicit modeling assumption; the residual sparsity term uses the hand-set target fM and attention map w defined in Eq. (5), but these are stated in the paper and evaluated ablated in Table 6 (CM3-CM5), so they are not a hidden fit or a parameter renamed as prediction. The unrolled updates in Eqs. (10)-(21) follow, with all fixed parameters relaxed to learnable ones, and the reported results come from training on standard splits and testing on external benchmarks (COD10K, NC4K, ETIS, DRIVE, GDD, etc.). The only self-citation that touches the model construction (He et al., 2024a, for the [0.4,0.6] exclusion and 0.1/0.9 extremes) is not load-bearing: Eq. (5) fully defines the maps and the ablation study tests their effect. The mathematical objection that l1 has no Lipschitz-continuous gradient, so the Taylor surrogate in Eqs. (10)-(12) is not a valid proximal-gradient step, is a correctness concern about how well the unrolled network minimizes the stated objective; it is not a circularity of the kind where a prediction reduces to an input by construction.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

No new physical entities, forces, or dimensions are introduced; 'distortion-prone areas' is a descriptive concept rather than a postulated entity. The main free choices are the manually specified certainty thresholds, the stage count, and the learnable proximal weights. The strongest hidden premise is that the hand-built sparsity model captures the true uncertainty structure of concealed objects.

free parameters (3)
  • Uncertainty threshold pair and extreme values for mask certainty = 0.4 and 0.6 ambiguity range; 0.1 and 0.9 extremes
    Hand-chosen in Eq. (5) and ablated in CM4 and CM5; directly controls the residual sparsity target and attention weights.
  • Number of unfolding stages K = 4
    Chosen from Table 7 as a performance-efficiency trade-off; ablating K changes results.
  • Proximal regularization weights alpha, lambda, mu, and Lipschitz constant L_S = learnable, randomly initialized
    Stated as relaxed to learnable parameters in Sec 3.2.2; they are fitted to the training distribution rather than derived.
assumptions (4)
  • standard math Proximal gradient and the Lipschitz Taylor expansion (Goldstein 1977) yield the closed-form updates in Eqs. (13) and (17).
    Invoked in Sec 3.2.1 to justify the update formulas; this is a standard convex optimization tool, but the objective becomes nonconvex once learned networks are inserted.
  • domain assumption The concealed image decomposes as C = F + B with F = C times M, and this foreground-background separation is an adequate model of concealment for all target tasks.
    Introduced in Eqs. (1)-(3); transparent and tubular structures may not obey a multiplicative foreground model.
  • domain assumption Deep networks can learn the implicit regularizers for M and B and can approximate the proximal operators.
    This is the core deep unfolding premise, stated in Sec 3.1 and used throughout Sec 3.2.
  • ad hoc to paper The uncertainty-removal mapping fM and attention map w in Eq. (5) encode the correct notion of mask certainty for concealed objects.
    These thresholds are not derived from first principles; they are hand set and ablated in Table 6.

how reviews work

0 comments
Cite this review

Pith. "Pith review of RUN: Reversible Unfolding Network for Concealed Object Segmentation." pith.science (2026). https://pith.science/paper/ORUYOKR5

@misc{pith2026250118783,
  author       = {Pith},
  title        = {Pith review of: RUN: Reversible Unfolding Network for Concealed Object Segmentation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ORUYOKR5}},
  note         = {Machine review of arXiv:2501.18783}
}
read the original abstract

Existing concealed object segmentation (COS) methods frequently utilize reversible strategies to address uncertain regions. However, these approaches are typically restricted to the mask domain, leaving the potential of the RGB domain underexplored. To address this, we propose the Reversible Unfolding Network (RUN), which applies reversible strategies across both mask and RGB domains through a theoretically grounded framework, enabling accurate segmentation. RUN first formulates a novel COS model by incorporating an extra residual sparsity constraint to minimize segmentation uncertainties. The iterative optimization steps of the proposed model are then unfolded into a multistage network, with each step corresponding to a stage. Each stage of RUN consists of two reversible modules: the Segmentation-Oriented Foreground Separation (SOFS) module and the Reconstruction-Oriented Background Extraction (ROBE) module. SOFS applies the reversible strategy at the mask level and introduces Reversible State Space to capture non-local information. ROBE extends this to the RGB domain, employing a reconstruction network to address conflicting foreground and background regions identified as distortion-prone areas, which arise from their separate estimation by independent modules. As the stages progress, RUN gradually facilitates reversible modeling of foreground and background in both the mask and RGB domains, directing the network's attention to uncertain regions and mitigating false-positive and false-negative results. Extensive experiments demonstrate the superior performance of RUN and highlight the potential of unfolding-based frameworks for COS and other high-level vision tasks. We will release the code and models.

Figures

Figures reproduced from arXiv: 2501.18783 by the authors.

Figure 1
Figure 1. Results of existing COS methods Our RUN demonstrates superiority in accurately segmenting concealed objects (in the top section) and achieves leading places across multiple COS tasks (in the bottom section): camouflaged object detection (COD), polyp image segmentation (PIS), medical tubular object segmentation (MTOS), and transparent object detection (TOD). In the top section, concealed object masks are highlighted … view at source ↗
Figure 2
Figure 2. Correspondence between uncertainties in the mask domain and distortions in the RGB domain. C is the concealed image and Bˆ is the estimated background, which has conflicting judgments of concealed regions with the mask M. This conflict leads to distortion-prone areas in their direct combination (g). Panel (h) illustrates the difference between (g) and the original image (a). However, after refinement through the net… view at source ↗
Figure 3
Figure 3. Framework of our RUN. The network connections in Mˆ (·) and Bˆ(·) are derived strictly based on mathematical principles, thus enhancing interpretability. For clarity, we replace certain redundant details with Qa, Qb, and Qc and present Mˆ (·) according to Eq. (18). The detailed connection can be seen in Fig. S1 in the Appendix. Panel (ii) illustrates that the joint optimization of image segmentation and reconstructi… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Visual comparison on COD, PIS, MTOS, and TOD tasks [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 6
Figure 6. Figure 6: Potential applications of RUN. The concealed object masks are highlighted in red and overlaid on the original images [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Is There Really a Camouflaged Object? Towards Realistic Camouflaged Object Detection

    cs.CV 2026-08 reject novelty 6.0 of 10

    The authors propose a 16,245-image benchmark that includes negative samples for camouflaged object detection and a network that jointly predicts object presence, camouflage presence, and segmentation masks.

  2. Uncertainty-Masked Bernoulli Diffusion for Camouflaged Object Detection Refinement

    cs.CV 2025-06 conditional novelty 6.0 of 10

    An uncertainty-masked Bernoulli diffusion refiner improves camouflaged object detection masks from existing models, achieving average gains of 5.5% in MAE and 3.2% in weighted F-measure.

  3. Segment Concealed Objects with Incomplete Supervision

    cs.CV 2025-06 conditional novelty 6.0 of 10

    SEE is a unified mean-teacher framework that derives SAM prompts from coarse teacher masks to generate pseudo-labels, and reports state-of-the-art results for weakly and semi-supervised concealed object segmentation.

  4. Track Any Anomalous Object: A Granular Video Anomaly Detection Pipeline

    cs.CV 2025-06 conditional novelty 5.0 of 10

    TAO pipelines object-centric anomaly scores into SAM2 prompts with a temporal consistency filter to obtain pixel-level anomaly segmentation and tracking.

Reference graph

Works this paper leans on

69 extracted references · 64 canonical work pages · cited by 4 Pith papers

  1. [1]

    Recurrent multi-scale transformer for high-resolution salient object detection

    Deng, X., Zhang, P., Liu, W., and Lu, H. Recurrent multi-scale transformer for high-resolution salient object detection. In ACM MM, pp.\ 7413--7423, 2023

    work page 2023

  2. [2]

    Polyp-pvt: Polyp segmentation with pyramid vision transformers

    Dong, B., Wang, W., Fan, D.-P., Li, J., Fu, H., and Shao, L. Polyp-pvt: Polyp segmentation with pyramid vision transformers. CAAI Artif. Intell. Res., 2, 2023

    work page 2023

  3. [3]

    K., Winn, J., and Zisserman, A

    Everingham, M., Van Gool, L., Williams, C. K., Winn, J., and Zisserman, A. The pascal visual object classes (voc) challenge. Int. J. Comput. Vis., 88: 0 303--338, 2010

    work page 2010

  4. [4]

    Structure-measure: A new way to evaluate foreground maps

    Fan, D.-P., Cheng, M.-M., Liu, Y., and Li, T. Structure-measure: A new way to evaluate foreground maps. In ICCV, pp.\ 4548--4557, 2017

    work page 2017

  5. [5]

    Camouflaged object detection

    Fan, D.-P., Ji, G.-P., Sun, G., Cheng, M.-M., and Shen, J. Camouflaged object detection. In CVPR, pp.\ 2777--2787, 2020 a

    work page 2020

  6. [6]

    Pranet: Parallel reverse attention network for polyp segmentation

    Fan, D.-P., Ji, G.-P., and Zhou, T. Pranet: Parallel reverse attention network for polyp segmentation. In MICCAI, pp.\ 263--273, 2020 b

    work page 2020

  7. [7]

    Concealed object detection

    Fan, D.-P., Ji, G.-P., Cheng, M.-M., and Shao, L. Concealed object detection. IEEE Trans. Pattern Anal. Mach. Intell., 2021 a

    work page 2021

  8. [8]

    Cognitive vision inspired object segmentation metric and loss function

    Fan, D.-P., Ji, G.-P., Qin, X., and Cheng, M.-M. Cognitive vision inspired object segmentation metric and loss function. Scientia Sinica Informationis, 6 0 (6), 2021 b

    work page 2021

Show all 69 references
  1. [9]

    Advances in deep concealed scene understanding

    Fan, D.-P., Ji, G.-P., Xu, P., Cheng, M.-M., Sakaridis, C., and Van Gool, L. Advances in deep concealed scene understanding. Visual Intell., 1 0 (1): 0 16, 2023 a

    2023

  2. [10]

    Rfenet: towards reciprocal feature evolution for glass segmentation

    Fan, K., Wang, C., Wang, Y., Wang, C., Yi, R., and Ma, L. Rfenet: towards reciprocal feature evolution for glass segmentation. In IJCAI, pp.\ 717--725, 2023 b

    2023

  3. [11]

    Reti-diff: Illumination degradation image restoration with retinex-based latent diffusion model

    Fang, C., Zhang, Y., Ye, T., Li, K., Tang, L., Guo, Z., Li, X., and Farsiu, S. Reti-diff: Illumination degradation image restoration with retinex-based latent diffusion model. arXiv preprint arXiv:2311.11638, 2023

    2023 arXiv

  4. [12]

    Real-world image dehazing with coherence-based label generator and cooperative unfolding network

    Fang, C., He, C., Xiao, F., Zhang, Y., Tang, L., Zhang, Y., Li, K., and Li, X. Real-world image dehazing with coherence-based label generator and cooperative unfolding network. NeurIPS, 2025

    2025

  5. [13]

    Res2net: A new multi-scale backbone architecture

    Gao, S.-H., Cheng, M.-M., Zhao, K., Zhang, X.-Y., Yang, M.-H., and Torr, P. Res2net: A new multi-scale backbone architecture. IEEE Trans. Pattern Anal. Mach. Intell., 43 0 (2): 0 652--662, 2019

    2019

  6. [14]

    Goldstein, A. A. Optimization of lipschitz continuous functions. Math. Program., 13: 0 14--22, 1977

    1977

  7. [15]

    Topology-aware uncertainty for image segmentation

    Gupta, S., Zhang, Y., Hu, X., Prasanna, P., and Chen, C. Topology-aware uncertainty for image segmentation. NeurIPS, 36, 2024

    2024

  8. [16]

    Internal-external boundary attention fusion for glass surface segmentation

    Han, D., Lee, S., Zhang, C., Yoon, H., Kwon, H., Kim, H.-C., and Choo, H.-G. Internal-external boundary attention fusion for glass surface segmentation. arXiv preprint arXiv:2307.00212, 2024

    2024 arXiv

  9. [17]

    Degradation-resistant unfolding network for heterogeneous image fusion

    He, C., Li, K., and Zhang, Y. Degradation-resistant unfolding network for heterogeneous image fusion. In ICCV, pp.\ 611--621, 2023 a

    2023

  10. [18]

    Camouflaged object detection with feature decomposition and edge reconstruction

    He, C., Li, K., Zhang, Y., Tang, L., and Zhang, Y. Camouflaged object detection with feature decomposition and edge reconstruction. In CVPR, pp.\ 22046--22055, 2023 b

    2023

  11. [19]

    Weakly-supervised concealed object segmentation with sam-based pseudo labeling and multi-scale feature grouping

    He, C., Li, K., Zhang, Y., Xu, G., and Tang, L. Weakly-supervised concealed object segmentation with sam-based pseudo labeling and multi-scale feature grouping. NeurIPS, 2024 a

    2024

  12. [20]

    Strategic preys make acute predators: Enhancing camouflaged object detectors by generating camouflaged objects

    He, C., Li, K., Zhang, Y., Zhang, Y., Guo, Z., and Li, X. Strategic preys make acute predators: Enhancing camouflaged object detectors by generating camouflaged objects. ICLR, 2024 b

    2024

  13. [21]

    Enhanced boundary learning for glass-like object segmentation

    He, H., Li, X., Cheng, G., Shi, J., Tong, Y., Meng, G., Prinet, V., and Weng, L. Enhanced boundary learning for glass-like object segmentation. In ICCV, pp.\ 15859--15868, 2021

    2021

  14. [22]

    Deep residual learning for image recognition

    He, K., Zhang, X., Ren, S., and Sun, J. Deep residual learning for image recognition. In CVPR, pp.\ 770--778, 2016

    2016

  15. [23]

    High-resolution iterative feedback network for camouflaged object detection

    Hu, X., Wang, S., Qin, X., Dai, H., Ren, W., Luo, D., Tai, Y., and Shao, L. High-resolution iterative feedback network for camouflaged object detection. In AAAI, volume 37, pp.\ 881--889, 2023

    2023

  16. [24]

    Representing topological self-similarity using fractal feature maps for accurate segmentation of tubular structures

    Huang, J., Zhou, Y., Luo, Y., Liu, G., Guo, H., and Yang, G. Representing topological self-similarity using fractal feature maps for accurate segmentation of tubular structures. In ECCV, pp.\ 143--160. Springer, 2025

    2025

  17. [25]

    Coinnet: A convolution-involution network with a novel statistical attention for automatic polyp segmentation

    Jain, S., Atale, R., Gupta, A., Mishra, U., Seal, A., Ojha, A., Jaworek-Korjakowska, J., and Krejcar, O. Coinnet: A convolution-involution network with a novel statistical attention for automatic polyp segmentation. IEEE Trans. Med. Imaging, 42 0 (12): 0 3987--4000, 2023

    2023

  18. [26]

    Segment, magnify and reiterate: Detect camouflaged objects hard way

    Jia, Q., Yao, S., and Liu, Y. Segment, magnify and reiterate: Detect camouflaged objects hard way. In CVPR, pp.\ 713--722, 2022

    2022

  19. [27]

    Camofocus: Enhancing camouflage object detection with split-feature focal modulation and context refinement

    Khan, A., Khan, M., Gueaieb, W., El Saddik, A., De Masi, G., and Karray, F. Camofocus: Enhancing camouflage object detection with split-feature focal modulation and context refinement. In WACV, pp.\ 1434--1443, 2024

    2024

  20. [28]

    V., Nie, Z., Tran, M.-T., and Sugimoto, A

    Le, T.-N., Nguyen, T. V., Nie, Z., Tran, M.-T., and Sugimoto, A. Anabranch network for camouflaged object segmentation. Comput. Vis. Image Underst., 184: 0 45--56, 2019

    2019

  21. [29]

    and Yu, Y

    Li, G. and Yu, Y. Visual saliency based on multiscale deep features. In CVPR, pp.\ 5455--5463, 2015

    2015

  22. [30]

    M., and Yuille, A

    Li, Y., Hou, X., Koch, C., Rehg, J. M., and Yuille, A. L. The secrets of salient object segmentation. In CVPR, pp.\ 280--287, 2014

    2014

  23. [31]

    and He, Z

    Lin, J. and He, Z. Rich context aggregation with reflection prior for glass surface detection. In CVPR, pp.\ 13415--13424, 2021

    2021

  24. [32]

    Stimulus-guided adaptive transformer network for retinal blood vessel segmentation in fundus images

    Lin, J., Huang, X., Zhou, H., Wang, Y., and Zhang, Q. Stimulus-guided adaptive transformer network for retinal blood vessel segmentation in fundus images. Med. Image Anal., 89: 0 102929, 2023

    2023

  25. [33]

    Visual saliency transformer

    Liu, N., Zhang, N., Wan, K., Shao, L., and Han, J. Visual saliency transformer. In ICCV, pp.\ 4722--4732, 2021

    2021

  26. [34]

    Vst++: Efficient and stronger visual saliency transformer

    Liu, N., Luo, Z., Zhang, N., and Han, J. Vst++: Efficient and stronger visual saliency transformer. IEEE Trans. Pattern Anal. Mach. Intell., 2024 a

    2024

  27. [35]

    Vmamba: Visual state space model

    Liu, Y., Tian, Y., Zhao, Y., Yu, H., Xie, L., Wang, Y., Ye, Q., and Liu, Y. Vmamba: Visual state space model. In NeurIPS, 2024 b

    2024

  28. [36]

    Simultaneously localize, segment and rank the camouflaged objects

    Lv, Y., Zhang, J., Dai, Y., Li, A., Liu, B., Barnes, N., and Fan, D.-P. Simultaneously localize, segment and rank the camouflaged objects. In CVPR, pp.\ 11591--11601, 2021

    2021

  29. [37]

    Structure and illumination constrained gan for medical image enhancement

    Ma, Y., Liu, J., Liu, Y., Fu, H., Hu, Y., Cheng, J., Qi, H., Wu, Y., Zhang, J., and Zhao, Y. Structure and illumination constrained gan for medical image enhancement. IEEE Trans. Med. Imaging, 40 0 (12): 0 3955--3967, 2021

    2021

  30. [38]

    How to evaluate foreground maps? In CVPR, pp.\ 248--255, 2014

    Margolin, R., Zelnik-Manor, L., and Tal, A. How to evaluate foreground maps? In CVPR, pp.\ 248--255, 2014

    2014

  31. [39]

    Don't hit me! glass detection in real-world scenes

    Mei, H., Yang, X., Wang, Y., Liu, Y., and He, S. Don't hit me! glass detection in real-world scenes. In CVPR, pp.\ 3687--3696, 2020

    2020

  32. [40]

    Mei, H., Yang, X., Yu, L., Zhang, Q., Wei, X., and Lau, R. W. Large-field contextual feature learning for glass detection. IEEE Trans. Pattern Anal. Mach. Intell., 2023

    2023

  33. [41]

    F., et al

    Mou, L., Zhao, Y., Fu, H., Liu, Y., Cheng, J., Zheng, Y., Su, P., Yang, J., Chen, L., Frangi, A. F., et al. Cs2-net: Deep learning segmentation of curvilinear structures in medical imaging. Med. Image Anal., 67: 0 101874, 2021

    2021

  34. [42]

    Zoom in and out: A mixed-scale triplet network for camouflaged object detection

    Pang, Y., Zhao, X., Xiang, T.-Z., Zhang, L., and Lu, H. Zoom in and out: A mixed-scale triplet network for camouflaged object detection. In CVPR, pp.\ 2160--2170, 2022

    2022

  35. [43]

    Dynamic snake convolution based on topological geometric constraints for tubular structure segmentation

    Qi, Y., He, Y., Qi, X., Zhang, Y., and Yang, G. Dynamic snake convolution based on topological geometric constraints for tubular structure segmentation. In ICCV, pp.\ 6070--6079, 2023

    2023

  36. [44]

    Rahman, M. M. Medical image segmentation via cascaded attention decoding. In WACV, pp.\ 6222--6231, 2023

    2023

  37. [45]

    Toward embedded detection of polyps in wce images for early diagnosis

    Silva, J., Histace, A., Romain, O., and Dray, X. Toward embedded detection of polyps in wce images for early diagnosis. Int. J. Comput. Assist. Radiol. Surg., 9: 0 283--293, 2014

    2014

  38. [46]

    Animal camouflage analysis: Chameleon database

    Skurowski, P., Abdulameer, H., and B aszczyk, J. Animal camouflage analysis: Chameleon database. Unpublished manuscript, pp.\ 7, 2018

    2018

  39. [47]

    Frequency-spatial entanglement learning for camouflaged object detection

    Sun, Y., Xu, C., Yang, J., Xuan, H., and Luo, L. Frequency-spatial entanglement learning for camouflaged object detection. In ECCV, pp.\ 343--360, 2024

    2024

  40. [48]

    R., and Liang, J

    Tajbakhsh, N., Gurudu, S. R., and Liang, J. Automated polyp detection in colonoscopy videos using shape and context information. IEEE Trans. Med. Imaging, 35 0 (2): 0 630--644, 2015

    2015

  41. [49]

    Learning to detect salient objects with image-level supervision

    Wang, L., Lu, H., and Wang, Y. Learning to detect salient objects with image-level supervision. In CVPR, pp.\ 136--145, 2017

    2017

  42. [50]

    Pvt v2: Improved baselines with pyramid vision transformer

    Wang, W., Xie, E., Li, X., Fan, D.-P., Song, K., Liang, D., Lu, T., Luo, P., and Shao, L. Pvt v2: Improved baselines with pyramid vision transformer. Comput. Vis. Media, 8 0 (3): 0 415--424, 2022

    2022

  43. [51]

    Lssnet: A method for colon polyp segmentation based on local feature supplementation and shallow feature supplementation

    Wang, W., Sun, H., and Wang, X. Lssnet: A method for colon polyp segmentation based on local feature supplementation and shallow feature supplementation. In MICCAI, pp.\ 446--456. Springer, 2024

    2024

  44. [52]

    Image threshold segmentation based on glle histogram

    Wang, X., Deng, L., and Xu, G. Image threshold segmentation based on glle histogram. In CPSCom, pp.\ 410--415. IEEE, 2019

    2019

  45. [53]

    Pixels, regions, and objects: Multiple enhancement for salient object detection

    Wang, Y., Wang, R., Fan, X., Wang, T., and He, X. Pixels, regions, and objects: Multiple enhancement for salient object detection. In CVPR, pp.\ 10031--10040, 2023

    2023

  46. [54]

    Concealed object segmentation with hierarchical coherence modeling

    Xiao, F., Zhang, P., and He, C. Concealed object segmentation with hierarchical coherence modeling. In CAAI ICAI, pp.\ 16--27, 2023

    2023

  47. [55]

    A survey of camouflaged object detection and beyond

    Xiao, F., Hu, S., Shen, Y., and He, C. A survey of camouflaged object detection and beyond. arXiv preprint arXiv:2408.14562, 2024

    2024 arXiv

  48. [56]

    Pyramid grafting network for one-stage high resolution saliency detection

    Xie, C., Xia, C., Ma, M., Zhao, Z., Chen, X., and Li, J. Pyramid grafting network for one-stage high resolution saliency detection. In CVPR, pp.\ 11717--11726, 2022

    2022

  49. [57]

    Hqg-net: Unpaired medical image enhancement with high-quality guidance

    Xu, G., Yan, J., Tang, L., and Zhang, Y. Hqg-net: Unpaired medical image enhancement with high-quality guidance. IEEE Trans. Neural Networks Learn. Syst., 2023

    2023

  50. [58]

    Hierarchical saliency detection

    Yan, Q., Xu, L., Shi, J., and Jia, J. Hierarchical saliency detection. In CVPR, pp.\ 1155--1162, 2013

    2013

  51. [59]

    Yan, T., Gao, J., Xu, K., Zhu, X., Huang, H., Li, H., Wah, B., and Lau, R. W. Ghostingnet: A novel approach for glass surface detection with ghosting cues. IEEE Trans. Pattern Anal. Mach. Intell., 2024

    2024

  52. [60]

    Saliency detection via graph-based manifold ranking

    Yang, C., Zhang, L., Lu, H., Ruan, X., and Yang, M.-H. Saliency detection via graph-based manifold ranking. In CVPR, pp.\ 3166--3173, 2013

    2013

  53. [61]

    Oaformer: Occlusion aware transformer for camouflaged object detection

    Yang, X., Zhu, H., Mao, G., and Xing, S. Oaformer: Occlusion aware transformer for camouflaged object detection. In ICME, pp.\ 1421--1426. IEEE, 2023

    2023

  54. [62]

    Gponet: A two-stream gated progressive optimization network for salient object detection

    Yi, Y., Zhang, N., Zhou, W., Shi, Y., Xie, G., and Wang, J. Gponet: A two-stream gated progressive optimization network for salient object detection. Pattern Recogn., 150: 0 110330, 2024

    2024

  55. [63]

    Camoformer: Masked separable attention for camouflaged object detection

    Yin, B., Zhang, X., Fan, D.-P., Jiao, S., Cheng, M.-M., Van Gool, L., and Hou, Q. Camoformer: Masked separable attention for camouflaged object detection. IEEE Trans. Pattern Anal. Mach. Intell., 2024

    2024

  56. [64]

    Exploring figure-ground assignment mechanism in perceptual organization

    Zhai, W., Cao, Y., and Zhang, J. Exploring figure-ground assignment mechanism in perceptual organization. In NeurIPS, volume 35, 2023

    2023

  57. [65]

    Focusdiffuser: Perceiving local disparities for camouflaged object detection

    Zhao, J., Li, X., Yang, F., Zhai, Q., Luo, A., Jiao, Z., and Cheng, H. Focusdiffuser: Perceiving local disparities for camouflaged object detection. In ECCV, pp.\ 181--198, 2024

    2024

  58. [66]

    Bilateral reference for high-resolution dichotomous image segmentation

    Zheng, P., Gao, D., Fan, D.-P., Liu, L., Laaksonen, J., Ouyang, W., and Sebe, N. Bilateral reference for high-resolution dichotomous image segmentation. CAAI AIR, 2024

    2024

  59. [67]

    I can find you! boundary-guided separated attention network for camouflaged object detection

    Zhu, H., Li, P., Xie, H., Yan, X., Liang, D., Chen, D., Wei, M., and Qin, J. I can find you! boundary-guided separated attention network for camouflaged object detection. In AAAI, volume 36, pp.\ 3608--3616, 2022

    2022

  60. [68]

    Salient object detection via integrity learning

    Zhuge, M., Fan, D.-P., Liu, N., Zhang, D., Xu, D., and Shao, L. Salient object detection via integrity learning. IEEE Trans. Pattern Anal. Mach. Intell., 2022

    2022

  61. [69]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.