A new robust dense matching algorithm is introduced in this paper: The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densib the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded...

The paper describes the propagation of a thin laser beam which passes through a hot turbulent jet, perpendicularly to the flow direction, using geometrical optics approximation. From the modelling of the random propagation direction of the laser beam along its whole path, the diffusion coefficient of the turbulent jet is determined by means of a shape optimization technique in which a genetic a...

The paper addresses a new QRS complex geometrical feature extraction technique as well as its application for electrocardiogram (ECG) supervised hybrid (fusion) beat-type classification. To this end, after detection and delineation of the major events of ECG signal via a robust algorithm, each QRS region and also its corresponding discrete wavelet transform (DWT) are supposed as virtual images ...

The color of the blends of pre-colored fibers depends on the ratio of each fiber in the blends. Some theories have been introduced for color matching of blends of pre-colored fibers. Most however, are restricted in scope and accuracy. Kubelka and Munk presented the most applicable theory, which is still used in industry. In this work, the classical Kubelka-Munk method for color prediction of a ...

`Constraint hierarchy' is a nonmonotonic system that allows programmers to describe over-constrained real-world problems by specifying constraints with hierarchical preferences, and has been applied to various areas. An important aspect of constraint hierarchies is the existence of e cient satisfaction algorithms based on local propagation. However, past local-propagation algorithms have been l...

Image completion is one of the subjects in image and video processing which deals with restoration of and filling in damaged regions of images using correct regions. Exemplar-based image completion methods give more pleasant results than pixel-based approaches. In this paper, a new algorithm is proposed to find the most suitable patch in order to fill in the damaged parts. This patch selection ...

PURPOSE The level-set method is known to require long computation time for 3D image segmentation, which limits its usage in clinical workflow. The goal of this study was to develop a fast level-set algorithm based on the coherent propagation method and explore its character using clinical datasets. METHODS The coherent propagation algorithm allows level set functions to converge faster by for...