Conditions for Segmentation of Motion with Affine Fundamental Matrix

Size: px
Start display at page:

Download "Conditions for Segmentation of Motion with Affine Fundamental Matrix"

Transcription

1

2 Conditions for Segmentation of Motion with Affine Fundamental Matrix Shafriza Nisha Basah 1, Reza Hoseinnezhad 2, and Alireza Bab-Hadiashar 1 Faculty of Engineering and Industrial Sciences, Swinburne University of Technology 1, Melbourne School of Engineering, The University of Melbourne 2, Victoria, Australia sbasah@swin.edu.au,rezah@unimelb.edu.au,abab-hadiashar@swin.edu.au Abstract. Various computer vision applications involve recovery and estimation of multiple motions from images of dynamic scenes. The exact nature of objects motions and the camera parameters are often not known a priori and therefore, the most general motion model (the fundamental matrix) is applied. Although the estimation of a fundamental matrix and its use for motion segmentation are well understood, the conditions governing the feasibility of segmentation for different types of motions are yet to be discovered. In this paper, we study the feasibility of separating a motion (of a rigid 3D object) with affine fundamental matrix in a dynamic scene from another similar motion (unwanted motion). We show that successful segmentation of the target motion depends on the difference between rotation angles and translational directions, the location of points belonging to the unwanted motion, the magnitude of the unwanted translation viewed by a particular camera and the level of noise. Extensive set of controlled experiments using synthetic images were conducted to show the validity of the proposed constraints. The similarity between the experimental results and the theoretical analysis verifies the conditions for segmentation of motion with affine fundamental matrix. These results are important for practitioners designing solutions for computer vision problems. 1 Introduction Recovering structure-and-motion (SaM) from images of dynamic scenes is an indispensable part of many computer vision applications ranging from local navigation of a mobile robot to image rendering in multimedia applications. The main problem in SaM recovery is that the exact nature of objects motions and the camera parameters are often not known a priori. Thus, any motion of 3D object needs to be modelled in the form of a fundamental matrix [1] (if all moving points are in the same plane, the motion can be modelled as a homography). Motion estimation and segmentation based on the fundamental matrix are well understood and solved in the established work summarised in (Chapters.9 12,[2]). Soon after that work, researchers resumed to the more challenging multibody structure-and-motion (termed MSaM by Schindler and Suter

3 2 Shafriza Nisha Basah, Reza Hoseinnezhad, and Alireza Bab-Hadiashar in [3]) where multiple objects in motions need to be concurrently estimated and segmented. However, the conditions governing the feasibility of segmentation involving MSaM for different types of motions are yet to be established. These conditions are important as they provide information on the limits of current MSaM methods and would provide useful guidelines for practitioners designing solutions for computer vision problems. Well known examples of previous works in motion segmentation using the fundamental matrix are by Torr [4], Vidal et.al [5] and Schindler and Suter [3]. Torr uses the fundamental matrix to estimate an object in motion and cluster it in a probabilistic framework using the Expectation Maximisation algorithm [4]. Vidal.et.al propose to estimate the number of moving objects in motion and cluster those motions using the multibody fundamental matrix; the generalization of the epipolar constraint and the fundamental matrix of multiple motions [5]. Schindler and Suter have implemented the geometric model selection to replace degenerate motion in a dynamic scene using multibody fundamental matrix [3]. The focus of this paper is to study the feasibility of the detection and segmentation of an unknown motion (of a rigid 3D object) with affine fundamental matrix in a dynamic scene (using images taken by an uncalibrated camera). Motion with affine fundamental matrix consists of rotation around Z axis of the image plane and translation parallel to the image plane (no translation in Z direction) [1]. This work is an extension to the study of conditions for motionbackground segmentation and segmentation of translational motions in [6, 7]. In Section 2, we derive the conditions for the detection and segmentation of motion with affine fundamental matrix and provide quantitative measures for detection using theoretical analysis. Section 3 details the Monte Carlo experiments using synthetic images conducted to verify the theoretical analysis and the proposed conditions for successful segmentation of motion with affine fundamental matrix. Section 4 concludes the paper. 2 Segmentation of Motion with Affine Fundamental Matrix Consider n = n i + n o feature points [X i, Y i, ] belonging to two 3D objects undergoing motion-a and motion-b (i =, 1...n i denote the points belonging to motion-a and i = n i + 1, n i n denote points belonging to motion-b). Each motion consists of rotations around Z axis followed by a non-zero translation in the X Y plane denoted by θ a and T a for motion-a and θ b and T b for motion-b where T a = [T xa, T ya, T za ] and T b = [T xb, T yb, T zb ] with T za = T zb =. The location [X i, Y i, ] before and after the translations are visible in the image plane and are denoted by m 1i = [x 1i, y 1i ] and m 2i = [x 2i, y 2i ]. All points in the image plane are perturbed by measurement noise e assumed to be independent and identically distributed (i.i.d) with Gaussian distribution: x 1i = x 1i + e 1 ix, y 1i = y 1i + e 1 iy, x 2i = x 2i + e 2 ix, and y 2i = y 2i + e 2 iy, (1)

4 Conditions for Segmentation of Motion with Affine Fundamental Matrix 3 where e 1 ix, e1 iy, e2 ix and e2 iy N(, σ2 n ) and σ n is the unknown scale of noise. The underlined variables denote the true or noise-free locations of points in image plane. The relationship between all noise-free matching points in the image plane and world coordinate points as viewed by a camera (with focal length f and principle points [P x,p y ]) are: x 1i = fx i + P x, x 2i = x 1i cosθ y 1i sin θ + ft x + P x, y 1i = fy i + P y, y 2i = x 1i sin θ + y 1i cosθ + ft y + P y, (2) where P x = P x (1 cosθ)+p y sin θ and P y = P y (1 cosθ) P x sin θ. The symbols θ, T x and T y in (2) denote the motion parameters where θ = θ a, T x = T xa and T y = T ya for motion-a and θ = θ b, T x = T xb and T y = T yb for motionb respectively. We aim to segment the matching points belonging to motion-a from the mixture of matching points belonging to motion-a and motion-b in two images, thus the points undergoing motion-a are considered the inliers and the points undergoing motion-b would be the outliers or the unwanted motion. The fundamental matrix of motion-a is computed using: F = A T [T] xra 1, (3) where R is the rotation matrix of the motion and [T] x is the skew symmetric matrix of translation T [8, 2,9]. For motion-a (θ = θ a, T x = T xa and T y = T ya ), equation (3) yields: F a = 1 T ya T xa, (4) f T xa sin θ a T ya cosθ a T ya sin θ a + T xa cosθ a Q where Q = (T ya cosθ a T xa sin θ a T ya )P x + (T xa T ya sin θ a T xa cosθ a )P y. We assume that, a perfect estimator provides the true fundamental matrix given in (4). If F a is known, the Sampson distances can be computed using [1,1,11]: d i = m 2i Fm 1i [ ( / x 1i) 2 + ( / y 1i) 2 + ( / x 2i) 2 + ( / y 2]. (5) 2i) m 2i Fm 1i Substitution of real plus noise forms in (1) and F a in (4) into equation (5) yields: d i =(2(T 2 ya + T 2 xa)) 1 2 [(x1i + e 1 ix)(t xa sinθ a T ya cosθ a ) + (y 1i + e 1 iy) (T ya sin θ a + T xa cosθ a ) + (x 2i + e 2 ix)t ya (y 2i + e 2 iy)t xa + Q]. (6) For points undergoing motion-a (i =, 1...n i ), the above expression without noise terms equals zero because the true F a is used to compute d i s. Thus, equation (6) can be simplified to: d i =(2(T 2 ya + T 2 xa )) 1 2 [e 1 ix (T xa sin θ a T ya cosθ a ) + e 1 iy (T ya sin θ a + T xa cosθ a ) + e 2 ix T ya e 2 iy T xa]. (7)

