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

Jürgen Albert

dblp:00/5474 · DBLP profile ↗
← Back
21ranked-venue papers
13as first author
0since 2021 · last 2008
—ORCID · none

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

Theory of computation · 13 · 13 first-authorArtificial intelligence and machine learning · 4Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Computer networks · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Computational photography and imaging · 56% Image and video coding · 44%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
6 papers
Automata and formal languages · 96% Combinatorics and discrete mathematics · 4%

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

TopicWeightPapersLastEvidence papers
Computational photography and imaging › color constancy
automatic white balance
0.112007
Integrating Color Constancy Into JPEG2000 · IEEE Trans. Image Process. 2007
Computational photography and imaging
color constancy
0.112007
Integrating Color Constancy Into JPEG2000 · IEEE Trans. Image Process. 2007
Image and video coding › image compression › wavelet-based image coding
JPEG2000
0.112007
Integrating Color Constancy Into JPEG2000 · IEEE Trans. Image Process. 2007
Bioinformatics and computational biology
sequence analysis
0.012003
Digital extractor: analysis of digital differential display output · Bioinform. 2003
Image and video coding › video compression
motion compensation
0.011998
Weighted finite automata for video compression · IEEE J. Sel. Areas Commun. 1998
Image and video coding
video compression
0.011998
Weighted finite automata for video compression · IEEE J. Sel. Areas Commun. 1998
Automata and formal languages
context-free languages
0.041982
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid · Inf. Control. 1982
Test Sets for Homomorphism Equivalence on Context Free Languages · Inf. Control. 1980
Test Sets for Homomorphism Equivalence on Context Free Languages · ICALP 1980
Automata and formal languages
weighted automata
0.011998
Weighted finite automata for video compression · IEEE J. Sel. Areas Commun. 1998
Automata and formal languages › finite automata
test sets
0.021982
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid · Inf. Control. 1982
Test Sets for Homomorphism Equivalence on Context Free Languages · ICALP 1980
Automata and formal languages
l systems
0.011978
Simple EOL Forms under Uniform Interpretation Generating CF Languages · ICALP 1978

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

retinex algorithm · 0.1gray-world assumption · 0.1vector quantization · 0.0quadtree decomposition · 0.0
YearPublicationVenuePosition
2008 Color Constancy from Image Transformations in JPEG and JPEG2000
abstract
Summary form only given. The ability of the human visual system to perceive colors as approximately constant irrespective of the illuminant is called color constancy. The output of a sensor varies with the type of illuminant used and is therefore not color constant. Color constancy algorithms try to compute a color constant descriptor from the measured data (M. Ebner, 2007). We show how color constancy can be implemented within JPEG and JPEG2000 by an adaptation of the well-known Retinex algorithm (E.H. Land and J.J. McCann, 1971), (E.H. Land, 1980). Compared to the normal decoding processes only little additional overhead is introduced into the processing pipeline.
German Tischler, Marc Ebner, Jürgen Albert
DCC3
2007 Integrating Color Constancy Into JPEG2000
abstract
The human visual system is able to perceive colors as approximately constant. This ability is known as color constancy. In contrast, the colors measured by a sensor vary with the type of illuminant used. Color constancy is very important for digital photography and automatic color-based object recognition. In digital photography, this ability is known under the name automatic white balance. A number of algorithms have been developed for color constancy. We review two well-known color constancy algorithms, the gray world assumption and the Retinex algorithm and show how a color constancy algorithm may be integrated into the JPEG2000 framework. Since computer images are usually stored in compressed form anyway, little overhead is required to add color constancy into the processing pipeline.
Marc Ebner, German Tischler, Jürgen Albert
IEEE Trans. Image Process.3
2005 Evolution of Vertex and Pixel Shaders
Marc Ebner, Markus Reinhardt, Jürgen Albert
EuroGP3
2003 Digital extractor: analysis of digital differential display output
Michael Sammeth, Jörg Rothgänger, W. Esser, Jürgen Albert, Jens Stoye, Dag Harmsen
Bioinform.4
2002 Coevolution Produces an Arms Race among Virtual Plants
Marc Ebner, Adrian Grigore, Alexander Heffner, Jürgen Albert
EuroGP4
2002 On The Use Of Negative Selection In An Artificial Immune System
Marc Ebner, Hans-Georg Breunig, Jürgen Albert
GECCO3
2001 On neutral networks and evolvability
abstract
Evolutionary algorithms apply the processes of variation, reproduction and selection to look for an individual that is capable of solving the task in hand. In order to improve the evolvability of a population, we propose to copy important characteristics of nature's search space. Desired characteristics for a genotype-phenotype mapping are described, and several highly redundant genotype-phenotype mappings are analyzed in the context of a population-based search. We show that evolvability is influenced by the existence of neutral networks in the genotype space. The extent of the neutral networks affects the interconnectivity of the search space and thereby affects evolvability. Species evolving on a non-redundant mapping reach a state of stasis after a few generations; in effect, evolution comes to a halt. However, species evolving on a genotype-phenotype mapping with extensive neutral networks are continuously able to find adaptive mutations and are able to locate higher optima. The existence of highly intertwined neutral networks increases the evolvability of a population.
Marc Ebner, Patrick Langguth, Jürgen Albert, Mark Shackleton, Rob Shipman
CEC3
2001 Normal form algorithms for extended context-free grammars
Jürgen Albert, Dora Giammarresi, Derick Wood
Theor. Comput. Sci.1
1998 Weighted finite automata for video compression
abstract
Weighted finite automata (WFA) exploit self-similarities within single pictures and also sequences of pictures to remove spatial and temporal redundancies. Their implementation then combines techniques from hierarchical methods related to quadtrees and from vector quantization to achieve performance results for low bit rates which can be put on a par with state-of-the-art codecs like embedded zero-tree wavelet coding. Due to their simple mathematical structure, WFA provide an ideal platform for efficient hybrid compression methods. Therefore, WFA were chosen as a starting point for a fractal-like video compression integrating a hierarchical motion compensation as well as an option to vary the compression quality between "centers of interest" and "background" in a flexible manner.
Ullrich Hafner, Jürgen Albert, Stefan Frank
IEEE J. Sel. Areas Commun.2
1984 On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version
Jürgen Albert
MFCS1
1983 Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages
Jürgen Albert, Derick Wood
J. Comput. Syst. Sci.1
1982 Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Jürgen Albert, Karel Culík II, Juhani Karhumäki
Inf. Control.1
1982 Tree Correspondence Problems
Jürgen Albert, Karel Culík II
J. Comput. Syst. Sci.1
1981 On subregular OL forms
Jürgen Albert, Hermann A. Maurer, Thomas Ottmann
Fundam. Informaticae1
1981 Languages with Homomorphic Replacements
Jürgen Albert, Lutz M. Wegner
Theor. Comput. Sci.1
1980 Test Sets for Homomorphism Equivalence on Context Free Languages
Jürgen Albert, Karel Culík II
ICALP1
1980 Languages with Homomorphic Replacements
Jürgen Albert, Lutz M. Wegner
ICALP1
1980 Simple EOL forms under uniform interpretation generating CF languages
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg
Fundam. Informaticae1
1980 Test Sets for Homomorphism Equivalence on Context Free Languages
Jürgen Albert, Karel Culík II
Inf. Control.1
1978 Simple EOL Forms under Uniform Interpretation Generating CF Languages
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg
ICALP1
1977 The Class of Context-Free Languages is not an E0L Family
Jürgen Albert, Hermann A. Maurer
Inf. Process. Lett.1