A Fast and Efficient Shape Blending by Stable and Analytically Invertible Finite Descriptors
In a previous work, we have proposed a morphing method based on invertible and stable descriptors that are invariant to Euclidean transformations and to the starting point. The stability guarantees the closeness in the shape sense of the reconstructed intermediate contours. However, this set of descriptors is not defined by a general expression. Here, we propose several sets of stable and invertible finite descriptors expressed by the same formula. Its stability is proven for a subset of this family thanks to the finite-dimension of the invariant space. Such finite dimension results from the Discrete Fourier Transform model that is used instead of Fourier coefficients. Moreover, an analytical general inverse formula is established. The use of the inverse analytical formula and the double utilization of the Fast Fourier Transform ensure an effective blending while being computationally efficient. Finally, we propose a new quantitative criterion for shape morphing. The latter is based on the Euclidean distances between successive curves in a morphing sequence after applying a given registration. Therefore, it allows us to compare the blending results of each set of descriptors. Several experiments are conducted on KIMIA’99 and MPEG-7 datasets. The results highlight the concordance of this criterion with the morphing visual quality and indicate which set of descriptors generates the most appropriate blending.
Code (2)
Similar Papers 제목 키워드 기반
Learning Dynamics Models with Stable Invariant Sets
Invariance and stability are essential notions in dynamical systems study, and thus it is of great interest to learn a dynamics model with a stable invariant set. However, existing methods can only handle the stability o…
MintNet: Building Invertible Neural Networks with Masked Convolutions
We propose a new way of constructing invertible neural networks by combining simple building blocks with a novel set of composition rules. This leads to a rich set of invertible architectures, including those similar to …
Image GenerationHow Regularization Terms Make Invertible Neural Networks Bayesian Point Estimators
Can regularization terms in the training of invertible neural networks lead to known Bayesian point estimators in reconstruction? Invertible networks are attractive for inverse problems due to their inherent stability an…
Analytic Bijections for Smooth and Interpretable Normalizing Flows
A key challenge in normalizing flows is finding expressive invertible scalar bijections. Existing approaches face trade-offs: affine transformations are smooth and analytically invertible but lack expressivity; monotonic…
Moment-Based 3D Gaussian Splatting: Resolving Volumetric Occlusion with Order-Independent Transmittance
The recent success of 3D Gaussian Splatting (3DGS) has reshaped novel view synthesis by enabling fast optimization and real-time rendering of high-quality radiance fields. However, it relies on simplified, order-dependen…
Novel View Synthesis