Efficient processing in an auto-adaptive network

Details Efficient processing in an auto-adaptive network Efficient processing in an auto-adaptive network

2009-04-29

2011-11-29

Gaffin, Jeffrey A (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

Knowledge representation and reasoning technique

C706S014000, C706S023000

Reexamination Certificate

active

08069132

ABSTRACT:
Feature values, which may be multi-dimensional, collected over successive time slices, are efficiently processed for use, for example, in known adaptive learning functions and event detection. A Markov chain in a recursive function to calculate imputed values for data points by use of a “nearest neighbor” matrix. Only data for the time slices currently required to perform computations must be stored. Earlier data need not be retained. A data selector, referred to herein for convenience as a window driver, selects successive cells of appropriate adjacent values in one or more dimensions to comprise an estimation set. The window driver effectively indexes tables of data to efficiently deliver input data to the matrix. In one form, feature inputs are divided into subgroups for parallel, pipelined processing.

REFERENCES:
patent: 5835902 (1998-11-01), Jannarone
patent: 5966178 (1999-10-01), Tashima et al.
patent: 6928398 (2005-08-01), Fang et al.
patent: 7079626 (2006-07-01), Hart et al.
patent: 7529721 (2009-05-01), Jannarone et al.
patent: 2006/0074741 (2006-04-01), Orumchian et al.
patent: 2008/0097802 (2008-04-01), Ladde et al.
patent: 2008/0126274 (2008-05-01), Jannarone et al.
patent: 03-150916 (1991-06-01), None
patent: 06-222809 (1994-08-01), None
“Methods for imputation of missing values in air quality data sets”, H. Junninen, H. Niska, K. Tuppurainen, J. Ruuskanen, M. Kolehmainen, Atmospheric Environment, vol. 38, Issue 18, Jun. 2004, pp. 2895-2907.
“Adaptive nearest neighbor search for relevance feedback in large image databases”, P. Wu, B. S. Manjunath, International Multimedia Conference; Proceedings of the ninth ACM international conference on Multimedia, vol. 9, 2001, pp. 89-97.
“Adaptive nearest neighbor search for relevance feedback in large image databases”, P. Wu, B. S. Manjunath, Proceeding Multimedia 01 Proceedings of the ninth ACM International conf, Sep. 30-Oct. 5, 2001, pp. 89-97.
International Search Report and Written Opinion for PCT/US06/27006 issued May 8, 2007.
McBader et al., A Programmable Image Signal Processing Architecture for Embedded Vision Systems, Proc. 14th IEEE International Conference on Digital Signal Processing, DSP 2002, Jul. 3, 2002, pp. 1269-1272.
Sun, Motion Activity for Video Indexing, Ph.D. Thesis, University of California, Santa Barbara, Jun. 2004, entire document, especially fig 5-1, p. 92.
International Search Report and Written Opinion for PCT/US2008/064276 issued Dec. 18, 2008.
Gao et al., Evaluating Continuous Nearest Neighbor Queries for Streaming Time Series via Pre-fetching, 2002, CIKM, Nov. 4-9, 2002 pp. 485-492.
U.S. Appl. No. 12/412,680, filed Mar. 27, 2009, Jannarrone et al.
European Search Report from EP 06786982.6 dated Apr. 14, 2010, 7 pages.
Ankur Jain, Edward Y. Chang, Yuang-Fang Wang: “Adaptive Stream Resource Management Using Kalman Filters” SIGMOD 2004, Jun. 18, 2004, 12 pages.
Eiman Elnahrawy et al.: “Context-Aware Sensors”, Jan. 14, 2004, 17 pages.
Andrew Kachites McCallum: “Reinforcement Learning with Selective Perception and Hidden State”, Dec. 31, 1996, 156 pages.

Affiliated with

Also associated with

Rating

Efficient processing in an auto-adaptive network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient processing in an auto-adaptive network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient processing in an auto-adaptive network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4299562