paper-with-me

홈 › Papers

A Continuous Max-Flow Approach to Cyclic Field Reconstruction

2015-11-11 · John S. H. Baxter, Jonathan McLeod, Terry M. Peters

Reconstruction of an image from noisy data using Markov Random Field theory has been explored by both the graph-cuts and continuous max-flow community in the form of the Potts and Ishikawa models. However, neither model takes into account the particular cyclic topology of specific intensity types such as the hue in natural colour images, or the phase in complex valued MRI. This paper presents \textit{cyclic continuous max-flow} image reconstruction which models the intensity being reconstructed as having a fundamentally cyclic topology. This model complements the Ishikawa model in that it is designed with image reconstruction in mind, having the topology of the intensity space inherent in the model while being readily extendable to an arbitrary intensity resolution.

📄 PDF Abstract BibTeX arXiv:1511.03629

Code (0)

등록된 구현이 없습니다.

Tasks

Image Reconstruction

Similar Papers 제목 키워드 기반

A Theory of Non-Acyclic Generative Flow Networks

2023-12-23 · Leo Maxime Brunswic, Yinchuan Li, Yushun Xu, Shangling Jui 외

GFlowNets is a novel flow-based method for learning a stochastic policy to generate objects via a sequence of actions and with probability proportional to a given positive reward. We contribute to relaxing hypotheses lim…

Representing Flow Fields with Divergence-Free Kernels for Reconstruction

2025-04-02 · Xingyu Ni, Jingrui Xing, Xingqiao Li, Bin Wang 외

Accurately reconstructing continuous flow fields from sparse or indirect measurements remains an open challenge, as existing techniques often suffer from oversmoothing artifacts, reliance on heterogeneous architectures, …

Computational EfficiencyData CompressionSuper-Resolution

A Proximal Bregman Projection Approach to Continuous Max-Flow Problems Using Entropic Distances

2015-01-30 · John S. H. Baxter, Martin Rajchl, Jing Yuan, Terry M. Peters

One issue limiting the adaption of large-scale multi-region segmentation is the sometimes prohibitive memory requirements. This is especially troubling considering advances in massively parallel computing and commercial …

Segmentation

Constraint-Free Structure Learning with Smooth Acyclic Orientations

2023-09-15 · Riccardo Massidda, Francesco Landolfi, Martina Cinquini, Davide Bacciu

The structure learning problem consists of fitting data generated by a Directed Acyclic Graph (DAG) to correctly reconstruct its arcs. In this context, differentiable approaches constrain or regularize the optimization p…

Graph Reconstruction

A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization

2014-05-05 · John S. H. Baxter, Martin Rajchl, Jing Yuan, Terry M. Peters

The incorporation of region regularization into max-flow segmentation has traditionally focused on ordering and part-whole relationships. A side effect of the development of such models is that it constrained regularizat…

Segmentation