Patents by Inventor Maxim Novikov

Maxim Novikov has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10582089
    Abstract: A method of image data interpolation. The method includes obtaining transform data associated with a plurality of sampling points, each sampling point located on a boundary of a region. The transform data is processed to generate additional transform data associated with an additional sampling point located on a boundary of a subregion of the region. An interpolation process is performed. The interpolation process includes processing image data associated with a point within the subregion with the additional transform data, thereby generating interpolated image data representative of an interpolated data value at the point. This patent application further relates to a method including obtaining transform data associated with points corresponding to a surface of a region and generating additional transform data associated with at least one interior point of the region. Image data associated with a further interior point of the region is interpolated using at least the additional transform data.
    Type: Grant
    Filed: November 15, 2018
    Date of Patent: March 3, 2020
    Assignee: Apical Limited
    Inventors: Maxim Novikov, Viacheslav Chesnokov, Gennady Manokhin
  • Publication number: 20190334978
    Abstract: A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.
    Type: Application
    Filed: July 4, 2019
    Publication date: October 31, 2019
    Inventors: Da Wan, Jianjun Shen, Maxim Novikov, Donghai Han, Hua Wang
  • Patent number: 10382529
    Abstract: A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.
    Type: Grant
    Filed: January 29, 2016
    Date of Patent: August 13, 2019
    Assignee: NICIRA, INC.
    Inventors: Da Wan, Jianjun Shen, Maxim Novikov, Donghai Han, Hua Wang
  • Publication number: 20190191068
    Abstract: A method of determining an exposure ratio for use with a multi-exposure image capture system operable to capture a first image of a scene with a first exposure and a second image of the scene with a second exposure shorter than the first exposure. The exposure ratio is a ratio of the first exposure to the second exposure. The method comprises obtaining image data representative of an image captured using an image sensor of the image capture system and setting the exposure ratio in dependence on a distribution of counts relating to values of a characteristic of respective pixels of the image and a weighting function which varies with the values of the characteristic.
    Type: Application
    Filed: December 19, 2018
    Publication date: June 20, 2019
    Inventors: Maxim NOVIKOV, Alexey KORNIENKO, Alexis Leonardo LLUIS GOMEZ
  • Publication number: 20190149697
    Abstract: A method of image data interpolation. The method includes obtaining transform data associated with a plurality of sampling points, each sampling point located on a boundary of a region. The transform data is processed to generate additional transform data associated with an additional sampling point located on a boundary of a subregion of the region. An interpolation process is performed. The interpolation process includes processing image data associated with a point within the subregion with the additional transform data, thereby generating interpolated image data representative of an interpolated data value at the point. This patent application further relates to a method including obtaining transform data associated with points corresponding to a surface of a region and generating additional transform data associated with at least one interior point of the region. Image data associated with a further interior point of the region is interpolated using at least the additional transform data.
    Type: Application
    Filed: November 15, 2018
    Publication date: May 16, 2019
    Inventors: Maxim NOVIKOV, Viacheslav CHESNOKOV, Gennady MANOKHIN
  • Publication number: 20170220697
    Abstract: A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.
    Type: Application
    Filed: January 29, 2016
    Publication date: August 3, 2017
    Inventors: Da Wan, Jianjun Shen, Maxim Novikov, Donghai Han, Hua Wang