IMAGE PROCESSING INCLUDING ADJOIN FEATURE BASED OBJECT DETECTION, AND/OR BILATERAL SYMMETRIC OBJECT SEGMENTATION
    51.
    发明申请
    IMAGE PROCESSING INCLUDING ADJOIN FEATURE BASED OBJECT DETECTION, AND/OR BILATERAL SYMMETRIC OBJECT SEGMENTATION 审中-公开
    包括基于特征的物体检测和/或双边对称对象分类的图像处理

    公开(公告)号:WO2014198055A1

    公开(公告)日:2014-12-18

    申请号:PCT/CN2013/077228

    申请日:2013-06-14

    CPC classification number: G06K9/6211 G06K9/68

    Abstract: Apparatuses, methods and storage medium associated with processing an image are disclosed herein. In embodiments, a method for processing one or more images may include generating a plurality of pairs of keypoint features for a pair of images. Each pair of keypoint features may include a keypoint feature from each image. Further, for each pair of keypoint features, corresponding adjoin features may be generated. Additionally, for each pair of keypoint features, whether the adjoin features are similar may be determined. Whether the pair of images have at least one similar object may also be determined, based at least in part on a result of the determination of similarity between the corresponding adjoin features. Other embodiments may be described and claimed.

    Abstract translation: 本文公开了与处理图像相关联的装置,方法和存储介质。 在实施例中,用于处理一个或多个图像的方法可以包括为一对图像生成多对关键点特征。 每对关键点特征可以包括来自每个图像的关键点特征。 此外,对于每对关键点特征,可以生成相应的邻接特征。 此外,对于每对关键点特征,可以确定邻接特征是否相似。 至少部分地基于相应邻接特征之间的相似性的确定结果,也可以确定该对图像是否具有至少一个相似对象。 可以描述和要求保护其他实施例。

    TECHNIQUES FOR VISUAL INSPECTION OF RENDERED GRAPHS FOR IDENTIFICATION AND ANALYSIS OF SELECTED PLOTS

    公开(公告)号:WO2019068215A1

    公开(公告)日:2019-04-11

    申请号:PCT/CN2017/105248

    申请日:2017-10-03

    CPC classification number: G06T11/206 G06T2200/24

    Abstract: Techniques are disclosed for analyzing a graph image in a disconnected mode, e.g., when a graph is rendered as. jpeg,. gif,. png, and so on, and identifying a portion of the graph image associated with a plot/curve of interest. The identified portion of the graph image may then be utilized to generate an adjusted image. The adjusted image may therefore dynamically increase visibility of the plot/curve of interest relative to other plots/curves, and thus the present disclosures provides additional graph functionalities without access to the data originally used to generate the graph. The disconnected graph functionalities disclosed herein may be implemented within an Internet browser or other "app" that may present images depicting graphs to a user.

    METHODS, SYSTEMS AND APPARATUS TO IMPROVE DEEP LEARNING RESOURCE EFFICIENCY

    公开(公告)号:WO2018170815A1

    公开(公告)日:2018-09-27

    申请号:PCT/CN2017/077815

    申请日:2017-03-23

    Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to improve deep learning resource efficiency. An example apparatus includes a graph monitor to select a candidate operation node in response to receiving an operation graph, the operation graph including one or more other operation nodes, a node rule evaluator to evaluate the candidate operation node based on an operating principle, the operating principle to determine an output storage destination of the candidate operation node based on a topology of the operation graph, and a tag engine to tag the candidate operation node with a memory tag value based on the determined output storage destination.

    METHODS AND APPARATUS FOR ENHANCING A BINARY WEIGHT NEURAL NETWORK USING A DEPENDENCY TREE

    公开(公告)号:WO2018217863A1

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

    申请号:PCT/US2018/034088

    申请日:2018-05-23

    Abstract: Methods and apparatus are disclosed for enhancing a binary weight neural network using a dependency tree. A method of enhancing a convolutional neural network (CNN) having binary weights includes constructing a tree for obtained binary tensors, the tree having a plurality of nodes beginning with a root node in each layer of the CNN. A convolution is calculated of an input feature map with an input binary tensor at the root node of the tree. A next node is searched from the root node of the tree and a convolution is calculated at the next node using a previous convolution result calculated at the root node of the tree. The searching of a next node from root node is repeated for all nodes from the root node of the tree, and a convolution is calculated at each next node using a previous convolution result.

Patent Agency Ranking