Multiple description coding of images can be implemented by means of simple splitting of the pixels into subsets. This can be realized via a preand post-processing to most standards for image communications, with obvious advantages. Unfortunately, this method suffers from high side distortion when only one description is received. In order to overcome this limitation, and to achieve better cont...

The sparse matrix-vector product (SpMV) is a fundamental operation in many scientific applications from various fields. The High Performance Computing (HPC) community has therefore continuously invested a lot of effort to provide an efficient SpMV kernel on modern CPU architectures. It has been shown that block-based kernels are helpful to achieve high performance, but also that they are diffic...

Abstract: This paper provides a new statistical approach to blind recovery of both earth signal and source wavelet given only the seismic traces using independent component analysis (ICA) by explicitly exploiting the sparsity of both the reflectivity sequence and the mixing matrix. Our proposed blind seismic deconvolution algorithm consists of three steps. Firstly, a transformation method that ...

In the studies related to multiple description coding (MDC), applying zero padding not only improves the spatial correlation between descriptions but also increases their sizes. However, as we pad more zeros, the spatial correlation does not improve linearly. Therefore, the distortion is not reduced as the same amount when the size increases. In this paper, we focus on how to efficiently find a...

Filtering is an important issue in signals and images processing. Many images and videos are compressed using discrete cosine transform (DCT). For reducing the computation complexity, we are interested in filtering block and images directly in DCT domain. This article proposed an efficient and yet very simple filtering method directly in DCT domain for any symmetric, asymmetric, separable, inse...

Efficient algorithms have recently been developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the zero-padding technique, with the important distinction that the additional work memory need not be contiguous with the input data. ...

Using a keyhole technique, it is shown that the data acquisition rate of gradient-echo imaging for functional MRI (fMRI) studies can be increased substantially. The resulting enhancement of the temporal resolution of fMRIs was accomplished without modifying the hardware of a conventional MRI system. High spatial resolution fMRI images were first collected with conventional full k-space acquisit...

Low-latency anonymous communication networks require padding to resist timing analysis attacks, and dependent link padding has been proven to prevent these attacks with minimal overhead. In this paper we consider low-latency anonymity networks that implement dependent link padding, and examine various network topologies. We find that the choice of the topology has an important influence on the ...

It has been observed that memory access performance can be improved by restructuring data declarations , using simple transformations such as array dimension padding and inter-array padding (array alignment) to reduce the number of misses in the cache and TLB (translation lookaside buuer). These transformations can be applied to both static and dynamic array variables. In this paper, we provide...

It has been observed that memory access performance can be improved by restructuring data declarations, using simple transformations such as array dimension padding and inter-array padding (array alignment) to reduce the number of misses in the cache and TLB (translation lookaside bu er). These transformations can be applied to both static and dynamic array variables. In this paper, we provide ...