2003
DOI: 10.1145/882262.882264
|View full text |Cite
|
Sign up to set email alerts
|

Graphcut textures

Abstract: In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output and then stitched together along optimal seams to generate a new (and typically larger) output. In contrast to other techniques, the size of the patch is not chosen a-priori , but instead a graph cut technique is used to determine the optimal patch region for any given offset between… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0
2

Year Published

2006
2006
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 716 publications
(83 citation statements)
references
References 24 publications
0
81
0
2
Order By: Relevance
“…The algorithm complexity (linear for the proposed method) has not been incorporated in the list because most discussed methods do not provide us with this information. Yet, according to [21], finding the best cut for a graph with n nodes appears to be Oðn logðnÞÞ, while the worst case is known to be Oðn 2 Þ, [31]. Table 1 summarizes the results of our comparison.…”
Section: Comparison With Other Methodologiesmentioning
confidence: 99%
See 2 more Smart Citations
“…The algorithm complexity (linear for the proposed method) has not been incorporated in the list because most discussed methods do not provide us with this information. Yet, according to [21], finding the best cut for a graph with n nodes appears to be Oðn logðnÞÞ, while the worst case is known to be Oðn 2 Þ, [31]. Table 1 summarizes the results of our comparison.…”
Section: Comparison With Other Methodologiesmentioning
confidence: 99%
“…The method by Peleg [29] concerns the elimination of existing seams rather than the actual composition of overlapping images, so it has not been included in the comparison. Finally, to reduce the size of the table, methods based on the computation of paths of minimal cost [28], [14], [17] have been grouped as well as those based on graph cuts [21], [2]. The table is binary in the sense that its scope is to indicate whether a given method satisfies a given property or not.…”
Section: Comparison With Other Methodologiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Blending, for instance, introduces some new frequencies (over-blurring), thus deteriorating visual aspects. Better results are usually obtained using a clever "cutting trajectory" along the overlap, computed according to an errorminimizing factor [5,13]. Recent improvements in the field of texture synthesis focus on recovering even better some feature-related aspects [26] by using additionally Laplacian filters.…”
Section: Related Work and Motivationmentioning
confidence: 99%
“…The main research trend in these methods is to minimize the mismatches on the boundaries between patches, after their placement in the corresponding output. The new patch can be blended [11] with the already synthesized portion, or an optimal cut can be found for seaming the two patches [12,13]. The patch-based methods have shown the best synthesis results up to now.…”
Section: Introductionmentioning
confidence: 99%