<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Collaborative Fake Media Detection in a Trust-Aware Real-Time Distribution Network</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dominik Renzel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Khaled A. N. Rashed</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ralf Klamma</string-name>
          <email>klammag@dbis.rwth-aachen.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Informatik 5 (Information Systems &amp; Databases), RWTH Aachen University Ahornstr.</institution>
          <addr-line>55, D-52056, Aachen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Due to the increased incorporation of external sources media agencies face the challenge of providing high-trust media to their customers. Automatic image processing approaches still do not bridge the semantic gap to identify fakes. Complementary community-based approaches lack real-time media distribution for improved awareness and base trust on subjective opinions instead of objective actions. In this paper we propose a collaborative fake media detection approach addressing these challenges in form of a federated, trust-aware media distribution network. Starting from a realistic use case scenario we elicit requirements and present an XMPP-based and Web service-enhanced multimedia distribution network as solution. Finally, we sketch a Web-based fake media detection application powered by our network and its services.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Traditionally, people consider images as a means for true reproduction of real
events and accepted as a proof of occurrence of such events. Recently, this
consideration is not longer valid since fake images have a high occurrence
especially now that images can be faked and distributed arbitrarily without much
e ort. Nowadays, news creation processes have taken signi cant distance from
being conducted in isolation. Following the basic principles of the Open
Innovation approach [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], in today's media distribution networks di erent communities
are involved as both information providers and consumers. With the growing
availability of low-cost high-quality multimedia processing and context sensor
equipment in mobile devices, it has already become widespread practice to even
have amateur reporters on site of interesting events serve as information sources.
With such an inherently distributed approach, the authenticity of distributed
multimedia is even more endangered than in previous more isolated approaches.
Today's media thus face the challenge of deciding if media are real or faked, ideally
before they are further broadcasted to their customers, who pay for high-trust
media.
      </p>
      <p>
        Consider the following infamous cases where faked media were nally published
