This work aims to study the dislocation or nodal lines of 3D Berry's random wave model. Their expected length is computed both in isotropic and anisotropic cases, being them compared. Afterwards, case asymptotic variance distribution are obtained as domain grows whole space. Under some integrability condition on covariance function, a central limit theorem established. The includes monochromati...

Accurate characterization of acute myocardial infarction (AMI) is crucial for the management of the patient. In this work we present a method for 3-dimensional (3D) velocity estimation and object tracking in sequences of ultrasound volume scans. Velocity estimation is based on motion estimation in 3D with maximum likelihood criteria. Tracking is carried out using a data association method based...

In this paper, we discuss techniques for the quantification of random and periodic noise present in flat field images. The types of noise studied are: (1) One-dimensional periodic noise (banding); (2) One-dimensional random noise (streaking) and, (3) Two-dimensional random noise (grain). A spectral separation technique was developed which allows the estimation of the individual noise power spec...

Consider a single planar grid, or two parallel planar grids of size w × n. The vertices of the grids are called terminals and pairwise disjoint sets of terminals are called nets. We aim at routing all nets in a cubic grid (above the single grid, or between the two grids holding the terminals) in a vertex-disjoint way. However, to ensure solvability, it is allowed to extend the length and the wi...

Consider two parallel planar grids of size w×n. The vertices of these grids are called terminals and pairwise disjoint subsets of terminals are called nets. We aim at routing all nets in a cubic grid between the two layers holding the terminals. However, to ensure solvability, it is allowed to introduce an empty row/column between every two consecutive rows/columns containing the terminals (in ...

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...