An Epipolar Line from a Single Pixel

  title={An Epipolar Line from a Single Pixel},
  author={Tavi Halperin and Michael Werman},
  journal={2018 IEEE Winter Conference on Applications of Computer Vision (WACV)},
  • Tavi Halperin, M. Werman
  • Published 28 March 2017
  • Computer Science
  • 2018 IEEE Winter Conference on Applications of Computer Vision (WACV)
Computing the epipolar geometry from feature points between cameras with very different viewpoints is often error prone, as an object's appearance can vary greatly between images. For such cases, it has been shown that using motion extracted from video can achieve much better results than using a static image. This paper extends these earlier works based on the scene dynamics. In this paper we propose a new method to compute the epipolar geometry from a video stream, by exploiting the following… Expand
Separable Four Points Fundamental Matrix
  • Gil Ben-Artzi
  • Computer Science
  • 2021 IEEE Winter Conference on Applications of Computer Vision (WACV)
  • 2021
The geometrical meaning of the decomposition-based representation of the fundamental matrix based on epipolar homography decomposition is analyzed and it is shown that it directly induces a consecutive sampling strategy of two independent sets of correspondences. Expand


Camera Calibration from Dynamic Silhouettes Using Motion Barcodes
This work proposes a speed up of about two orders of magnitude, as well as an increase in robustness and accuracy, to methods computing epipolar geometry from dynamic silhouettes, based on a new temporal signature: motion barcode for lines. Expand
Camera Network Calibration and Synchronization from Silhouettes in Archived Video
This work presents an automatic method for calibrating a network of cameras that works by analyzing only the motion of silhouettes in the multiple video streams, using a RANSAC-based algorithm that simultaneously computes the epipolar geometry and synchronization of a pair of cameras only from theMotion of silhouette in video. Expand
The fundamental matrix: Theory, algorithms, and stability analysis
This paper clarifies the projective nature of the correspondence problem in stereo and shows that the epipolar geometry can be summarized in one 3×3 matrix of rank 2 which is proposed to call the Fundamental matrix, a task which is of practical importance. Expand
A computer algorithm for reconstructing a scene from two projections
A simple algorithm for computing the three-dimensional structure of a scene from a correlated pair of perspective projections is described here, when the spatial relationship between the twoExpand
Consistent Labeling of Tracked Objects in Multiple Cameras with Overlapping Fields of View
It is shown that, if the FOV lines are known, it is possible to disambiguate between multiple possibilities for correspondence, and once these lines are initialized, the homography between the views can also be recovered. Expand
Fundamental Matrices from Moving Objects Using Line Motion Barcodes
Previous work to scenes having multiple moving objects by using the “Motion Barcodes”, a temporal signature of lines is extended, assuming that cameras are relatively stationary and that moving objects have already been extracted using background subtraction. Expand
Video Synchronization Using Temporal Signals from Epipolar Lines
A novel definition of low level temporal signals computed from epipolar lines is introduced and the spatial matching of two such temporal signals is given by the fundamental matrix, bypassing the problem of correspondence changes in the presence of motion. Expand
Automatic Camera Network Localization using Object Image Tracks
A method for localizing the cameras in a camera network to recover the orientation and position up to scale of each camera, even when cameras are wide-baseline or have different photometric properties is shown. Expand
Epipolar geometry based on line similarity
A similarity measure between lines is proposed that indicates whether two lines are corresponding epipolar lines and enables finding epipolar line correspondences as needed for the computation of epipolar geometry. Expand
In Defense of the Eight-Point Algorithm
  • R. Hartley
  • Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1997
This paper shows that by preceding the eight-point algorithm with a very simple normalization (translation and scaling) of the coordinates of the matched points, results are obtained comparable with the best iterative algorithms. Expand