A Fast Texture Synthesis Technique using Spatial Neighborhood

نویسندگان

  • Muath Sabha
  • Philip Dutré
چکیده

In this technical report, we present a texture synthesis technique that stores all possible histories in memory structure acting as a Finite State Machine. The histories, which are the most probable spatial neighborhood for each pixel or patch, are stored in each state of the FSM. After constructing that structure, the synthesis goes very fast and smooth in a raster scan order. We found that our technique works well for a wide variety of textures, ranging from stochastic to regular structured textures, including near-regular textures. We show that our technique is faster, and gives better results than previous pixelor patch-based techniques, with minimal user input.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sample - Based Texture Synthesis

The goal of this dissertation is to attain a fast texture synthesis technique able to generate visually pleasing results from a sample texture for a wide range of texture categories. Computer graphics applications often use textures to decorate virtual objects in order to increase realism without modifying geometric details. In recent years, texture synthesis has been a useful tool to generate ...

متن کامل

Ãìàçäáãã Íaeáîîêëáììáì Ääíîîae Ëñôð¹×× Ìüøùöö Ëýòø×× List of Abbreviations

The goal of this dissertation is to attain a fast texture synthesis technique able to generate visually pleasing results from a sample texture for a wide range of texture categories. Computer graphics applications often use textures to decorate virtual objects in order to increase realism without modifying geometric details. In recent years, texture synthesis has been a useful tool to generate ...

متن کامل

Texture Synthesis using TSVQ and Target Re-synthesis

This paper presents a simple texture synthesis method that is fast, efficient, and optimized. Given an input texture, the algorithm will synthesize a texture image of specified size by matching output image pixel neighborhoods with input pixel neighborhoods. The pixel-neighborhood matching will be aided by the use of a TreeStructured Vector Quantization (TSVQ) method which will allow the algori...

متن کامل

Model-based Estimation of Texels and Placement Grids for Fast Realistic Texture Synthesis

This paper describes the basic steps of a new technique, called bunch sampling, that enables the realistic synthesis of spatially homogeneous textures. A geometric shape of the bunch (acting as a texel) and spatial placement grid governing relative positions of the bunches are estimated from the training texture by using a generic Gibbs random field texture model with multiple pairwise pixel in...

متن کامل

Texture Synthesis using Exact Neighborhood Matching

In this paper we present an elegant pixel-based texture synthesis technique which is able to generate visually pleasing results from source textures of both stochastic and structured nature. Inspired by the observation that the most common artefacts which occur when synthesizing textures are high frequency discontinuities, our technique tries to avoid these artefacts by forcing at least one of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005