Abstract: Hand-drawn symbols can take many different and distorted shapes from their ideal representation. Then, very flexible methods are needed to be able to handle unconstrained drawings. We propose here to extend our previous work in hand-drawn symbol recognition based on a Bayesian framework and deformable template matching. This approach gets flexibility enough to fit distorted shapes in the drawing while keeping fidelity to the ideal shape of the symbol. In this work, we define the similarity measure between an image and a symbol based on the distance from every pixel in the image to the lines in the symbol. Matching is carried out using an implementation of the EM algorithm. Thus, we can improve recognition rates and computation time with respect to our previous formulation based on a simulated annealing algorithm.

Abstract: In this paper we introduce a novel application of the diffusion tensor for anisotropic image processing. The Anisotropic Contour Completion (ACC) we suggest consists in extending the characteristic function of the open curve by means of a degenerated diffusion tensor that prevents any diffusion in the normal direction. We show that ACC is equivalent to a dilation with a continuous elliptic structural element that takes into account the local orientation of the contours to be closed. Experiments on contours extracted from real images show that ACC produces shapes able to adapt to any curve in an active contour framework. 1.

Abstract: A hatched area is characterized by a set of parallel straight lines placed at regular intervals. In this paper, a Hough-based schema is introduced to recognize hatched areas in technical documents from attributed graph structures representing the document once it has been vectorized. Defining a Hough-based transform from a graph instead of the raster image allows to drastically reduce the processing time and, second, to obtain more reliable results because straight lines have already been detected in the vectorization step. A second advantage of the proposed method is that no assumptions must be made a priori about the slope and frequency of hatching patterns, but they are computed in run time for each hatched area.

Abstract: The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both deterministic applications and non-deterministic applications. In particular, the performance prediction of data dependent programs is an extremely challenging problem because for a specific issue the input datasets may cause different execution times. Generally, a parallel application is characterized as a collection of tasks and their interrelations. If the application is time-critical it is not enough to work with only one value per task, and consequently knowledge of the distribution of task execution times is crucial. The development of a new prediction methodology to estimate the performance of data-dependent parallel applications is the primary target of this study. This approach makes it possible to evaluate the parallel performance of an application without the need of implementation. A real data-dependent arterial structure detection application model is used to apply the methodology proposed. The predicted times obtained using the new methodology for genuine datasets are compared with predicted times that arise from using only one execution value per task. Finally, the experimental study shows that the new methodology generates more precise predictions.

Abstract: Myocardium appears as a uniform tissue that seen in convectional Magnetic Resonance Images (MRI) shows just the contractile part of its movement. MR Tagging is a unique imaging technique that prints a grid over the tissue which moves according to the underlying movement of the myocardium revealing the true deformation of the cardiac muscle. Optical flow techniques based on spectral information estimate tissue displacement by analyzing information encoded in the phase maps which can be obtained using, local (Gabor) and global (HARP) methods. In this paper we compare both in synthetic and real Tagged MR sequences. We conclude that local method is slightly more accurate than the global one. On the other hand, global method is more efficient as it is much faster and less parameters have to be taken into account