Image segmentation is an important step in image processing, with many applications such as pattern recognition, object detection, and medical image analysis. It is a technique that separates objects of interests from the background in an image. Geometric active contour is a recent image segmentation method that overcomes previous problems with snakes. It is an attractive method for medical image segmentation as it is able to capture the object of interest in one continuous curve. The theory and implementation details of geometric active contours are discussed in this work. The robustness of the algorithm is tested through a series of tests, involving both synthetic images and medical images. Curve leaking past boundaries is a common problem in cases of non-ideal edges. Noise is also problematic for the advancement of the curve. Smoothing and parameters selection are discussed as ways to help solve these problems. This work also explores the incorporation of the multi-resolution method of Gaussian pyramids into the algorithm. Multi-resolution methods, used extensively in the areas of denoising and edge-selection, can help capture the spatial structure of an image. Results show that similar to the multi-resolution methods applied to parametric active contours, the multi-resolution can greatly increase the computation without sacrificing performance. In fact, results show that with successive smoothing and sub-sampling, performance often improves. Although smoothing and parameter adjustment help improve the performance of geometric active contours, the edge-based approach is still localized and the improvement is limited. Region-based approaches are recommended for further work on active contours.

The task is to build an intelligent sensor that can instruct a Lego robot to perform certain tasks. The sensor is mounted on the Lego robot and it contains a digital camera which takes continuous images of the front view of the robot. These images are received by an FPGA which simultaneously saves them in an external storage device (SDRAM). At one time only one image is saved and during the time it is being saved, FPGA processes the image to extract some meaningful information. In front of digital camera there are different objects. The sensor is made to classify various objects on the basis of their color. For the classification, the requirement is to implement color image segmentation based object tracking algorithm on a small Field Programmable Gate array (FPGA). For the color segmentation in the images, we are using RGB values of the pixels and with the comparison of their relative values we get the binary image which is processed to determine the shape of the object. A histogram is used to retrieve object‟s features and saves results inside the memory of FPGA which can be read by an external microcontroller with the help of serial port (RS-232).

Image segmentation is an important step in image processing, with many applications such as pattern recognition, object detection, and medical image analysis. It is a technique that separates objects of interests from the background in an image. Geometric active contour is a recent image segmentation method that overcomes previous problems with snakes. It is an attractive method for medical image segmentation as it is able to capture the object of interest in one continuous curve. The theory and implementation details of geometric active contours are discussed in this work. The robustness of the algorithm is tested through a series of tests, involving both synthetic images and medical images. Curve leaking past boundaries is a common problem in cases of non-ideal edges. Noise is also problematic for the advancement of the curve. Smoothing and parameters selection are discussed as ways to help solve these problems. This work also explores the incorporation of the multi-resolution method of Gaussian pyramids into the algorithm. Multi-resolution methods, used extensively in the areas of denoising and edge-selection, can help capture the spatial structure of an image. Results show that similar to the multi-resolution methods applied to parametric active contours, the multi-resolution can greatly increase the computation without sacrificing performance. In fact, results show that with successive smoothing and sub-sampling, performance often improves. Although smoothing and parameter adjustment help improve the performance of geometric active contours, the edge-based approach is still localized and the improvement is limited. Region-based approaches are recommended for further work on active contours.

This thesis describes a probabilistic approach to imagesegmentation and interpretation. The focus of the investigation is the development of a systematic way of combining color, brightness, texture and geometric features extracted from an image to arrive at a consistent interpretation for each pixel in the image. The contribution of this thesis is thus the presentation of a novel framework for the fusion of extracted image features producing a segmentation of an image into relevant regions. Further, a solution to the sub-pixel mixing problem is presented based on solving a probabilistic linear program. This work is specifically aimed at interpreting and digitizing multi-spectral aerial imagery of the Earth's surface. The features of interest for extraction are those of relevance to environmental management, monitoring and protection. The presented algorithms are suitable for use within a larger interpretive system. Some results are presented and contrasted with other techniques. The integration of these algorithms into a larger system is based firmly on a probabilistic methodology and the use of statistical decision theory to accomplish uncertain inference within the visual formalism of a graphical probability model.

The accurate detection of static object boundaries such as contours or surfaces and dynamic tunnels of moving objects via deformable models is an ongoing research topic in computer vision. Most deformable models attempt to converge towards a desired solution by minimizing the sum of internal (prior) and external (measurement) energy terms. Such an approach is elegant, but frequently mis-converges in the presence of noise or complex boundaries and typically requires careful semi-dependent parameter tuning and initialization. Furthermore, current deformable model based approaches are computationally demanding which precludes real-time use. To address these limitations, a decoupled deformable model (DDM) is developed which optimizes the two energy terms separately. Essentially, the DDM consists of a measurement update step, employing a Hidden Markov Model (HMM) and Maximum Likelihood (ML) estimator, followed by a separate prior step, which modifies the updated deformable model based on the relative strengths of the measurement uncertainty and the non-stationary prior. The non-stationary prior is generated by using a curvature guided importance sampling method to capture high curvature regions. By separating the measurement and prior steps, the algorithm is less likely to mis-converge; furthermore, the use of a non-iterative ML estimator allows the method to converge more rapidly than energy-based iterative solvers. The full functionality of the DDM is developed in three phases. First, a DDM in 2D called the decoupled active contour (DAC) is developed to accurately identify the boundary of a 2D object in the presence of noise and background clutter. To carry out this task, the DAC employs the Viterbi algorithm as a truncated ML estimator, curvature guided importance sampling as a non-stationary prior generator, and a linear Bayesian estimator to fuse the non-stationary prior with the measurements. Experimental results clearly demonstrate that the DAC is robust to noise, can capture regions of very high curvature, and exhibits limited dependence on contour initialization or parameter settings. Compared to three other published methods and across many images, the DAC is found to be faster and to offer consistently accurate boundary identification. Second, a fast decoupled active contour (FDAC) is proposed to accelerate the convergence rate and the scalability of the DAC without sacrificing the accuracy by employing computationally efficient and scalable techniques to solve the three primary steps of DAC. The computational advantage of the FDAC is demonstrated both experimentally and analytically compared to three computationally efficient methods using illustrative examples. Finally, an extension of the FDAC from 2D to 3D called a decoupled active surface (DAS) is developed to precisely identify the surface of a volumetric 3D image and the tunnel of a moving 2D object. To achieve the objectives of the DAS, the concepts of the FDAC are extended to 3D by using a specialized 3D deformable model representation scheme and a computationally and storage efficient estimation scheme. The performance of the DAS is demonstrated using several natural and synthetic volumetric images and a sequence of moving objects.

