Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ole Riis Jensen

dblp:74/5413 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2002
0000-0001-8193-8348ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video coding · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › entropy coding
arithmetic coding
0.012002
Content layer progressive coding of digital maps · IEEE Trans. Image Process. 2002
Image and video coding › entropy coding
context-based arithmetic coding
0.012002
Content layer progressive coding of digital maps · IEEE Trans. Image Process. 2002
Image and video coding › image compression
lossless image compression
0.012002
Content layer progressive coding of digital maps · IEEE Trans. Image Process. 2002
Image and video coding › scalable coding
progressive coding
0.012002
Content layer progressive coding of digital maps · IEEE Trans. Image Process. 2002
Coding theory › error-correcting codes
concatenated codes
0.011998
Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes
convolutional codes
0.011998
Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › decoding
iterative decoding
0.011998
Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › decoding
sequential decoding
0.011998
Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes
reed-solomon codes
0.011998
Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding · IEEE Trans. Commun. 1998

Methods — techniques the papers use, named apart from their topics

template-based context modeling · 0.0context collapsing · 0.0simulation · 0.0belief propagation · 0.0
YearPublicationVenuePosition
2002 Content layer progressive coding of digital maps
abstract
A new lossless context based method is presented for content progressive coding of limited bits/pixel images, such as maps, company logos, etc., common on the World Wide Web. Progressive encoding is achieved by encoding the image in content layers based on color level or other predefined information. Information from already coded layers are used when coding subsequent layers. This approach is combined with efficient template based context bilevel coding, context collapsing methods for multilevel images and arithmetic coding. Relative pixel patterns are used to collapse contexts. Expressions for calculating the resulting number of contexts are given. The new methods outperform existing schemes coding digital maps and in addition provide progressive coding. Compared to the state-of-the-art PWC coder, the compressed size is reduced to 50-70% on our layered map test images.
Søren Forchhammer, Ole Riis Jensen
IEEE Trans. Image Process.2
2000 Content Layer Progressive Coding of Digital Maps
abstract
A new lossless context based method is presented for content progressive coding of limited bits/pixel images, such as maps, company logos, etc., common on the WWW. Progressive encoding is achieved by separating the image into content layers based on other predefined information. Information from already coded layers are used when coding subsequent layers. This approach is combined with efficient template based context bi-level coding, context collapsing methods for multi-level images and arithmetic coding. Relative pixel patterns are used to collapse contexts. The number of contexts are analyzed. The new methods outperform existing coding schemes coding digital maps and in addition provide progressive coding. Compared to the state-of-the-art PWC coder, the compressed size is reduced to 60-70% on our layered test images.
Søren Forchhammer, Ole Riis Jensen
Data Compression Conference2
1999 Virtual seminar room-modelling and experimentation in horizontal and vertical integration
abstract
The initial design considerations and research goals for an ATM network based virtual seminar room with five sites are presented. The basic observation behind the design of the virtual seminar room is, that besides the constant growth in available bandwidth for transmission in communication networks, many networks either already offer or are developing technologies to give quality of service (QoS) guarantees. This means that applications not only will support transmission of coded audio and video, but can be designed in a known and well-controlled network environment, which enables the applications to provide, in a broad sense, a high and reliable quality presented at the human computer interface.
Søren Forchhammer, Anders Fosgerau, Peter Søren Kirk Hansen, Steffen Duus Hansen, Ole Riis Jensen, Robin Sharp, John Aasted Sørensen
MMSP5
1999 Content progressive coding of limited bits/pixel images
abstract
We propose a new lossless context based method for content progressive coding of limited bits/pixel images, such as maps, company logos, etc., common on the WWW. Progressive encoding is done by separating the image into content layers based on color level or predefined information. By introducing skip-pixel coding the number of pixels encoded in each layer is reduced by using information from already coded layers. This approach is combined with efficient template based context bi-level coding, context collapsing methods for multi-level images and arithmetic coding. With our new method we are thus able to outperform existing coding schemes and in addition provide progressive coding. Compared to GIF we are able to reduce the compressed size with a factor of up to 3.
Ole Riis Jensen, Søren Forchhammer
MMSP1
1998 Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding
abstract
We describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon (RS) codes with nonuniform profile. With this scheme decoding with good performance is possible as low as E/sub b//N/sub 0/=0.6 dB, which is about 1.25 dB below the signal-to-noise ratio (SNR) that marks the cutoff rate for the full system. Accounting for about 0.45 dB due to the outer codes, sequential decoding takes place at about 1.7 dB below the SNR cutoff rate for the convolutional code. This is possible since the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability of computational overflow. Analytical results for the probability that the first RS word is decoded after C computations are presented. These results are supported by simulation results that are also extended to other parameters.
Ole Riis Jensen, Erik Paaske
IEEE Trans. Commun.1