2018 IEEE Western New York Image and Signal Processing Workshop (WNYISPW) 2018
DOI: 10.1109/wnyipw.2018.8576382
|View full text |Cite
|
Sign up to set email alerts
|

Nonsingular Gaussian Conditionally Markov 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 pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
49
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 14 publications
(49 citation statements)
references
References 29 publications
0
49
0
Order By: Relevance
“…A sequence [x k ] is [k 1 , k 2 ]-CM c , c ∈ {k 1 , k 2 } (i.e., CM over [k 1 , k 2 ]) iff conditioned on the state at time k 1 (or k 2 ), the sequence is Markov over [k 1 + 1, k 2 ] ([k 1 , k 2 − 1]). The above definition is equivalent to the following lemma [1].…”
Section: Definitions and Notationsmentioning
confidence: 99%
See 2 more Smart Citations
“…A sequence [x k ] is [k 1 , k 2 ]-CM c , c ∈ {k 1 , k 2 } (i.e., CM over [k 1 , k 2 ]) iff conditioned on the state at time k 1 (or k 2 ), the sequence is Markov over [k 1 + 1, k 2 ] ([k 1 , k 2 − 1]). The above definition is equivalent to the following lemma [1].…”
Section: Definitions and Notationsmentioning
confidence: 99%
“…By Lemma 3.1, the set of reciprocal sequences modeled by a reciprocal CM L model contains Markov and non-Markov sequences (depending on the parameters of the boundary condition). So, a sequence modeled by a reciprocal CM L model and a boundary condition determined as in the proof of Lemma 3.1 (i.e., satisfying (11)) is actually a Markov sequence whose C −1 is (block) tri-diagonal (i.e., (1) with D 0 = · · · = D N −2 = 0). Given this C −1 , we can obtain parameters of Markov model (15)…”
Section: Reciprocal Sequencesmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, inside and outside are independent given the boundaries. A sequence is CM F (CM L ) over [k 1 , k 2 ] iff conditioned on the state at time k 1 (k 2 ), the sequence is Markov over [k 1 + 1, k 2 ] ([k 1 , k 2 − 1]) [1]. The set of CM sequences is very large and it includes many classes.…”
Section: Introductionmentioning
confidence: 99%
“…But the covariance of a singular sequence is not invertible. Also, proofs of models presented in [1] and [15]- [16] are based on the nonsingularity of sequences and do not work for the singular case. In this paper, we use different ideas and approaches to obtain dynamic models and characterizations for the general singular/nonsingular case.…”
Section: Introductionmentioning
confidence: 99%