Showing papers by "Peter Meer published in 2000"

Real-time tracking of non-rigid objects using mean shift

Abstract: A new method for real time tracking of non-rigid objects seen from a moving camera is proposed. The central computational module is based on the mean shift iterations and finds the most probable target position in the current frame. The dissimilarity between the target model (its color distribution) and the target candidates is expressed by a metric derived from the Bhattacharyya coefficient. The theoretical analysis of the approach shows that it relates to the Bayesian framework while providing a practical, fast and efficient solution. The capability of the tracker to handle in real time partial occlusions, significant clutter, and target scale variations, is demonstrated for several image sequences.

Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint

Abstract: We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algorithm is motivated by the recovery of bilinear forms, one of the fundamental problems in computer vision which appears whenever the epipolar constraint is imposed, or a conic is fit to noisy data points. We employ the errors-in-variables (EIV) model and show why already at moderate noise levels most available methods fail to provide a satisfactory solution. The improved behavior of the new algorithm is due to two factors: taking into account the heteroscedastic nature of the errors arising from the linearization of the bilinear form, and the use of generalized singular value decomposition (GSVD) in the computations. The performance of the algorithm is compared with several methods proposed in the literature for ellipse fitting and estimation of the fundamental matrix. It is shown that the algorithm achieves the accuracy of nonlinear optimization techniques at much less computational cost.

A general method for Errors-in-Variables problems in computer vision

Abstract: The Errors-in-Variables (EIV) model from statistics is often employed in computer vision though only rarely under this name. In an EIV model all the measurements are corrupted by noise while the a priori information is captured with a nonlinear constraint among the true (unknown) values of these measurements. To estimate the model parameters and the uncorrupted data, the constraint can be linearized, i.e., embedded in a higher dimensional space. We show that linearization introduces data-dependent (heteroscedastic) noise and propose an iterative procedure, the heteroscedastic EIV (HEIV) estimator to obtain consistent estimates in the most general, multivariate case. Analytical expressions for the covariances of the parameter estimates and corrected data points, a generic method for the enforcement of ancillary constraints arising from the underlying geometry are also given. The HEIV estimator minimizes the first order approximation of the geometric distances between the measurements and the true data points, and thus can be a substitute for the widely used Levenberg-Marquardt based direct solution of the original nonlinear problem. The HEIV estimator has however the advantage of a weaker dependence on the initial solution and a faster convergence. In comparison to Kanatani's renormalization paradigm (an earlier solution of the same problem) the HEIV estimator has more solid theoretical foundations which translate into better numerical behavior We show that the HEIV estimator can provide an accurate solution to most 3D vision estimation tasks, and illustrate its performance through two case studies: calibration and the estimation of the fundamental matrix.

Computer-assisted discrimination among malignant lymphomas and leukemia using immunophenotyping, intelligent image repositories, and telemicroscopy

Abstract: The process of discriminating among pathologies involving peripheral blood, bone marrow, and lymph node has traditionally begun with subjective morphological assessment of cellular materials viewed using light microscopy. The subtle visible differences exhibited by some malignant lymphomas and leukemia, however, give rise to a significant number of false negatives during microscopic evaluation by medical technologists. We have developed a distributed, clinical decision support prototype for distinguishing among hematologic malignancies. The system consists of two major components, a distributed telemicroscopy system and an intelligent image repository. The hybrid system enables individuals located at disparate clinical and research sites to engage in interactive consultation and to obtain computer-assisted decision support. Software, written in Java, allows primary users to control the specimen stage, objective lens, light levels, and focus of a robotic microscope remotely while a digital representation of the specimen is continuously broadcast to all session participants. Primary user status can be passed as a token. The system features shared graphical pointers, text messaging capability, and automated database management. Search engines for the database allow one to automatically identify and retrieve images, diagnoses, and correlated clinical data of cases from a gold standard database which exhibit spectral and spatial profiles which are most similar to a given query image.

Reduction of bias in maximum likelihood ellipse fitting

Abstract: An improved maximum likelihood estimator for ellipse fitting based on the heteroscedastic errors-in-variables (HEIV) regression algorithm is proposed. The technique significantly reduces the bias of the parameter estimates present in the direct least squares method, while it is numerically more robust than renormalization, and requires less computations than minimizing the geometric distance with the Levenberg-Marquardt optimization procedure. The HEIV algorithm also provides closed-form expressions for the covariances of the ellipse parameters and corrected data points. The quality of the different solutions is assessed by defining confidence regions in the input domain, either analytically or by bootstrap. The latter approach is exclusively data driven and it is used whenever the expression of the covariance for the estimates is not available.

Performance analysis in content-based retrieval with textures

Abstract: The features employed in content-based retrieval are most often simple low-level representations, while a human observer judges similarity between images based on high-level semantic properties. Using textures as an example, we show that a more accurate description of the underlying distribution of low-level features does not improve the retrieval performance. We also introduce the simplified multiresolution symmetric autoregressive model for textures, and the Bhattacharyya distance based similarity measure. Experiments are performed with four texture representations and four similarity measures over the Brodatz and Vis Tex databases.