The Fast Marching method is widely employed in several fields of image processing. Some years ago a Multi-Stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a modified numerical scheme for MSFM to take into account the variation of the local cost, which has proven to be second order. The influence of the stencil set choice on the algorithm outcome with respect to stencil orthogonality and axis swapping is also explored, where stencils are taken from neighborhoods of varying radius. The experimental results show that the proposed schemes improve the accuracy of their original counterparts, and that the use of permutation-invariant stencil sets provides robustness against shifted vector coordinates in the stencil set.

Medical image processing is often limited by the computational cost of the involved algorithms. Whereas dedicated computing devices (GPUs in particular) exist and do provide significant efficiency boosts, they have an extra cost of use in terms of housekeeping tasks (device selection and initialization, data streaming, synchronization with the CPU, and others), which may hinder developers from using them. This paper describes an OpenCL-based framework that is capable of handling dedicated computing devices seamlessly and that allows the developer to concentrate on image processing tasks. The framework handles automatically device discovery and initialization, data transfers to and from the device and the file system and kernel loading and compiling. Data structures need to be defined only once independently of the computing device; code is unique, consequently, for every device, including the host CPU. Pinned memory/buffer mapping is used to achieve maximum performance in data transfers. Code fragments included in the paper show how the computing device is almost immediately and effortlessly available to the users algorithms, so they can focus on productive work. Code required for device selection and initialization, data loading and streaming and kernel compilation is minimal and systematic. Algorithms can be thought of as mathematical operators (called processes), with input, output and parameters, and they may be chained one after another easily and efficiently. Also for efficiency, processes can have their initialization work split from their core workload, so process chains and loops do not incur in performance penalties. Algorithm code is independent of the device type targeted.

Ultrasound (US) imaging exhibits considerable difficulties for medical visual inspection and for development of automatic analysis methods due to speckle, which negatively affects the perception of tissue boundaries and the performance of automatic segmentation methods. With the aim of alleviating the effect of speckle, many filtering techniques are usually considered as a preprocessing step prior to automatic analysis methods or visual inspection. Most of the state-of-the-art filters try to reduce the speckle effect without considering its relevance for the characterization of tissue nature. However, the speckle phenomenon is the inherent response of echo signals in tissues and can provide important features for clinical purposes. This loss of information is even magnified due to the iterative process of some speckle filters, e.g., diffusion filters, which tend to produce over-filtering because of the progressive loss of relevant information for diagnostic purposes during the diffusion process. In this paper, we propose an anisotropic diffusion filter with a probabilistic-driven memory mechanism to overcome the over-filtering problem by following a tissue selective philosophy. In particular, we formulate the memory mechanism as a delay differential equation for the diffusion tensor whose behavior depends on the statistics of the tissues, by accelerating the diffusion process in meaningless regions and including the memory effect in regions where relevant details should be preserved. Results both in synthetic and real US images support the inclusion of the probabilistic memory mechanism for maintaining clinical relevant structures, which are removed by the state-of-the-art filters.

We propose a fully 3-D methodology for the computation of myocardial nonviable tissue transmurality in contrast enhanced magnetic resonance images. The outcome is a continuous map defined within the myocardium where not only current state-of-the-art measures of transmurality can be calculated, but also information on the location of nonviable tissue is preserved. The computation is done by means of a partial differential equation framework we have called multi-stencil streamline fast marching. Using it, the myocardial and scarred tissue thickness is simultaneously computed. Experimental results show that the proposed 3-D method allows for the computation of transmurality in myocardial regions where current 2-D methods are not able to as conceived, and it also provides more robust and accurate results in situations where the assumptions on which current 2-D methods are based-i.e., there is a visible endocardial contour and its corresponding epicardial points lie on the same slice-, are not met.

A realistic log-compressed law for ultrasound images based on a real device is proposed. The model takes into account the linear behavior of the logarithmic amplifier for small signal gain which transforms image values in a different way as the classical models do. Additionally, for recovery purposes, a method for the estimation of the compression parameters is also proposed when a realistic log-compressed law is considered. Results with synthetic images show that the proposed method achieved a consistent Rayleigh parameter estimate with a very low error. Experiments with real images show that the inversion method is consistent through the whole acquisition process when parameters of the logarithmic amplifier are assumed constant.

This paper proposes a novel method to detect anomalies in network traffic, based on a nonrestricted α-stable first-order model and statistical hypothesis testing. To this end, we give statistical evidence that the marginal distribution of real traffic is adequately modeled with α-stable functions and classify traffic patterns by means of a Generalized Likelihood Ratio Test (GLRT). The method automatically chooses traffic windows used as a reference, which the traffic window under test is compared with, with no expert intervention needed to that end. We focus on detecting two anomaly types, namely floods and flash-crowds, which have been frequently studied in the literature. Performance of our detection method has been measured through Receiver Operating Characteristic (ROC) curves and results indicate that our method outperforms the closely-related state-of-the-art contribution described in. All experiments use traffic data collected from two routers at our university-a 25,000 students institution-which provide two different levels of traffic aggregation for our tests (traffic at a particular school and the whole university). In addition, the traffic model is tested with publicly available traffic traces. Due to the complexity of α-stable distributions, care has been taken in designing appropriate numerical algorithms to deal with the model.

A method to identify different tissues in ultrasound images is presented. Assuming a Rayleigh model for speckle, the different tissues present in the image will be related to the Rayleigh sigma parameter, with different values for each different tissue. The parameter is locally estimated using well known estimation methods for the Rayleigh distribution, such as the maximum likelihood estimator. A significant increase in the separability of the different tissues present in the image is then achieved. A subsequent clustering process based on the position of the maxima of the estimator distribution allows the classification of each pixel in a tissue class.

In this paper we analyze a result previously published about a comparison between two statistical tests used for evaluation of boundary detection algorithms on medical images. We conclude that the statement made by Chalana and Kim (1997) about the performance of the percentage test has a weak theoretical foundation, and according to our results, is not correct. In addition, we propose a one-sided hypothesis test for which the acceptance region can be determined in advance, as opposed to the two-sided confidence intervals proposed in the original paper, which change according to the estimated quantity.

This paper presents an algorithm for automatically detecting bone contours from hand radiographs using active contours. Prior knowledge is first used to locate initial contours for the snakes inside each bone of interest. Next, an adaptive snake algorithm is applied so that parameters are properly adjusted for each bone specifically. We introduce a novel truncation technique to prevent the external forces of the snake from pulling the contour outside the bones boundaries, yielding excellent results.