Paper
10 May 2006 What is trackable?
George Cybenko, Valentino Crespi, Goufei Jiang
Author Affiliations +
Abstract
We have developed a general framework, called a Process Query System (PQS), that serves as a foundation for formulating tracking problems, implementing software solutions to tracking problems and understanding theoretical issues related to tracking in specific scenarios. The PQS framework posits that an environment consists of multiple dynamical processes. Processes have states, state transitions (deterministic, nondeterministic or probabilistic) and observables related to state occupancy. Examples of such dynamical processes are nondeterministic automata, Hidden Markov Models and classical state space models. We define a tracking problem as the inverse problem of determining the processes and process states that explain a stream of observations. This paper describes a quantitative concept of trackability by considering the rate of growth of state sequences of a process model given a temporal sequence of observations. Recent formal results concerning this notion of trackability are summarized without proof. Complete proofs of the various results are contained in a technical report by the authors and cited in the bibliography.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
George Cybenko, Valentino Crespi, and Goufei Jiang "What is trackable?", Proc. SPIE 6201, Sensors, and Command, Control, Communications, and Intelligence (C3I) Technologies for Homeland Security and Homeland Defense V, 620107 (10 May 2006); https://doi.org/10.1117/12.690628
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensors

Kinematics

Matrices

Sensor networks

Binary data

Process modeling

Signal detection

Back to Top