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.
In this paper, we propose a multiscale dictionary learning framework for hierarchical sparse representation of natural images. The proposed framework leverages an adaptive quadtree decomposition to represent structured sparsity in different scales. In dictionary learning, a tree-structured regularized optimization is formulated to distinguish and represent high-frequency details based on varying local...
Tensor-based compressive sensing (CS) can preserve the intrinsic multidimensional structures with a reduced computational complexity. However, its recovery performance is degraded by simple sparsity. This paper proposes an efficient recovery algorithm GT-ADMM to solve a nonconvex optimization problem for tensor-based CS with group sparsity. Group-sparse representations of tensors is derived based...
Demanding for efficient compression and storage of DNA sequences has been rising with the rapid growth of DNA sequencing technologies. Existing reference-based algorithms map all patterns to regions found in the reference sequence, which lead to redundancy of incomplete similarity. This paper proposes an efficient reference-based method for DNA sequence compression that integrates FM-index and complementary...
Conventional Compressive Sensing (CS) obscures the intrinsic structures of multidimensional signals with the vectorized representation. Although tensor-based CS methods can preserve the intrinsic multidimensional structures with reduced computational complexity, their sampling efficiency and recovery performance are degraded with the assumption of standard/simple sparsity. This paper proposes a general...
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...
This paper proposes an adaptive dictionary learning approach based on sub modular optimization. A candidate atom set is constructed based on multiple bases from the combination of analytic and trained dictionaries. With the low-frequency components by the analytic DCT atoms, high-resolution dictionaries can be inferred through online learning to make efficient approximation with rapid convergence...
To enable learning-based video coding for transmission over heterogenous networks, this paper proposes a scalable video coding framework by progressive dictionary learning. With the hierarchical B-picture prediction structure, the inter-predicted frames would be reconstructed in terms of the spatio-temporal dictionary in a successive sense. Within the progressive dictionary learning, the training...
This paper proposes a bi-directional context modeling (BCM) technique for reference-free genome sequence compression, which constructs its contexts by combining arbitrary predicted symbols in two directions corresponding to approximate repeats and non-repeat regions. Thus, BCM can sequentially predict DNA sequences with weighted conditional probabilities that simultaneously exploit the correlations...
Classical context modeling and binarization algorithms on multimedia do not fully exploit their spatial correlations under the sequential assumption. This paper proposes a novel entropy coding scheme incorporating regional context modeling (RCM) and dynamic Huffman binarization (DHB) for multimedia. RCM evaluates the context order with the line distance in Cartesian coordinate system, so that the...
LS-based adaptation cannot fully exploit high-dimensional correlations in image signals, as linear prediction model in the input space of supports is undesirable to capture higher order statistics. This paper proposes Gaussian process regression for prediction in lossless image coding. Incorporating kernel functions, the prediction support is projected into a high-dimensional feature space to fit...
Previous reference-based compression on DNA sequences do not fully exploit the intrinsic statistics by merely concerning the approximate matches. In this paper, an adaptive difference distribution-based coding framework is proposed by the fragments of nucleotides with a hierarchical tree structure. To keep the distribution of difference sequence from the reference and target sequences concentrated,...
Genome data are playing a significantly important role in modern medicine, e.g., personalized medicine and earlier detection of diseases. With the increasing demand in genome data, advanced sequencing techniques have been developed, among which the flexible miniaturized sequencing devices [1] are very promising, especially due to their portability and efficiency. These portable devices commonly have...
In this paper, we investigate and propose a novel prediction model for lossless image coding in which the optimal correlated prediction for block of pixels are simultaneously obtained in the sense of the least code length. It not only utilizes the spatial statistical correlation for the optimal prediction directly based on 2-D contexts, but also formulates the data-driven structural interdependencies...
This paper proposes a novel model on intra-coding for high efficiency video coding (HEVC), which can simultaneously make the set of prediction for block of pixels in an optimal rate-distortion sense. It not only utilizes the spatial statistical correlation for the optimal prediction based on 2-D contexts, but also formulates the data-driven structural interdependencies to make the prediction error...
In this paper, we propose the bitwise structured prediction model for lossless image coding, especially for the oscillatory regions. The learning-based model utilizes the regular features obtained from the predicted local data. At first, the pixel-wise prediction is decomposed into the bitwise ones. In each bit plane, the prediction of the current bit is simplified to the max margin estimation for...
The sequential context modeling framework is generalized to a non-sequential one by context relaxation from consecutive suffix of the subsequences of symbols to the permutation of the preceding symbols as result of considering complex context structures in such sources as video and program binaries. Context weighting tree is also extended to a series of context trees which are built according to the...
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.