Search

Coronary artery disease (CAD) is the leading cause of death around the world. One of the most common imaging methods for diagnosing CAD is the X-ray angiography (XRA). Diagnosing using XRA images is usually challenging due to some reasons such as, non-uniform illumination, low contrast, presence of other body tissues, and presence of catheter. These challenges make the diagnosis task hard and more prone to misdiagnosis. In this paper, we propose a new method for coronary artery segmentation, catheter detection, and centerline extraction in X-ray angiography images. For the segmentation, initially, three different superpixel scales are exploited, and a measure for vesselness probability of each superpixel is determined. A voting mechanism is used for obtaining an initial segmentation map from the three superpixel scales. The initial segmentation is refined by finding the orthogonal line on each ridge pixel of vessel region. The catheter is detected in the first frame of the angiography sequence and is tracked in other frames by fitting a second order polynomial on it. Also, we use the image ridges for extracting the coronary artery centerlines. We evaluated and compared our method with one of the previous well-known coronary artery segmentation methods on two challenging datasets. The results show that our method can segment the vessels and also detect and track the catheter in the XRA sequences. In general, the results assessed by a cardiologist show that 83% of the images processed by our proposed segmentation method were labeled as good or excellent, while this score for the compared method is 48%. Also, the evaluation results show that our method performs 67% faster than the compared method. Graphical abstract Proposed framework for coronary artery detection.

A new method of image resolution up-conversion (image interpolation) based on maximum a posteriori sequence estimation is proposed. Instead of making a hard decision about the value of each missing pixel, we estimate the missing pixels in groups. At each missing pixel of the high resolution (HR) image, we consider an ensemble of candidate interpolation methods (interpolation functions). The interpolation functions are interpreted as states of a Markov model. In other words, the proposed method undergoes state transitions from one missing pixel position to the next. Accordingly, the interpolation problem is translated to the problem of estimating the optimal sequence of interpolation functions corresponding to the sequence of missing HR pixel positions. We derive a parameter-free probabilistic model for this to-be-estimated sequence of interpolation functions. Then, we solve the estimation problem using a trellis representation and the Viterbi algorithm. Using directional interpolation functions and sequence estimation techniques, we classify the new algorithm as an adaptive directional interpolation using soft-decision estimation techniques. Experimental results show that the proposed algorithm yields images with higher or comparable peak signal-to-noise ratios compared with some benchmark interpolation methods in the literature while being efficient in terms of implementation and complexity considerations.

In this paper, an adaptive in-loop quantization technique is proposed for quantizing inner product coefficients in matching pursuit. For each matching pursuit (MP) stage a different quantizer is used based on the probability distribution of MP coefficients. The quantizers are optimized for a given rate budget constraint. Additionally, our proposed adaptive quantization scheme finds the optimal quantizers for each stage based on the already encoded inner product coefficients. Experimental results show that our proposed adaptive quantization scheme outperforms existing quantization methods used in matching pursuit image coding.

Matching pursuit (MP) is a multiresolution signal analysis method and can be used to render a selected region of an image with a specific quality. A novel, scalable, and progressive MP-based region-of-interest image-coding scheme is presented. The method is capable of providing a trade off between rate, distortion, and complexity. The method also provides an interactive way of information refinement for regions of an image with higher receiver's priority. By selecting a proper subset of the huge initial MP dictionary, using the method described in this paper, the complexity burden of MP analysis can be adapted to the computational power of the image encoder.

In this paper, we present a pipeline architecture specifically designed to process and compress DNA microarray images. Many of the pixilated image generation methods produce one row of the image at a time. This property is fully exploited by the proposed pipeline that takes in one row of the produced image at each clock pulse and performs the necessary image processing steps on it. This will remove the present need for sluggish software routines that are considered a major bottleneck in the microarray technology. Moreover, two different structures are proposed for compressing DNA microarray images. The proposed architecture is proved to be highly modular, scalable, and suited for a standard cell VLSI implementation.

Abstract: Fractal coding algorithm has many applications including image compression. In this paper a classification scheme is presented which allows the hardware implementation of the fractal coder. High speed and low power consumption are the goal of the suggested design. The introduced method is based on binary classification of domain and range blocks. The proposed technique increases the processing speed and reduces the power consumption while the qualities of the reconstructed images are comparable with those of the available software techniques. In order to show the functionality of the proposed algorithm, the architecture was implemented on a FPGA chip. The application of the proposed hardware is shown in image compression. The resulted compression ratios, PSNR error, gate count, compression speed and power consumption are compared with the existing designs. Other applications of the proposed design are feasible in certain fields such as mass–volume database coding and also in video coder’s block matching schemes. [Copyright &y& Elsevier]

Retargeting algorithms are used to transfer and display images on devices with various sizes and resolutions. All of these algorithms try to preserve the important parts of image against distortions while producing a retargeted image with visual quality comparable with the original one. The main challenge in different algorithms is to find a suitable energy function that properly estimates the importance of each pixel in image. Hence the energy map needs to be improved. In this paper we propose a novel energy function which combines the information from saliency map, depth map and gradient map. We also present an algorithm to adaptively assign proper weights to these three importance maps for each input image. Then we calculate a switching threshold based on energy map that determines when to apply seam carving or scaling. The idea is to use a combination of seam carving and scaling to preserve the structure of important parts of image against distortion when the image size decreases beyond a point. This method reduces shape deformations and visual artifacts in salient regions of images and produces better quality output images. The results of the proposed method show superior visual quality in produced images in comparison to the state-of-the-arts. [ABSTRACT FROM AUTHOR]