The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Caching is an effective way to reduce peak-hour network traffic congestion by storing some contents at user's local cache. Maddah-Ali and Niesen (MAN) initiated a fundamental study of caching systems by proposing a scheme (with uncoded cache placement and linear network coding delivery) that is provably optimal to within a factor 4.7. In this paper, when the cache contents and the user demands are...
An image pre-processing approach is proposed for joint source-channel coding (JSCC) scheme based on double protograph low-density parity-check (DP-LDPC) codes. Firstly, discrete cosine transform (DCT) and quantization are applied to the transmitted images. Different from the data processing of the previous approach for the quantized DCT coefficients, the representation of true form takes the place...
Independent Component Analysis (ICA) is a statistical method for transforming an observable multi-dimensional random vector into components that are as statistically independent as possible from each other. The binary ICA (BICA) is a special case of ICA in which both the observations and the independent components are over a binary alphabet. The BICA problem has received a significant amount of attention...
Many approaches have been proposed to support lossless coding within video coding standards that are primarily designed for lossy coding. The simplest approach is to just skip transform and quantization and directly entropy code the prediction residual, which is used in HEVC version 1. However, this simple approach is inefficient for compression. More efficient approaches include processing the residual...
Low-level feature encoding combined with Spatial Pyramid Matching (SPM) is widely adopted in the image classification system nowadays to extract features, which are usually high-dimensional. This not only makes the classification problem computationally prohibitive, but also raises other issues, such as the “curse of dimensionality”. In this paper we present supervised dimensionality reduction (DR)...
It is desirable to support efficient lossless coding within video coding standards, which are primarily designed for lossy coding, with as little modification as possible. A simple approach is to skip transform and quantization, and directly entropy code the prediction residual, but this is inefficient for compression. A more efficient and popular approach is to process the residual block with DPCM...
Sensory abnormalities and multisensory integration effects play an important role in autism. This paper deals with the latter, using a neural model that suggests that weak central coherence, a processing bias for features and local information, may account for a failure to control or modulate the experience of sensory inputs. A series of algorithms is proposed to encode auditory-visual interactions...
We introduce Sparse Entropy Clustering (SEC) which uses minimum entropy criterion to split high dimensional binary vectors into groups. The idea is based on the analogy between clustering and data compression: every group is reflected by a single encoder which provides its optimal compression. Following the Minimum Description Length Principle the clustering criterion function includes the cost of...
In some real-world applications, multiple measuring methods are often employed to extract multiple feature groups of data, yielding multi-view data. The main challenge of multiview clustering is to find a suitable way of simultaneously exploiting the complementary information of all views, considering the view conflicts arose by different measures. For perspective of optimization, previous multi-view...
Through various means of structural and synaptic plasticity enabling online learning, neural networks are constantly reconfiguring their computational functionality. Neural information content is embodied within the configurations, representations, and computations of neural networks. To explore neural information content, we have developed metrics and computational paradigms to quantify neural information...
Depth maps are becoming increasingly important in the context of emerging video coding and processing applications. Depth images represent the scene surface and are characterized by areas of smoothly varying grey levels separated by sharp edges at the position of object boundaries. To enable high quality view rendering at the receiver side, preservation of these characteristics is important. Lossless...
In on-board applications, image compression is required because of bandwidth, memory space or transmission time is limited. LOCO-I (Low Complexity Lossless Compression for Image) is developed for simplicity with the compression potential of context models. In this paper an optimized LOCO-I algorithm for small image compression applications is developed to improve compression performance. Compression...
Text messages are generally encoded by performing table look-up on fixed length code tables. In this paper, a lossless text compression algorithm which works on the principle of entropy reduction is proposed. Characters in a text message in any language are generally encoded using a binary string with a Unique Lexicographical Rank (ULR). A corresponding Maximum Rank(MR) for any binary string can be...
In a distributed video coding problem, use of a correct model for the correlation noise plays a significant role in improving the decoding performance and consequently in providing higher coding efficiency. In this work, we first study the predictive and additive correlation noise models at the DCT coefficient band level for transform-domain distributed video coding. Then, bounds on compression rates...
One of the main challenges for continued wireless capacity growth is the difficulty in exploiting the multicast nature of the wireless medium: wireless end points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting...
Modern, complex printed circuit boards contain high-end commercial off-the-shelf components such as high-capacity FPGAs and expensive peripherals. This paper describes a strategy to build a hardware attestation protocol for such a board. The owner or operator of the PCB wants to achieve the assurance that the board installed in the field is physically the same as the one that was originally deployed...
Electron-beam direct-write (EBDW) lithography is an attractive candidate of next-generation lithography in advanced semiconductor processes. The huge data stream bandwidth required for the data delivery path in EBDW systems could seriously deteriorate throughput, which is one of the major deficiencies constraining EBDW lithography from mass production. A lossless electron-beam layout data compression...
The FM index (Ferragina & Manzini, J. ACM, 2005) is a widely-used compresseddata structure that stores a string T in a compressed form that also supports fast pattern matching queries. Fixed-block boosting is a relatively straightforward technique that achieves optimal index size in theory, but to date it is unclear how best to translate the method into practice. In this paper we describe several...
Indexable dictionaries, supporting rank and select queries, are used as building blocks for many algorithms. For a universe U = {0, ..., |U| - 1} and an ordered set S = {s0, ..., sn-1} ⊆ U, an indexable dictionary supports rank and select queries in addition to membership queries, Select(j) query is used to get the j'th ranked element, and Rank(x) is used to retrieve the rank of x among all elements...
The problem of multilevel diversity coding with regeneration is considered in this work. Two new outer bounds on the optimal tradeoffs between the normalized storage capacity and repair bandwidth are established, by which the optimality of separate coding at the minimum-bandwidth-regeneration (MBR) point follows immediately. This resolves a question left open in a previous work by Tian and Liu.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.