APPARATUS AND METHOD FOR QUADTREE BASED VARIABLE BLOCK SIZE MOTION ESTIMATION
    1.
    发明申请
    APPARATUS AND METHOD FOR QUADTREE BASED VARIABLE BLOCK SIZE MOTION ESTIMATION 审中-公开
    基于QUADTREE的可变块大小运动估计的装置和方法

    公开(公告)号:WO1997017797A2

    公开(公告)日:1997-05-15

    申请号:PCT/US1996016956

    申请日:1996-10-23

    Abstract: A method and apparatus for determining an optimal quadtree structure for quadtree-based variable block size (VBS) motion estimation. The method computes the motion vectors for the entire quadtree from the largest block-size to the smallest block-size. Next, the method may optionally select an optimal quantizer scale for each block. The method then compares from "bottom-up" the sum of the distortion from encoding all sub-blocks or sub-nodes (children) as compared to the distortion from encoding the block or node (parent) from which the subnodes are partitioned from. If the sum of the distortion from encoding the children is greater than that of the parent then the node is "merged". Conversely, if the sum of the distortion from encoding the children is less than that of the parent then the node is "split" and the Lagrangian cost of the parent node is set as the sum of the Lagrangian cost of its children. This step is repeated for the all nodes through every level until an optimal quadtree structure is obtained.

    Abstract translation: 一种用于确定用于基于四叉树的可变块大小(VBS)运动估计的最佳四叉树结构的方法和装置。 该方法从最大块大小到最小块大小计算整个四叉树的运动矢量。 接下来,该方法可以可选地为每个块选择最佳量化器标度。 然后,该方法从与所编码的所有子块或子节点(子节点)中的失真和的总和相比,从编码从子节点被分割的块或节点(父节点)的失真相比较“自下而上”。 如果来自编码孩子的失真的总和大于父节点的失真总和,则该节点被“合并”。 相反,如果来自编码孩子的失真的总和小于父母的失真之和,则节点“分裂”,并且父节点的拉格朗日代价被设置为其孩子的拉格朗日代价的总和。 通过每个级别对所有节点重复此步骤,直到获得最佳四叉树结构。

Patent Agency Ranking