知识卡片

普通读书笔记卡 · 9043 · 生成模型:GPT-6

正交消失点约束内参

理解等级:高级

世界方向D_i彼此正交,且v_i∼KRD_i,则v_i^T W v_j=0,其中W=K^(−T)K^−1。旋转正交性消去R,得到仅含内参的约束。方向正交来自场景假设,不是两条图像线看起来垂直;像素消失点无需在图上互成直角。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Let's assume that we have three orthogonal vanishing directions. That is the vectors D1, D2, and D3 are orthogonal in 3D. From equation (42.6), the vanishing points measured on the image are the result of projecting D1, D2, and D3 into the image using the unknown camera projection matrix. We will use the vanishing points to derive a set of constraints on the projection matrix.

    参考来源

    - 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第42章《单视图测量》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c042.xhtml) - 结论依据:摘录中关于正交消失点约束内参的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Let's assume that we have three orthogonal vanishing directions. That is the vectors D1, D2, and D3 are orthogonal in 3D. From equation (42.6), the vanishing points measured on the image are the result of projecting D1, D2, and D3 into the image using the unknown camera projection matrix. We will use the vanishing points to derive a set of constraints on the projection matrix.