Search arXiv⌕ Search

arXiv subjects

Jeffrey Uhlmann

Publications and source records attributed to Jeffrey Uhlmann.

40 records · Page 3Linked to original sources

A Canonical Image Set for Examining and Comparing Image Processing Algorithms

The purpose of this paper is to introduce a set of four test images containing features and structures that can facilitate effective examination and comparison of image processing algorithms. More specifically, the images are designed to more explicitly expose the characteristic properties of algorithms for image compression, virtual resolution adjustment, and enhancement. This set was developed at the Naval Research Laboratory (NRL) in the late 1990s as a more rigorous alternative to Lena and other images that have come into common use for purely ad hoc reasons with little or no rigorous consideration of their suitability. The increasing number of test images appearing in the literature not only makes it more difficult to compare results from different papers, it also introduces the potential for cherry-picking to influence results. The key contribution of this paper is the proposal to establish {\em some} canonical set to ensure that published results can be analyzed and compared in a rigorous way from one paper to another, and consideration of the four NRL images is proposed for this purpose.

cs.CV↗

Unit Consistency, Generalized Inverses, and Effective System Design Methods

This paper examines the potential role of unit consistency as a system design principle. Unit-consistent generalized matrix inverses and unit-invariant matrix decompositions are derived in support of this principle. Applications of the methods described are illustrated with examples relating to nonlinear system identification and robustness to multiplicative noise for image database retrieval.

math.NA↗

On the Equivalence of the General Covariance Union (GCU) and Minimum Enclosing Ellipsoid (MEE) Problems

In this paper we describe General Covariance Union (GCU) and show that solutions to GCU and the Minimum Enclosing Ellipsoid (MEE) problems are equivalent. This is a surprising result because GCU is defined over positive semidefinite (PSD) matrices with statistical interpretations while MEE involves PSD matrices with geometric interpretations. Their equivalence establishes an intersection between the seemingly disparate methodologies of covariance-based (e.g., Kalman) filtering and bounded region approaches to data fusion.

math.OC↗