Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Berthold K. P. Horn is active.

Publication


Featured researches published by Berthold K. P. Horn.


Artificial Intelligence | 1980

Determining Optical Flow

Berthold K. P. Horn; Brian G. Schunck

Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent velocity of the brightness pattern varies smoothly almost everywhere in the image. An iterative implementation is shown which successfully computes the optical flow for a number of synthetic image sequences. The algorithm is robust in that it can handle image sequences that are quantified rather coarsely in space and time. It is also insensitive to quantization of brightness levels and additive noise. Examples are included where the assumption of smoothness is violated at singular points or along lines in the image.


Journal of The Optical Society of America A-optics Image Science and Vision | 1987

Closed-form solution of absolute orientation using unit quaternions

Berthold K. P. Horn

Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task . It finds applications i n stereoph and in robotics . I present here a closed-form solution to the least-squares problem for three or more paints . Currently various empirical, graphical, and numerical iterative methods are in use . Derivation of the solution i s simplified by use of unit quaternions to represent rotation . I emphasize a symmetry property that a solution to thi s problem ought to possess . The best translational offset is the difference between the centroid of the coordinates i n one system and the rotated and scaled centroid of the coordinates in the other system . The best scale is equal to th e ratio of the root-mean-square deviations of the coordinates in the two systems from their respective centroids . These exact results are to be preferred to approximate methods based on measurements of a few selected points . The unit quaternion representing the best rotation is the eigenvector associated with the most positive eigenvalue o f a symmetric 4 X 4 matrix . The elements of this matrix are combinations of sums of products of correspondin g coordinates of the points .


Journal of The Optical Society of America A-optics Image Science and Vision | 1988

Closed-form solution of absolute orientation using orthonormal matrices

Berthold K. P. Horn; Hugh M. Hilden; Shahriar Negahdaripour

Finding the relationship between two coordinate systems by using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. The solution has applications in stereophotogrammetry and in robotics. We present here a closed-form solution to the least-squares problem for three or more points. Currently, various empirical, graphical, and numerical iterative methods are in use. Derivation of a closed-form solution can be simplified by using unit quaternions to represent rotation, as was shown in an earlier paper [ J. Opt. Soc. Am. A4, 629 ( 1987)]. Since orthonormal matrices are used more widely to represent rotation, we now present a solution in which 3 × 3 matrices are used. Our method requires the computation of the square root of a symmetric matrix. We compare the new result with that obtained by an alternative method in which orthonormality is not directly enforced. In this other method a best-fit linear transformation is found, and then the nearest orthonormal matrix is chosen for the rotation. We note that the best translational offset is the difference between the centroid of the coordinates in one system and the rotated and scaled centroid of the coordinates in the other system. The best scale is equal to the ratio of the root-mean-square deviations of the coordinates in the two systems from their respective centroids. These exact results are to be preferred to approximate methods based on measurements of a few selected points.


Proceedings of the IEEE | 1981

Hill shading and the reflectance map

Berthold K. P. Horn

Shaded overlays for maps give the user an immediate appreciation for the surface topography since they appeal to an important visual depth cue. A brief review of the history of manual methods is followed by a discussion of a number of methods that have been proposed for the automatic generation of shaded overlays. These techniques are compared using the reflectance map as a common representation for the dependence of tone or gray level on the orientation of surface elements.


Proceedings of the IEEE | 1984

Extended Gaussian images

Berthold K. P. Horn

This is a primer on extended Gaussian images. Extended Gaussian images are useful for representing the shapes of surfaces. They can be computed easily from: 1. needle maps obtained using photometric stereo; or 2. depth maps generated by ranging devices or binocular stereo. Importantly, they can also be determined simply from geometric models of the objects. Extended Gaussian images can be of use in at least two of the tasks facing a machine vision system: 1. recognition, and 2. determining the attitude in space of an object. Here, the extended Gaussian image is defined and some of its properties discussed. An elaboration for nonconvex objects is presented and several examples are shown.


Computer Graphics and Image Processing | 1974

Determining lightness from an image

Berthold K. P. Horn

A method for the determination of lightness from image intensity is presented. For certain classes of images, lightness corresponds to reflectance, while image intensity is the product of reflectance and illumination intensity. The method is two-dimensional and depends on the different spatial distribution of these two components of image intensity. Such a lightness-judging process is required for Lands retinex theory of color vision, A number of physical models are developed and computer simulation of the process is demonstrated. This work should be of interest to designers of image processing hardward, cognitive psychologists dealing with the human visual system and neurophysiologists concerned with the function of structures in the primate retina.


Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing | 1986

The variational approach to shape from shading

Berthold K. P. Horn; Michael J. Brooks