5 4 Shafriza Nisha Basah, Reza Hoseinnezhad, and Alireza Bab-Hadiashar Distances d i s of the points belonging to motion-a in (7) turn out to be a linear combination of the i.i.d. noises therefore, they are also normally distributed with zero mean. The variance of d i s (i =, 1...n i ) also equals σ 2 n as the numerator and denominator cancel each other. Therefore, the distribution of d i s of motiona are the same as the noise e which are N(, σ 2 n). The points belonging to motion-a are to be separated from the points belonging to motion-b. The distances of points belonging to motion-b (i = n i + 1, n i n) with respect to F a are calculated using (6) in which [x 2i,y 2i ] are replaced with the terms in (1) for motion-b, yields: d i =(2(T 2 ya + T 2 xa )) 1 2 [x1i (T xa sin θ a T ya cosθ a ) + y 1i (T ya sinθ a + T xa cosθ a ) + x 2i T ya y 2i T xa + Q] + e, (8) where e N(, σ 2 n ) based on the distribution of d i s in (7). By combining equation (8) with the image-world points relationship for motion-b in (2), and expressing it in term of directions of translation (φ a for T a and φ b for T b ) and magnitude of T b, we obtain (after manipulations using several trigonometric identities): d i = 2sin θ 2 ( x 1i cosθ + ý 1i sin Θ) + K sin φ + e, (9) where x 1i = x 1i P x, ý 1i = y 1i P y, θ = θ a θ b, φ = φ a φ b, Θ = φ a θa+θ b 2 and K = f T b 2. By using the harmonic addition theorem [12], equation (9) is simplified to: where G i = d i = G i sin θ 2 cos Θ i + K sin φ + e, (1) 2( x 2 1i + ý 2 ) and Θ 1i i = Θ + tan 1 ( x 1i /ý 1i ) + β (the value of β = if x 1i or β = π if x 1i < ). Since the distribution of d i s of motion-a is always N(, σ 2 n) (according to equation (7)), the feasibility of identification and segmentation of points belonging to motion-a using a robust estimator depends on the distribution of d i s of motion-b. If the population of d i s from points belonging to motion-b overlap with population of d i s from points belonging to motion-a, they would not be separable. However if both populations (d i s from motion-a and b) do not overlap, the population of d i s of each motion will be separable. Thus, a robust estimator should be able to correctly identify and segment the points belonging to motion-a. In order to ensure that both populations do not overlap, the following conditions must be satisfied 1 : d i 5σ n or d i 5σ n when i = n i + 1, n i n, (11) where d i s are the noise-free d i s given by all terms in equation (8) except for the noise term e. If the conditions in (11) is satisfied 99.4% of points belonging 1 Since the d i s of motion-a is distributed according to N(, σ 2 n) and d i s of motion-b are also perturbed by measurement noise of N(, σ 2 n), from probability theory if the maximum or minimum value of d i s of motion-b are at least 5σ n away from the mean of d i s of motion-a, then only about.6% of d i s of each population would overlap.

6 Conditions for Segmentation of Motion with Affine Fundamental Matrix 5 to motion-a will be correctly segmented. Since the term G i s in (1) are always positive, the range of the term G i cos Θ i in (1) are: Ĝ G i cos Θ i Ĝ for all i s, (12) where Ĝ is the maximum values of G i s depending on the locations of the objects undergoing motion-b. Thus, the range of d i s from equations (1) and (12) are: θ Ĝsin 2 + K θ sin φ d Ĝsin i 2 + K sin φ. (13) Combining the inequalities in (11) and (13), the conditions for successful segmentation of points belonging to motion-a are expressed as: Ĝsin θ 2 + K θ sin φ 5σ n or Ĝsin 2 + K sin φ 5σ n. (14) Solving for θ, the inequalities in (14) are expressed as: θ 2 5σ sin 1 n ± K sin φ Ĝ θ 2 5σ sin 1 n ± K sin φ Ĝ for θ, for θ <. In most computer vision problems, the distance between the camera and the object in motion is roughly known. Therefore, the term in equation (15) can be expressed in term of average distance Z between camera and objects in motions or Z. We assume that an accurate estimate for F a is obtained by minimising the cost function of a robust estimator. Having F a, the distances (d i s) of all matching points can be computed. Then d 2 i s for all points are used as residuals for segmentation to identify and segment points belonging to motion-a using a robust estimator. Here, we use the Modified Selective Statistical Estimator (MSSE) [13] as it has been shown to outperform other robust estimation techniques in term of its consistency [14]. In MSSE, the residuals are sorted in an ascending order and the scale estimate given by the smallest kth distances is calculated using [13] for a particular value of k: (15) σ 2 k = k i=1 d2 i k 1. (16) While incrementing k, the MSSE algorithm is terminated when d k+1 is larger than 2.5 times the scale estimate given by the smallest k distances: d 2 k+1 > 2.52 σ 2 k. (17) With the above threshold, at least 99.4% of the inliers will be segmented if there are normally distributed [13].

