Patents Assigned to 21 CT, Inc.
  • Patent number: 8929645
    Abstract: A stochastic method and system for fast stereoscopic ranging includes selecting a pair of images for stereo processing, in which the pair of images are a frame pair and one of the image is a reference frame, seeding estimated values for a range metric at each pixel of the reference frame, initializing one or more search stage constraints, stochastically computing local influence for each valid pixel in the reference frame, aggregating local influences for each valid pixel in the reference frame, refining the estimated values for the range metric at each valid pixel in the reference frame based on the aggregated local influence, and post-processing range metric data. A valid pixel is a pixel in the reference frame that has a corresponding pixel in the other frame of the frame pair. The method repeats n iterations of the stochastically computing through the post-processing.
    Type: Grant
    Filed: January 11, 2013
    Date of Patent: January 6, 2015
    Assignee: 21 CT, Inc.
    Inventor: Thayne R. Coffman
  • Publication number: 20140198976
    Abstract: A stochastic method and system for fast stereoscopic ranging includes selecting a pair of images for stereo processing, in which the pair of images are a frame pair and one of the image is a reference frame, seeding estimated values for a range metric at each pixel of the reference frame, initializing one or more search stage constraints, stochastically computing local influence for each valid pixel in the reference frame, aggregating local influences for each valid pixel in the reference frame, refining the estimated values for the range metric at each valid pixel in the reference frame based on the aggregated local influence, and post-processing range metric data. A valid pixel is a pixel in the reference frame that has a corresponding pixel in the other frame of the frame pair. The method repeats n iterations of the stochastically computing through the post-processing.
    Type: Application
    Filed: January 11, 2013
    Publication date: July 17, 2014
    Applicant: 21 CT, INC.
    Inventor: Thayne R. COFFMAN
  • Patent number: 8611591
    Abstract: Described herein are tracking algorithm modifications to handle occlusions when processing a video stream including multiple image frames. Specifically, system and methods for handling both partial and full occlusions while tracking moving and non-moving targets are described. The occlusion handling embodiments described herein may be appropriate for a visual tracking system with supplementary range information.
    Type: Grant
    Filed: December 19, 2008
    Date of Patent: December 17, 2013
    Assignee: 21 CT, Inc.
    Inventors: Thayne R. Coffman, Ronald C. Larcom
  • Patent number: 8467628
    Abstract: A stochastic method and system for fast stereoscopic ranging includes selecting a pair of images for stereo processing, in which the pair of images are a frame pair and one of the image is a reference frame, seeding estimated values for a range metric at each pixel of the reference frame, initializing one or more search stage constraints, stochastically computing local influence for each valid pixel in the reference frame, aggregating local influences for each valid pixel in the reference frame, refining the estimated values for the range metric at each valid pixel in the reference frame based on the aggregated local influence, and post-processing range metric data. A valid pixel is a pixel in the reference frame that has a corresponding pixel in the other frame of the frame pair. The method repeats n iterations of the stochastically computing through the post-processing.
    Type: Grant
    Filed: April 24, 2008
    Date of Patent: June 18, 2013
    Assignee: 21 CT, Inc.
    Inventor: Thayne R. Coffman
  • Patent number: 8069127
    Abstract: A method and system for solving an optimization problem comprising a plurality of dynamic constraints. A genetic algorithm is used to iteratively generate potential solutions to the problem. A constraint graph is used to model the plurality of dynamic constraints, and any potential solution that does not correspond to a connected subgraph of the constraint graph is infeasible and discarded. Real-time changes in dynamic constraints are incorporated by modification of the constraint graph between iterations of the genetic algorithm. An exemplary embodiment comprising the scheduling of air missions is presented.
    Type: Grant
    Filed: April 26, 2007
    Date of Patent: November 29, 2011
    Assignee: 21 CT, Inc.
    Inventors: Darrin Taylor, Lee Alford