Pith. sign in

REVIEW 4 cited by

PyMatting: A Python Library for Alpha Matting

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.12382 v1 pith:QJKPLKYN submitted 2020-03-25 cs.CV eess.IV

PyMatting: A Python Library for Alpha Matting

Thomas Germer , Tobias Uelwer , Stefan Conrad , Stefan Harmeling This is my paper
classification cs.CV eess.IV
keywords pymattingalphaimagemattingbackgroundextractforegroundgiven
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

An important step of many image editing tasks is to extract specific objects from an image in order to place them in a scene of a movie or compose them onto another background. Alpha matting describes the problem of separating the objects in the foreground from the background of an image given only a rough sketch. We introduce the PyMatting package for Python which implements various approaches to solve the alpha matting problem. Our toolbox is also able to extract the foreground of an image given the alpha matte. The implementation aims to be computationally efficient and easy to use. The source code of PyMatting is available under an open-source license at https://github.com/pymatting/pymatting.

discussion (0)

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

Forward citations

Cited by 4 Pith papers

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

  1. Can LLM Agents Price Competitively? A Dynamic Multi-Attribute Auction Benchmark for Agentic Commerce

    cs.AI 2026-07 conditional novelty 7.0

    LLM merchant agents in a new dynamic auction benchmark capture at most 32% of hindsight-optimal profit; profit tracks margin per win more than win rate, and fast pre-shock learners adapt poorly to preference shocks.

  2. A Fast and Simple $(1+\epsilon)$-Approximation for Minimum Spanning Trees in Doubling Metrics

    cs.DS 2026-07 conditional novelty 7.0

    A deterministic algorithm computes a (1+ε)-approximate MST in doubling metrics in time 2^{O(ddim)} n(log n + ε^{-1} log^4(1/ε)), improving prior ε^{-O(ddim)} dependence.

  3. Gap-Majority Lemmas in Communication Complexity

    cs.CC 2026-07 conditional novelty 7.0

    Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.

  4. Snowveil: A Framework for Decentralised Preference Discovery

    cs.GT 2025-12 reject novelty 6.0

    Snowveil is a gossip-based decentralized preference aggregation protocol claiming almost-sure finite-time convergence and O(n) expected convergence time using a Borda-plurality rule.