Analysis of long image sequence is important for visual surveillance, mobile robotics, and areas where a dynamic scene is observed over a long period of time, which means that a compact representation is needed to efficiently process it. In this report a novel representation for motion segmentation in long image sequences is presented. This representation, the feature interval graph, measures t...

Long image sequences provide a wealth of information, which means that a compact representation is needed to efficiently process them. In this paper a novel representation for motion segmentation in long image sequences is presented. This representation – the feature interval graph – measures the pairwise rigidity of features in the scene. The feature interval graph is recursively computed, mak...

Viglino defined a Hausdorff topological space to be C-compact if each closed subset of the space is anH-set in the sense of Velǐcko. In this paper, we study the class of Hausdorff spaces characterized by the property that each closed subset is an S-set in the sense of Dickman and Krystock. Such spaces are calledC-s-compact. Recently, the notion of strongly subclosed relation, introduced by Jose...

It is well known that infinite minimal sets for continuous functions on the interval are Cantor sets; that is, compact zero dimensional metrizable sets without isolated points. On the other hand, it was proved in Alcaraz and Sanchis (Bifurcat Chaos 13:1665–1671, 2003) that infinite minimal sets for continuous functions on connected linearly ordered spaces enjoy the same properties as Cantor set...

This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-t...

We show that the property of sequential compactness for subspaces of R is countably productive in ZF. Also, in the language of weak choice principles, we give a list of characterizations of the topological statement ‘sequentially compact subspaces of R are compact’. Furthermore, we show that forms 152 (= every non-well-orderable set is the union of a pairwise disjoint well-orderable family of d...

Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multiple comparisons. A heuristic previously proposed for this task is compared with two new algorithmic approaches. The latter rely on the equivalence of computing compact letter displays to computing clique covers in grap...

We define recurrence for a compactly generated para-topological group G acting continuously on locally compact Hausdorff space X with dimX=0, and then we show that if Gx‾ is all x∈X, the conditions are pairwise equivalent: (i) this dynamic pointwise recurrent, (ii) union of G-minimal sets, (iii) G-orbit closure relation closed in X×X, (iv) X∋x↦Gx‾∈2X continuous. Consequently, product it regular...

The traditional method of pairwise job interchange compares the cost of sequences that differ only in the interchange of two jobs. It assumes that either there are no intermediate jobs (adjacent pairwise interchange) or that the interchange can be performed no matter what the intermediate jobs are ( nonadjacent pairwise interchange). We introduce a generalization that permits the pairwise inter...

A question of Woodin asks if κ is strongly compact and GCH holds below κ, then must GCH hold everywhere? One variant of this question asks if κ is strongly compact and GCH fails at every regular cardinal δ < κ, then must GCH fail at some regular cardinal δ ≥ κ? Another variant asks if it is possible for GCH to fail at every limit cardinal less than or equal to a strongly compact cardinal κ. We ...