Search Results (9)

Mesh subdivision is a common mesh-processing algorithm used to improve model accuracy and surface smoothness. Its classical scheme adopts a fixed linear vertex update strategy and is implemented iteratively, which often results in excessive mesh smoothness. In recent years, a nonlinear subdivision method that uses neural network methods, called neural subdivision (NS), has been proposed. However, as a new scheme, its application scope and the effect of its algorithm need to be improved. To solve the above problems, a graph neural network method based on neural subdivision was used to realize mesh subdivision. Unlike fixed half-flap structures, the non-fixed mesh patches used in this paper naturally expressed the interior and boundary of a mesh and learned its spatial and topological features. The tensor voting strategy was used to replace the half-flap spatial transformation method of neural subdivision to ensure the translation, rotation, and scaling invariance of the algorithm. Dynamic graph convolution was introduced to learn the global features of the mesh in the way of stacking, so as to improve the subdivision effect of the network on the extreme input mesh. In addition, vertex neighborhood information was added to the training data to improve the robustness of the subdivision network. The experimental results show that the proposed algorithm achieved a good subdivision of both the general input mesh and extreme input mesh. In addition, it effectively subdivided mesh boundaries. In particular, using the general input mesh, the algorithm in this paper was compared to neural subdivision through quantitative experiments. The proposed method reduced the Hausdorff distance and the mean surface distance by 27.53% and 43.01%, respectively. Full article

This paper presents the advanced classes of linear symmetric subdivision schemes for the fitting of data and the creation of geometric shapes. These schemes are derived from the B-spline and Lagrange’s blending functions. The important characteristics of the derived schemes, including continuity, support, and the impact of parameters on the magnitude of the artifact and Gibbs oscillations are discussed. Schemes additionally generalize various subdivision schemes. Linear symmetric subdivision schemes can produce Gibbs oscillations when the initial data is taken from discontinuous functions. Additionally, these schemes may generate unwanted artifacts in the limit curve that do not exist in the original polygon. One solution is to use non-linear schemes, but this approach increases the computational complexity of the scheme. An alternative approach is proposed that involves modifying the linear symmetric schemes by introducing parameters into the linear rules. The suitable values of these parameters reduce or eliminate Gibbs oscillations and artifacts while still using linear symmetric schemes. Our approach provides a balance between reducing or eliminating Gibbs oscillations and artifacts while maintaining computational efficiency. Full article

As the basis for guiding business process decisions, flowcharts contain sensitive information pertaining to process-related concepts. Therefore, it is necessary to encrypt them to protect the privacy or security of stakeholders. Using the principles of image singular value decomposition, chaotic system randomness, and neural network camouflage, a business flow chart encryption method based on dynamic selection chaotic system and singular value decomposition is proposed. Specifically, a dynamic selected chaotic system is constructed based on the nonlinear combination of one-dimensional chaotic system Logistics and Sine, and its randomness is verified. Next, using the neural network, the process image is merged into a gray matrix. The double-bit unitary matrix scrambling based on singular value decomposition is then proposed. Subsequently, using the dynamic selected chaotic system, a new sub-division diffusion method is proposed, which combines, diffuses, and performs weighted superposition to generate a matrix after diffusion and compression. Finally, the asymmetric encryption method encrypts the color image and reduces its dimensionality into a single grayscale ciphertext, and the decryption process is not the reverse of the encryption process. Simulation results and performance analysis show that the proposed image encryption scheme has good encryption performance. Full article

In this article, a nonlinear binary three-point non-interpolatory subdivision scheme is presented. It is based on a nonlinear perturbation of the three-point subdivision scheme: A new three point approximating $C^2$ subdivision scheme, where the convergence and the stability of this linear subdivision scheme are analyzed. It is possible to prove that this scheme does not present Gibbs oscillations in the limit functions obtained. The numerical experiments show that the linear scheme is stable even in the presence of jump discontinuities. Even though, close to jump discontinuities, the accuracy is loosed. This order reduction is equivalent to the introduction of some diffusion. Diffusion is a good property for subdivision schemes when the discontinuities are numerical, i.e., they appear when discretizing a continuous function close to high gradients. On the other hand, if the initial control points come from the discretization of a piecewise continuous function, it can be interesting that the subdivision scheme produces a piecewise continuous limit function. For instance, in the approximation of conservation laws, real discontinuities appear as shocks in the solution. The nonlinear modification introduced in this work allows to attain this objective. As far as we know, this is the first subdivision scheme that appears in the literature with these properties. Full article

