Methods › Computer Vision › Image Decomposition Models › BIDeN

Blind Image Decomposition Network

BIDeN

1 paper tagged archive 2025-07-28

Introduced by Junlin Han et al. in Blind Image Decomposition

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

BIDeN, or Blind Image Decomposition Network, is a model for blind image decomposition, which requires separating a superimposed image into constituent underlying images in a blind setting, that is, both the source components involved in mixing as well as the mixing mechanism are unknown. For example, rain may consist of multiple components, such as rain streaks, raindrops, snow, and haze.

The Figure shows an example where N = 4, L = 2, x = a, b, c, d, and I = 1, 3. a, c are selected then passed to the mixing function f, and outputs the mixed input image z, which is f(a, c) here. The generator consists of an encoder E with three branches and multiple heads H. ⊗ denotes the concatenation operation. Depth and receptive field of each branch is different to capture multiple scales of features. Each specified head points to the corresponding source component, and the number of heads varies with the maximum number of source components N. All reconstructed images (a′, c′) and their corresponding real images (a, c) are sent to an unconditional discriminator. The discriminator also predicts the source components of the input image z. The outputs from other heads (b′, d′) do not contribute to the optimization.

PaperSource

In Syntology about another paper, arXiv:2204.08152: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Bidirectional Information Decoupling Network (BiDeN)' (resolution: alias); this answer is about that name. About another paper: this answer is about arXiv:2204.08152, while the archive credits arXiv:2108.11364.

Origin paper of this answer, arXiv:2204.08152 (its page on this site · its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

1 task the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Rain Removal1

Usage over time archive 2025-07-28

Papers per year tagged with BIDeN: 2021 to 2021, peak 1 1 0 2021: 1 paper 2021
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Image Decomposition Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections