Flow-TAG is presented--a data-driven framework based on a generative flow model with a 1D U-Net backbone capable of mapping the geometry of a curve to the optimal parametrization for cubic B-splines that exhibits superior parameterization performance, robustness to noise in the input data, and strong generalization capability to previously unseen 2D and 3D curves drawn from distinct data distributions.
Abstract
Robust curve fitting is essential in computer-aided design for transforming noisy, discrete data into accurate geometric models that ensure numerical stability across engineering workflows. B-spline models have become the industry standard for this task, offering a flexible and reliable framework characterized by local control and smooth shape representation. This paper presents flow-TAG--a data-driven framework based on a generative flow model with a 1D U-Net backbone capable of mapping the geometry of a curve to the optimal parametrization for cubic B-splines. By leveraging learned geometric patterns, flow-TAG exhibits superior parameterization performance, robustness to noise in the input data, and strong generalization capability to previously unseen 2D and 3D curves drawn from distinct data distributions. Flow-TAG yields fitted curves that achieve the lower root-mean-square error (55% lower on average) and Hausdorff distance (52% lower on average) relative to state-of-the-art data-driven methods. In addition, we investigate the practical applicability of our generative framework in the compression of ECG signals for wearable devices. The proposed compression setup provides a compression ratio of 13 with the signal distortion of around 5%, which is acceptable in the field.
Two lightweight, training-free algorithms are proposed, CAT-OV and CAT-OT that adapt step-sizes at inference time based on a novel connection between Flow Matching sampling and gradient flow that outperform existing step-size heuristics in image quality metrics across four text- to-image Flow Matching models.
Qinchan Li, Pedro Cisneros-Velarde, Ke-Ru Fu et al.· 1 citation
Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite-dimensional spaces. Functional Flow Matching (FFM) extends Flow Matching to this setting, learning a velocity field whose flow transports a Gaussian prior to the data d...
Fred Xu, Thomas Markovich, Barbora Barancikova et al.· 0 citations
This paper combines the polar spline construction with hierarchical splines to obtain adaptively-refinable polar splines, and shows how to construct hierarchical polar spline $k$-form spaces, proves that the corresponding basis functions are linearly independent, and proves that they form a cohomologically-correct disc...
Diogo C. Cabanas, D. Toshniwal, Rafael Vázquez· 0 citations
This paper analyzes the local Taylor expansion of a continuous denoiser to motivate a strict invariance condition required for optimal, singlestep generation: the conservation of target identity, and demonstrates that solving this condition via the Method of Characteristics analytically yields the straight-line traject...
The first Hessian formulation for feature mapping is presented and the behavior of first- and second-order optimizers on benchmark problems is reported, which requires one additional solution of the FEM system per feature variable.
F. Wein, Patrick Jung, Arash Moradian et al.· 0 citations
The results demonstrate that flow matching naturally adapts to the intrinsic geometry of data and mitigates the curse of dimensionality, as the convergence exponent depends on the intrinsic rather than ambient dimension.
Saptarshi Chakraborty, Quentin Berthet, Peter L. Bartlett· 7 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.