cs.CVNov 1, 2026

ContactCut: A Partition-Aware Contact Selection Framework for False-Merge Correction in Connectomics

Authors: Byunghyun Ko, Won-Ki Jeong, Chaoli Wang

Organizations: Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA · Department of Computer Science and Engineering, Korea University, Seoul, Korea

Abstract

Localized false-merge correction in connectomics requires converting an identified error into an executable native 3D partition. Still, neither intermediate correction predictions nor seeded graph solvers alone determine which native source-sink constraints should define that partition. We formulate this problem as a 3D-native partition-aware contact selection problem: selecting candidate contacts based on the complete partitions they induce. Our solution comprises two components: ContactCut (CC)-Auto, which uses learned single-contact selection, and ContactCut (CC)-Search, which enables bounded paired-contact search, generates compact alternatives, and applies learned panel ranking. On historical two-way false-merge corrections from MICrONS and FlyWire, CC-Auto improves failure-aware 3D partition (FA-3D Part.) mIoU by 5.9 and 3.4 points over the strongest graph-based controls and by 12.5 and 10.0 points over the best learned baselines. A MICrONS-trained ranker transfers to FlyWire with negligible degradation. CC-Search expands oracle reachability and prioritizes near-oracle alternatives. The code is available at https://github.com/bentake/ContactCut.

Figures & tables

Explore similar work

CardsList
  1. ConnectomeBench2: A Unified Benchmark for Automated Connectomic Proofreading

    Jun 19, 2026Jeff Brown, Tim Farkas, Gleb Razgar +1

  2. BlockFormer\textit{BlockFormer} : Transformer-based inference from genomic contact maps

    May 20, 2026Eloïse Touron, Pedro L. C. Rodrigues, Julyan Arbel +2GenomicsInverse Problems

  3. Linkify: Learning from Interface-Augmented Assembly Graphs

    Jul 1, 2026Anushrut Jignasu, Daniele GrandiGraph Representation LearningInformation Retrieval