A necessary prerequisite for object oriented image processing is successful image segmentation. The approach presented in this paper aims for an universal high-quality solution applicable and adaptable to many problems and data types. As each image analysis problem deals with structures of a certain spatial scale, the average image objects size must be free adaptable to the scale of interest. This is achieved by a general segmentation algorithm based on homogeneity definitions in combination with local and global optimization techniques. A scale parameter is used to control the average image object size. Different homogeneity criteria for image objects based on spectral and/or spatial information are developed and compared.

Multiresolution Segmentation-an optimization approach for high quality multi-scale image segmentation

A cookbook of algorithms for common image processing applicationsThanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids Its an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists who require highly specialized image processingAlgorithms now exist for a wide variety of sophisticated image processing applications required by software engineers and developers, advanced programmers, graphics programmers, scientists, and related specialistsThis bestselling book has been completely updated to include the latest algorithms, including 2D vision methods in content-based searches, details on modern classifier methods, and graphics cards used as image processing computational aidsSaves hours of mathematical calculating by using distributed processing and GPU programming, and gives non-mathematicians the shortcuts needed to program relatively sophisticated applicationsAlgorithms for Image Processing and Computer Vision, 2nd Edition provides the tools to speed development of image processing applications

/pdf/algorithms-for-image-processing-and-computer-vision-gdi70hbodx.pdf

Algorithms for image processing and computer vision

http://www.ens-lyon.fr/DI/wp-content/uploads/2009/07/LopesBetrouni.pdf

Fractal and multifractal analysis: a review.

Accurate segmentation of medical images is a key step in contouring during radiotherapy planning. Computed topography (CT) and Magnetic resonance (MR) imaging are the most widely used radiographic techniques in diagnosis, clinical studies and treatment planning. This review provides details of automated segmentation methods, specifically discussed in the context of CT and MR images. The motive is to discuss the problems encountered in segmentation of CT and MR images, and the relative merits and limitations of methods currently available for segmentation of medical images.

Automated medical image segmentation techniques

Methods for digital-image texture analysis are reviewed based on available literature and research work either carried out or supervised by the authors The review has been prepared on request of Dr Richard Lerski, Chairman of the Management Committee of the COST B11 action "Quantitation of Magnetic Resonance Image Texture"

/pdf/texture-analysis-methods-a-review-3pph5x6k81.pdf

Texture Analysis Methods - A Review

Fractal dimension is an interesting feature proposed to characterize roughness and self-similarity in a picture. This feature has been used in texture segmentation and classification, shape analysis and other problems. An efficient differential box-counting approach to estimate fractal dimension is proposed in this note. By comparison with four other methods, it has been shown that the authors, method is both efficient and accurate. Practical results on artificial and natural textured images are presented. >

An efficient differential box-counting approach to compute fractal dimension of image

This paper deals with the problem of recognizing and segmenting textures in images. For this purpose the authors employ a technique based on the fractal dimension (FD) and the multi-fractal concept. Six FD features are based on the original image, the above average/high gray level image, the below average/low gray level image, the horizontally smoothed image, the vertically smoothed image, and the multi-fractal dimension of order two. A modified box-counting approach is proposed to estimate the FD, in combination with feature smoothing in order to reduce spurious regions. To segment a scene into the desired number of classes, an unsupervised K-means like clustering approach is used. Mosaics of various natural textures from the Brodatz album as well as microphotographs of thin sections of natural rocks are considered, and the segmentation results to show the efficiency of the technique. Supervised techniques such as minimum-distance and k-nearest neighbor classification are also considered. The results are compared with other techniques. >

N. Sarkar

Papers

An efficient differential box-counting approach to compute fractal dimension of image

Texture segmentation using fractal dimension