This paper introduces an improved graph cut approach and combines it with commonly used surface texture representations
for synthesis. Unlike graph cut which supports iterative refinement for improvement of the patch seams, the improved graph
cut method re-synthesis the max error overlap region using k-nearest neighbor method. This paper follows a simple 3D
surface texture synthesis framework, which comprises three steps: capture, synthesis and relighting. Firstly, it represents 3D
surface textures under varied illumination directions using gradient and albedo maps. Then, it uses the surface representation
to synthesis a description of a larger surface. Finally, it renders the surface representation. It proposes an improved graph cut
method for the synthesis step, and the proposed method can generate perceptually smooth images of 3D surface texture from
small samples.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.