Triangulation & Direct linear transform

后端 未结 2 868
-上瘾入骨i
-上瘾入骨i 2020-12-31 13:49

Following Hartley/Zisserman\'s Multiview Geometery, Algorithm 12: The optimal triangulation method (p318), I got the corresponding image points xhat1 and xhat2 (step 10). In

相关标签:
2条回答
  • 2020-12-31 14:35

    As is mentioned in the book (sec 12.2), pi T are the rows of P. Therefore, you don't need to transpose P1(k,:) (i.e. the right formulation is A = [xhat1(1) * P1(3,:) - P1(1,:) ; ...).

    I hope that was just a typo.

    Additionally, it is recommended to normalize each row of A with its L2 norm, i.e. for all i

    A(i,:) = A(i,:)/norm(A(i,:));

    And if you want to plot the triangulated 3D points, you have to normalize Xhat before plotting (its meaningless otherwise), i.e.

    Xhat = Xhat/Xhat(4);

    0 讨论(0)
  • 2020-12-31 14:41
    A(1,:) = A(1,:)/norm(A(1,:));
    A(2,:) = A(2,:)/norm(A(2,:));
    A(3,:) = A(3,:)/norm(A(3,:));
    A(4,:) = A(4,:)/norm(A(4,:));
    

    Could be simplified as A = normr(A).

    0 讨论(0)
提交回复
热议问题