7 6 Shafriza Nisha Basah, Reza Hoseinnezhad, and Alireza Bab-Hadiashar From our analysis, the separability of motion with affine fundamental matrix depends on the difference between rotation angles and translational directions ( θ and φ), the location of points belonging to motion-b (Ĝ), the magnitude of T b viewed by a particular camera ( K Z ) and the level of noise (σ n ) presented in equation (15). We verified these conditions using Monte Carlo experiments and the results are presented in the next section. The correctness of these conditions are verified by studying the variance of the result of the Monte Carlo experiments. The conditions for segmentation for more general motions (including T z and rotation around other axes) are too complex to be derived theoretically. However, the derived condition for segmentation of motion with affine fundamental matrix is served as the basis of approximation for more general motions when T z and rotation around other axes are very small or close to zero. 3 Monte Carlo Experiments The Monte Carlo experiments with synthetic images have two parts. The first part was conducted to verify the conditions for segmentation in (15) for separating motion-a from motion-b. The second part of the experiments was designed to examine how the conditions change when the inlier ratio ɛ was varied. In each iteration in the Monte Carlo experiments, 2 pairs of points in the world coordinate according to motion-a were mixed with the pairs of matching points according to motion-b (the number of matching points belonging to motion-b depends on the inlier ratio ɛ). All X and Y coordinates of the matching points were randomly generated while Z coordinates were uniformly distributed according to U( Z σ Z, Z+σ Z ) where Z = 1m and σz Z = 1%. Then, all matching points were projected to two images using a synthetic camera (with f = 73 pixels, [P x, P y ]=[32,24] and image size of pixels). Random noise with the distribution of N(, σn) 2 was added to all points. We assumed that the image points ( x 1i s and ý 1i s) belonging to each motion (motion-a and b) were clustered together, since in many computer vision applications the objects in motions are rigid. The points belonging to motion-b were assumed to be within 2% 2% width and length of the image size and according to Ĝ, while the points belonging to motion-a could be anywhere in the image plane (since its d i s will always be N(, σn) 2 according to (7)). The segmentation was performed using MSSE with d 2 i s (calculated based on the true F a) as the segmentation residuals. The ratio of the number of segmented inliers over the actual inliers ζ was calculated and recorded. Each experiment consists of 1 experimental iterations and the mean and standard deviation of 1 ζ s were recorded (denoted by ζ and σζ). These experiments were then repeated for various ɛ. In the first part of the experiments, we consider two scenarios; Scenario-I with parameters K Z =5 (corresponding to T b = 1m), σ n =.5 and Ĝ =.75G max while Scenario-II with parameters K Z =4 (corresponding to T b =.8m), σ n = 1 and Ĝ =.75G max 2. The conditions for segmentation for Scenario-I and II 2 The term G max is the value of G i when [ x 1i,ý 1i ] are maximum and in this case [32,24] according to a camera with image size with [P x, P y]=[32,24].

8 Conditions for Segmentation of Motion with Affine Fundamental Matrix 7 were generated from (15) and shown in Fig.2(c)-(d) and Fig.2(e)-(f) respectively, where the shaded area denote the area where motion-a will be successfully segmented from motion-b (in this area, both population of d i s will not overlap). This analysis were also performed in five different cases with ɛ = 3%. The motion parameters were selected from the magnitudes of θ s and φ s from the shaded region (Case-1 and 2) and unshaded region (Case-3, 4 and 5) in Fig.2(c)-(d). In all cases, the histogram of d i s of all image points were plotted and ζ s were recorded. For five instances of the data samples generated in Case 1 to 5 for Scenario-I (in Fig.2(c)-(d)), the histogram of d i s for all points are plotted in Fig.1. These figures show that in Case-1 ( θ = 1 and φ = 1 ) and Case-2 ( θ = 5 and φ = 3 ), the points belonging to motion-a were correctly segmented, denoted by ζ =.98 for both cases (ζ = 1 indicates perfect segmentation). Successful segmentation was expected as the population of d i s of points belonging to motion-a and motion-b were not overlapping, thus there were separable as shown in Fig.1(a) and 1(b). As the magnitudes of θ and φ were selected to be outside the shaded region in Fig.2(c)-(d) in Case-3 ( θ = 2 and φ = 1 ) and Case-4 ( θ = 1 and φ = 4 ), the points belonging to motion-a were incorrectly segmented denoted by ζ = 1.92 and The failure is due to the overlap of the population of d i s of both motions and thus there were very little distinction between them as shown in Fig.1(c) and 1(d). However, in Case-5 ( θ = 1 and φ = 4 ) it was observed that the points belonging to motion-a was correctly segmented (ζ =.99 and non overlapping d i s in Fig.1(d)) even though the magnitudes of θ and φ were the same as in Case-4. These experiment results were consistent with the conditions for segmentation derived in equation (15), where population of d i s of both motions are not overlap in the shaded region of Fig.2(c)-(d). Thus the points belonging to motion-a will be correctly segmented when the magnitudes of θ and φ are in this region. However, when the magnitudes of θ and φ are outside the shaded region in Fig.2(c)-(d), the are no guarantee that points belonging to motion-a will be correctly segmented since there is a chance that the population of d i s of both motions would overlap. In the second part of the experiments, the effect of varying ɛ from 3% to 8% to the conditions for segmentation of Scenario-I and II (the shaded regions) in Fig.2(c) to (e) were examined. The mean and sigma of 1 ζ s (denoted as ζ and σζ) were recorded for each pair of θ s and φ s in the experiments. Both θ and φ in the experiments were varied from to 9 with the increment of 2.5. Fig.2(a) and 2(b) show ζ and σζ versus θ and φ for Scenario-I. It was observed that for small θ and φ (both < 5 ), points from motion-a were mixed with points from motion-b and segmented (ζ > 1). In such cases, an inaccurate inlier-outlier dichotomy would result in an incorrect motion estimation and segmentation. As both φ and θ increased to 9, the magnitudes of ζ s approaching.99 and σζ s reduced to around.2. From Fig.2(a) and 2(b), there are areas when ζ =.99 and σζ <.1 Generally smaller Ĝ means that the points moved by motion-b were closer to [Px, Py] of the image.

9 8 Shafriza Nisha Basah, Reza Hoseinnezhad, and Alireza Bab-Hadiashar Frequency di (a) Case 1, ζ =.98 Frequency di (b) Case 2, ζ =.98 Frequency di (c) Case 3, ζ = Frequency 15 1 Frequency di (d) Case 4, ζ = di (e) Case 5, ζ =.99 Fig.1. Histogram for d i s for all points for Case-1 to 5 in Scenario-I. (when θ between to 12 and φ from 6 to 9 ) indicating correct and consistent segmentation of motion-a. Then the magnitudes of θ s and φ s when ζ.994 and σζ.1 were extracted from Fig.2(a) and 2(b) and compared to the analytical conditions for segmentation as shown in Fig.2(c). The magnitudes of ζ.994 and σζ.1 were selected to make sure that the segmentation of motion-a was correct and consistent for all iterations (1 iterations for each θ and φ) in the experiments 3. The extracted θ s and φ s when ζ.994 and σζ.1 for different inlier ratio ɛ and Scenario-II are shown in Fig.2(c) to 2(f). When the value of ɛ is increased from 3% to 8%, the region where the magnitudes of ζ.994 and σζ.1 are slightly expanded as shown in Fig.2(d) and 2(f). In addition, we observed that when θ > 2 for Scenario-I and θ > 45 for Scenario-II, the points belonging to motiona were also correctly and consistently segmented ( ζ.994 and σζ.1). This is because, when ɛ was higher (more points of motion-a than motion-b) and high values on θ, the density of d i s for points belonging to motion-b were not widely spread. Thus, the likelihood of both populations of d i s to overlap decreased. Hence, expanding the region for correct and consistent segmentation of points belonging to motion-a. The similarity between the experimental and analytical results for the magnitude of θ s and φ s to achieve correct and consistent segmentation ( ζ.994, σζ.1 and both population of d i s do not overlap) in Fig.2(c) to 2(f) verifies the segmentation analysis in Section.2. 3 From probability theory, the standard deviation of a uniformly distributed variables B s is according to Bmax B min 12, where B max and B min are the maximum and minimum values of B s [15]. Thus, if ζ s was uniformly distributed with σζ =.1, the values of ζ s were between ζ ±.17.