To simulate sheet metal forming processes precisely, an in-house dynamic explicit code was developed to apply a new solid-shell element to sheet metal forming analyses, with a corotational coordinate system utilized to simplify the nonlinearity and to integrate the element with anisotropic constitutive laws. The enhancing parameter of the solid-shell element, implemented to circumvent the volumetric and thickness locking phenomena, was condensed into an explicit form. To avoid the rank deficiency, a modified physical stabilization involving the B-bar method and reconstruction of transverse shear components was adopted. For computational efficiency of the solid-shell element in numerical applications, an adaptive mesh subdivision scheme was developed, with element geometry and contact condition taken as subdivision criteria. To accurately capture the anisotropic behavior of sheet metals, material models with three different anisotropic yield functions were incorporated. Several numerical examples were carried out to validate the accuracy of the proposed element and the efficiency of the adaptive mesh subdivision. Full article

In this paper, we introduce and analyze the behavior of a nonlinear subdivision operator called PPH, which comes from its associated PPH nonlinear reconstruction operator on nonuniform grids. The acronym PPH stands for Piecewise Polynomial Harmonic, since the reconstruction is built by using piecewise polynomials defined by means of an adaption based on the use of the weighted Harmonic mean. The novelty of this work lies in the generalization of the already existing PPH subdivision scheme to the nonuniform case. We define the corresponding subdivision scheme and study some important issues related to subdivision schemes such as convergence, smoothness of the limit function, and preservation of convexity. In order to obtain general results, we consider σ quasi-uniform grids. We also perform some numerical experiments to reinforce the theoretical results. Full article

Means of positive numbers appear in many applications and have been a traditional matter of study. In this work, we focus on defining a new mean of two positive values with some properties which are essential in applications, ranging from subdivision and multiresolution schemes to the numerical solution of conservation laws. In particular, three main properties are crucial—in essence, the ideas of these properties are roughly the following: to stay close to the minimum of the two values when the two arguments are far away from each other, to be quite similar to the arithmetic mean of the two values when they are similar and to satisfy a Lipchitz condition. We present new means with these properties and improve upon the results obtained with other means, in the sense that they give sharper theoretical constants that are closer to the results obtained in practical examples. This has an immediate correspondence in several applications, as can be observed in the section devoted to a particular example. Full article

Multiresolution representations of data are known to be powerful tools in data analysis and processing, and they are particularly interesting for data compression. In order to obtain a proper definition of the edges, a good option is to use nonlinear reconstructions. These nonlinear reconstruction are the heart of the prediction processes which appear in the definition of the nonlinear subdivision and multiresolution schemes. We define and study some nonlinear reconstructions based on the use of nonlinear means, more in concrete the so-called Generalized means. These means have two interesting properties that will allow us to get associated reconstruction operators adapted to the presence of discontinuities, and having the maximum possible order of approximation in smooth areas. Once we have these nonlinear reconstruction operators defined, we can build the related nonlinear subdivision and multiresolution schemes and prove more accurate inequalities regarding the contractivity of the scheme for the first differences and in turn the results about stability. In this paper, we also define a new nonlinear two-dimensional multiresolution scheme as non-separable, i.e., not based on tensor product. We then present the study of the stability issues for the scheme and numerical experiments reinforcing the proven theoretical results and showing the usefulness of the algorithm. Full article

The occurrence of the Gibbs phenomenon near irregular initial data points is a widely known fact in curve generation by interpolating subdivision schemes. In this article, we propose a family of 5-point nonlinear ternary interpolating subdivision schemes. We provide the convergence analysis and prove that this family of subdivision schemes is $C^2$ continuous. Numerical results are presented to show that nonlinear schemes reduce the Gibbs phenomenon significantly while keeping the same order of smoothness. Full article