SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2011.14288 · 2020

Learning Affinity-Aware Upsampling for Deep Image Matting

arXiv · PDF · Open in the Atlas

Code that ran

1 of 1 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2011.14288.json · badge: /api/ran/2011.14288.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
dongdong93/a2u_matting reimplementation (classifier label)
classifier basis: classifier_2025
1 ran · 0 no recorded run
FunctionStatusWhere it lives
weighted_loss Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
dongdong93/a2u_matting/scripts/trainval.py
code served (permissive licence) · get_code("5e90e36e1297ff63")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch

torch.manual_seed(0)

# The function expects:
# - pd: predicted alpha map, shape (bs, 1, h, w)
# - gt: ground truth tensor with shape (bs, 11, h, w) containing:
#   - gt[:, 0, :, :]: alpha values
#   - gt[:, 1, :, :]: mask
#   - gt[:, 2:5, :, :]: foreground (3 channels)
#   - gt[:, 5:8, :, :]: background (3 channels)
#   - gt[:, 8:11, :, :]: composite/ground truth color (3 channels)
# - wl: weight for loss_alpha (default 0.5)
# - epsilon: small value for numerical stability (default 1e-06)

bs = 2
h = 4
w = 3

# Create predicted alpha map (batch_size=2, 1 channel, height=4, width=3)
pd = torch.rand(bs, 1, h, w)

# Create ground truth tensor (batch_size=2, 11 channels, height=4, width=3)
# Channel layout:
# 0: alpha values
# 1: mask
# 2-4: foreground RGB
# 5-7: background RGB
# 8-10: composite RGB
gt = torch.rand(bs, 11, h, w)

# Ensure alpha values are in [0, 1]
gt[:, 0, :, :] = torch.rand(bs, h, w)

# Ensure mask is binary or in [0, 1]
gt[:, 1, :, :] = torch.randint(0, 2, (bs, h, w)).float()

# Foreground, background, and composite are already in valid range [0, 1]

wl = 0.5
epsilon = 1e-06

ARGS = {
    "pd": pd,
    "gt": gt,
    "wl": wl,
    "epsilon": epsilon,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type Tensor, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We show that learning affinity in upsampling provides an effective and efficient approach to exploit pairwise interactions in deep networks. Second-order features are commonly used in dense prediction to build adjacent relations with a learnable module after upsampling such as non-local blocks. Since upsampling is essential, learning affinity in upsampling can avoid additional propagation layers, offering the potential for building compact models. By looking at existing upsampling operators from a unified mathematical perspective, we generalize them into a second-order form and introduce Affinity-Aware Upsampling (A2U) where upsampling kernels are generated using a light-weight lowrank bilinear model and are conditioned on second-order features. Our upsampling operator can also be extended to downsampling. We discuss alternative implementations of A2U and verify their effectiveness on two detail-sensitive tasks: image reconstruction on a toy dataset; and a largescale image matting task where affinity-based ideas constitute mainstream matting approaches. In particular, results on the Composition-1k matting dataset show that A2U achieves a 14% relative improvement in the SAD metric against a strong baseline with negligible increase of parameters (<0.5%). Compared with the state-of-the-art matting network, we achieve 8% higher performance with only 40% model complexity.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2011.14288")
get_code_for_paper("2011.14288")
have("2011.14288")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2011.14288.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2011.14288.svg)](https://syntology.ai/paper/2011.14288)

Connect an agent — have() is free.