Papers › AccFlow: Backward Accumulation for Long-Range Optical Flow

AccFlow: Backward Accumulation for Long-Range Optical Flow

25 Aug 2023ICCV 2023 1arXiv:2308.13133archive 2025-07-28

Guangyang Wu, Xiaohong Liu, Kunming Luo, Xi Liu, Qingqing Zheng, Shuaicheng Liu, Xinyang Jiang, Guangtao Zhai, Wenyi Wang

Recent deep learning-based optical flow estimators have exhibited impressive performance in generating local flows between consecutive frames. However, the estimation of long-range flows between distant frames, particularly under complex object deformation and large motion occlusion, remains a challenging task. One promising solution is to accumulate local flows explicitly or implicitly to obtain the desired long-range flow. Nevertheless, the accumulation errors and flow misalignment can hinder the effectiveness of this approach. This paper proposes a novel recurrent framework called AccFlow, which recursively backward accumulates local flows using a deformable module called as AccPlus. In addition, an adaptive blending module is designed along with AccPlus to alleviate the occlusion effect by backward accumulation and rectify the accumulation error. Notably, we demonstrate the superiority of backward accumulation over conventional forward accumulation, which to the best of our knowledge has not been explicitly established before. To train and evaluate the proposed AccFlow, we have constructed a large-scale high-quality dataset named CVO, which provides ground-truth optical flow labels between adjacent and distant frames. Extensive experiments validate the effectiveness of AccFlow in handling long-range optical flow estimation. Codes are available at https://github.com/mulns/AccFlow .

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2308.13133")

Code

Syntology Ran 18 of 22 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 2 ran · honoured contract; 3 ran · fixture could not drive it; 13 ran with no contract checked.

By repository: official repository: 22 samples from 1 repository, 18 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mulns/accflow officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

22 samples harvested; 18 ran; 2 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
3ran · fixture could not drive it
13ran
4unverified

Licence: 0 of the 22 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mulns/AccFlow. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

AccPlus mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic MIT (permissive) · c77aa920181bdc89 · report
BasicEncoder mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic MIT (permissive) · 576b3b38aab41bd9 · report
EPE mulns/accflow/networks/losses.py official repository ran · honoured contract fingerprinted MIT (permissive) · 6baff9bff3755d04 · report
FlowDecoder mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic MIT (permissive) · 8ff75104333f9fe0 · report
FlowEncoder mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 87bf584d40e57b05 · report
ResidualBlock mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic MIT (permissive) · 84fcdc8833141dbe · report
ZeroConv2d mulns/AccFlow/networks/AccFlow_.py official repository ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · e5c5c487aa60bd33 · report
backwarp mulns/AccFlow/networks/AccFlow_.py official repository ran · fixture could not drive it MIT (permissive) · 6e854d3d7f3980c8 · report
conv mulns/accflow/networks/modules.py official repository ran MIT (permissive) · 277f39f9246c0485 · report
coords_grid mulns/accflow/networks/utils.py official repository ran · honoured contract MIT (permissive) · 81a137c5322b4930 · report
downflow8 mulns/AccFlow/networks/AccFlow_.py official repository ran · fixture could not drive it MIT (permissive) · 155f17374085bd89 · report
fetch_optimizer mulns/accflow/fine_tune.py official repository ran MIT (permissive) · ae7c4400ee88b6af · report
forward_interpolate mulns/accflow/networks/utils.py official repository ran fingerprinted MIT (permissive) · f7edf6ef2466762a · report
getOcc mulns/AccFlow/networks/AccFlow_.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 2f15e505b8f9ff7b · report
get_loss mulns/accflow/networks/losses.py official repository ran MIT (permissive) · 7cfa1a8b7a0dd16c · report
preprocess mulns/accflow/fine_tune.py official repository ran MIT (permissive) · bdc31782573bea88 · report
sequence_loss_acc mulns/accflow/loss.py official repository ran MIT (permissive) · f2ea78b310d23fe1 · report
sequence_loss_raft mulns/accflow/loss.py official repository ran MIT (permissive) · d8d15efffe600e6f · report
AccFlow mulns/AccFlow/networks/AccFlow_.py official repository unverified MIT (permissive) · 479d06f2b314617c · report
Blending mulns/AccFlow/networks/AccFlow_.py official repository unverified MIT (permissive) · 5480e390f26b975a · report
bilinear_sampler mulns/accflow/networks/utils.py official repository unverified MIT (permissive) · 0d272f32cfaeb750 · report
getOcc mulns/accflow/networks/AccFlow_.py official repository unverified MIT (permissive) · ebd6cc10326f76f8 · report

Tasks

Optical Flow Estimation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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