In stochastic representation an image is a sample function of an array of random variables which is called a random field. For characterizing an ensemble of images, we choose an autoregressive model as our image model. An image model often applies to image processing such as image data compression and image restoration. Therefore the validity of the image model affect it¡¦s performance of image processing. The output of the AR model depends on its parameters ¡V system transition matrix and generating noise. Hence the validity of this model is related to these two parameters. How to seek the standard of the validity of the image model is a problem. We exploit performance of image model¡¦s application ¡V image restoration - to find a method of determining the validity of the image model. In our paper we find a relation between image restoration performance and image model¡¦s parameters by the Kalman filtering equations. An image model with lower generating noise power and system transition matrix is better for image restoration and is considered a good image model. In the analysis of the parameters of the image model, we can meet the requirements of the parameters by image segmentation method, residual image method and normalized image method. In addition it also helps us understand the Kalman filter much more and know how to find the solution of similar problems.

none

none

The accurate detection of static object boundaries such as contours or surfaces and dynamic tunnels of moving objects via deformable models is an ongoing research topic in computer vision. Most deformable models attempt to converge towards a desired solution by minimizing the sum of internal (prior) and external (measurement) energy terms. Such an approach is elegant, but frequently mis-converges in the presence of noise or complex boundaries and typically requires careful semi-dependent parameter tuning and initialization. Furthermore, current deformable model based approaches are computationally demanding which precludes real-time use. To address these limitations, a decoupled deformable model (DDM) is developed which optimizes the two energy terms separately. Essentially, the DDM consists of a measurement update step, employing a Hidden Markov Model (HMM) and Maximum Likelihood (ML) estimator, followed by a separate prior step, which modifies the updated deformable model based on the relative strengths of the measurement uncertainty and the non-stationary prior. The non-stationary prior is generated by using a curvature guided importance sampling method to capture high curvature regions. By separating the measurement and prior steps, the algorithm is less likely to mis-converge; furthermore, the use of a non-iterative ML estimator allows the method to converge more rapidly than energy-based iterative solvers. The full functionality of the DDM is developed in three phases. First, a DDM in 2D called the decoupled active contour (DAC) is developed to accurately identify the boundary of a 2D object in the presence of noise and background clutter. To carry out this task, the DAC employs the Viterbi algorithm as a truncated ML estimator, curvature guided importance sampling as a non-stationary prior generator, and a linear Bayesian estimator to fuse the non-stationary prior with the measurements. Experimental results clearly demonstrate that the DAC is robust to noise, can capture regions of very high curvature, and exhibits limited dependence on contour initialization or parameter settings. Compared to three other published methods and across many images, the DAC is found to be faster and to offer consistently accurate boundary identification. Second, a fast decoupled active contour (FDAC) is proposed to accelerate the convergence rate and the scalability of the DAC without sacrificing the accuracy by employing computationally efficient and scalable techniques to solve the three primary steps of DAC. The computational advantage of the FDAC is demonstrated both experimentally and analytically compared to three computationally efficient methods using illustrative examples. Finally, an extension of the FDAC from 2D to 3D called a decoupled active surface (DAS) is developed to precisely identify the surface of a volumetric 3D image and the tunnel of a moving 2D object. To achieve the objectives of the DAS, the concepts of the FDAC are extended to 3D by using a specialized 3D deformable model representation scheme and a computationally and storage efficient estimation scheme. The performance of the DAS is demonstrated using several natural and synthetic volumetric images and a sequence of moving objects.

The objective of this study is to apply digital image processing (DIP) techniques to optical coherence tomography (OCT) images and develop computer-based non-subjective quantitative analysis, which can be used as diagnostic aids in early detection of dental caries. This study first compares speckle reduction effects on raw OCT image data by implementing spatial-domain and transform-domain speckle filtering. Then region-based contour search and global thresholding techniques examine digital OCT images with possible lesions to identify and highlight the presence of features indicating early stage dental caries. The outputs of these processes, which explore the combination of image restoration and segmentation, can be used to distinguish lesion from normal tissue and determine the characteristics prior to, during, and following treatments. The combination of image processing and analysis techniques in this thesis shows potential of detecting early stage caries lesion successfully.