Pixel connectivity

Abstract: A fast parallel thinning algorithm is proposed in this paper It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the north-west boundary points and the south-east corner points End points and pixel connectivity are preserved Each pattern is thinned down to a skeleton of unitary thickness Experimental results show that this method is very effective 12 references

Abstract: A system for placing a visible "watermark" on a digital image is disclosed, wherein an image of the watermark is combined with the digital image. The pixels of the watermark image are examined, and for each pixel whose value is not a specified "transparent" value, the corresponding pixel of the original image is modified by changing its brightness but its chromaticities. This results in a visible mark which allows the contents of the image to be viewed clearly, but which discourages unauthorized use of the image.

Abstract: Mutual information (MI) has emerged in recent years as an effective similarity measure for comparing images. One drawback of MI, however, is that it is calculated on a pixel by pixel basis, meaning that it takes into account only the relationships between corresponding indi- vidual pixels and not those of each pixel's respective neighborhood. As a result, much of the spatial information inherent in images is not utilized. In this paper, we propose a novel extension to MI called regional mutual information (RMI). This extension efficiently takes neighborhood regions of corresponding pixels into account. We demonstrate the usefulness of RMI by applying it to a real-world problem in the medical domain— intensity-based 2D-3D registration of X-ray projection images (2D) to a CT image (3D). Using a gold-standard spine image data set, we show that RMI is a more robust similarity meaure for image registration than MI.

Abstract: A method and system operative to process monochrome image data are disclosed. In one embodiment, the method can comprise the steps of receiving monochrome image data, segmenting the input pixel values into pixel value ranges, assigning pixel positions in the lowest pixel value range an output pixel value of a first binary value, assigning pixel positions in the highest pixel value range an output pixel value of a second binary value, wherein the first and second binary values are different, and assigning pixel positions in intermediate pixel value ranges output pixel values that correspond to a spatial binary pattern. The resulting binary image data can be written to a file for subsequent storage, transmission, processing, or retrieval and rendering. In further embodiments, a system can be made operative to accomplish the same.