Results 171 to 180 of about 9,338 (218)
Some of the next articles are maybe not open access.
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2002
If the only information we have on a certain database is through a set of views, the question arises of whether this is sufficient to answer completely a given query. We say that the set of views is lossless with respect to the query, if, no matter what the database is, we can answer the query by solely relying on the content of the views. The question
DIEGO CALVANESE +3 more
openaire +2 more sources
If the only information we have on a certain database is through a set of views, the question arises of whether this is sufficient to answer completely a given query. We say that the set of views is lossless with respect to the query, if, no matter what the database is, we can answer the query by solely relying on the content of the views. The question
DIEGO CALVANESE +3 more
openaire +2 more sources
On the lossless and J-lossless embedding theorems in H∞
Systems and Control Letters, 1996The connection between the lossless embedding theorem in H∞ [2] used with linear fractional transformation and the J-lossless embedding theorem [3] in H∞ used with homographic transformation is shown in state space in this paper. In particular, it will be shown that the condition P21−1(s)ϵRH∞ which is essential in the former as an approach to the ...
Yeng Chai Soh
exaly +2 more sources
Lossless, near-lossless, and refinement coding of bilevel images
IEEE Transactions on Image Processing, 1999We present general and unified algorithms for lossy/lossless coding of bilevel images. The compression is realized by applying arithmetic coding to conditional probabilities. As in the current JBIG standard the conditioning may be specified by a template. For better compression, the more general free tree may be used.
Bo Martins, Søren Forchhammer
openaire +2 more sources
Sentiment Lossless Summarization
Knowledge-Based Systems, 2021Abstract The aim of automatic text summarization (ATS) is to extract representative texts from documents and keep major points of the extracted texts consistent with the original documents. However, most existing studies ignore sentimental information loss in the summarization process, which leads to sentiment loss summarization.
Xiaodong Li 0007 +4 more
openaire +1 more source
Lossless and near-lossless compression of still color images
Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 2003This paper proposes a unified coding algorithm for lossless and near-lossless color image compression that exploits the correlations between RGB signals. For lossless coding, a reversible color transform is proposed that removes the correlations between RGB signals while avoiding any finite word length limitation.
Takayuki Nakachi +2 more
openaire +1 more source
Lossless and near-lossless image compression with color transformations
Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2002A comparison of lossless compression results is given for RGB, YC/sub R/C/sub B/ and reversible JPEG 2000 color space. The paper describes the general conditions that rounding errors of a color transformation do not cumulate in the consecutive cycles of forward and inverse transformation.
Marek Domanski, Krzysztof Rakowski
openaire +1 more source
Lossless-by-Lossy Coding for Scalable Lossless Image Compression
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008This paper presents a method of scalable lossless image compression by means of lossy coding. A progressive decoding capability and a full decoding for the lossless rendition are equipped with the losslessly encoded bit stream. Embedded coding is applied to large-amplitude coefficients in a wavelet transform domain.
Kazuma Shinoda +2 more
openaire +1 more source
SPIE Proceedings, 2013
In this paper, we first review the lossless coding mode in the version 1 of the HEVC standard that has recently finalized. We then provide a performance comparison between the lossless coding mode in the HEVC and MPEG-AVC/H.264 standards and show that the HEVC lossless coding has limited coding efficiency.
Wen Gao 0001, Minqiang Jiang, Haoping Yu
openaire +1 more source
In this paper, we first review the lossless coding mode in the version 1 of the HEVC standard that has recently finalized. We then provide a performance comparison between the lossless coding mode in the HEVC and MPEG-AVC/H.264 standards and show that the HEVC lossless coding has limited coding efficiency.
Wen Gao 0001, Minqiang Jiang, Haoping Yu
openaire +1 more source
2018 52nd Annual Conference on Information Sciences and Systems (CISS), 2018
The framework of secrecy by design is introduced and the fundamental limits of lossless data compression are analyzed for this setting. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function f s , and then to derive fundamental limits for the performance of the resulting secrecy
Yanina Y. Shkel +2 more
openaire +1 more source
The framework of secrecy by design is introduced and the fundamental limits of lossless data compression are analyzed for this setting. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function f s , and then to derive fundamental limits for the performance of the resulting secrecy
Yanina Y. Shkel +2 more
openaire +1 more source
The lossless DCT for combined lossy/lossless image coding
Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269), 2002This paper introduces a modification of the discrete cosine transform (DCT) that produces integer coefficients from which the original image data can be reconstructed losslessly. It describes an embedded coding scheme which incorporates this lossless DCT and presents some experimental rate-distortion curves for this scheme.
openaire +1 more source