Search results for "Subdivision"
showing 10 items of 52 documents
Representation of NURBS surfaces by Controlled Iterated Functions System automata
2019
Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures.This work focuses…
On the application of the generalized means to construct multiresolution schemes satisfying certain inequalities proving stability
2021
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 o…
Partial volume correction for volume estimation of liver metastases and lymph nodes in CT scans using spatial subdivision
2010
In oncological therapy monitoring, the estimation of tumor growth from consecutive CT scans is an important aspect in deciding whether the given treatment is adequate for the patient. This can be done by measuring and comparing the volume of a lesion in the scans based on a segmentation. However, simply counting the voxels within the segmentation mask can lead to significant differences in the volume, if the lesion has been segmented slightly differently by various readers or in different scans, due to the limited spatial resolution of CT and due to partial volume effects. We present a novel algorithm for measuring the volume of liver metastases and lymph nodes which considers partial volum…
A Graph Based Algorithm For Intersection Of Subdivision Surfaces
2003
Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the fol…
Weighted-Power p Nonlinear Subdivision Schemes
2012
In this paper we present and analyze a generalization of the Powerp subdivision schemes proposed in [3,12]. The Weighted-Powerp schemes are based on a harmonic weighted version of the Power<emp average considered in [12], and their development is motivated by the desire to generalize the nonlinear analysis in [3,5] to interpolatory subdivision schemes with higher than second order accuracy.
Polynomial Smoothing Splines
2014
Interpolating splines is a perfect tool for approximation of a continuous-time signal \(f(t)\) in the case when samples \(x[k]=f(k),\;k\in \mathbb {Z}\) are available. However, frequently, the samples are corrupted by random noise. In such case, the so-called smoothing splines provide better approximation. In this chapter we describe periodic smoothing splines in one and two dimensions. The SHA technique provides explicit expression of such splines and enables us to derive optimal values of the regularization parameters.
A structured filter for Markovian switching systems
2014
In this work, a new methodology for the structuring of multiple model estimation schemas is developed. The proposed filter is applied to the estimation and detection of active mode in dynamic systems. The discrete-time Markovian switching systems represented by several linear models, associated with a particular operating mode, are studied. Therefore, the main idea of this work is the subdivision of the models set to some subsets in order to improve the detection and estimation performances. Each subset is associated with sub-estimators based on models of the subset. In order to compute the global estimate and subset probabilities, a global estimator is proposed. Theoretical developments ba…
Subdivision into i-packings and S-packing chromatic number of some lattices
2015
An ?$i$?-packing in a graph ?$G$? is a set of vertices at pairwise distance greater than ?$i$?. For a nondecreasing sequence of integers ?$S=(s_1,s_2,\ldots)$?, the?$S$?-packing chromatic number of a graph ?$G$? is the least integer ?$k$? such that there exists a coloring of ?$G$? into ?$k$? colors where each set of vertices colored ?$i$?, ?$i=1,\ldots,k$?, is an ?$s_i$?-packing. This paper describes various subdivisions of an ?$i$?-packing into ?$j$?-packings ?$(j>i)$? for the hexagonal, square and triangular lattices. These results allow us to bound the ?$S$?-packing chromatic number for these graphs, with more precise bounds and exact values for sequences ?$S=(s_i,i \in \mathbb{N}^*)$?, …
Espaces tangents pour les formes auto-similaires
2013
The fractal geometry is a relatively new branch of mathematics that studies complex objects of non-integer dimensions. It finds applications in many branches of science as objects of such complex structure often poses interesting properties. In 1988 Barnsley presented the Iterative Func-tion System (IFS) model that allows modelling complex fractal shapes with only a limited set of contractive transformations. Later many other models were based on the IFS model such as Language-Restricted IFS,Projective IFS, Controlled IFS and Boundary Controlled IFS. The lastto allow modelling complex shapes with control points and specific topol-ogy. These models cover classical geometric models such as B-…
Modelling the occurrence of rainy days under a typical Mediterranean climate
2014
The statistical inference of the alternation of wet and dry periods in daily rainfall records can be achieved through the modelling of inter-arrival time-series, IT, defined as the succession of times elapsed from a rainy day and the one immediately preceding it. In this paper, under the hypothesis that ITs are independent and identically distributed random variables, a modelling framework based on a generalisation of the commonly adopted Bernoulli process is introduced. Within this framework, the capability of three discrete distributions, belonging to the Hurwitz–Lerch-Zeta family, to reproduce the main statistical features of IT time-series was tested. These distributions namely Lerch-se…