Texture Synthesis: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: number of pixels | $n$: number of pixels | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 22: | Line 22: | ||
| [[non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis)|non-parametric sampling Efros and Leung]] || 1999 || $O(n^{3})$ || || || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/790383 Time] | | [[non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis)|non-parametric sampling Efros and Leung]] || 1999 || $O(n^{3})$ || || || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/790383 Time] | ||
|- | |- | ||
| [[image analogies Hertzmann (Texture Synthesis Texture Synthesis)|image analogies Hertzmann]] || 2001 || $O(N log n)$ || || || Deterministic || [https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/383259.383295 Time] | | [[image analogies Hertzmann (Texture Synthesis Texture Synthesis)|image analogies Hertzmann]] || 2001 || $O(N \log n)$ || || || Deterministic || [https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/383259.383295 Time] | ||
|- | |- | ||
| [[R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis)|R. Paget ; I.D. Longstaff]] || 1998 || $O(n^{3})$ || || || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/679446 Time] | | [[R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis)|R. Paget ; I.D. Longstaff]] || 1998 || $O(n^{3})$ || || || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/679446 Time] | ||
Latest revision as of 09:24, 10 April 2023
Description
Given a texture sample, synthesize a new texture that, when perceived by a human observer, appears to be generated by the same underlying stochastic process.
Parameters
$n$: number of pixels
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| tree-structured vector quantization Wei-Levoy | 2000 | $O(n^{2} log n)$ | $O(nd)$ | Deterministic | Time & Space | |
| Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf | 2017 | $O(N)$ | $O(N)$ | Deterministic | Time & Space | |
| non-parametric sampling Efros and Leung | 1999 | $O(n^{3})$ | Deterministic | Time | ||
| image analogies Hertzmann | 2001 | $O(N \log n)$ | Deterministic | Time | ||
| R. Paget ; I.D. Longstaff | 1998 | $O(n^{3})$ | Deterministic | Time | ||
| Image quilting Efros-Freeman | 2001 | $O(n^{3})$ | Deterministic | Time | ||
| Kwatra | 2003 | $O(n^{3})$ | Deterministic | Time | ||
| CNN Based Gatys; Leon A | 2001 | $O(n^{3})$ | Deterministic |