By exploiting new human-machine interface techniques, such as visual eyetrackers, it should be possible to develop more eÆcient visual multimedia services associated with low bandwidth, dynamic channel adaptation and robust visual data transmission. In this paper, we introduce foveation-based error resilience and unequal error protection techniques over highly error-prone mobile networks. Each ...

an algebraic construction for constant dimension subspace codes is called orbit code. it arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. in particular orbit codes of a singer subgroup of the general linear group has investigated recently. in this paper, we consider the normalizer of a singer subgroup of the general linear group a...

Going beyond the desktop to leverage novel devices—such as smartphones, tablets, or large displays—for visual sensemaking typically requires supporting extraneous operations for device discovery, interaction sharing, and view management. Such operations can be time-consuming and tedious, and distract the user from the actual analysis. Embodied interaction models in these multi-device environmen...

The present study is a replication of Chum, Bekkering, Dodd, & Pratt (2007). Motor and visual codes interact to facilitate visuospatial memory performance. Psychonomic Bulletin & Review, 14, 1189-1193

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

We apply a probabilistic method for learning efficient image codes to the problem of unsupervised classification, segmentation and de-noising of images. The method is based on the Independent Component Analysis (ICA) mixture model proposed for unsupervised classification and automatic context switching in blind source separation [I]. In this paper, we demonstrate that this algorithm is effectiv...

Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hash codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result in s...

in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...

We present a general method for estimating defocus blur from first principles, given a set of natural scenes and properties of the vision system. Local, high-precision, signed estimates are obtained for a model human visual system. OCTS Codes: (100.0100) Image Processing; (110.0110) Imaging Systems; (330.0330) Vision, color, and visual optics