Publication

Self Tuning Texture Optimization

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Probabilistic modeling of texture transition for fast tracking and delineation

Seyed Ali Shahrokni

In this thesis a probabilistic approach to texture boundary detection for tracking applications is presented. We have developed a novel fast algorithm for Bayesian estimation of texture transition locations from a short sequence of pixels on a scanline tha ...

EPFL2005

Adapting the Sample Size in Texture Synthesis

Sabine Süsstrunk, Luciano Sbaiz, Roberto Costantini

Starting from a sample of a given size, texture synthesis algorithms are used to create larger texture images. A good algorithm produces synthesized textures that are pixelwise different but perceptually indistinguishable from the original image. The sampl ...

2005

Perspective accurate splatting

Mark Pauly

We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous methods, this leads to perspective correct splat shapes, avoiding artifacts such ...

2004

A Measure For Spatial Dependency In Natural Stochastic Textures

Sabine Süsstrunk, Roberto Costantini, Gloria Menegaz

Random textures differ from natural textures because they lack structure. Structure is a concept that is difficult to formalize, however, we generally observe that it is associated to spatial dependency between adjacent pixels. Random textures, in fact, ar ...

2004

Rate-distortion optimal mesh simplification for communications

Laurent Balmelli

The thesis studies the optimization of a specific type of computer graphic representation: polygon-based, textured models. More precisely, we focus on meshes having 4-8 connectivity. We study a progressive and adaptive representation for textured 4-8 meshe ...

EPFL2002

Rotation invariant texture characterization and retrieval using steerable wavelet-domain hidden Markov models

Martin Vetterli, Minh Do

We present a new statistical model for characterizing texture images based on wavelet-domain hidden Markov models. With a small number of parameters, the new model captures both the subband marginal distributions and the dependencies across scales and orie ...

2002

Splines and wavelets for image warping and projection

Stefan Horbelt

This thesis investigates advanced signal processing concepts and their application to geometric processing and transformations of images and volumes. In the first part, we discuss the class of transformations that project volume data onto a plane using par ...

EPFL2001

Texture Mapping by Successive Refinement

Michaël Unser, Philippe Thévenaz

We define texture mapping as an optimization problem for which the goal of preserving the maximum amount of information in the mapped texture. We derive a solution that is optimal in the least-squares sense and that corresponds to the pseudo-inverse of a ...

IEEE2000

Texture mapping by successive refinement

Michaël Unser, Philippe Thévenaz, Stefan Horbelt

2000

3D surface cellular automata and their applications

Stéphane Gobron

This paper describes the generation and rendering of three-dimensional (3D) surface cellular automata (CA). Our model’s main advantage is that it gives direct texturing simulation based on the actual shape of anytriangulated input object. We first introduc ...

1999