Fabio Pellacini

Fabio Pellacini

Auto-generated profile, based on publicly available information

Fabio Pellacini

University of Modena and Reggio Emilia Italy

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 September 2015 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
TSThorsten‐Walther Schmidt
Thorsten‐Walther Schmidt
FPFabio Pellacini
Fabio Pellacini
DNDerek Nowrouzezahrai
Derek Nowrouzezahrai
WJWojciech Jarosz
Wojciech Jarosz
CDCarsten Dachsbacher
Carsten Dachsbacher

1 August 2008
Verified
Conference Paper
Open access
PDF file
XAXiaobo An
Xiaobo An
FPFabio Pellacini
Fabio Pellacini
We present an intuitive and efficient method for editing the appearance of complex spatially-varying datasets, such as images and measured materials. In our framework, users specify rough adjustments that are refined interactively by enforcing the policy that similar edits are applied to spatially-close regions of similar appearance. Rather than proposing a specific user interface, our method allows artists to quickly and imprecisely specify the initial edits with any method or workflow they feel most comfortable with. An energy optimization formulation is used to propagate the initial rough adjustments to the final refined ones by enforcing the editing policy over all pairs of points in the dataset. We show that this formulation is equivalent to solving a large linear system defined by a dense matrix. We derive an approximate algorithm to compute such a solution interactively by taking advantage of the inherent structure of the matrix. We demonstrate our approach by editing images, HDR radiance maps, and measured materials. Finally, we show that our framework generalizes prior methods while providing significant improvements in generality, robustness and efficiency.

17 July 2020 in The Visual Computer
Verified
Journal Article
Open access
PDF file
TDTinsae G. Dulecha
Tinsae G. Dulecha
FFFilippo A. Fanni
Filippo A. Fanni
FPFederico Ponchio
Federico Ponchio
FPFabio Pellacini
Fabio Pellacini
AGAndrea Giachetti
Andrea Giachetti
Reflectance transformation imaging (RTI) is a computational photography technique widely used in the cultural heritage and material science domains to characterize relieved surfaces. It basically consists of capturing multiple images from a fixed viewpoint with varying lights. Handling the potentially huge amount of information stored in an RTI acquisition that consists typically of 50–100 RGB values per pixel, allowing data exchange, interactive visualization, and material analysis, is not easy. The solution used in practical applications consists of creating “relightable images” by approximating the pixel information with a function of the light direction, encoded with a small number of parameters. This encoding allows the estimation of images relighted from novel, arbitrary lights, with a quality that, however, is not always satisfactory. In this paper, we present NeuralRTI, a framework for pixel-based encoding and relighting of RTI data. Using a simple autoencoder architecture, we show that it is possible to obtain a highly compressed representation that better preserves the original information and provides increased quality of virtual images relighted from novel directions, especially in the case of challenging glossy materials. We also address the problem of validating the relight quality on different surfaces, proposing a specific benchmark, SynthRTI, including image collections synthetically created with physical-based rendering and featuring objects with different materials and geometric complexity. On this dataset and as well on a collection of real acquisitions performed on heterogeneous surfaces, we demonstrate the advantages of the proposed relightable image encoding.

3 May 2022 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
CMClaudio Mancinelli
Claudio Mancinelli
GNGiacomo Nazzaro
Giacomo Nazzaro
FPFabio Pellacini
Fabio Pellacini
EPEnrico Puppo
Enrico Puppo
We present a practical framework to port Bézier curves to surfaces. We support the interactive drawing and editing of Bézier splines on manifold meshes with millions of triangles, by relying on just repeated manifold averages. We show that direct extensions of the de Casteljau and Bernstein evaluation algorithms to the manifold setting are fragile, and prone to discontinuities when control polygons become large. Conversely, approaches based on subdivision are robust and can be implemented efficiently. We implement manifold extensions of the recursive de Casteljau bisection, and an open-uniform Lane-Riesenfeld subdivision scheme. For both schemes, we present algorithms for curve tracing, point evaluation, and approximated point insertion. We run bulk experiments to test our algorithms for robustness and performance, and we compare them with other methods at the state of the art, always achieving correct results and superior performance. For interactive editing, we port all the basic user interface interactions found in 2D tools directly to the mesh. We also support mapping complex SVG drawings to the mesh and their interactive editing.

29 November 2021 in ACM Transactions on Graphics
Verified
Journal Article
Open access
GNGiacomo Nazzaro
Giacomo Nazzaro
EPEnrico Puppo
Enrico Puppo
FPFabio Pellacini
Fabio Pellacini
Tangles are complex patterns, which are often used to decorate the surface of real-world artisanal objects. They consist of arrangements of simple shapes organized into nested hierarchies, obtained by recursively splitting regions to add progressively finer details. In this article, we show that 3D digital shapes can be decorated with tangles by working interactively in the intrinsic metric of the surface. Our tangles are generated by the recursive application of only four operators, which are derived from tracing the isolines or the integral curves of geodesics fields generated from selected seeds on the surface. Based on this formulation, we present an interactive application that lets designers model complex recursive patterns directly on the object surface without relying on parametrization. We reach interactive speed on meshes of a few million triangles by relying on an efficient approximate graph-based geodesic solver.

30 July 2022 in Computer Graphics Forum
Verified
Journal Article
Closed access
MRMarzia Riso
Marzia Riso
DSDavide Sforza
Davide Sforza
FPFabio Pellacini
Fabio Pellacini