10 Conditions for Segmentation of Motion with Affine Fundamental Matrix 9 ζ σζ (a) (b) 8 Analytical result Monte Carlo experiments 8 Analytical result Monte Carlo experiments (c) Scenario-I, ɛ = 3% (d) Scenario-I, ɛ = 8% 8 Analytical result Monte Carlo experiments 8 Analytical result Monte Carlo experiments (e) Scenario-II, ɛ = 3% (f) Scenario-II, ɛ = 8% Fig.2. ζ and σζ versus θ and φ for Scenario-I when ɛ = 3% in (a) and (b). The analytical and the extracted magnitudes of θ s and φ s when motion-a will be correctly and consistently segmented in (c)-(d) for Scenario-I and (e)-(f) for Scenario- II (the boundary of the region where ζ.994 and σζ.1 from Monte Carlo experiments were plotted instead of the shaded region for illustration purposes). 4 Conclusions The conditions for segmentation of motions with affine fundamental matrix were proposed in terms of the difference between rotation angles ( θ) and translational directions ( φ), the location of points belonging to the unwanted motion (Ĝ), the magnitude of the unwanted translation viewed by a particular camera ( K Z ) and the level of noise (σ n ). If this conditions are satisfied, it is guaranteed that the population of distances belonging to multiple affine motions do not overlap, and therefore the target motion can be successfully segmented. The proposed conditions were both studied by theoretical analysis and verified by