to information end-consumers. A recent example of a faked image manipulated
by the newspaper Al-Ahram and published in international media is showing the
Egyptian president Mubarak at the front of a group of world leaders, where in
2
the original image he was lagging behind (cf. Figure 1). The fake thus tried to
transport a subtle propagandistic message of a distorted reality. In turn, news
papers and TV stations had to issue errata to recover their reputation.
Such events are eroding the public trust in media. Therefore, media agencies
are required to make their distribution channels capable of identifying media
fakery at the earliest stage possible not only to avoid reports of a distorted reality
with possible negative consequences, but also to avoid additional costs due to
the following correction means. The most desirable solution is automatic fake
detection, but current methods still cannot identify semantic inconsistencies in
media (cf. [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]). Thus, complementary Web 2.0 community-based approaches
were developed to involve people in such processes. Systems such as NewsTrust
(http://newstrust.com) pursue such an approach. However, information still has
to be pulled by participants, although the current trend hints to real-time
requirements and synchronous server side pushes [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] creating a new level of community
awareness. Furthermore, the quality of authenticity judgements depends on the
trustability of its judges. Current systems establish the trust level of a user by
ratings of others which are often subjective and not based on objectively valuable
contributions. Furthermore, the willingness to spend time on rating others is
mostly not given. Instead of basing trust on subjective opinions, a method is
required that objectively adapts trust levels depending on actions.
In this paper we overcome the above problems with an open standard-based
collaborative image fake detection system distributed across various communities.
The system operates in near real-time and complements traditional automatic
approaches. Our approach is powered by a set of Web services based on the
MPEG-7 standard as well as by services and infrastructure provided by the open
standard Extensible Messaging and Presence Protocol (XMPP) [
        <xref ref-type="bibr" rid="ref25 ref26">25, 26</xref>
        ] and its
extension protocols, in particular XMPP PubSub [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. A media fake detection
application connecting to our infrastructure is realized as a Web 2.0 application
consisting of a set of OpenSocial Gadgets [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] for direct communication and the
distribution of MPEG-7 [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] multimedia metadata across an XMPP network of
media agents.
      </p>
      <p>In Section 2 we rst analyze the state-of-the-art of image fakery detection
systems and technologies related to our approach. Then, in Section 3 we describe a
use case scenario where three media agencies have to detect a faked image, thereby
identifying requirements for our system. In Section 4 we present the backend of
our system as a multimedia distribution network including its individual parts in
detail. In Section 5 we present a media fake detection application powered by
our network. In Section 6 we conclude and provide an outlook to further work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Faked Image Detection: Faked image detection has been investigated for years and
addressed by a number of approaches. Watermarking approaches [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] are based on
imperceptibly embedding information within the image content. The requirements
of embedding such information in digital images are specially equipped digital
cameras. In addition, watermarking degrades the quality of the image content.
In contrast to watermarking approaches, researchers in the eld of digital image
forensics have developed passive techniques which operate in the absence of any
watermark or signature for image authentication (e.g. [
        <xref ref-type="bibr" rid="ref11 ref21 ref31 ref6">6, 21, 11, 31</xref>
        ]). They work
on the assumption that although digital forgeries may leave no visual clues of
having been tampered with, they may alter the underlying statistics of an image
that can be detected using statistical models. The major drawback of such tools
is that their use in public domains is computationally impractical.
Content based approaches (e.g.[
        <xref ref-type="bibr" rid="ref12 ref18">18, 12</xref>
        ]) aim at detecting all faked images produced
from the original through active manipulation. They are based on similarity search
and embed no additional information within the image content, thus considering
the image itself as the watermark. The e ciency of such techniques is largely
a ected by the size of the reference image dataset [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Furthermore, current
approaches lack discriminative power for fake detection due to the inability
of capturing semantic aspects. Our collaborative fake detection system utilizes
community aspects in addition to automatic content-based image similarity search
techniques [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        Collaborative Fake Detection: Sharing knowledge and control is the key idea of
collaborative fake detection [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. A Community of Practice [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] is the context
where such collaborative activities can be achieved. Knowledge about media is
exchanged within the communities of practice for example by the distribution of
MPEG-7 metadata [
        <xref ref-type="bibr" rid="ref14 ref28">14, 28</xref>
        ]. Collaborative judgments and evidence against the
suspected fake support the evaluation of semantic inconsistencies that cannot
yet be detected with automatic approaches. The important problem faced in
collaborative fake media detection is the assessment of trustable authenticity
judgments that we address in the scope of this paper.
      </p>
      <p>
        Trust Management : Trust management is a key issue in distributed networks,
especially in sharing environments. Trust provides us with information about the
people we should share content with and accept content from. There are some
e orts to formalize trust. Massa et al. propose a trust-aware model in which the
web of trust is explicitly expressed [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Golbeck analyzed and modeled the core
characteristics of trust in collaborative social networks and developed several
algorithms for computing trust on the example of the TrustMail application
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In this work, we take into account the trust of information sources and the
quality of their contributions using a simpli ed trust mechanism and present a
modular trust-aware multimedia distribution network.
      </p>
      <p>
        MPEG-7 : MPEG-7 is a standard for the description of multimedia content. It
provides descriptors for various data types - text, graphics, audio, video. In
order to achieve interoperability and keep advantages of server side computation
we have presented the Lightweight Application Server (LAS) [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] for MPEG-7
Web services. It provides communities with a set of core services and MPEG-7
semantic multimedia metadata and content processing services to connect to
heterogeneous data sources [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. In particular, the LIRE [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] library is used for
automatic extraction and indexing of low-level features as well as content based
image retrieval (CBIR).
      </p>
      <p>
        Real-time federation: Due to frequent complaints about the intransparency and
lack of control of private data storage with social networking platforms, there are
already new alternative platforms emerging (e.g. Diaspora [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]), where the same
functionality is o ered in a way that anybody can run his instance in federation
with others. At the same time, the demand for real-time application behavior [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
speeds up the information ow tremendously. Concepts such as security, privacy
and trust have to be weaved in as unobtrusive, transparent, and least blocking as
possible. In our approach we aimed to realize these requirements with a network
of federation-enabled XMPP servers including respective services and data.
Publish/Subscribe: Nowadays, the Publish/Subscribe (PubSub)[
        <xref ref-type="bibr" rid="ref2 ref5">2, 5</xref>
        ] pattern is
omnipresent (e.g. newspapers, blogs, even email lists). There is a channel of
communication (resp. a node), subscribers receiving data sent on that channel,
and publishers who send data payloads across the channel. The pattern was also
described by Gamma et al. as the behavioural Observer pattern [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Until today,
the pattern is applied successfully, sometimes working locally on one machine
or remotely across whole networks. The XMPP PubSub Extension Protocol [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
supports the construction of remote PubSub systems transporting XML-based
payloads. For this work we demonstrate the distribution of MPEG-7 multimedia
content descriptions along with authenticity ratings.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Use Case Scenario &amp; Requirements Analysis</title>
      <p>In this section we rst describe a scenario to understand a media fake detection
process in a media distribution network such as in Figure 2. Afterwards, we
derive a set of requirements for our system improving the process. Consider the
following scenario. A government press agency sends a doctored picture of a
successful long-range missile launch to Thompson Reuters as a demonstration
of the country's military power, although the real outcome of the event was a
crash of the missile. Despite the good cooperation with the government press
agency in the past, the responsible media agent recognizes the image content as
highly sensitive and thus decides to request expertise on its authenticity before
further distribution. Although some trusted experts reviewed the image, the
forgery is not discovered, and the picture distributed to customers. TV stations</p>
      <p>Media Agencies</p>
      <p>Amateur Prosumers
(Blogs, Websites, Mobile Reporting)
Professionals
TV Stations</p>
      <p>Professionals</p>
      <p>Newspapers
and newspapers around the world broadcast the sensitive information to their
audiences. After the worldwide publication of the faked picture, a group of local
dissidents who eye-witnessed the failed missile launch feel the urge to reveal the
truth. In a message sent to Reuters they describe the real situation, send their
own picture of the missile crash as proof for their statement, and state their
willingness to help prevent such incidents in future. Further expert analysis on
both pictures then reveals the fake. As a result, Reuters and all its customers issue
a corrective statement to recover their public credibility. However, to prevent
further occurrences of such situations, media agents decide to be more cautious
towards their information sources or even decide for alternative sources. On the
other hand, Reuters acknowledges the group of dissidents' help in discovering the
fake and decides to involve their expertise for further authenticity judgement.
From the above scenario we now derive a set of requirements to an information
system supporting the process described above, before we explain our approach
in the next sections.</p>
      <p>
        { media &amp; metadata repository : The rst step is to make media and their
metadata available for other parties. We base this work on our LAS MPEG-7
services and its repository [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ].
{ federated multimedia distribution network : The most important use case in
the scenario is the transport of media (metadata) between entities in real-time.
Here, PubSub is the main communication pattern. For a distributed approach,
PubSub support is required in a remote and federated manner. The network
should support arbitrary payload formats in order to stay generic. Here, we
base our approach on the XMPP Protocol and its PubSub extension [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
ful lling all these requirements.
{ authenticity rating service: a service is required that allows the collaborative
assignment of authenticity ratings to media as well as the computation
and rendering of reasonable aggregates to create awareness for fakes and to
support the decision of a media agency to publish a medium or not.
{ trust management service: a service is required that manages trust
relationships between entities again in a federated way and supports the dynamic
evolution of trust. Since the service itself must be trusted by its users, privacy
and security are non-functional requirements to be guaranteed.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>A Trust-aware Multimedia Distribution Network</title>
      <p>In this section we present a modular trust-aware multimedia distribution network
based on the above requirements. In Section 4.1 we describe a basic network
building block and its work ow. Each building block implies a simple trust
protocol which is formalized in Section 4.2. Finally, we demonstrate the composition
of complete information distribution networks of building blocks in Section 4.3.
4.1</p>
      <sec id="sec-4-1">
        <title>The Basic Building Block</title>
        <p>Conceptually, the basic building block of our architecture is a variation of the
PubSub pattern (cf. Fig. 3). The central parts of this building block are an
untrusted in node and a trusted out node with con guration under control of
a mediator. For the in node, all of the mediator's sources are publishers and
subscribers at the same time to support media distribution for collaboration. For
the out node, only the mediator is allowed to publish. The list of subscribers
re ects the mediator's consumers relying on the authenticity of the information
published. First, a source introduces a new medium along with an authenticity</p>
        <p>Sources
Trusted Sources
++++
+++
++
-
-</p>
        <p>Mediator
in out
(untrusted) (trusted)</p>
        <p>
          Consumers
Fig. 3. Building block for media distribution network
rating by publishing it to the untrusted in node that immediately pushes it to
all other sources, which in turn publish their authenticity ratings to the same
node. Based on ratings from various sources accumulated over time, the mediator
eventually decides the information to be trustworthy of being published to the
out node or not. The decision depends on the individual levels of trust towards his
sources. In Section 4.2 we provide a formalized description of our trust mechanism.
Technically, each of the building blocks described above can be realized with a set
of components depicted in Figure 4. Any XMPP Server hosting a PubSub service
as speci ed in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] realizes all necessary functionality regarding the management
and con guration of nodes, in particular controlling node subscriber and publisher
lists, as well as pushing arbitrary XML-based payloads to subscribers.
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Authenticity Rating &amp; Trust</title>
        <p>
          In this section we formalize the relationship between authenticity ratings and
trust used in our approach. Let J = fj1; :::; jng be a set of unique identi ers for
the entities involved in the fake detection process. For our approach we use JIDs
(cf. [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]). Our basic notion of trust involves two entities, i.e. a trustor tr 2 J , a
trustee te 2 J and a level of trust t(tr; te) between them. Although there exists
work on sophisticated models such as [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], trust-aware social networks usually
let users assign a single numerical rating for usability reasons [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. In our model,
the mediator m of a building block from Section 4.1 takes the role of the trustor
of a set of sources Sm J as its trustees, that publish information payloads i of
a certain domain I (in our case the domain of MPEG-7 descriptors).
For authenticity ratings, we de ne a function r that for a given i and a source s
assigns a rating 2 R = ftrue; f akeg. In the following we describe the relationship
between authenticity ratings and the dynamic adaptation of trust between
involved entities.
        </p>
        <p>Not only is t(tr; te) depending on previous authenticity statements, but also
should be adapted dynamically, either reinforcing desirable actions - in our
case publishing a faked medium as fake resp. a real one as real - or punishing
undesirable actions - in our case publishing a faked medium as real resp. a real
one as fake. Thus, reinforcement consists in tr raising his trust level towards te,
punishment in lowering it. Thus, each m must be enabled to update trust levels
8s 2 Sm. Listing 1.1 sketches an algorithm for updating trust values.</p>
        <p>}
t r u s t _ u p d a t e (m 2 J; i 2 I; x action ){
for each s 2 Sm {
if r(i; s) = f ake ^ x = pfake(m; i) then t(m; s)++;
else if r(i; s) = true ^ x = pfake(m; i) then t(m; s) - -;
else if r(i; s) = f ake ^ x = preal(m; i) then t(m; s) - -;
else if r(i; s) = true ^ x = preal(m; i) then t(m; s)++;
}</p>
        <p>Listing 1.1. Updating trust values after publication to trusted out node
Any trust update takes place whenever m feels con dent to publish i as either fake
(pfake(m; i)) or real (preal(m; i)). Furthermore, there is the option of rejecting
any publication on the trusted out node (rej(m; i)). In this case, no trust update
takes place. Since m in his role as trustor is interested in high-quality media
(metadata) and reliable authenticity ratings, he can expose trust levels as an
incentive to perform desirable actions only. To decide publication of an i, m relies
on ratings from di erent s 2 Sm, while using t(m; s) as weighting factor. For a
given i 2 I, a function a returns an aggregate supporting m in his decision which
action to take. For simplicity we chose a(m; i) as weighted mean over all ratings
on i by s 2 Sm, where the weights are given by t(m; s) (cf. Equation 1). The
intuition behind choosing the weighted mean is that the higher a source's trust
value is the more in uence his rating has on the resulting aggregate used by m
to decide on publication.</p>
        <p>a(m; i) =</p>
        <p>PjjS=m1j t(m; sj ) r(i; sj )</p>
        <p>PjjS=m1j t(m; sj )
(1)
Technically, the dynamic management of trust is realized as a service that
maintains individual levels of trust between trustors and their trustees. Ratings
of di erent sources for given information items are covered by another service.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Construction of a Network</title>
        <p>A complete distribution network can now be modeled by reasonably connecting
multiple building blocks. The intuition is that each mediator can act as a source
for another mediator. Thus, information distribution networks can dynamically
pubsub.tld1
org1-untrusted
org1-trusted</p>
        <p>17</p>
        <p>XMPP PubSub</p>
        <p>Rating Service
Trust Service</p>
        <p>Rating Service</p>
        <p>Trust Service
Jabber RPC</p>
        <p>Jabber RPC</p>
        <p>XMPP(SSAeSrvLe/rT-LtoS-S)erver
tld1</p>
        <p>tld2
contribute remotely to node org1-untrusted at pubsub.tld1</p>
        <p>pubsub.tld2
17 org2-untrusted</p>
        <p>org2-trusted
XMPP PubSub</p>
        <p>
          Fig. 4. A Trust-aware Federated Media Distribution Network
evolve over time by simple interactions with XMPP PubSub nodes. It should be
noted that it is not necessary that each entity in the network maintains its own
XMPP server, which would be acceptable e.g. for a high-pro le media agency,
but inacceptable e.g. for a freelancing information agent. For these purposes
it is possible to o er a building block from Section 4.1 as a service, which is
hosted on one XMPP server or a whole cluster. On the technical level we realize
a network of di erent interconnected building blocks by a network of XMPP
servers in combination with the provision of services for the management of users,
communities, MPEG-7 multimedia metadata, trust and authenticity rating as
indicated in Figure 4. Given the inherent XMPP server-to-server communication
[
          <xref ref-type="bibr" rid="ref25 ref26">25, 26</xref>
          ], all components are federated and accessible across the network via the
protocol and its extensions [
          <xref ref-type="bibr" rid="ref1 ref17 ref27">1, 17, 27</xref>
          ]. In particular, [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] can be used to invoke
services of our LAS.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>A Fake Multimedia Detection Application</title>
      <p>
        In this section, we brie y describe how to apply our trust-aware media distribution
network from Section 4 for realizing a fake media detection application. Figure 5
shows a rst mockup of such an application consisting of a set of three widgets.
In the following we will brie y explain the interface for collaborative fake media
detection for both the mediator and his sources, which re ects the work ow
from Section 4. In the Incoming Media Overview, the user gets an overview of
media currently discussed on all untrusted in nodes he is subscribed to. Each
element of the list provides a short summary of the medium and its metadata (cf.
i 2 I, Section 4.2) and the weighted authenticity ratings aggregate (cf. function
a, Section 4.2). From this list, the user can select any element, which is then
rendered in more detail in the Media Details widget. Apart from the medium
and its metadata, the user nds di erent buttons, depending on his role. As an
information source, the user nds a rating interface, which allows him to choose
between real or fake, add a comment and submit his rating. On submission, a
triple consisting of a source identi er, a media identi er and a rating is encoded as
an XML payload and published to the in node again. After automatic forwarding
to all subscribers, their interfaces are updated with the new information. As a
mediator, the user can decide on the three di erent actions preal, pfake, and rej
(cf. Section 4.2) by pressing the respective buttons. A trust update (cf. Listing
1.1) is executed after any publication to the trusted out node by invoking the
respective LAS service. Due to space restrictions, we will not elaborate here
on further UI elements, such as media annotation (cf. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]), advanced trust
visualisation, etc.
      </p>
      <p>
        Technically, the interface is realizable as a set of OpenSocial [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] gadgets using
XMPP/LAS AJAX client libraries to connect to the XMPP server network and
its services. For the access to PubSub nodes, we implemented an extension of the
dojo XMPP library realizing the most important use cases of [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. For the access
to LAS Services, we implemented an AJAX connector client library. However, a
further extension of the dojo XMPP library realizing the Jabber RPC extension
protocol is a preferable alternative for the future.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>
        In this paper we have demonstrated an approach for collaborative fake media
detection based on a federated, trust-aware media distribution network with near
real-time properties. We have presented an overview of related work in the domain
of fake media detection, which is dominated by image processing approaches,
that still do not bridge the semantic gap [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] and by community approaches
lacking real-time communication and trust adaptations based on objective actions.
Thus, we proposed our approach to overcome these challenges. Starting from a
realistic use case scenario we elicited requirements and presented a realization
as an XMPP-based and Web service-enhanced multimedia distribution network
supporting arbitrary XML-based payload format. Finally, we sketched the design
of a Web-based fake media detection application taking bene t from our network
and its services.
      </p>
      <p>
        At the time of writing this document many components of our multimedia
distribution network as well as connector clients have been realized and evaluated.
We already gained experience with XMPP-enabled OpenSocial Gadgets and
therefore extended the well-known dojo JS library with support for PubSub,
multi-user chats, etc. [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. With these extensions, a real-time microblogging
application was easily realizable. Although the XMPP standard provides detailed
documentation about the protocol itself, there is not too much information
which PubSub node topologies are suitable when scaling up to larger and highly
distributed networks. Thus, we are currently evaluating architecture scalability
and performance in the context of the ROLE project (http://role-project.eu),
where XMPP also serves as an open standard infrastructure for Widget-based
PLE (Personal Learning Environments). Currently, we realize the fake
multimedia detection application based on the design presented in the context of this work.
Acknowledgments. The research leading to these results has received funding
from the European Community's Seventh Framework Programme
(FP7/20072013) under grant agreement no 231396 (ROLE project) as well as DAAD.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>D.</given-names>
            <surname>Adams</surname>
          </string-name>
          . XEP-
          <volume>0009</volume>
          : Jabber-RPC.
          <source>Technical report, XMPP Standards Foundation</source>
          ,
          <year>February 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>K. P.</given-names>
            <surname>Birman</surname>
          </string-name>
          and
          <string-name>
            <given-names>T. A.</given-names>
            <surname>Joseph</surname>
          </string-name>
          .
          <article-title>Exploiting Virtual Synchrony in Distributed Systems</article-title>
          .
          <source>In SOSP '87: Proceedings of the eleventh ACM Symposium on Operating systems principles</source>
          , pages
          <volume>123</volume>
          {
          <fpage>138</fpage>
          , New York, NY, USA,
          <year>1987</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>H.</given-names>
            <surname>Chesbrough</surname>
          </string-name>
          . Open Innovation:
          <article-title>The new imperative for creating and pro ting from technology</article-title>
          .
          <source>Harvard Business</source>
          School Press,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>R.</given-names>
            <surname>Datta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J. Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Image retrieval: Ideas, in uences, and trends of the new age</article-title>
          .
          <source>ACM Comput. Surv.</source>
          ,
          <volume>40</volume>
          :5:
          <issue>1</issue>
          {5:
          <fpage>60</fpage>
          , May
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Eugster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Felber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Guerraroui</surname>
          </string-name>
          , and A.
          <string-name>
            <surname>-M. Kermarrec</surname>
          </string-name>
          .
          <source>The Many Faces of Publish/Subscribe. ACM Computing Surveys</source>
          ,
          <volume>35</volume>
          (
          <issue>2</issue>
          ):
          <volume>114</volume>
          {
          <fpage>131</fpage>
          ,
          <year>June 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>J.</given-names>
            <surname>Fridrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Soukal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lukas</surname>
          </string-name>
          .
          <article-title>Detection of Copy-Move Forgery in Digital Images</article-title>
          .
          <source>In Proc. of DFRWS</source>
          <year>2003</year>
          , pages
          <fpage>90</fpage>
          {
          <fpage>105</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>E.</given-names>
            <surname>Gamma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Helm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Vlissides</surname>
          </string-name>
          . Design Patterns:
          <article-title>Elements of Reusable Object-Oriented Software</article-title>
          . Addison-Wesley, Reading, MA,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>J.</given-names>
            <surname>Golbeck</surname>
          </string-name>
          .
          <article-title>Trust and Nuanced Pro le Similarity in Online Social Networks</article-title>
          .
          <article-title>ACM Transactions on the Web</article-title>
          . In press.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>J.</given-names>
            <surname>Golbeck</surname>
          </string-name>
          .
          <article-title>Computing and Applying Trust in Web-based Social Networks</article-title>
          .
          <source>PhD thesis</source>
          , University of Maryland,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>D.</given-names>
            <surname>Grippi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Salzberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sofaer</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Zhitomirskiy.</surname>
          </string-name>
          <article-title>diaspora*. The privacy aware, personally controlled, do-it-all, open source social network</article-title>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Farid</surname>
          </string-name>
          .
          <article-title>Exposing Digital Forgeries by Detecting Inconsistencies in Lighting</article-title>
          .
          <source>In ACM Multimedia and Security Workshop</source>
          , pages
          <volume>1</volume>
          {
          <fpage>10</fpage>
          , New York, NY, USA,
          <year>2005</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sukthankar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Sukthankar</surname>
          </string-name>
          .
          <article-title>E cient Nearduplicate Detection and Sub-image Retrieval</article-title>
          .
          <source>In MM '04: Proceedings of the ACM international conference on Multimedia</source>
          , pages
          <volume>869</volume>
          {
          <fpage>876</fpage>
          , NY, USA,
          <year>2004</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. M.
          <article-title>Lux and S. A. Chatzichristo s. Lire: lucene image retrieval: an extensible Java CBIR library</article-title>
          .
          <source>In MM '08: Proceedings of the 16th ACM international conference on Multimedia</source>
          , pages
          <volume>1085</volume>
          {
          <fpage>1088</fpage>
          , New York, NY, USA,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Manjunath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Salembier</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Sikora</surname>
          </string-name>
          .
          <article-title>Introduction to MPEG-7, Multimedia Content Description Interface</article-title>
          . John Wiley and Sons, Ltd.,
          <year>June 2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>S.</given-names>
            <surname>Marsh</surname>
          </string-name>
          .
          <article-title>Formalising Trust as a Computational Concept</article-title>
          .
          <source>PhD thesis</source>
          , University of Stirling, Department of Mathematics and Computer Science,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>P.</given-names>
            <surname>Massa</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Bhattacharjee</surname>
          </string-name>
          .
          <article-title>Using Trust in Recommender Systems: An Experimental Analysis</article-title>
          .
          <source>In Proceedings of iTrust2004 International Conference</source>
          , pages
          <volume>221</volume>
          {
          <fpage>235</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. P. Millard,
          <string-name>
            <given-names>P.</given-names>
            <surname>Saint-Andre</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Meijer</surname>
          </string-name>
          . XEP-
          <volume>0060</volume>
          : Publish-Subscribe.
          <source>Technical report, XMPP Standards Foundation</source>
          ,
          <year>July 2010</year>
          . Draft Standard.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>S.</given-names>
            <surname>Nikolopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zafeiriou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Nikolaidis</surname>
          </string-name>
          .
          <article-title>Image replica detection system utilizing R-trees and linear discriminant analysis</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>43</volume>
          (
          <issue>3</issue>
          ):
          <volume>636</volume>
          {
          <fpage>649</fpage>
          ,
          <string-name>
            <surname>March</surname>
          </string-name>
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <source>OpenSocial Speci cation 1.0. Technical report</source>
          , OpenSocial and Gadgets Speci cation Group,
          <year>March 2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>T. O'Reilly</surname>
            and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Batelle</surname>
          </string-name>
          .
          <source>Web Squared: Web</source>
          <volume>2</volume>
          .0
          <string-name>
            <given-names>Five</given-names>
            <surname>Years</surname>
          </string-name>
          <string-name>
            <surname>On</surname>
          </string-name>
          ,
          <year>2009</year>
          .
          <source>Special Report Web 2.0 Summit.</source>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>A.</given-names>
            <surname>Popescu</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Farid</surname>
          </string-name>
          .
          <article-title>Statistical Tools for Digital Forensics</article-title>
          .
          <source>In Proceedings of the 6th International Workshop on Information Hiding</source>
          , pages
          <volume>128</volume>
          {
          <fpage>147</fpage>
          , Toronto, Canada,
          <year>2004</year>
          . Springer-Verlag, Berlin-Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>K. A. N.</given-names>
            <surname>Rashed</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Klamma</surname>
          </string-name>
          .
          <article-title>Towards Detecting Faked Images</article-title>
          . In A. Carreras,
          <string-name>
            <given-names>J.</given-names>
            <surname>Delgado</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          <article-title>M. as</article-title>
          , and V. Rodriguez, editors,
          <source>Proceedings of the 11th International Workshop on Interoperable Social Multimedia Applications(WISMA10)</source>
          , Barcelona, Spain, May
          <volume>19</volume>
          -20, May
          <year>2010</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , Vol.
          <volume>583</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>D.</given-names>
            <surname>Renzel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Klamma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Kovachev</surname>
          </string-name>
          . Virtual Camp re
          <article-title>- Collaborative Multimedia Semantization with Mobile Social Software</article-title>
          . In R. Klamma,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kosch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lux</surname>
          </string-name>
          , and F. Stegmaier, editors,
          <source>Proceedings of the 10th International Workshop on Semantic Multimedia Database Technologies (SeMuDaTe'09)</source>
          , Graz, Austria,
          <fpage>12</fpage>
          <lpage>2009</lpage>
          . CEUR Workshop Proceedings, Vol.
          <volume>539</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>C.</given-names>
            <surname>Rey</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Dugelay</surname>
          </string-name>
          .
          <article-title>A survey of Watermarking Algorithms for Image Authentication</article-title>
          .
          <source>EURASIP J. Appl. Signal Process</source>
          .,
          <year>2002</year>
          (1):
          <volume>613</volume>
          {
          <fpage>621</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>P.</given-names>
            <surname>Saint-Andre</surname>
          </string-name>
          .
          <article-title>RFC 3920 { Extensible Messaging and Presence Protocol (XMPP): Core</article-title>
          .
          <source>Technical report, Jabber Software Foundation</source>
          ,
          <year>October 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>P.</given-names>
            <surname>Saint-Andre</surname>
          </string-name>
          .
          <article-title>RFC 3921 { Extensible Messaging and Presence Protocol (XMPP): Instant Messaging and Presence</article-title>
          .
          <source>Technical report, Jabber Software Foundation</source>
          ,
          <year>October 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <given-names>P.</given-names>
            <surname>Saint-Andre.</surname>
          </string-name>
          XEP-
          <volume>0045</volume>
          :
          <string-name>
            <surname>Multi-User Chat</surname>
          </string-name>
          .
          <source>Technical report, XMPP Standards Foundation</source>
          ,
          <year>July 2008</year>
          . Draft Standard.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28. G.
          <string-name>
            <surname>Shih-Fu Chang</surname>
            ,
            <given-names>A. B.</given-names>
          </string-name>
          <string-name>
            <surname>Chan</surname>
            , and
            <given-names>P. J.</given-names>
          </string-name>
          <string-name>
            <surname>Moreno</surname>
          </string-name>
          .
          <article-title>Overview of the MPEG-7 standard</article-title>
          . IEEE Trans.
          <article-title>Circuits and Systems for Video Technology</article-title>
          .,
          <volume>11</volume>
          (
          <issue>0</issue>
          ):
          <volume>688</volume>
          {
          <fpage>695</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <given-names>A.</given-names>
            <surname>Smeulders</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Worring</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Santini</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. A</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Jain</surname>
          </string-name>
          .
          <article-title>Content-Based Image Retrieval at the End of the Early Years</article-title>
          .
          <source>IEEE Trans Pattern Anal Mach Intell</source>
          ,
          <volume>22</volume>
          (
          <issue>12</issue>
          ):
          <volume>1349</volume>
          {
          <fpage>1380</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>M. Spaniol</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Klamma</surname>
            , H. Jan en, and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Renzel</surname>
          </string-name>
          .
          <article-title>LAS: A Lightweight Application Server for MPEG-7 Services in Community Engines</article-title>
          . In K. Tochtermann and H. Maurer, editors,
          <source>Proceedings of I-KNOW '06, 6th International Conference on Knowledge Management, Graz, Austria, September</source>
          <volume>6</volume>
          {
          <fpage>8</fpage>
          ,
          <year>2006</year>
          ,
          <string-name>
            <surname>J.UCS</surname>
          </string-name>
          (
          <article-title>Journal of Universal Computer Science</article-title>
          )Proceedings, pages
          <volume>592</volume>
          {
          <fpage>599</fpage>
          . Springer-Verlag,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Farid</surname>
          </string-name>
          .
          <article-title>Exposing Digital Forgeries in Video by Detecting Double Quantization</article-title>
          .
          <source>In ACM Multimedia and Security Workshop</source>
          , pages
          <volume>39</volume>
          {
          <fpage>48</fpage>
          , Princeton, NJ,
          <year>September 2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32. E. Wenger.
          <source>Communities of Practice: Learning</source>
          , Meaning, and Identity. Cambridge University Press, Cambridge, UK,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>M. Wolpers</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Ullrich</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Klamma</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Renzel</surname>
          </string-name>
          .
          <article-title>Early Experiences with Responsive Open Learning Environments</article-title>
          . In H. Maurer,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kulathuramaiyer</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K. Tochtermann, editors,
          <source>Proceedings of I-KNOW</source>
          <year>2010</year>
          ,
          <article-title>1-3 September 2010</article-title>
          , Graz, Austria, pages
          <volume>391</volume>
          {
          <fpage>402</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>