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

Jochen Maydt

dblp:12/1774 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2006
—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-authorApplied, interdisciplinary, general and emerging computing · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.112006
Recco: recombination analysis using cost optimization · Bioinform. 2006
Bioinformatics and computational biology › molecular evolution
recombination breakpoint detection
0.112006
Recco: recombination analysis using cost optimization · Bioinform. 2006
Bioinformatics and computational biology › molecular evolution
recombination detection
0.112006
Recco: recombination analysis using cost optimization · Bioinform. 2006
Bioinformatics and computational biology
sequence analysis
0.112006
Recco: recombination analysis using cost optimization · Bioinform. 2006

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

mutation-recombination cost model · 0.1cost optimization · 0.1
YearPublicationVenuePosition
2006 Recco: recombination analysis using cost optimization
abstract
MOTIVATION: Recombination plays an important role in the evolution of many pathogens, such as HIV or malaria. Despite substantial prior work, there is still a pressing need for efficient and effective methods of detecting recombination and analyzing recombinant sequences. RESULTS: We introduce Recco, a novel fast method that, given a multiple sequence alignment, scores the cost of obtaining one of the sequences from the others by mutation and recombination. The algorithm comes with an illustrative visualization tool for locating recombination breakpoints. We analyze the sequence alignment with respect to all choices of the parameter alpha weighting recombination cost against mutation cost. The analysis of the resulting cost curve yields additional information as to which sequence might be recombinant. On random genealogies Recco is comparable in its power of detecting recombination with the algorithm Geneconv (Sawyer, 1989). For specific relevant recombination scenarios Recco significantly outperforms Geneconv.
Jochen Maydt, Thomas Lengauer
Bioinform.1
2002 An extended set of Haar-like features for rapid object detection
abstract
Recently Viola et al. [2001] have introduced a rapid object detection. scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated Haar-like features. These novel features significantly enrich the simple features of Viola et al. and can also be calculated efficiently. With these new rotated features our sample face detector shows off on average a 10% lower false alarm rate at a given hit rate. We also present a novel post optimization procedure for a given boosted cascade improving on average the false alarm rate further by 12.5%.
Rainer Lienhart, Jochen Maydt
ICIP (1)2
2002 A fast method for training support vector machines with a very large set of linear features
abstract
Current systems for object detection often use support vector machines (SVM) as the basic classification algorithm. A rather common case is to compute a small set of linear features and then train the classifier on these features. We present a fast method to train and evaluate SVM with many linear features and show results for face detection using a set of 210400 features. The resulting classifier is both more accurate and faster than a classifier trained on raw pixel features, which total up only to 576 features in our case.
Jochen Maydt, Rainer Lienhart
ICME (1)1