48,858 research outputs found
Ultra-Reliable Cloud Mobile Computing with Service Composition and Superposition Coding
An emerging requirement for 5G systems is the ability to provide wireless
ultra-reliable communication (URC) services with close-to-full availability for
cloud-based applications. Among such applications, a prominent role is expected
to be played by mobile cloud computing (MCC), that is, by the offloading of
computationally intensive tasks from mobile devices to the cloud. MCC allows
battery-limited devices to run sophisticated applications, such as for gaming
or for the "tactile" internet. This paper proposes to apply the framework of
reliable service composition to the problem of optimal task offloading in MCC
over fading channels, with the aim of providing layered, or composable,
services at differentiated reliability levels. Inter-layer optimization
problems, encompassing offloading decisions and communication resources, are
formulated and addressed by means of successive convex approximation methods.
The numerical results demonstrate the energy savings that can be obtained by a
joint allocation of computing and communication resources, as well as the
advantages of layered coding at the physical layer and the impact of channel
conditions on the offloading decisions.Comment: 8 pages, 5 figures, To be presented at CISS 201
Hyperspectral image compression : adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding
Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability to a wide range of data, while being of reasonable complexity. Some wavelet-based compression algorithms have been successfully used for some hyperspectral space missions. This paper focuses on the optimization of a full wavelet compression system for hyperspectral images. Each step of the compression algorithm is studied and optimized. First, an algorithm to find the optimal 3-D wavelet decomposition in a rate-distortion sense is defined. Then, it is shown that a specific fixed decomposition has almost the same performance, while being more useful in terms of complexity issues. It is shown that this decomposition significantly improves the classical isotropic decomposition. One of the most useful properties of this fixed decomposition is that it allows the use of zero tree algorithms. Various tree structures, creating a relationship between coefficients, are compared. Two efficient compression methods based on zerotree coding (EZW and SPIHT) are adapted on this near-optimal decomposition with the best tree structure found. Performances are compared with the adaptation of JPEG 2000 for hyperspectral images on six different areas presenting different statistical properties
Algorithms as scores: coding live music
The author discusses live coding as a new path in the evolution of the musical score. Live-coding practice accentu- ates the score, and whilst it is the perfect vehicle for the performance of algorithmic music it also transforms the compositional process itself into a live event. As a continuation of 20th-century artistic developments of the musical score, live-coding systems often embrace graphical elements and language syntaxes foreign to standard programming languages. The author presents live coding as a highly technologized artistic practice, shedding light on how non-linearity, play and generativity will become prominent in future creative media productions
Sparse Modeling for Image and Vision Processing
In recent years, a large amount of multi-disciplinary research has been
conducted on sparse models and their applications. In statistics and machine
learning, the sparsity principle is used to perform model selection---that is,
automatically selecting a simple model among a large collection of them. In
signal processing, sparse coding consists of representing data with linear
combinations of a few dictionary elements. Subsequently, the corresponding
tools have been widely adopted by several scientific communities such as
neuroscience, bioinformatics, or computer vision. The goal of this monograph is
to offer a self-contained view of sparse modeling for visual recognition and
image processing. More specifically, we focus on applications where the
dictionary is learned and adapted to data, yielding a compact representation
that has been successful in various contexts.Comment: 205 pages, to appear in Foundations and Trends in Computer Graphics
and Visio
- âŠ