Consistent and powerful non-Euclidean graph-based change-point test with applications to segmenting random interfered video data [Statistics]

The change-point detection has been carried out in terms of the Euclidean minimum spanning tree (MST) and shortest Hamiltonian path (SHP), with successful applications in the determination of authorship of a classic novel, the detection of change in a network over time, the detection of cell divisions, etc. However, these...

https://ift.tt/2kR5opY