computer aided diagnostic comprises wide research areas with stability and reliability software requirements. We propose a set of libraries aiming to provide a development framework for medical applications. This fram...
详细信息
computer aided diagnostic comprises wide research areas with stability and reliability software requirements. We propose a set of libraries aiming to provide a development framework for medical applications. This framework's libraries, mostly written from scratch (e.g Core library), were developed for both medical imaging systems and general physical simulations. Their internal interactions tend to be transparent to the developer and easy to use at the same time while providing flexibility to interact with other codes. The robustness of the code is shown in complex applications like the medical workstation here exemplified, while its flexibility and fast prototyping characteristics are exemplified with some simple demonstrations.
We constructed a single C-B zier curve with a shape parameter for G2 joining two circular arcs. It was shown that an S-shaped transition curve, which is able to manage a broader scope about two circle radii than the B...
详细信息
We constructed a single C-B zier curve with a shape parameter for G2 joining two circular arcs. It was shown that an S-shaped transition curve, which is able to manage a broader scope about two circle radii than the B zier curves, has no curvature extrema, while a C-shaped transition curve has a single curvature extremum. Regarding the two kinds of curves, specific algo- rithms were presented in detail, strict mathematical proofs were given, and the effectiveness of the method was shown by examples. This method has the following three advantages: (1) the pattern is unified; (2) the parameter able to adjust the shape of the tran- sition curve is available; (3) the transition curve is only a single segment, and the algorithm can be formulated as a low order equation to be solved for its positive root. These advantages make the method simple and easy to implement.
This paper presents a semiautomatic method for the identification of immunohistochemical (IHC) staining in digitized samples. The user trains the system by selecting on a sample image some typical positive stained reg...
详细信息
This paper presents a semiautomatic method for the identification of immunohistochemical (IHC) staining in digitized samples. The user trains the system by selecting on a sample image some typical positive stained regions that will be used as a reference for the construction of a distance metric. In this learning process, the global optimum is obtained by induction employing higher polynomial terms of the Mahalanobis distance, extracting nonlinear features of the IHC pattern distributions. The results of the proposed method showed a high correlation to a pathologist's manual analysis, which was used as a golden standard, presenting a more robust discrimination between stained and non-stained areas with little bias.
This paper presents a semiautomatic method for the identification of immunohistochemical (IHC) staining in digitized samples. The user trains the system by selecting on a sample image some typical positive stained reg...
We present evaluation results with focus on combined image and efficiency performance of the Gradient Network Method to segment color images, especially images showing outdoor scenes. A brief review of the techniques,...
详细信息
We present evaluation results with focus on combined image and efficiency performance of the Gradient Network Method to segment color images, especially images showing outdoor scenes. A brief review of the techniques, Gradient Network Method and Color Structure Code, is also presented. Different region-growing segmentation results are compared against ground truth images using segmentation evaluation indices Rand and Bipartite Graph Matching. These results are also confronted with other well established segmentation methods (EDISON and JSEG). Our preliminary results show reasonable performance in comparison to several state-of-art segmentation techniques, while also showing very promising results comparatively in the terms of efficiency, indicating the applicability of our solution to real time problems.
In this paper, we present a parallelization of a filtering algorithm related to non-linear anisotropic diffusion, used to enhance the performance of an application in a parallel distributed system. The anisotropic dif...
详细信息
ISBN:
(纸本)9780769532578
In this paper, we present a parallelization of a filtering algorithm related to non-linear anisotropic diffusion, used to enhance the performance of an application in a parallel distributed system. The anisotropic diffusion is a well-established technique for image enhancement by means of diffusivity functions, which act as border attenuators. However, it requires a high computational cost when a large amount of data is used. The proposed implementation was parallelized considering both point-to-point and collective communications, adopting the MPI paradigm. Results from both approaches indicate that the proposed algorithm has reached interesting levels of performance (81% and 93% of efficiency, respectively) when compared to the execution of one process in a single computer node. In addition, our results indicate an enhancement of around 21% utilizing the collective communication strategy when compared to point-to-point communication.
作者：
Lele ZhouSaif ZahirImage Processing
Graphics and Multimedia Lab Computer Science Department University of Northern British Columbia Canada
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lo...
详细信息
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image compression. The proposed algorithm introduces a new method, direct redundancy elimination, to efficiently exploit the two-dimensional redundancy of an image, as well as a novel dynamic context model to improve the efficiency of arithmetic coding. Simulation results show that the proposed algorithm has comparable compression ratio to JBIG standard. In many cases, the proposed algorithm outperforms the JBIG standard
In this paper, we propose a lossless binary image compression scheme that can achieve high compression ratio via partitioning the black regions (one's) of the input image into rectangles. After partitioning, the t...
详细信息
In this paper, we propose a near minimum sparse pattern coding based scheme for binary image compression. Sparse patterns such as those obtained from prediction, image differencing, and other methods can be coded effi...
详细信息
In this paper, we propose a near minimum sparse pattern coding based scheme for binary image compression. Sparse patterns such as those obtained from prediction, image differencing, and other methods can be coded efficiently using the scheme proposed in this paper. In this research we apply our scheme on coordinate representation of rectangular regions via a number of matrices. Such representations allow for efficiently coding these vertices, and hence compress the image significantly. Simulation results show that the proposed scheme outperformed previously published methods for coordinate data coding by nearly 17%. This scheme has low complexity compared with JBIG2.
A new scheme for partitioning systolic algorithms is presented. It is based on the time-sharing properties of the c-slow circuits. The technique is amenable to formalization and holds high potential for automatization...
详细信息
暂无评论