Three-dimensional textural and volumetric image analysis holds great potential in understanding the image data produced by multi-photon microscopy. In this paper, an algorithm that quantitatively analyzes the texture and the morphology of vasculature in engineered tissues is proposed. The investigated 3D artificial tissues consist of Human Umbilical Vein Endothelial Cells (HUVEC) embedded in co...

First, a new framework describing the transfer matrices for the two dimensional run length constrained arrays (codes) is introduced, and some important properties of the transfer matrices ( 1) m T m  are derived in this framework. Then, using these properties, it is shown that the numbers ( , ) ( , 1) N m n m n  of the two dimensional binary arrays satisfying the (1, )  run length constraint...

In this paper, we generalize image (texture) statistical descriptors and propose algorithms that improve their efficacy. Recently, a new method showed how the popular Co-Occurrence Matrix (COM) can be modified into a fuzzy version (FCOM) which is more effective and robust to noise. Here, we introduce new fuzzy versions of two additional higher order statistical matrices: the Run Length Matrix (...

a r t i c l e i n f o a b s t r a c t We present fast methods to describe the surface evolution of large three-dimensional structures. Based on the sparse field level set method and the hierarchical run-length encoding level set data structure optimal figures for the computation time and for the memory consumption are achieved. Furthermore, we introduce a new multi-level-set technique, which is...

We exhibit lower bounds on the number of states in a fixed rate finite-state encoder that maps unconstrained n-ary sequences into a given set of constrained sequences, defined by a finite labelled graph G. In particular, one simple lower bound is given by minxmaxv xv where x = [xv] ranges over certain (nonnegative integer) approximate eigenvectors of the adjacency matrix for G. In some sense, o...

We introduce a novel preprocessing-based algorithm to solve the problem of determining the first arc of a shortest path in sparse graphs. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns i...