Abstract We develop a systematic approach to the discovery of parallel iterative schemes for solving the shape-from-shading problem on a grid. A standard procedure for finding such schemes is outlined, and subsequently used to derive several new ones. The shape-from-shading problem is known to be mathematically equivalent to a nonlinear first-order partial differential equation in surface elevation. To avoid the problems inherent in methods used to solve such equations, we follow previous work in reformulating the problem as one of finding a surface orientation field that minimizes the integral of the brightness error. The calculus of variations is then employed to derive the appropriate Euler equations on which iterative schemes can be based. The problem of minimizing the integral of the brightness error term is ill posed, since it has an infinite number of solutions in terms of surface orientation fields. A previous method used a regularization technique to overcome this difficulty. An extra term was added to the integral to obtain an approximation to a solution that was as smooth as possible. We point out here that surface orientation has to obey an integrability constraint if it is to correspond to an underlying smooth surface. Regularization methods do not guarantee that the surface orientation recovered satisfies this constraint. Consequently, we attempt to develop a method that enforces integrability, but fail to find a convergent iterative scheme based on the resulting Euler equations. We show, however, that such a scheme can be derived if, instead of strictly enforcing the constraint, a penalty term derived from the constraint is adopted. This new scheme, while it can be expressed simply and elegantly using the surface gradient, unfortunately cannot deal with constraints imposed by occluding boundaries. These constraints are crucial if ambiguities in the solution of the shape-from-shading problem are to be avoided. Differrent schemes result if one uses different parameters to describe surface orientation. We derive two new schemes, using unit surface normals, that facilitate the incorporation of the occluding boundary information. These schemes, while more complex, have several advantages over previous ones.


International Journal of Computer Vision | 1991

Direct methods for recovering motion

Berthold K. P. Horn; E. J. Weldon

We have developed direct methods for recovering the motion of an observer in a static environment in the case of pure rotation, pure translation, and arbitrary motion when the rotation is known. Some of these methods are based on the minimization of the difference between the observed time derivative of brightness and that predicted from the spatial brightness gradient, given the estimated motion. We minimize the square of the integral of this difference taken over the image region of interest. Other methods presented here exploit the fact that surfaces have to be in front of the observer in order to be seen.We do not establish point correspondences, nor do we estimate the optical flow. We use only first-order derivatives of the image brightness, and we do not assume an analytic form for the surface. We show that the field of view should be large to accurately recover the components of motion in the direction toward the image region. We also demonstrate the importance of points where the time derivative of brightness is small and discuss difficulties resulting from very large depth ranges. We emphasize the need for adequate filtering of the image data before sampling to avoid aliasing, in both the spatial and temporal dimensions.


International Journal of Computer Vision | 1987

Relative Orientation

Berthold K. P. Horn

Before corresponding points in images taken with two cameras can be used to recover distances to objects in a scene, one has to determine the position and orientation of one camera relative to the other. This is the classic photogrammetric problem of relative orientation, central to the interpretation of binocular stereo information. Iterative methods for determining relative orientation were developed long ago; without them we would not have most of the topographic maps we do today. Relative orientation is also of importance in the recovery of motion and shape from an image sequence when successive frames are widely separated in time. Workers in motion vision are rediscovering some of the methods of photogrammetry.Described here is a simple iterative scheme for recovering relative orientation that, unlike existing methods, does not require a good initial guess for the baseline and the rotation. The data required is a pair of bundles of corresponding rays from the two projection centers to points in the scene. It is well known that at least five pairs of rays are needed. Less appears to be known about the existence of multiple solutions and their interpretation. These issues are discussed here. The unambiguous determination of all of the parameters of relative orientation is not possible when the observed points lie on a critical surface. These surfaces and their degenerate forms are analyzed as well.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 1987

Direct Passive Navigation

Shahriar Negahdaripour; Berthold K. P. Horn

In this correspondence, we show how to recover the motion of an observer relative to a planar surface from image brightness derivatives. We do not compute the optical flow as an intermediate step, only the spatial and temporal brightness gradients (at a minimum of eight points). We first present two iterative schemes for solving nine nonlinear equations in terms of the motion and surface parameters that are derived from a least-squares fomulation. An initial pass over the relevant image region is used to accumulate a number of moments of the image brightness derivatives. All of the quantities used in the iteration are efficiently computed from these totals without the need to refer back to the image. We then show that either of two possible solutions can be obtained in closed form. We first solve a linear matrix equation for the elements of a 3 × 3 matrix. The eigenvalue decomposition of the symmetric part of the matrix is then used to compute the motion parameters and the plane orientation. A new compact notation allows us to show easily that there are at most two planar solutions.

Collaboration


Dive into the Berthold K. P. Horn's collaboration.

Top Co-Authors

Avatar

Ichiro Masaki

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Yajun Fang

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Richard C. Lanza

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Patrick Henry Winston

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

John L. Wyatt

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Robert J. Woodham

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

A. Overeem

Wageningen University and Research Centre

View shared research outputs
Researchain Logo
Decentralizing Knowledge