Andrea Silvetti
Universidad Nacional del Sur
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Andrea Silvetti.
Computers & Geosciences | 2013
Andrea Silvetti; Claudio Delrieux
We present a new method for computing the local fractal dimension in remote sensing imagery. It is based on a novel way of estimating the quadratic self correlation (or 2D Hurst coefficient) of the pixel values. The method is thoroughly tested with a set of synthetic images an also with remote sensing imagery to assess the usefulness of the techniques for unsupervised image segmentation. We make a comparison with other estimators of the local fractal dimension. Quadratic self-correlation methods provide more accurate results with synthetic images, and also produce more robust and fit segmentations in remote sensing imagery. Even with very small computation windows, the methods prove to be able to detect borders and details precisely.
international conference of the chilean computer science society | 1997
Andrea Silvetti; Claudio Delrieux; Silvia Mabel Castro
Interactive CAGD systems produce faster and more accurate curve and surface analysis and design by means of geometric or algebraic interpolation algorithms, where users can directly modify and edit the position and shape of curves or surfaces. For this reason, many claim that interpolation schemata are more flexible and intuitive than approximation schemata. Also, in engineering and architectural design problems there are position and slope constraints to fulfill that, with standard approximation schemata, are harder to produce. However, interpolation methods are limited with respect to the analytic properties of the resulting curves and surfaces. Piecewise polynomial interpolation methods only guarantees a C/sup 1/ continuity order, which is usually unacceptable. In this work we propose an interpolation method, named T-Splines or tangent splines. Starting with interpolating points and derivatives, a T-Spline is the (approximating) cubic Spline over an ancillary control graph, whose approximation is also a solution of the required interpolation. We present the necessary conditions for finding the ancillary control graph from the interpolation points and derivatives. In addition we give a nonuniform parametrization schema such that a nonuniform B-Spline approximation of the ancillary control points is a C/sup 2/ piecewise polynomial interpolation of the original control points. Some applications are also discussed.
Archive | 2007
Andrea Silvetti; Claudio Delrieux
I Workshop de Investigadores en Ciencias de la Computación | 1999
Silvia Mabel Castro; Andrea Silvetti; Claudio Delrieux; Ernesto Bjerg
XIV Congreso Argentino de Ciencias de la Computación | 2008
Andrea Silvetti; Claudio Delrieux
X Workshop de Investigadores en Ciencias de la Computación | 2008
Andrea Silvetti; Claudio Delrieux
II Workshop de Investigadores en Ciencias de la Computación | 2000
Andrea Silvetti; Claudio Delrieux; Silvia Mabel Castro
V Congreso Argentino de Ciencias de la Computación | 1999
Silvia Mabel Castro; Claudio Delrieux; Andrea Silvetti
V Congreso Argentino de Ciencias de la Computación | 1999
Andrea Silvetti; Claudio Delrieux; Silvia Mabel Castro
I Workshop de Investigadores en Ciencias de la Computación | 1999
Andrea Silvetti; Silvia Mabel Castro; Claudio Delrieux