Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
We address the problem of segmenting a sequence of images of natural scenes into disjoint regions that are characterized by constant spatio-temporal statistics. We model the spati...
Gianfranco Doretto, Daniel Cremers, Paolo Favaro, ...
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Segmentation of deep brain structures is a challenging task for MRI images due to blurry structure boundaries, small object size and irregular shapes. In this paper, we present a ...
Abstract. This paper deals with the classification of color video sequences using Markov Random Fields (MRF) taking into account motion information. The theoretical framework relie...