This paper describes a graph-spectral method for path estimation. Our aim is to find a maximum probability path through a lattice of pixel sites. We characterise the path recovery problem using a site transition matrix. A graph-spectral analysis of the transition matrix reveals how the maximum probability path can be located using an eigenvector of the associated normalised affinity matrix. We ...

Reconstructing the logical network from the transition matrix is benefit for learning the logical meaning of the algebraic result from the algebraic representation of a BN. And so far there has no method to convert the matrix expression back to the logic expression for a BN with an arbitrary topology structure. Based on the canonical form and Karnaugh map, we propose a method for reconstructing...