Fundamentals of Gaussian CM Sequences
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.