Geometry-based image retrieval in binary image databases.

In this paper, a geometry-based image retrieval system is developed for multi-object images. We model both shape and topology of image objects using a structured representation called curvature tree (CT). The hierarchy of the CT reflects the inclusion relationships between the image objects. To facilitate shape-based matching, triangle-area representation (TAR) of each object is stored at the corresponding node in the CT. The similarity between two multi-object images is measured based on the maximum similarity subtree isomorphism (MSSI) between their CTs. For this purpose, we adopt a recursive algorithm to solve the MSSI problem and a very effective dynamic programming algorithm to measure the similarity between the attributed nodes. Our matching scheme agrees with many recent findings in psychology about the human perception of multi-object images. Experiments on a database of 13500 real and synthesized medical images and the MPEG-7 CE-1 database of 1400 shape images have shown the effectiveness of the proposed method.

Fractal-wavelet image denoising revisited.

The essence of fractal image denoising is to predict the fractal code of a noiseless image from its noisy observation. From the predicted fractal code, one can generate an estimate of the original image. We show how well fractal-wavelet denoising predicts parent wavelet subtress of the noiseless image. The performance of various fractal-wavelet denoising schemes (e.g., fixed partitioning, quadtree partitioning) is compared to that of some standard wavelet thresholding methods. We also examine the use of cycle spinning in fractal-based image denoising for the purpose enhancing the denoised estimates. Our experimental results show that these fractal-based image denoising methods are quite competitive with standard wavelet thresholding methods for image denoising. Finally, we compare the performance of the pixel- and wavelet-based fractal denoising schemes.

Prostate segmentation algorithm using dyadic wavelet transform and discrete dynamic contour.

Knowing the location and the volume of the prostate is important for ultrasound-guided prostate brachytherapy, a commonly used prostate cancer treatment method. The prostate boundary must be segmented before a dose plan can be obtained. However, manual segmentation is arduous and time consuming. This paper introduces a semi-automatic segmentation algorithm based on the dyadic wavelet transform (DWT) and the discrete dynamic contour (DDC). A spline interpolation method is used to determine the initial contour based on four user-defined initial points. The DDC model then refines the initial contour based on the approximate coefficients and the wavelet coefficients generated using the DWT. The DDC model is executed under two settings. The coefficients used in these two settings are derived using smoothing functions with different sizes. A selection rule is used to choose the best contour based on the contours produced in these two settings. The accuracy of the final contour produced by the proposed algorithm is evaluated by comparing it with the manual contour outlined by an expert observer. A total of 114 2D TRUS images taken for six different patients scheduled for brachytherapy were segmented using the proposed algorithm. The average difference between the contour segmented using the proposed algorithm and the manually outlined contour is less than 3 pixels.

Fractal image denoising.

Over the past decade, there has been significant interest in fractal coding for the purpose of image compression. However, applications of fractal-based coding to other aspects of image processing have received little attention. We propose a fractal-based method to enhance and restore a noisy image. If the noisy image is simply fractally coded, a significant amount of the noise is suppressed. However, one can go a step further and estimate the fractal code of the original noise-free image from that of the noisy image, based upon a knowledge (or estimate) of the variance of the noise, assumed to be zero-mean, stationary and Gaussian. The resulting fractal code yields a significantly enhanced and restored representation of the original noisy image. The enhancement is consistent with the human visual system where extra smoothing is performed in flat and low activity regions and a lower degree of smoothing is performed near high frequency components, e.g., edges, of the image. We find that, for significant noise variance (sigma > or = 20), the fractal-based scheme yields results that are generally better than those obtained by the Lee filter which uses a localized first order filtering process similar to fractal schemes. We also show that the Lee filter and the fractal method are closely related.