SYSTEMS AND METHODS FOR OBJECT DETECTION
    21.
    发明申请
    SYSTEMS AND METHODS FOR OBJECT DETECTION 有权
    用于物体检测的系统和方法

    公开(公告)号:US20160148071A1

    公开(公告)日:2016-05-26

    申请号:US14551942

    申请日:2014-11-24

    CPC classification number: G06K9/4647 G06K9/4652 G06K9/6212

    Abstract: An object detection system and a method of detecting an object in an image are disclosed. In an embodiment, a method for detecting the object includes computing one or more feature planes of one or more types for each image pixel of the image. A plurality of cells is defined in the image, where each cell includes first through nth number of pixels, and starting locations of each cell in the image in horizontal and vertical directions are integral multiples of predefined horizontal and vertical step sizes, respectively. One or more feature plane summations of one or more types are computed for each cell. A feature vector is determined for an image portion of the image based on a set of feature plane summations, and the feature vector is compared with a corresponding object classifier to detect a presence of the corresponding object in the image portion of the image.

    Abstract translation: 公开了一种物体检测系统和检测图像中物体的方法。 在一个实施例中,用于检测对象的方法包括为图像的每个图像像素计算一个或多个类型的一个或多个特征面。 在图像中定义多个单元,其中每个单元包括第一至第n个像素数,并且图像中每个单元在水平和垂直方向上的起始位置分别是预定水平和垂直步长的整数倍。 为每个单元计算一个或多个类型的一个或多个特征平面求和。 基于特征平面求和的集合来确定图像的图像部分的特征向量,并且将特征向量与对应的对象分类器进行比较,以检测图像的图像部分中相应对象的存在。

    ALIASED MODE FOR CACHE CONTROLLER
    22.
    发明申请

    公开(公告)号:US20250021481A1

    公开(公告)日:2025-01-16

    申请号:US18797945

    申请日:2024-08-08

    Abstract: An apparatus includes first CPU and second CPU cores, a L1 cache subsystem coupled to the first CPU core and comprising a L1 controller, and a L2 cache subsystem coupled to the L1 cache subsystem and to the second CPU core. The L2 cache subsystem includes a L2 memory and a L2 controller configured to operate in an aliased mode in response to a value in a memory map control register being asserted. In the aliased mode, the L2 controller receives a first request from the first CPU core directed to a virtual address in the L2 memory, receives a second request from the second CPU core directed to the virtual address in the L2 memory, directs the first request to a physical address A in the L2 memory, and directs the second request to a physical address B in the L2 memory.

    Feature point identification in sparse optical flow based tracking in a computer vision system

    公开(公告)号:US11915431B2

    公开(公告)日:2024-02-27

    申请号:US16532658

    申请日:2019-08-06

    Abstract: A method for sparse optical flow based tracking in a computer vision system is provided that includes detecting feature points in a frame captured by a monocular camera in the computer vision system to generate a plurality of detected feature points, generating a binary image indicating locations of the detected feature points with a bit value of one, wherein all other locations in the binary image have a bit value of zero, generating another binary image indicating neighborhoods of currently tracked points, wherein locations of the neighborhoods in the binary image have a bit value of zero and all other locations in the binary image have a bit value of one, and performing a binary AND of the two binary images to generate another binary image, wherein locations in the binary image having a bit value of one indicate new feature points detected in the frame.

    DYNAMIC QUANTIZATION FOR DEEP NEURAL NETWORK INFERENCE SYSTEM AND METHOD

    公开(公告)号:US20210150248A1

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

    申请号:US17128365

    申请日:2020-12-21

    Abstract: A method for dynamically quantizing feature maps of a received image. The method includes convolving an image based on a predicted maximum value, a predicted minimum value, trained kernel weights and the image data. The input data is quantized based on the predicted minimum value and predicted maximum value. The output of the convolution is computed into an accumulator and re-quantized. The re-quantized value is output to an external memory. The predicted min value and the predicted max value are computed based on the previous max values and min values with a weighted average or a pre-determined formula. Initial min value and max value are computed based on known quantization methods and utilized for initializing the predicted min value and predicted max value in the quantization process.

    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.

    EFFICIENT SIMD IMPLEMENTATION OF 3X3 NON MAXIMA SUPPRESSION OF SPARSE 2D IMAGE FEATURE POINTS

    公开(公告)号:US20190005349A1

    公开(公告)日:2019-01-03

    申请号:US15989551

    申请日:2018-05-25

    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 feature point selection
    30.
    发明授权

    公开(公告)号:US09747515B2

    公开(公告)日:2017-08-29

    申请号:US14794916

    申请日:2015-07-09

    Abstract: Systems and methods are provided for selecting feature points within an image. A plurality of candidate feature points are identified in the image. A plurality of feature points are selected for each of the plurality of candidate feature points, a plurality of sets of representative pixels. For each set of representative pixels, a representative value is determined as one of a maximum chromaticity value and a minimum chromaticity value from the set of representative pixels. A score is determined for each candidate feature point from the representative values for the plurality of sets of representative pixels associated with the candidate feature point. The feature points are selected according to the determined scores for the plurality of candidate feature points.

Patent Agency Ranking