Share Email Print

Proceedings Paper

Square-root filtering in time-sequential estimation of random fields
Author(s): Toshio Mike Chin; William Clement Karl; Arthur J. Mariano; Alan S. Willsky
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

As a time-sequential and Bayesian front-end for image sequence processing, we consider the square root information (SRI) realization of Kalman filter. The computational complexity of the filter due to the dimension of the problem -- the size of the state vector is on the order of the number of pixels in the image frame -- is decreased drastically using a reduced-order approximation exploiting the natural spatial locality in the random field specifications. The actual computation for the reduced-order SRI filter is performed by an iterative and distributed algorithm for the unitary transformation steps, providing a potentially faster alternative to the common QR factorization-based methods. For the space-time estimation problems, near- optimal solutions can be obtained in a small number of iterations (e.g., less than 10), and each iteration can be performed in a finely parallel manner over the image frame, an attractive feature for a dedicated hardware implementation.

Paper Details

Date Published: 8 April 1993
PDF: 8 pages
Proc. SPIE 1903, Image and Video Processing, (8 April 1993); doi: 10.1117/12.143140
Show Author Affiliations
Toshio Mike Chin, Univ. of Miami (United States)
William Clement Karl, Massachusetts Institute of Technology (United States)
Arthur J. Mariano, Univ. of Miami (United States)
Alan S. Willsky, Massachusetts Institute of Technology (United States)

Published in SPIE Proceedings Vol. 1903:
Image and Video Processing
Majid Rabbani; M. Ibrahim Sezan; A. Murat Tekalp, Editor(s)

© SPIE. Terms of Use
Back to Top