Efficient SIMD implementation of 3X3 non maxima suppression of sparse 2D image feature points

    公开(公告)号:US10521688B2

    公开(公告)日:2019-12-31

    申请号:US15989551

    申请日:2018-05-25

    Abstract: This invention transforms a list of feature points in raster scan order into a list of maxima suppressed feature points. A working buffer has two more entries than the width of the original image. Each entry is assigned to an x coordinate of the original image. Each entry stores a combined y coordinate and reliability score for each feature point in the original list. This process involves a forward scan and a backward scan. For each original feature point its x coordinate defines the location within the working buffer where neighbor feature points would be stored if they exist. The working buffer initial data and the y coordinates assure a non-suppress comparison result if the potential neighbors are not actual neighbors. For actual neighbor data, the y coordinates match and the comparison result depends solely upon the relative reliability scores.

    Efficient SIMD implementation of 3x3 non maxima suppression of sparse 2D image feature points

    公开(公告)号:US11010631B2

    公开(公告)日:2021-05-18

    申请号:US16730622

    申请日:2019-12-30

    Abstract: In accordance with disclosed embodiments, an image processing method includes performing a first scan in a first direction on a first list of pixels in which, for each pixel in the first list, a feature point property is compared with a corresponding feature point property of each of a first set of neighboring pixels, performing a second scan in a second direction on the first list of pixels in which, for each pixel in the first list, a feature point property is compared with a corresponding feature point property of each of a second set of neighboring pixels, using the results of the first and second scans to identify pixels from the first list to be suppressed, and forming a second list of pixels that includes pixels from the first list that are not identified as pixels to be suppressed. The second list represents a non-maxima suppressed list.

    SYSTEM AND METHOD TO EXTRACT UNIQUE ELEMENTS FROM SORTED LIST
    3.
    发明申请
    SYSTEM AND METHOD TO EXTRACT UNIQUE ELEMENTS FROM SORTED LIST 有权
    从分类列表中提取特征元素的系统和方法

    公开(公告)号:US20160253365A1

    公开(公告)日:2016-09-01

    申请号:US14632822

    申请日:2015-02-26

    CPC classification number: G06F17/30988

    Abstract: A device includes an input array register, a determining component and a computing component. The input array register stores a sorted list of n elements as an input array having size n, n being an integer greater than or equal to two. The determining component creates a list of m elements as a mask array having a size m, m being an integer greater than or equal to one, one of the m elements being based on two adjacent of the n elements of the input array. The computing component performs a mathematical operation between the input array and the mask array to generate a list of p elements as an output array having a size p, p being an integer greater than or equal to 0, the p elements identifying unique elements within the n elements.

    Abstract translation: 一种设备包括输入阵列寄存器,确定组件和计算组件。 输入阵列寄存器存储n个元素的排序列表作为大小为n的输入阵列,n是大于或等于2的整数。 确定组件创建m个元素的列表作为具有尺寸m,m是大于或等于1的整数的掩模阵列,m个元素中的一个基于输入阵列的n个元素中的两个相邻。 计算组件在输入阵列和掩模阵列之间执行数学运算,以产生p个元素的列表作为具有大小p,p为大于或等于0的整数的输出阵列,p元素标识该元素内的唯一元素 n元素。

    System and method to extract unique elements from sorted list

    公开(公告)号:US09811607B2

    公开(公告)日:2017-11-07

    申请号:US14632822

    申请日:2015-02-26

    CPC classification number: G06F17/30988

    Abstract: A device includes an input array register, a determining component and a computing component. The input array register stores a sorted list of n elements as an input array having size n, n being an integer greater than or equal to two. The determining component creates a list of m elements as a mask array having a size m, m being an integer greater than or equal to one, one of the m elements being based on two adjacent of the n elements of the input array. The computing component performs a mathematical operation between the input array and the mask array to generate a list of p elements as an output array having a size p, p being an integer greater than or equal to 0, the p elements identifying unique elements within the n elements.

    Efficient SIMD implementation of 3x3 non maxima suppression of sparse 2D image feature points

    公开(公告)号:US09984305B2

    公开(公告)日:2018-05-29

    申请号:US15203973

    申请日:2016-07-07

    CPC classification number: G06K9/4609 G06K9/00986 G06K9/4671 G06K9/6202

    Abstract: This invention transforms a list of feature points in raster scan order into a list of maxima suppressed feature points. A working buffer has two more entries than the width of the original image. Each entry is assigned to an x coordinate of the original image. Each entry stores a combined y coordinate and reliability score for each feature point in the original list. This process involves a forward scan and a backward scan. For each original feature point its x coordinate defines the location within the working buffer where neighbor feature points would be stored if they exist. The working buffer initial data and the y coordinates assure a non suppress comparison result if the potential neighbors are not actual neighbors. For actual neighbor data, the y coordinates match and the comparison result depends solely upon the relative reliability scores.

    Efficient SIMD Implementation of 3x3 Non Maxima Suppression of sparse 2D image feature points

    公开(公告)号:US20170300773A1

    公开(公告)日:2017-10-19

    申请号:US15203973

    申请日:2016-07-07

    CPC classification number: G06K9/4609 G06K9/00986 G06K9/4671 G06K9/6202

    Abstract: This invention transforms a list of feature points in raster scan order into a list of maxima suppressed feature points. A working buffer has two more entries than the width of the original image. Each entry is assigned to an x coordinate of the original image. Each entry stores a combined y coordinate and reliability score for each feature point in the original list. This process involves a forward scan and a backward scan. For each original feature point its x coordinate defines the location within the working buffer where neighbor feature points would be stored if they exist. The working buffer initial data and the y coordinates assure a non suppress comparison result if the potential neighbors are not actual neighbors. For actual neighbor data, the y coordinates match and the comparison result depends solely upon the relative reliability scores.

Patent Agency Ranking