Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fundamentals of Gaussian CM Sequences

Published 13 Nov 2018 in math.PR, cs.SY, eess.SP, and math.DS | (1811.05086v5)

Abstract: Markov processes are widely used in modeling random phenomena/problems. However, they may not be adequate in some cases where more general processes are needed. The conditionally Markov (CM) process is a generalization of the Markov process based on conditioning. There are several classes of CM processes (one of them is the class of reciprocal processes), which provide more capability (than Markov) for modeling random phenomena. Reciprocal processes have been used in many different applications (e.g., image processing, intent inference, intelligent systems). In this paper, nonsingular Gaussian (NG) CM sequences are studied, characterized, and their dynamic models are presented. The presented results provide effective tools for studying reciprocal sequences from the CM viewpoint, which is different from that of the literature. Also, the presented models and characterizations serve as a basis for application of CM sequences, e.g., in motion trajectory modeling with destination information.

Citations (20)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.