11 1 Shafriza Nisha Basah, Reza Hoseinnezhad, and Alireza Bab-Hadiashar Monte Carlo experiments with synthetic images. The performance of these conditions for various inlier ratio was also examined. The magnitudes of θ s and φ s (for particular values of K Z, Ĝ and σ n) for correct and consistent segmentation did not changed significantly when the inlier ratio was varied. However when the inlier ratio was high (ɛ = 8%), the segmentation was also successful when the magnitude of θ was large ( θ > 2 for Scenario-I and θ > 45 for Scenario-II). This is explained by the fact that, less contamination of the unwanted motion and high magnitude of θ reduced the likelihood for both populations of distances to overlap resulting in the successful segmentation of the target object. References 1. Torr, P.H.S., Zisserman, A., Maybank, S.J.: Robust detection of degenerate configurations while estimating the fundamental matrix. Vision Computing and Image Understanding 71 (1998) Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Second edn. Cambridge University Press, Cambridge, UK (23) 3. Schindler, K., Suter, D.: Two-view multibody structure-and-motion with outliers through model selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 28 (26) Torr, P.H.S.: Motion Segmentation and Outlier Detection. Phd thesis, Department of Engineering Science, University of Oxford (1995) 5. Vidal, R., Ma, Y., Soatto, S., Sastry, S.: Two-view multibody structure from motion. International Journal of Computer Vision 68 (26) Basah, S.N., Hoseinnezhad, R., Bab-Hadiashar, A.: Limits of motion-background segmentation using fundamental matrix estimation. DICTA 8 (28) Basah, S.N., Bab-Hadiashar, A., Hoseinnezhad, R.: Conditions for segmentation of 2d translations of 3d objects. Image Analysis and Processing - ICIAP 29. LNCS 5716 (29) Armangu, X., Salvi, J.: Overall view regarding fundamental matrix estimation. Image and Vision Computing 21 (23) Zhang, Z.: Determining the epipolar geometry and its uncertainty: A review. International Journal of Computer Vision 27(2) (1998) Torr, P.H.S., Murray, D.W.: The development and comparison of robust methodsfor estimating the fundamental matrix. International Journal of Computer Vision 24 (1997) Weng, J., Huang, T., Ahuja, N.: Motion and structure from two perspective views: Algorithms, error analysis, and error estimation. IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (1989) Weisstein, E.W.: Harmonic addition theorem. (From MathWorld-A Wolfram Web Resource Bab-Hadiashar, A., Suter, D.: Robust segmentation of visual data using ranked unbiased scale estimate. Robotica 17 (1999) Hoseinnezhad, R., Bab-Hadiashar, A.: Consistency of robust estimators in multistructural visual data segmentation. Pattern Recognition 4 (27) Evans, M., Hastings, N., Peacock, B.: Statistical Distributions. Third edn. Wiley (2)

A Factorization Method for 3D Multi-body Motion Estimation and Segmentation

A Factorization Method for 3D Multi-body Motion Estimation and Segmentation 1 A Factorization Method for 3D Multi-body Motion Estimation and Segmentation René Vidal Department of EECS University of California Berkeley CA 94710 rvidal@eecs.berkeley.edu Stefano Soatto Dept. of Computer

More information

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix ECCV Workshop on Vision and Modeling of Dynamic Scenes, Copenhagen, Denmark, May 2002 Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Dept of EECS, UC Berkeley Berkeley,

More information

The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views

The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views Richard Hartley 1,2 and RenéVidal 2,3 1 Dept. of Systems Engineering 3 Center for Imaging Science Australian National University

More information

Vision par ordinateur

Vision par ordinateur Vision par ordinateur Géométrie épipolaire Frédéric Devernay Avec des transparents de Marc Pollefeys Epipolar geometry π Underlying structure in set of matches for rigid scenes C1 m1 l1 M L2 L1 l T 1 l

More information

A Study of Kruppa s Equation for Camera Self-calibration

A Study of Kruppa s Equation for Camera Self-calibration Proceedings of the International Conference of Machine Vision and Machine Learning Prague, Czech Republic, August 14-15, 2014 Paper No. 57 A Study of Kruppa s Equation for Camera Self-calibration Luh Prapitasari,

More information

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Stefano Soatto Shankar Sastry Department of EECS, UC Berkeley Department of Computer Sciences, UCLA 30 Cory Hall,

More information

Fast RANSAC with Preview Model Parameters Evaluation

Fast RANSAC with Preview Model Parameters Evaluation 1000-9825/2005/16(08)1431 2005 Journal of Software Vol.16, No.8 +, ( ATR, 410073) Fast RANSAC with Preview Model Parameters Evaluation CHEN Fu-Xing +, WANG Run-Sheng (National Key Laboratory of ATR, National

More information

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction Qifa Ke and Takeo Kanade Department of Computer Science, Carnegie Mellon University Email: ke@cmu.edu, tk@cs.cmu.edu Abstract

More information

Mixture Models and EM

Mixture Models and EM Mixture Models and EM Goal: Introduction to probabilistic mixture models and the expectationmaximization (EM) algorithm. Motivation: simultaneous fitting of multiple model instances unsupervised clustering

More information

Lecture : Probabilistic Machine Learning

Lecture : Probabilistic Machine Learning Lecture : Probabilistic Machine Learning Riashat Islam Reasoning and Learning Lab McGill University September 11, 2018 ML : Many Methods with Many Links Modelling Views of Machine Learning Machine Learning

More information

ROBUST MULTIPLE-VIEW GEOMETRY ESTIMATION BASED ON GMM

ROBUST MULTIPLE-VIEW GEOMETRY ESTIMATION BASED ON GMM Computing and Informatics, Vol. 21, 2002, 591 606 ROBUST MULTIPLE-VIEW GEOMETRY ESTIMATION BASED ON GMM Mingxing Hu, Qiang Xing, Baozong Yuan, Xiaofang Tang Institute of Information Science Northern Jiaotong

More information

Robust Motion Segmentation by Spectral Clustering

Robust Motion Segmentation by Spectral Clustering Robust Motion Segmentation by Spectral Clustering Hongbin Wang and Phil F. Culverhouse Centre for Robotics Intelligent Systems University of Plymouth Plymouth, PL4 8AA, UK {hongbin.wang, P.Culverhouse}@plymouth.ac.uk

More information

ROBUST ESTIMATOR FOR MULTIPLE INLIER STRUCTURES

ROBUST ESTIMATOR FOR MULTIPLE INLIER STRUCTURES ROBUST ESTIMATOR FOR MULTIPLE INLIER STRUCTURES Xiang Yang (1) and Peter Meer (2) (1) Dept. of Mechanical and Aerospace Engineering (2) Dept. of Electrical and Computer Engineering Rutgers University,

More information

Learning Gaussian Process Models from Uncertain Data

Learning Gaussian Process Models from Uncertain Data Learning Gaussian Process Models from Uncertain Data Patrick Dallaire, Camille Besse, and Brahim Chaib-draa DAMAS Laboratory, Computer Science & Software Engineering Department, Laval University, Canada

More information

Affine Structure From Motion

Affine Structure From Motion EECS43-Advanced Computer Vision Notes Series 9 Affine Structure From Motion Ying Wu Electrical Engineering & Computer Science Northwestern University Evanston, IL 68 yingwu@ece.northwestern.edu Contents

More information

Segmentation of Subspace Arrangements III Robust GPCA

Segmentation of Subspace Arrangements III Robust GPCA Segmentation of Subspace Arrangements III Robust GPCA Berkeley CS 294-6, Lecture 25 Dec. 3, 2006 Generalized Principal Component Analysis (GPCA): (an overview) x V 1 V 2 (x 3 = 0)or(x 1 = x 2 = 0) {x 1x

More information

High Accuracy Fundamental Matrix Computation and Its Performance Evaluation

High Accuracy Fundamental Matrix Computation and Its Performance Evaluation High Accuracy Fundamental Matrix Computation and Its Performance Evaluation Kenichi Kanatani Department of Computer Science, Okayama University, Okayama 700-8530 Japan kanatani@suri.it.okayama-u.ac.jp

More information

Camera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s =

Camera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s = Camera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s = cotα), and the lens distortion (radial distortion coefficient

More information

Is covariance information useful in estimating vision parameters?

Is covariance information useful in estimating vision parameters? Is covariance information useful in estimating vision parameters? Michael J. Brooks, Wojciech Chojnacki, Darren Gawley and Anton van den Hengel Department of Computer Science, Adelaide University Adelaide,

More information

Introduction to Machine Learning

Introduction to Machine Learning Introduction to Machine Learning Brown University CSCI 1950-F, Spring 2012 Prof. Erik Sudderth Lecture 25: Markov Chain Monte Carlo (MCMC) Course Review and Advanced Topics Many figures courtesy Kevin

More information

Rotational Invariants for Wide-baseline Stereo

Rotational Invariants for Wide-baseline Stereo Rotational Invariants for Wide-baseline Stereo Jiří Matas, Petr Bílek, Ondřej Chum Centre for Machine Perception Czech Technical University, Department of Cybernetics Karlovo namesti 13, Prague, Czech

More information

LECTURE NOTE #3 PROF. ALAN YUILLE

LECTURE NOTE #3 PROF. ALAN YUILLE LECTURE NOTE #3 PROF. ALAN YUILLE 1. Three Topics (1) Precision and Recall Curves. Receiver Operating Characteristic Curves (ROC). What to do if we do not fix the loss function? (2) The Curse of Dimensionality.

More information

Second-Order Polynomial Models for Background Subtraction

Second-Order Polynomial Models for Background Subtraction Second-Order Polynomial Models for Background Subtraction Alessandro Lanza, Federico Tombari, Luigi Di Stefano DEIS, University of Bologna Bologna, Italy {alessandro.lanza, federico.tombari, luigi.distefano

More information

Algorithms for Computing a Planar Homography from Conics in Correspondence

Algorithms for Computing a Planar Homography from Conics in Correspondence Algorithms for Computing a Planar Homography from Conics in Correspondence Juho Kannala, Mikko Salo and Janne Heikkilä Machine Vision Group University of Oulu, Finland {jkannala, msa, jth@ee.oulu.fi} Abstract

More information

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING. Non-linear regression techniques Part - II

ADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING. Non-linear regression techniques Part - II 1 Non-linear regression techniques Part - II Regression Algorithms in this Course Support Vector Machine Relevance Vector Machine Support vector regression Boosting random projections Relevance vector

More information

Determining the Translational Speed of a Camera from Time-Varying Optical Flow

Determining the Translational Speed of a Camera from Time-Varying Optical Flow Determining the Translational Speed of a Camera from Time-Varying Optical Flow Anton van den Hengel, Wojciech Chojnacki, and Michael J. Brooks School of Computer Science, Adelaide University, SA 5005,

More information

Nonrobust and Robust Objective Functions

Nonrobust and Robust Objective Functions Nonrobust and Robust Objective Functions The objective function of the estimators in the input space is built from the sum of squared Mahalanobis distances (residuals) d 2 i = 1 σ 2(y i y io ) C + y i

More information

Object Recognition Using Local Characterisation and Zernike Moments

Object Recognition Using Local Characterisation and Zernike Moments Object Recognition Using Local Characterisation and Zernike Moments A. Choksuriwong, H. Laurent, C. Rosenberger, and C. Maaoui Laboratoire Vision et Robotique - UPRES EA 2078, ENSI de Bourges - Université

More information

A Study of Covariances within Basic and Extended Kalman Filters

A Study of Covariances within Basic and Extended Kalman Filters A Study of Covariances within Basic and Extended Kalman Filters David Wheeler Kyle Ingersoll December 2, 2013 Abstract This paper explores the role of covariance in the context of Kalman filters. The underlying

More information

Scale & Affine Invariant Interest Point Detectors

Scale & Affine Invariant Interest Point Detectors Scale & Affine Invariant Interest Point Detectors KRYSTIAN MIKOLAJCZYK AND CORDELIA SCHMID [2004] Shreyas Saxena Gurkirit Singh 23/11/2012 Introduction We are interested in finding interest points. What

More information

Pose estimation from point and line correspondences

Pose estimation from point and line correspondences Pose estimation from point and line correspondences Giorgio Panin October 17, 008 1 Problem formulation Estimate (in a LSE sense) the pose of an object from N correspondences between known object points

More information

Motion Estimation (I)

Motion Estimation (I) Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion

More information

Confidence Estimation Methods for Neural Networks: A Practical Comparison

Confidence Estimation Methods for Neural Networks: A Practical Comparison , 6-8 000, Confidence Estimation Methods for : A Practical Comparison G. Papadopoulos, P.J. Edwards, A.F. Murray Department of Electronics and Electrical Engineering, University of Edinburgh Abstract.

More information

A Background Layer Model for Object Tracking through Occlusion

A Background Layer Model for Object Tracking through Occlusion A Background Layer Model for Object Tracking through Occlusion Yue Zhou and Hai Tao UC-Santa Cruz Presented by: Mei-Fang Huang CSE252C class, November 6, 2003 Overview Object tracking problems Dynamic

More information

arxiv: v1 [cs.it] 21 Feb 2013

arxiv: v1 [cs.it] 21 Feb 2013 q-ary Compressive Sensing arxiv:30.568v [cs.it] Feb 03 Youssef Mroueh,, Lorenzo Rosasco, CBCL, CSAIL, Massachusetts Institute of Technology LCSL, Istituto Italiano di Tecnologia and IIT@MIT lab, Istituto

More information

Variational Principal Components

Variational Principal Components Variational Principal Components Christopher M. Bishop Microsoft Research 7 J. J. Thomson Avenue, Cambridge, CB3 0FB, U.K. cmbishop@microsoft.com http://research.microsoft.com/ cmbishop In Proceedings

More information

Recovering Unknown Focal Lengths in Self-Calibration: G.N. Newsam D.Q. Huynh M.J. Brooks H.-P. Pan.

Recovering Unknown Focal Lengths in Self-Calibration: G.N. Newsam D.Q. Huynh M.J. Brooks H.-P. Pan. Recovering Unknown Focal Lengths in Self-Calibration: An Essentially Linear Algorithm and Degenerate Congurations G.N. Newsam D.Q. Huynh M.J. Brooks H.-P. Pan fgnewsam,du,mjb,hepingg@cssip.edu.au Centre

More information

Spectral Clustering with Eigenvector Selection

Spectral Clustering with Eigenvector Selection Spectral Clustering with Eigenvector Selection Tao Xiang and Shaogang Gong Department of Computer Science Queen Mary, University of London, London E 4NS, UK {txiang,sgg}@dcs.qmul.ac.uk Abstract The task

More information

CSE 252B: Computer Vision II

CSE 252B: Computer Vision II CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Hamed Masnadi Shirazi, Solmaz Alipour LECTURE 5 Relationships between the Homography and the Essential Matrix 5.1. Introduction In practice,

More information

A Practical Method for Decomposition of the Essential Matrix

A Practical Method for Decomposition of the Essential Matrix Applied Mathematical Sciences, Vol. 8, 2014, no. 176, 8755-8770 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410877 A Practical Method for Decomposition of the Essential Matrix Georgi

More information

2D Image Processing (Extended) Kalman and particle filter

2D Image Processing (Extended) Kalman and particle filter 2D Image Processing (Extended) Kalman and particle filter Prof. Didier Stricker Dr. Gabriele Bleser Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz

More information

Randomized RANSAC with T d,d test

Randomized RANSAC with T d,d test Randomized RANSAC with T d,d test O. Chum 1,J.Matas 1,2 1 Center for Machine Perception, Dept. of Cybernetics, CTU Prague, Karlovo nám 13, CZ 121 35 2 CVSSP, University of Surrey, Guildford GU2 7XH, UK

More information

Bayesian Machine Learning

Bayesian Machine Learning Bayesian Machine Learning Andrew Gordon Wilson ORIE 6741 Lecture 2: Bayesian Basics https://people.orie.cornell.edu/andrew/orie6741 Cornell University August 25, 2016 1 / 17 Canonical Machine Learning

More information

Accelerated Appearance-Only SLAM

Accelerated Appearance-Only SLAM Accelerated Appearance-Only SLAM Mark Cummins and Paul Newman Oxford University Mobile Robotics Research Group. {mjc,pnewman}@robots.ox.ac.uk Abstract This paper describes a probabilistic bail-out condition

More information

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical

More information

Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project

Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project Devin Cornell & Sushruth Sastry May 2015 1 Abstract In this article, we explore

More information

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Corners, Blobs & Descriptors With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Motivation: Build a Panorama M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 How do we build panorama?

More information

Augmented Reality VU numerical optimization algorithms. Prof. Vincent Lepetit

Augmented Reality VU numerical optimization algorithms. Prof. Vincent Lepetit Augmented Reality VU numerical optimization algorithms Prof. Vincent Lepetit P3P: can exploit only 3 correspondences; DLT: difficult to exploit the knowledge of the internal parameters correctly, and the

More information

Large Scale Environment Partitioning in Mobile Robotics Recognition Tasks

Large Scale Environment Partitioning in Mobile Robotics Recognition Tasks Large Scale Environment in Mobile Robotics Recognition Tasks Boyan Bonev, Miguel Cazorla {boyan,miguel}@dccia.ua.es Robot Vision Group Department of Computer Science and Artificial Intelligence University

More information

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics DS-GA 100 Lecture notes 11 Fall 016 Bayesian statistics In the frequentist paradigm we model the data as realizations from a distribution that depends on deterministic parameters. In contrast, in Bayesian

More information

16 : Markov Chain Monte Carlo (MCMC)

16 : Markov Chain Monte Carlo (MCMC) 10-708: Probabilistic Graphical Models 10-708, Spring 2014 16 : Markov Chain Monte Carlo MCMC Lecturer: Matthew Gormley Scribes: Yining Wang, Renato Negrinho 1 Sampling from low-dimensional distributions

More information

Introduction to pinhole cameras

Introduction to pinhole cameras Introduction to pinhole cameras Lesson given by Sébastien Piérard in the course Introduction aux techniques audio et vidéo (ULg, Pr JJ Embrechts) INTELSIG, Montefiore Institute, University of Liège, Belgium

More information

Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms

Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms Tom Bylander Division of Computer Science The University of Texas at San Antonio San Antonio, Texas 7849 bylander@cs.utsa.edu April

More information

Computer Vision Group Prof. Daniel Cremers. 14. Sampling Methods

Computer Vision Group Prof. Daniel Cremers. 14. Sampling Methods Prof. Daniel Cremers 14. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric

More information

Robust Scale Estimation for the Generalized Gaussian Probability Density Function

Robust Scale Estimation for the Generalized Gaussian Probability Density Function Metodološki zvezki, Vol. 3, No. 1, 26, 21-37 Robust Scale Estimation for the Generalized Gaussian Probability Density Function Rozenn Dahyot 1 and Simon Wilson 2 Abstract This article proposes a robust

More information

Introduction to Machine Learning. PCA and Spectral Clustering. Introduction to Machine Learning, Slides: Eran Halperin

Introduction to Machine Learning. PCA and Spectral Clustering. Introduction to Machine Learning, Slides: Eran Halperin 1 Introduction to Machine Learning PCA and Spectral Clustering Introduction to Machine Learning, 2013-14 Slides: Eran Halperin Singular Value Decomposition (SVD) The singular value decomposition (SVD)

More information

SEQUENTIAL SUBSPACE FINDING: A NEW ALGORITHM FOR LEARNING LOW-DIMENSIONAL LINEAR SUBSPACES.

SEQUENTIAL SUBSPACE FINDING: A NEW ALGORITHM FOR LEARNING LOW-DIMENSIONAL LINEAR SUBSPACES. SEQUENTIAL SUBSPACE FINDING: A NEW ALGORITHM FOR LEARNING LOW-DIMENSIONAL LINEAR SUBSPACES Mostafa Sadeghi a, Mohsen Joneidi a, Massoud Babaie-Zadeh a, and Christian Jutten b a Electrical Engineering Department,

More information

Corner. Corners are the intersections of two edges of sufficiently different orientations.

Corner. Corners are the intersections of two edges of sufficiently different orientations. 2D Image Features Two dimensional image features are interesting local structures. They include junctions of different types like Y, T, X, and L. Much of the work on 2D features focuses on junction L,

More information

Statistical Visual-Dynamic Model for Hand-Eye Coordination

Statistical Visual-Dynamic Model for Hand-Eye Coordination The 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems October 18-22, 2010, Taipei, Taiwan Statistical Visual-Dynamic Model for Hand-Eye Coordination Daniel Beale, Pejman Iravani

More information

Robotics. Lecture 4: Probabilistic Robotics. See course website for up to date information.

Robotics. Lecture 4: Probabilistic Robotics. See course website   for up to date information. Robotics Lecture 4: Probabilistic Robotics See course website http://www.doc.ic.ac.uk/~ajd/robotics/ for up to date information. Andrew Davison Department of Computing Imperial College London Review: Sensors

More information

EKF and SLAM. McGill COMP 765 Sept 18 th, 2017

EKF and SLAM. McGill COMP 765 Sept 18 th, 2017 EKF and SLAM McGill COMP 765 Sept 18 th, 2017 Outline News and information Instructions for paper presentations Continue on Kalman filter: EKF and extension to mapping Example of a real mapping system:

More information

Computer Vision Group Prof. Daniel Cremers. 11. Sampling Methods

Computer Vision Group Prof. Daniel Cremers. 11. Sampling Methods Prof. Daniel Cremers 11. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric

More information

OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE

OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE R. Matsuoka a, b a Research and Development Division, Kokusai Kogyo Co., Ltd., -4-1 Harumi-cho, Fuchu, Tokyo

More information

ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES

ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES John Lipor Laura Balzano University of Michigan, Ann Arbor Department of Electrical and Computer Engineering {lipor,girasole}@umich.edu ABSTRACT This paper

More information

Robotics, Geometry and Control - Rigid body motion and geometry

Robotics, Geometry and Control - Rigid body motion and geometry Robotics, Geometry and Control - Rigid body motion and geometry Ravi Banavar 1 1 Systems and Control Engineering IIT Bombay HYCON-EECI Graduate School - Spring 2008 The material for these slides is largely

More information

Solution. Daozheng Chen. Challenge 1

Solution. Daozheng Chen. Challenge 1 Solution Daozheng Chen 1 For all the scatter plots and 2D histogram plots within this solution, the x axis is for the saturation component, and the y axis is the value component. Through out the solution,

More information

Sparse Levenberg-Marquardt algorithm.

Sparse Levenberg-Marquardt algorithm. Sparse Levenberg-Marquardt algorithm. R. I. Hartley and A. Zisserman: Multiple View Geometry in Computer Vision. Cambridge University Press, second edition, 2004. Appendix 6 was used in part. The Levenberg-Marquardt

More information

Extending the Associative Rule Chaining Architecture for Multiple Arity Rules

Extending the Associative Rule Chaining Architecture for Multiple Arity Rules Extending the Associative Rule Chaining Architecture for Multiple Arity Rules Nathan Burles, James Austin, and Simon O Keefe Advanced Computer Architectures Group Department of Computer Science University

More information

CS4495/6495 Introduction to Computer Vision. 3D-L3 Fundamental matrix

CS4495/6495 Introduction to Computer Vision. 3D-L3 Fundamental matrix CS4495/6495 Introduction to Computer Vision 3D-L3 Fundamental matrix Weak calibration Main idea: Estimate epipolar geometry from a (redundant) set of point correspondences between two uncalibrated cameras

More information

On Geometric Error for Homographies

On Geometric Error for Homographies On Geometric Error for Homographies Ondra Chum, Tomás Pajdla, Peter Sturm To cite this version: Ondra Chum, Tomás Pajdla, Peter Sturm. On Geometric Error for Homographies. [Research Report] CTU-CMP-0000-00,

More information

Camera Models and Affine Multiple Views Geometry

Camera Models and Affine Multiple Views Geometry Camera Models and Affine Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in May 29, 2001 1 1 Camera Models A Camera transforms a 3D

More information

Nuclear lifetime measurements from data with independently varying observation

Nuclear lifetime measurements from data with independently varying observation 44 (216) Heavy Ion Accelerator Symposium 215 DOI: 1.151/ epjconf/21612344 Nuclear lifetime measurements from data with independently varying observation times T. J. Gray 1, M. W. Reed 1,a, G. J. Lane 1,

More information

On the Computation of the Ego-Motion and Distance to Obstacles for a Micro Air Vehicle

On the Computation of the Ego-Motion and Distance to Obstacles for a Micro Air Vehicle On the Computation of the Ego-Motion and Distance to Obstacles for a Micro Air Vehicle Ram V. Iyer, hihai He and Phillip R. Chandler Abstract In this paper, we have considered the problem of velocity and

More information

Math 276, Spring 2007 Additional Notes on Vectors

Math 276, Spring 2007 Additional Notes on Vectors Math 276, Spring 2007 Additional Notes on Vectors 1.1. Real Vectors. 1. Scalar Products If x = (x 1,..., x n ) is a vector in R n then the length of x is x = x 2 1 + + x2 n. We sometimes use the notation

More information

Clustering K-means. Clustering images. Machine Learning CSE546 Carlos Guestrin University of Washington. November 4, 2014.

Clustering K-means. Clustering images. Machine Learning CSE546 Carlos Guestrin University of Washington. November 4, 2014. Clustering K-means Machine Learning CSE546 Carlos Guestrin University of Washington November 4, 2014 1 Clustering images Set of Images [Goldberger et al.] 2 1 K-means Randomly initialize k centers µ (0)

More information

Automated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling

Automated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling Automated Segmentation of Low Light Level Imagery using Poisson MAP- MRF Labelling Abstract An automated unsupervised technique, based upon a Bayesian framework, for the segmentation of low light level

More information

SELECTIVE ANGLE MEASUREMENTS FOR A 3D-AOA INSTRUMENTAL VARIABLE TMA ALGORITHM

SELECTIVE ANGLE MEASUREMENTS FOR A 3D-AOA INSTRUMENTAL VARIABLE TMA ALGORITHM SELECTIVE ANGLE MEASUREMENTS FOR A 3D-AOA INSTRUMENTAL VARIABLE TMA ALGORITHM Kutluyıl Doğançay Reza Arablouei School of Engineering, University of South Australia, Mawson Lakes, SA 595, Australia ABSTRACT

More information

Introduction to statistics

Introduction to statistics Introduction to statistics Literature Raj Jain: The Art of Computer Systems Performance Analysis, John Wiley Schickinger, Steger: Diskrete Strukturen Band 2, Springer David Lilja: Measuring Computer Performance:

More information

Results: MCMC Dancers, q=10, n=500

Results: MCMC Dancers, q=10, n=500 Motivation Sampling Methods for Bayesian Inference How to track many INTERACTING targets? A Tutorial Frank Dellaert Results: MCMC Dancers, q=10, n=500 1 Probabilistic Topological Maps Results Real-Time

More information

Reconstruction from projections using Grassmann tensors

Reconstruction from projections using Grassmann tensors Reconstruction from projections using Grassmann tensors Richard I. Hartley 1 and Fred Schaffalitzky 2 1 Australian National University and National ICT Australia, Canberra 2 Australian National University,

More information

Visual Self-Calibration of Pan-Tilt Kinematic Structures

Visual Self-Calibration of Pan-Tilt Kinematic Structures Visual Self-Calibration of Pan-Tilt Kinematic Structures Bartosz Tworek, Alexandre Bernardino and José Santos-Victor Abstract With the increasing miniaturization of robotic devices, some actuators are

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Brown University CSCI 2950-P, Spring 2013 Prof. Erik Sudderth Lecture 13: Learning in Gaussian Graphical Models, Non-Gaussian Inference, Monte Carlo Methods Some figures

More information

Modeling Multiscale Differential Pixel Statistics

Modeling Multiscale Differential Pixel Statistics Modeling Multiscale Differential Pixel Statistics David Odom a and Peyman Milanfar a a Electrical Engineering Department, University of California, Santa Cruz CA. 95064 USA ABSTRACT The statistics of natural

More information

A geometric interpretation of the homogeneous coordinates is given in the following Figure.

A geometric interpretation of the homogeneous coordinates is given in the following Figure. Introduction Homogeneous coordinates are an augmented representation of points and lines in R n spaces, embedding them in R n+1, hence using n + 1 parameters. This representation is useful in dealing with

More information

Robust Monte Carlo Methods for Sequential Planning and Decision Making

Robust Monte Carlo Methods for Sequential Planning and Decision Making Robust Monte Carlo Methods for Sequential Planning and Decision Making Sue Zheng, Jason Pacheco, & John Fisher Sensing, Learning, & Inference Group Computer Science & Artificial Intelligence Laboratory

More information

ε ε

ε ε The 8th International Conference on Computer Vision, July, Vancouver, Canada, Vol., pp. 86{9. Motion Segmentation by Subspace Separation and Model Selection Kenichi Kanatani Department of Information Technology,

More information

DD Advanced Machine Learning

DD Advanced Machine Learning Modelling Carl Henrik {chek}@csc.kth.se Royal Institute of Technology November 4, 2015 Who do I think you are? Mathematically competent linear algebra multivariate calculus Ok programmers Able to extend

More information

Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models

Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models Bayesian Image Segmentation Using MRF s Combined with Hierarchical Prior Models Kohta Aoki 1 and Hiroshi Nagahashi 2 1 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology

More information

(xf, yf) (xn, yn) (x1, y1) (xs, ys)

(xf, yf) (xn, yn) (x1, y1) (xs, ys) Modelling and Testing the Stability of Edge Segments: Length and Orientation Claus Brndgaard Madsen & Henrik Iskov Christensen Aalborg University, Fr. Bajers Vej 7D DK-9220 Aalborg, Denmark E-mail: [cbm,

More information

Empirical Entropy Manipulation and Analysis

Empirical Entropy Manipulation and Analysis 2nd Joint Symposium on Neural Computation Proceedings 203 Empirical Entropy Manipulation and Analysis Paul Viola, Nicol N. Schraudolph, Terrence J. Sejnowski Computational Neurobiology Laboratory The Salk

More information

CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling

CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy

More information

Chapter 2: Force Vectors

Chapter 2: Force Vectors Chapter 2: Force Vectors Chapter Objectives To show how to add forces and resolve them into components using the Parallelogram Law. To express force and position in Cartesian vector form and explain how

More information

Detection of signal transitions by order statistics filtering

Detection of signal transitions by order statistics filtering Detection of signal transitions by order statistics filtering A. Raji Images, Signals and Intelligent Systems Laboratory Paris-Est Creteil University, France Abstract In this article, we present a non

More information

Shape of Gaussians as Feature Descriptors

Shape of Gaussians as Feature Descriptors Shape of Gaussians as Feature Descriptors Liyu Gong, Tianjiang Wang and Fang Liu Intelligent and Distributed Computing Lab, School of Computer Science and Technology Huazhong University of Science and

More information

CSC 576: Variants of Sparse Learning

CSC 576: Variants of Sparse Learning CSC 576: Variants of Sparse Learning Ji Liu Department of Computer Science, University of Rochester October 27, 205 Introduction Our previous note basically suggests using l norm to enforce sparsity in

More information

Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30

Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30 Problem Set 2 MAS 622J/1.126J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain

More information

Visual SLAM Tutorial: Bundle Adjustment

Visual SLAM Tutorial: Bundle Adjustment Visual SLAM Tutorial: Bundle Adjustment Frank Dellaert June 27, 2014 1 Minimizing Re-projection Error in Two Views In a two-view setting, we are interested in finding the most likely camera poses T1 w

More information

Linear Differential Algorithm for Motion Recovery: A Geometric Approach

Linear Differential Algorithm for Motion Recovery: A Geometric Approach International Journal of Computer Vision 361), 71 89 000) c 000 Kluwer Academic Publishers. Manufactured in The Netherlands. Linear Differential Algorithm for Motion Recovery: A Geometric Approach YI MA,

More information

p(d θ ) l(θ ) 1.2 x x x

p(d θ ) l(θ ) 1.2 x x x p(d θ ).2 x 0-7 0.8 x 0-7 0.4 x 0-7 l(θ ) -20-40 -60-80 -00 2 3 4 5 6 7 θ ˆ 2 3 4 5 6 7 θ ˆ 2 3 4 5 6 7 θ θ x FIGURE 3.. The top graph shows several training points in one dimension, known or assumed to

More information

Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint

Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint Yi Ma, Jana Košecká, and Shankar Sastry Electronics Research Laborotory University of California at Berkeley, Berkeley

More information