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.
High Efficiency Video Coding was developed by the JCT-VC to replace the current H.264/AVC standard, which has dominated digital video services in all segments of the domestic and professional markets for over ten years. Therefore, there is a lot of legacy content encoded with H.264/AVC, and an efficient video transcoding from H.264 to HEVC will be needed to enable gradual migration to HEVC. HEVC adopts...
Existing sparse representation with subspace learning is hampered by the intersection of subspaces of bases. With structured sparsity to enable the prior knowledge of signal statistics, this paper proposes a novel compressive video sampling by subspace learning to minimize the intersection of subspaces. As the measurement, the block coherence is optimized with the regularized learning to generate...
Due to all kinds of need of customers and the complicated transmitting environment of digital image and video resources, numerous practical applications emerge, e.g. Image in painting, interpolation, super-resolution and the removal of salt and pepper noise. One thing these cases all have in common is that there are plenty of missing pixels randomly distributed in an image. Existing image restoration...
This paper concerns itself with compression strategies for orientation signals, seen as signals evolving on the space of quaternion's. The compression techniques extend classical signal approximation strategies used in data mining, by explicitly taking into account the quotient-space properties of the quaternion space. The approximation techniques are applied to the case of human gesture recognition...
This paper proposes a general optimization framework to allocate computing resources to the compression of massive and heterogeneous data sets incident upon a communication or storage system. The framework is formulated using abstract parameters, and builds on rigorous tools from optimization theory. The outcome is a set of algorithms that together can reach optimal compression allocation in a realistic...
The de Bruijn graph GK of a set of strings Sis a key data structure in genome assembly that represents overlaps between all the K-length substrings of S. Construction and navigation of the graph is a space and time bottleneck in practice and the main hurdle for assembling large genomes. This problem is compounded because state-of-the-art assemblers do not build the de Bruijngraph for a single order...
k2-trees have been proved successful to represent in avery compact way different kinds of binary relations, such as web graphs, RDFs or raster data. In order to be a fully functional succinct representation for these domains, the k2-tree must support all the required operations for binary relations. In their original description, the authors include how to answer some of the most relevant queries...
The title exemplifies the topic as it is easily recognized as compressed from possible English original versions. It also exemplifies some difficulties. A small sampling of readers all thought "Losy" was a corruption of "Lossy," which is consistent with the apparent loss of letters in "Hstry" and "Losy". But while "Hstry" is compressed, it is not really...
We study compression techniques for parallel in-memory graph algorithms, and show that we can achieve reduced space usage while obtaining competitive or improved performance compared to running the algorithms on uncompressed graphs. We integrate the compression techniques into Ligra, a recent shared-memory graph processing system. This system, which we call Ligra+, is able to represent graphs using...
In this paper, we exploit a new type of data redundancy in the multisource surveillance video to reduce the huge gap between the growth rate of the data and the video compression rate. Global redundancy caused by correlated appearances of moving objects in multiple videos consists of model similarity, spatial correlation and temporal consistency. Therefore, we propose a global coding scheme of moving...
SHVC is the scalable extension of the latest video coding standard High Efficiency Video Coding (HEVC). Color Gamut Scalability (CGS) refers to a scalable use case in which base layer and enhancement layer have different color gamuts. In this case, special inter-layer prediction is needed to improve coding efficiency in SHVC. In this paper, a solution based on asymmetric 3D lookup table is presented...
A novel clustered multi-dictionary code compression method is proposed to effectively reduce the memory size which program code stored. According to the repeat times of distinct codes, the code set is clustered into several clusters. Each cluster is compressed with different dictionary and the codeword length is the same for the same dictionary. Shorter codeword is used for the dictionary whose size...
Lossless image compression is particularly important in applications requiring high fidelity such as medical imaging, remote sensing and scientific imaging. These applications cannot tolerate the minute artifacts that are caused by lossy compression methods. We first describe a new predictor for lossless image compression based on plane fitting. Our main contribution is an adaptive model switching...
FASTQ is the defacto standard for data from next generation sequencing platforms. The FASTQ format uses four lines per read: two lines for header information, one for the sequence itself, and one for the quality scores. The proposed compression scheme treats the various lines of each four line set differently. The highly repetitive headers are encoded using an LZ77 variant. The reads themselves are...
This paper proposes an approach of compressed sensing (CS) of video in which distributed video coding DVC and CS are integrated as in [1], and the sensing matrix is modulated in suit of [2] but with proposed fixed weighting strategy to certain DCT coefficients in an effort to improve the visual quality of reconstruction.
We present complementary compound-cognizant data engineering techniques for feature compression and data indexing across two-dimensional gas chromatographic (GC×GC) datasets with petroleum forensics as the primary application. We propose single-linkage clustering of dominant compounds (targets) along with local interpretation across biomarker peak profiles. Our methods enable high-volume data compression,...
We present a video coding system that partitions the scene into "visual structures" and a residual "background" layer. The system exploits the temporal redundancy of visual structures to compress video sequences. We construct a dictionary of track-templates, which correspond to a representation of visual structures. We subsequently choose a subset of the dictionary's elements to...
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.