Computing languages by (Bounded) local sets

Accurate three-dimensional perception is a fundamental task in various computer vision applications. Recently, commercial RGB-depth (RGB-D) cameras have been widely adopted as single-view depth-sensing devices owing to their efficient ...

• We propose a method for a high-quality real-world depth dataset using only RGB-D stream dataset.

We extend the classical characterization (a.k.a. Medvedev theorem) of any regular language as the homomorphic image of a local language over an alphabet of cardinality depending on the size of the language recognizer. We allow strictly locally ...

We consider equality sets of prefix morphisms, that is, sets E(g"1,g"2)={w|g"1(w)=g"2(w)}, where g"1 and g"2 are prefix morphisms. Recall that a morphism g is prefix if, for all different letters a and b, g(a) is not a prefix of g(b). We prove a rather ...