Matthias Mühlich
Goethe University Frankfurt
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Matthias Mühlich.
european conference on computer vision | 2004
Matthias Mühlich; Rudolf Mester
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mostly in form of covariance matrices) into errors-in-variables or total least squares models led to a considerable improvement of existing algorithms.
Pattern Recognition Letters | 2001
Matthias Mühlich; Rudolf Mester
Abstract Let u → i and v → i be the projections of the same 3D object point in two different images (written in homogeneous coordinates). If all 3D points are restricted to lie on a plane, then the equation v → i ≃ A u → i holds for all point correspondences u → i ⇔ v → i , i =1,…, N (≃ denoting projective equivalence) with a 3×3-matrix A describing a mapping between two images of plane. The problem of estimating this mapping is known as homography estimation and constitutes a common problem in two-view motion analysis. In this paper, we will derive a new fast algorithm for homography estimation that takes image error models into account in order to improve estimation quality. In comparison to the well-known Least Squares (LS) estimation, the application of the Total Least Squares (TLS) method and a prior equilibration (which essentially consists in adjusting the error metric) leads to a considerable improvement in estimation quality. Starting out from the LS method, our approach is developed in several steps and results of each step are given, demonstrating the improvement achieved at each step. At the end, the outlier sensitivity is examined with an example for images with model violations (3D points not lying on the plane).
international conference on image processing | 2001
Rudolf Mester; Matthias Mühlich
This paper outlines the ubiquitous presence of generalized orientation (or subspace) estimation problems in image analysis. We show the potential sources of bias in naive approaches to directional estimation problems, discuss countermeasures against this bias, and point out the direct relation to the total least squares problem. An improved method (using TLS and equilibration) for a precise direct motion estimation of planar objects (8 parameter motion model, homography estimation) concludes this paper.
southwest symposium on image analysis and interpretation | 2004
Matthias Mühlich; Rudolf Mester
The natural characteristics of image signals and the statistics of measurement noise are decisive for designing optimal filter sets and optimal estimation methods in signal processing. Astonishingly, this principle has so far only partially found its way into the field of image sequence processing. We show how a Wiener-type MMSE optimization criterion for the resulting image signal, based on a simple covariance model of images or image sequences, provides direct and intelligible solutions for various, apparently different, problems, such as error concealment, or adaption of filters to signal and noise statistics.
dagm conference on pattern recognition | 2005
Matthias Mühlich; Rudolf Mester
Filtering a signal with a finite impulse response (FIR) filter introduces dependencies between the errors in the filtered image due to overlapping filter masks. If the filtering only serves as a first step in a more complex estimation problem (e.g. orientation estimation), then these correlations can turn out to impair estimation quality. n nThe aim of this paper is twofold. First, we show that orientation estimation (with estimation of optical flow being an important special case for space-time volumes) is a Total Least Squares (TLS) problem: Tp
computer analysis of images and patterns | 1999
Stefan Trautwein; Matthias Mühlich; Dirk Feiden; Rudolf Mester
thickapprox
scandinavian conference on image analysis | 2005
Matthias Mühlich; Rudolf Mester
0 with sought parameter vector p and given TLS data matrix T whose statistical properties can be described with a covariance tensor. In the second part, we will show how to improve TLS estimates given this statistical information.
Mustererkennung 1998, 20. DAGM-Symposium | 1998
Matthias Mühlich; Rudolf Mester
The main goal of this paper is to introduce methods for three-view motion analysis that do not need threefold correspondences in the image planes as the well-known trifocal tensor methods do. With this characteristic, the proposed method is a practically very advantageous approach for (ego-)motion analysis and structure from motion. The proposed method starts with three two-view parameter estimates generated by Hartley/Muhlich-equilibrated TLS solutions, enforces geometrical consistency and iteratively optimizes the distances from the set of epipolar lines.
Mustererkennung 1999, 21. DAGM-Symposium | 1999
Dirk Feiden; Matthias Mühlich; Rudolf Mester
Estimation of inhomogeneous vectors is well-studied in estimation theory. For instance, given covariance matrices of input data allow to compute optimal estimates and characterize their certainty. But a similar statement does not hold for homogeneous vectors and unfortunately, the majority of estimation problems arising in computer vision refers to such homogeneous vectors... n nThe aim of this paper is twofold: First, we will describe several iterative estimation schemes for homogeneous estimation problems in a unified framework, thus presenting the missing link between those apparently different approaches. And secondly, we will present a novel approach called IETLS (for iterative equilibrated total least squares) which is insensitive to data preprocessing and shows better stability in presence of higher noise levels where other schemes often fail to converge.
european signal processing conference | 2004
Matthias Mühlich; Rudolf Mester
Kern dieses Beitrags ist (in Erweiterung von [6]) die statistische Analyse des 8 + n-Punkte Algorithmus’ zur Bestimmung der Fundamentalmatrix. Dadurch gelingt es, eine Verbesserung dieses als sehr empfindlich geltenden Verfahrens zu erreichen, die uber die Wirkung der von Hartley vorgeschlagenen Normalisierungstransformationen hinausgeht. An dem hier betrachteten „klassischen“Vision-Problem wird deutlich, das die moglichst genaue statistische Analyse des Fehlerverhaltens eines Algorithmus’ keine akademische Fingerubung, sondern eine zwingende Notwendigkeit auf dem Weg zu zuverlassigen und praxistauglichen Verfahren ist.