By Topic

Multimedia and Ubiquitous Engineering (MUE), 2011 5th FTRA International Conference on

Date 28-30 June 2011

Filter Results

Displaying Results 1 - 25 of 71
  • [Front cover]

    Publication Year: 2011 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (863 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (11 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (48 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011 , Page(s): v - x
    Save to Project icon | Request Permissions | PDF file iconPDF (168 KB)  
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2011 , Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2011 , Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2011 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (65 KB)  
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011 , Page(s): xiv - xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB)  
    Freely Available from IEEE
  • Welcome message from the MCC 2011 Organizers

    Publication Year: 2011 , Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • MCC 2011 Organization

    Publication Year: 2011 , Page(s): xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • A Policy Enforcement Framework for Ubiquitous Computing Applications

    Publication Year: 2011 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (266 KB) |  | HTML iconHTML  

    Future ubiquitous computing environments integrate the services of everyday objects equipped with tiny processors and sensors into distributed applications. These smart devices can communicate with each other and also explore their environment. In order for the applications to function properly, policies need to be defined, which determine ways that they can be used, protected, changed, etc. A policy can be considered as a set of rules, specified by users, which are usually applied by a policy manager. In this paper we proposed an alternative approach, which supports the adoption of policies directly by the applications without the need of an enforcing policy manager. Two everyday scenarios are used as examples that demonstrate the validity of the approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CLIO: Context Supporting Collective City Memory

    Publication Year: 2011 , Page(s): 6 - 11
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (281 KB) |  | HTML iconHTML  

    Personal memories as expressed through narrations, photos or drawings, published or confined texts, often describe events that have occurred in cities, in time these personal memories are melded into a collective memory attached to the physical space. Collective memory is closely related to location, refers to a time period and reflects the social interactions of people who share it. All these parameters of context, location, time and social interactions, which affect the way collective memory is formed, are parameters of context that modern context-aware systems can exploit, therefore context-aware computing can fundamentally change how people interact with collective memory. This paper presents a context-aware system that allows people to form and interact with collective city memory through a ubiquitous environment, called CLIO, CLIO is based on a reasoning and inference process that exploits both context and rules on it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Multi- and Many-core Parallelism for Accelerating Image Compression

    Publication Year: 2011 , Page(s): 12 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (335 KB) |  | HTML iconHTML  

    With the help of recent development on semiconductor design and process technologies modern processors can provide a great opportunity to increase the performance of processing multimedia data by exploiting task- and data-parallelism in heterogeneous system consisting of multi-core CPUs and many-core GPUs (graphical processing units). This paper presents an optimization of 2D DCT (discrete cosine transform), a computation intensive signal processing algorithm widely used in compression standards, on speed in multi-core CPUs and many-core GPUs. Two optimization techniques using Intel TBB (threading building blocks) and Open CL are discussed in detail. Open CL is a recent open standard proposed to provide universal APIs and programming paradigms for various GPUs and accelerators, it can provide massively parallel processing suitable for data intensive multimedia applications with very low cost. The simulation result that the parallel DCT implementations are performed considerably faster than the serial ones, max 4.8 and 6.9 times speedup as for TBB and Open CL, respectively. Especially, Open CL implementation on GPU shows a linear speedup, a typical characteristic of massively parallel processing, as the increase of 2D data sets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Object-based Virtual Network in Unbiquitous Computing Environment

    Publication Year: 2011 , Page(s): 18 - 21
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (314 KB) |  | HTML iconHTML  

    This paper proposes a novel object-based virtual network middleware for supporting the interoperability among home devices and smart grid devices. In order to demonstrate that home devices and smart grid devices are interoperable through the proposed middleware, we implement applications based on the OVNet on a target platform consisting of embedded boards, sensors and laptops for emulation purposes of a home network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capturing the Evolving Properties of Disconnected Mobile P2P Networks

    Publication Year: 2011 , Page(s): 22 - 27
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (498 KB) |  | HTML iconHTML  

    The design of message routing algorithms and its performance evaluation in disconnected mobile P2P networks are challenging issues due to its high dynamic evolving topology. To capture the evolution of the connectivity properties of such networks, a Time-Evolving Graph (TEG) model is proposed in this paper. Our intuitive observation is that the connectivity graph of a dynamic network can be obtained from the union of every snapshots observed over a sequential of past time steps. To avoid losing the network connectivity information in all past evolution, each possible edge is weighted by a set of the 2-tuples which consist of the start time and the duration of each contact. We then present the TEG model through using discrete time Markov process to deal with the time dependencies of consecutive time-step indexed network snapshots. As a further simplification, the dynamic of each possible edge is seen as an independent birth-death process. In addition, given the observed sequence of time-step indexed data, the birth and death probability of each possible edge are estimated using Laplace's rule of succession. We note that a TEG eventually converges to an un-uniform random graph in which the birth probability of all possible edge follows a unique power law distribution. The TEG model is validated through the computation of all possible time-evolved end-to-end fastest paths existing in real experimental datasets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Location Based Hierarchical Secure Multicast Group Building in Wireless Sensor Networks

    Publication Year: 2011 , Page(s): 28 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (354 KB) |  | HTML iconHTML  

    In large-scale wireless sensor networks, multicast is an important routing service for the efficient data distribution required for activities, such as filtering scheme updates, the redistribution of the cryptography keys and targeted queries. Especially, the redistribution of cryptography keys is important for the robust secure communication within the multicast group. In this paper, we propose a hierarchical secure multicast group building method. In order to build the groups, we exploit genetic algorithms by considering the location information of the sensor nodes. We show the efficiency of our proposal through simulation, in terms of the standard deviation among group members. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A High-Capacity CDMA Watermarking Scheme Based on Orthogonal Pseudorandom Sequence Subspace Projection

    Publication Year: 2011 , Page(s): 33 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    In this paper, we propose a high-capacity CDMA based watermarking scheme based on orthogonal pseudorandom sequence subspace projection. We introduced a novel idea to eliminate the interference due to the correlation between the host image and the code sequences in the watermark extraction phase, and therefore, improve the robustness and message capacity of the watermarking scheme. We give the implementation steps of the proposed scheme and test its performance under different attack conditions by a series of experiments. Experimental results show that the proposed scheme shows higher robustness than the canonical scheme under different attack conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Object Expression System using Depth-maps

    Publication Year: 2011 , Page(s): 39 - 43
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB) |  | HTML iconHTML  

    In existing Augmented Reality (AR), data gloves or markers are used for smooth interactions between objects and backgrounds. This results in inconvenience in use and reduced immersiveness. To reinforce immersiveness in AR, added input devices should be removed. To this end, spatial coordinates should be accurately perceived even when a marker has been attached. In this paper, an object expression system was proposed that uses depth-maps for interactions without any additional input devices in order to improve immersiveness. Immersiveness was improved by projecting obtained images on two-dimensional (2D) spaces, extracting vanishing lines, calculating the virtual spatial coordinates of the projected images, and varying the sizes of the inserted objects in accordance with the sizes of the areas of virtual coordinates, based on the images projected on the 2D coordinates. By using this system, the use of three-dimensional (3D) modelers could be excluded when 3D objects were created, thus, the efficiency of object creation could be improved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Fuzzy Single Layer Supervised Learning Algorithm

    Publication Year: 2011 , Page(s): 44 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (324 KB) |  | HTML iconHTML  

    In this paper, we improve the convergence prevented from vibrating decision boundary with bias term and suggest a linear activation function. We propose an enhanced fuzzy single layer perceptron which reduces the learning time introducing the rate of learning and the concept of momentum. We applied to Exclusive OR problem and pattern recognition of letters to analyze the performance of learning through enhanced fuzzy single layer perceptron and precedent fuzzy single layer perceptron. After the number of epoch and the convergence of enhanced fuzzy single layer perceptron were compared with those of precedent one, we found that enhanced one had far less time for learning and improved the convergence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective and Efficient Indexing Scheme for Audio Fingerprinting

    Publication Year: 2011 , Page(s): 48 - 52
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (350 KB) |  | HTML iconHTML  

    An audio fingerprint is a content-based compact signature that summarizes an audio recording. A song can be recognized by matching an extracted fingerprint to a database of known fingerprints. Audio fingerprinting must solve the two key problems of fingerprint extraction and database search. In this paper, we are given a fingerprint database of songs and focus our attention on the problem of effective and efficient database search. The high dimensionality of fingerprints suffers from the curse of dimensionality. We describe a new indexing scheme and a new search algorithm on the index and then present experimental results for a database of 1,000 songs. The preliminary result of our experiments shows encouraging performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TouchAll: A Multi-Touch, Gestures, and Fiducials API for Flash/Action Script 3.0

    Publication Year: 2011 , Page(s): 53 - 58
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (652 KB) |  | HTML iconHTML  

    In this paper, we present Touch All, an high-level API (Application Programming Interface) for Flash Action Script 3.0, that supports all-in-one multi-touch, gestures, and fiducials, either through UDP, TCP, or Local Connection. Touch All API was built entirely on Flash Develop on top of the TUIO AS3 library, and Adobe's Flex and Air SDKs (Software Development Kits). Also, in this paper, using the Touch All API, we address the development of an application, intended to support multi-touch, gestures, and fiducials, either through UDP, TCP, or Local Connection. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Holistic Feature Extraction for Automatic Image Annotation

    Publication Year: 2011 , Page(s): 59 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (797 KB) |  | HTML iconHTML  

    Automating the annotation process of digital images is a crucial step towards efficient and effective management of this increasingly high volume of content. It is, nevertheless, an extremely challenging task for the research community. One of the main bottle necks is the lack of integrity and diversity of features. We solve this problem by proposing to utilize 43 image features that cover the holistic content of the image from global to subject, background, and scene. In our approach, saliency regions and background are separated without prior knowledge. Each of them together with the whole image is treated independently for feature extraction. Extensive experiments were designed to show the efficiency and effectiveness of our approach. We chose two publicly available datasets manually annotated and with the diverse nature of images for our experiments, namely, the Corel5k and ESP Game datasets. They contain 5,000 images with 260 keywords and 20,770 images with 268 keywords, respectively. Through empirical experiments, it is confirmed that by using our features with the state-of-the-art technique, we achieve superior performance in many metrics, particularly in auto-annotation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual Recognition Using Density Adaptive Clustering

    Publication Year: 2011 , Page(s): 67 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (477 KB) |  | HTML iconHTML  

    Visual codebook based texture analysis and image recognition is popular for its robustness to affine transformation and illumination variation. It is based on the affine invariable descriptors of local patches extracted by region detector, and then represents the image by histogram of the codebook constructed by the feature vector quantization. The most commonly used vector quantization method is k-means. But due to the limitations of predefined number of clusters and local minimum update rule, we show that k-means would fail to code the most discriminable descriptors. Another defect of k-means is that the computational complexity is extremely high. In this paper, we proposed a nonparametric vector quantization method based on mean shift, and use locality-sensitive hashing (LSH) to reduce the cost of the nearest neighborhood query in the mean-shift iterations. The performance of proposed method is demonstrated in several image classification tasks. We also show that the Information Gain or Mutual Information based feature selection based on our codebook further improves the performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile Context Data Management Framework

    Publication Year: 2011 , Page(s): 73 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (365 KB) |  | HTML iconHTML  

    Mobile devices have become a new way to access information and consume services on the Internet everywhere. This mobile environment is quite different from a desktop one (e.g. the screen is smaller, lower computing power, the user is usually on route while consuming services), so the requested information has to be customized in order to increase the satisfaction of the users and fulfil their needs on the move. This process can be performed gathering context information about the user, stored in the mobile device or offered by embedded sensors (e.g. GPS). This paper presents a mobile framework that provides the needed functionalities in order to acquire, unify, model and manage context data coming from mobile devices. The validation of the framework by means of an implementation of a real use case scenario is also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.