Demo Data from EDBT 2026 / reviewers in the wild / expert
Ottar Johnsen
dblp:97/239
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 1 · 1 first-author
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 · 70% Multimedia systems and quality of experience · 30% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video coding › document image compression
facsimile coding |
0.0 | 1 | 1981 | Progressive Transmission of Two-Tone Images · IEEE Trans. Commun. 1981 |
Image and video coding › scalable coding
progressive coding |
0.0 | 1 | 1981 | Progressive Transmission of Two-Tone Images · IEEE Trans. Commun. 1981 |
Multimedia systems and quality of experience › image transmission
progressive transmission |
0.0 | 1 | 1981 | Progressive Transmission of Two-Tone Images · IEEE Trans. Commun. 1981 |
Coding theory › source coding › variable-length codes › prefix codes
huffman coding |
0.0 | 1 | 1980 | On the redundancy of binary Huffman codes (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory › source coding › universal coding
redundancy bounds |
0.0 | 1 | 1980 | On the redundancy of binary Huffman codes (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory
source coding |
0.0 | 1 | 1980 | On the redundancy of binary Huffman codes (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Methods — techniques the papers use, named apart from their topics
two-dimensional code modification · 0.0progressive resolution refinement · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Detection of the Groove Position in Phonographic ImagesabstractThe sound of phonographic records is contained in the radial position of the groove (and sometimes also its depth). The sound is usually extracted by a mechanical device (the stylus of the record player). Many old records are in such bad shape that no mechanical contact is possible. An alternative is to take a picture of the record and to estimate the radial groove position, using image processing. In this paper, we present the technique to extract the radial position of the groove and therefore the sound of the records. Ottar Johnsen, Sylvain Stotzer, Frédéric Bapst, Rolf Ingold |
ICIP (6) | 1 |
| 2006 | Groove Extraction of Phonographic Records
Sylvain Stotzer, Ottar Johnsen, Frédéric Bapst, Rolf Ingold |
Document Analysis Systems | 2 |
| 2004 | Phonographic sound extraction using image and signal processingabstractThe optical retrieval and storage technique called VisualAudio provides a way to extract sound information from an analog disk without any mechanical contact. The process is straightforward: we take a picture of each side of the disk using a dedicated analog camera, we store the film as our working copy, and when needed, we scan the film and process the image in order to extract the sound. This technique can be used to retrieve the sound from old records that are in such a bad shape that no regular turntable can be used. A working prototype has been built and has retrieved the sound from several records. We present the signal processing issues of this system and, in particular, a signal-to-noise ratio analysis. Sylvain Stotzer, Ottar Johnsen, Frédéric Bapst, Christoph Sudan, Rolf Ingold |
ICASSP (4) | 2 |
| 1981 | Progressive Transmission of Two-Tone ImagesabstractA technique is proposed for transmitting two-tone images in a progression of stages. In the first stage, information is transmitted to allow a crude reproduction of the picture. In the following stages, the quality of the received picture is improved until a copy identical to the original is obtained. The proposed technique uses a modification of the two-dimensional code recommended by the CCITT for transmission of facsimile. The main features of the coding scheme are as follows. 1) A crude version of the image is obtained after approximately 10-20 percent of the total transmission time. A good version, with half the resolution in both the horizontal and vertical directions, is obtained after 50 percent of the total transmission time. 2) Compatibility with the CCITT codes for transmission of facsimile. 3) Total transmission time is only about 20 percent larger than the time required for nonprogressive transmission using the CCITT codes. Ottar Johnsen, Arun N. Netravali |
IEEE Trans. Commun. | 1 |
| 1980 | On the redundancy of binary Huffman codes (Corresp.)abstractSome properties of Huffman codes are presented. It is shown that knowing the probabilityP_{1}of the most likely source letter, there exist new lower and upper bounds on the redundancy of the Huffman code which are tighter forP_{1} \geq 0.4than those given by Shannon's first theorem or by the more recent results of Gallager. It is also shown that the new bounds are the tightest possible forP_{1} \geq 0.4when it is supposed that PI is the only known probability. Ottar Johnsen |
IEEE Trans. Inf. Theory | 1 |