vix.ing · top · new · best · stats · spec

Fundamentals of Gaussian CM Sequences

2018/11/13 by Reza Rezaie, X. Rong Li, Rezaie, Reza +1
Computer Science · #Dynamical Systems (math.DS) #FOS: Electrical engineering #FOS: Mathematics #Numerical Methods and Algorithms #Probability (math.PR) #Signal Processing (eess.SP) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1811.05086

openalex publication_date 2018/11/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related