2013
DOI: 10.1117/12.2005851
|View full text |Cite
|
Sign up to set email alerts
|

Video game watermarking

Abstract: The publishers of video games suffer from illegal piracy and information leakage caused by end-consumers, "release groups"or insiders shortly after or even before the official release of a new video game. Mechanisms to prevent or at least postpone this illegal redistribution are DRM or copy protection mechanisms. However, these mechanisms are very unpopular, because they restrict the customers in playing the game and demand a high administration effort from the developers and/or distributors. Even worse, most … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Conforming to the special watermarking requirements in video game applications [3], new requirements and challenges for watermarking texture files are listed as follows.…”
Section: Requirements Of Texture Watermarkingmentioning
confidence: 99%
See 3 more Smart Citations
“…Conforming to the special watermarking requirements in video game applications [3], new requirements and challenges for watermarking texture files are listed as follows.…”
Section: Requirements Of Texture Watermarkingmentioning
confidence: 99%
“…Consequently the impact on the robustness caused by DXTn compression is not controllable. Furthermore, the embedding process in most algorithms is not separable and scalable, which makes them unsuitable for watermark container technique and distributed embedding for an image set [3].…”
Section: Requirements Of Texture Watermarkingmentioning
confidence: 99%
See 2 more Smart Citations
“…For an even number of vertices, the average distance of the two corresponding median vertices is taken, i.e. 1 2 r(v i |b i |/2 ) + r(v i |b i |/2 ) . Note that the vertices have been sorted with respect to their distance to the center point C. Figure 2 illustrates the creation of four bins, i.e.…”
Section: Bin Creationmentioning
confidence: 99%