Patents by Inventor Jeffrey Mark Siskind

Jeffrey Mark Siskind 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: 11409526
    Abstract: A system and method which allows the basic checkpoint-reverse-mode AD strategy (of recursively decomposing the computation to reduce storage requirements of reverse-mode AD) to be applied to arbitrary programs: not just programs consisting of loops, but programs with arbitrarily complex control flow. The method comprises (a) transforming the program into a formalism that allows convenient manipulation by formal tools, and (b) introducing a set of operators to allow computations to be decomposed by running them for a given period of time then pausing them, while treating the paused program as a value subject to manipulation.
    Type: Grant
    Filed: September 13, 2017
    Date of Patent: August 9, 2022
    Assignee: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Publication number: 20220207272
    Abstract: A system and method for determining the locations and types of objects in a plurality of videos. The method comprises pairing each video with one or more sentences describing the activity or activities in which those objects participate in the associated video, wherein no use is made of a pretrained object detector. The object locations are specified as rectangles, the object types are specified as nouns, and sentences describe the relative positions and motions of the objects in the videos referred to by the nouns in the sentences. The relative positions and motions of the objects in the video are described by a conjunction of predicates constructed to represent the activity described by the sentences associated with the videos.
    Type: Application
    Filed: December 29, 2020
    Publication date: June 30, 2022
    Applicant: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Haonan Yu
  • Publication number: 20190235868
    Abstract: A system and method which allows the basic checkpoint-reverse-mode AD strategy (of recursively decomposing the computation to reduce storage requirements of reverse-mode AD) to be applied to arbitrary programs: not just programs consisting of loops, but programs with arbitrarily complex control flow. The method comprises (a) transforming the program into a formalism that allows convenient manipulation by formal tools, and (b) introducing a set of operators to allow computations to be decomposed by running them for a given period of time then pausing them, while treating the paused program as a value subject to manipulation.
    Type: Application
    Filed: September 13, 2017
    Publication date: August 1, 2019
    Applicant: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Publication number: 20190220668
    Abstract: A system and method for determining the locations and types of objects in a plurality of videos. The method comprises pairing each video with one or more sentences describing the activity or activities in which those objects participate in the associated video, wherein no use is made of a pretrained object detector. The object locations are specified as rectangles, the object types are specified as nouns, and sentences describe the relative positions and motions of the objects in the videos referred to by the nouns in the sentences. The relative positions and motions of the objects in the video are described by a conjunction of predicates constructed to represent the activity described by the sentences associated with the videos.
    Type: Application
    Filed: June 6, 2017
    Publication date: July 18, 2019
    Applicant: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Haonan Yu
  • Publication number: 20190179316
    Abstract: A system for directing the motion of a vehicle, comprising receiving commands in natural language using a processor, the commands specifying a relative path to be taken by the vehicle with respect to other objects in the environment; and determining an absolute path for the vehicle to follow based on the relative path using the processor, the absolute path comprising a series of coordinates in the environment; and directing the vehicle along the absolute path. Also provided is a system for training a lexicon of a natural language processing system, comprising receiving a data set containing a corpus of absolute paths driven by a vehicle annotated with natural language descriptions of the absolute paths using a processor, and determining parameters of the lexicon based on the data set.
    Type: Application
    Filed: August 25, 2017
    Publication date: June 13, 2019
    Applicant: Purdue Research Foundation
    Inventors: Jeffrey Mark SISKIND, Haonan Yu, Scott Alan BRONIKOWSKI, Daniel Paul BARRETT
  • Patent number: 9183466
    Abstract: A method of testing a video against an aggregate query includes automatically receiving an aggregate query defining participant(s) and condition(s) on the participant(s). Candidate object(s) are detected in the frames of the video. A first lattice is constructed for each participant, the first-lattice nodes corresponding to the candidate object(s). A second lattice is constructed for each condition. An aggregate lattice is constructed using the respective first lattice(s) and the respective second lattice(s). Each aggregate-lattice node includes a scoring factor combining a first-lattice node factor and a second-lattice node factor. respective aggregate score(s) are determined of one or more path(s) through the aggregate lattice, each path including a respective plurality of the nodes in the aggregate lattice, to determine whether the video corresponds to the aggregate query.
    Type: Grant
    Filed: December 6, 2013
    Date of Patent: November 10, 2015
    Assignee: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Andrei Barbu, Siddharth Narayanaswamy, Haonan Yu
  • Publication number: 20140369596
    Abstract: A method of testing a video against an aggregate query includes automatically receiving an aggregate query defining participant(s) and condition(s) on the participant(s). Candidate object(s) are detected in the frames of the video. A first lattice is constructed for each participant, the first-lattice nodes corresponding to the candidate object(s). A second lattice is constructed for each condition. An aggregate lattice is constructed using the respective first lattice(s) and the respective second lattice(s). Each aggregate-lattice node includes a scoring factor combining a first-lattice node factor and a second-lattice node factor. respective aggregate score(s) are determined of one or more path(s) through the aggregate lattice, each path including a respective plurality of the nodes in the aggregate lattice, to determine whether the video corresponds to the aggregate query.
    Type: Application
    Filed: December 6, 2013
    Publication date: December 18, 2014
    Applicant: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Andrei Barbu, Siddharth Narayanaswamy, Haonan Yu
  • Patent number: 8739137
    Abstract: The disclosed system provides a transformation-based implementation of forward-mode and reverse-mode automatic differentiation as a built-in, first-class function in a functional programming language. Each of these constructs imposes only a small constant factor of the computational burden (time) of the function itself, and the forward construct has the same properties in terms of space. The functions can be applied to any function, including those involving derivatives and nested closures.
    Type: Grant
    Filed: October 19, 2007
    Date of Patent: May 27, 2014
    Assignee: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Patent number: 8281299
    Abstract: The disclosed system provides a functional programming construct that allows convenient modular run-time nonstandard interpretation via reflection on closure environments. This construct encompasses both the ability to examine the contents of a closure environment and to construct a new closure with a modified environment. Examples of this powerful and useful construct support such tasks as tracing, security logging, sandboxing, error checking, profiling, code instrumentation and metering, run-time code patching, and resource monitoring. It is a non-referentially-transparent mechanism that reifies the closure environments that are only implicit in higher-order programs. A further example provides a novel functional-programming language that supports forward automatic differentiation (AD).
    Type: Grant
    Filed: November 13, 2007
    Date of Patent: October 2, 2012
    Assignee: Purdue Research Foundation
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Publication number: 20090077543
    Abstract: The disclosed system provides a transformation-based implementation of forward-mode and reverse-mode automatic differentiation as a built-in, first-class function in a functional programming language. Each of these constructs imposes only a small constant factor of the computational burden (time) of the function itself, and the forward construct has the same properties in terms of space. The functions can be applied to any function, including those involving derivatives and nested closures.
    Type: Application
    Filed: October 19, 2007
    Publication date: March 19, 2009
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Publication number: 20080163188
    Abstract: The disclosed system provides a functional programming construct that allows convenient modular run-time nonstandard interpretation via reflection on closure environments. This construct encompasses both the ability to examine the contents of a closure environment and to construct a new closure with a modified environment. Examples of this powerful and useful construct support such tasks as tracing, security logging, sandboxing, error checking, profiling, code instrumentation and metering, run-time code patching, and resource monitoring. It is a non-referentially-transparent mechanism that reifies the closure environments that are only implicit in higher-order programs. A further example provides a novel functional-programming language that supports forward automatic differentiation (AD).
    Type: Application
    Filed: November 13, 2007
    Publication date: July 3, 2008
    Inventors: Jeffrey Mark Siskind, Barak Avrum Pearlmutter
  • Patent number: 6941290
    Abstract: A method for computing all occurrences of a compound event from occurrences of primitive events where the compound event is a defined combination of the primitive events. The method includes the steps of: (a) defining primitive event types; (b) defining combinations of the primitive event types as a compound event type; (c) inputting the primitive event occurrences, such occurrences being specified as the set of temporal intervals over which a given primitive event type is true; and (d) computing the compound event occurrences, such occurrences being specified as the set of temporal intervals over which the compound event type is true, where the sets of temporal intervals in steps (c) and (d) are specified as smaller sets of spanning intervals, each spanning interval representing a set of intervals.
    Type: Grant
    Filed: July 30, 2001
    Date of Patent: September 6, 2005
    Assignee: NEC Laboratories America, Inc.
    Inventor: Jeffrey Mark Siskind
  • Patent number: 6693630
    Abstract: A method for determining the stability of a two dimensional polygonal scene. Each polygon in the scene includes data representing a set L of line segments comprised of individual line segments l. The method determines whether the line segments are stable under an interpretation I. I is a quintuple (g, ⇄i, ⇄j, ⇄&thgr;, ) and g is a property of line segments while ⇄i, ⇄j, ⇄&thgr;, and are relations between pairs of line segments.
    Type: Grant
    Filed: July 11, 2000
    Date of Patent: February 17, 2004
    Assignee: NEC Laboratories America, Inc.
    Inventor: Jeffrey Mark Siskind
  • Publication number: 20020138458
    Abstract: A method for computing all occurrences of a compound event from occurrences of primitive events where the compound event is a defined combination of the primitive events. The method includes the steps of: (a) defining primitive event types; (b) defining combinations of the primitive event types as a compound event type; (c) inputting the primitive event occurrences, such occurrences being specified as the set of temporal intervals over which a given primitive event type is true; and (d) computing the compound event occurrences, such occurrences being specified as the set of temporal intervals over which the compound event type is true, where the sets of temporal intervals in steps (c) and (d) are specified as smaller sets of spanning intervals, each spanning interval representing a set of intervals.
    Type: Application
    Filed: July 30, 2001
    Publication date: September 26, 2002
    Applicant: NEC Research Institute, Inc.
    Inventor: Jeffrey Mark Siskind