@article {316, title = {IRGS: Image segmentation using edge penalties and region growing}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {30}, year = {2008}, pages = {2126 - 2139}, abstract = {

This paper proposes an image segmentation method named iterative region growing using semantics (IRGS), which is characterized by two aspects. First, it uses graduated increased edge penalty (GIEP) functions within the traditional Markov random field (MRF) context model in formulating the objective functions. Second, IRGS uses a region growing technique in searching for the solutions to these objective functions. The proposed IRGS is an improvement over traditional MRF based approaches in that the edge strength information is utilized and a more stable estimation of model parameters is achieved. Moreover, the IRGS method provides the possibility of building a hierarchical representation of the image content, and allows various region features and even domain knowledge to be incorporated in the segmentation process. The algorithm has been successfully tested on several artificial images and synthetic aperture radar (SAR) images.

}, keywords = {Algorithms, artificial images, Artificial Intelligence, Automated, Computer-Assisted, edge strength information, GIEP, graduated increased edge penalty, image enhancement, image interpretation, image segmentation, IRGS, iterative methods, iterative region growing, Markov processes, Markov random field context model, model parameter estimation, MRF, Pattern Recognition, random processes, Reproducibility of Results, Sensitivity and Specificity, Subtraction Technique, synthetic aperture radar images}, doi = {10.1109/TPAMI.2008.15}, author = {Q Yu and D A. Clausi} } @inproceedings {591, title = {Adaptive color image segmentation using Markov random fields}, booktitle = {International Conference on Pattern Recognition}, year = {2002}, address = {Rochester, NY}, abstract = {

A new framework for color image segmentation is introduced generalizing the concepts of point-based and spatially-based methods. This framework is based on Markov random fields using a continuous Gibbs sampler. The Markov random fields approach allows for a rigorous computational framework where local and global spatial constraints can be globally optimized. Using a continuous Gibbs sampler enables the algorithm to adapt continuous-valued regional prototypes in a manner analogous to vector quantization while the discrete Gibbs sampler is used to adjust region boundaries.

}, keywords = {adaptive color image segmentation, adaptive signal processing, continuous Gibbs sampler, continuous-valued regional prototypes, discrete Gibbs sampler, global spatial constraints, image colour analysis, image sampling, image segmentation, local spatial constraints, Markov processes, Markov Random Fields, point-based methods, random processes, region boundaries adjustment, spatially-based methods, vector quantization}, doi = {http://dx.doi.org/10.1109/ICIP.2002.1039085}, author = {S Wesolkowski and P Fieguth} } @inproceedings {597, title = {A Markov random fields model for hybrid edge and region based colour image segmentation}, booktitle = {15th Canadian Conference on Electrical and Computer Engineering}, year = {2002}, abstract = {

A framework based on a Markov random field approach for color image segmentation enhanced by edge detection is presented. We use a previously developed methodology to transform the image into an R\&$\#$39;G\&$\#$39;B\&$\#$39; space to remove any highlight components preserving the vector-angle component, representing color hue but not intensity, to remove shading effects. To improve the segmentation process we describe the idea of a line process. This allows for the integration of region segmentation with edge detection in a Markov random field framework. We discuss the advantages of this new model with respect to the previously developed image segmentation model.

}, keywords = {color hue, color theory, dichromatic reflection model, edge detection, highlight components removal, hybrid edge-based color image segmentation, image colour analysis, image segmentation, line process, Markov processes, Markov random fields model, random processes, region segmentation, region-based color image segmentation, RGB space, shading effects removal, vector-angle component}, doi = {http://dx.doi.org/10.1109/CCECE.2002.1013070}, author = {S Wesolkowski and P Fieguth} } @article {485, title = {An overlapping tree approach to multiscale stochastic modeling and estimation}, journal = {IEEE Transactions on Image Processing}, volume = {6}, year = {1997}, pages = {1517 - 1529}, abstract = {

Recently, a class of multiscale stochastic models has been introduced in which random processes and fields are described by scale-recursive dynamic trees. A major advantage of this framework is that it leads to an extremely efficient, statistically optimal algorithm for least-squares estimation. In certain applications, however, estimates based on the types of multiscale models previously proposed may not be adequate, as they have tended to exhibit a visually distracting blockiness. We eliminate this blockiness by discarding the standard assumption that distinct nodes on a given level of the multiscale process correspond to disjoint portions of the image domain; instead, we allow a correspondence to overlapping portions of the image domain. We use these so-called overlapping-tree models for both modeling and estimation. In particular, we develop an efficient multiscale algorithm for generating sample paths of a random field whose second-order statistics match a prespecified covariance structure, to any desired degree of fidelity. Furthermore, we demonstrate that under easily satisfied conditions, we can ldquo;lift rdquo; a random field estimation problem to one defined on an overlapped tree, resulting in an estimation algorithm that is computationally efficient, directly produces estimation error covariances, and eliminates blockiness in the reconstructed imagery without any sacrifice in the resolution of fine-scale detail

}, keywords = {covariance analysis, covariance structure, error analysis, estimation algorithm, estimation error covariances, fine scale detail resolution, image domain, image reconstruction, image resolution, least squares approximations, least squares estimation, multiscale stochastic modeling, overlapping tree, parameter estimation, quadtrees, random field estimation, random processes, scale recursive dynamic trees, second order statistics, statistically optimal algorithm, stochastic processes}, issn = {1057-7149}, author = {W W. Irving and P Fieguth and A S. Willsky} } @article {488, title = {Fractal estimation using models on multiscale trees}, journal = {IEEE Transactions on Signal Processing}, volume = {44}, year = {1996}, pages = {1297 - 1300}, abstract = {

We estimate the Hurst parameter H of fractional Brownian motion (or, by extension, the fractal exponent phi; of stochastic processes having 1/f phi;-like spectra) by applying a multiresolution framework. This framework admits an efficient likelihood function evaluation, allowing us to compute the maximum likelihood estimate of this fractal parameter with relative ease. In addition to yielding results that compare well with other proposed methods, and in contrast with other approaches, our method is directly applicable with, at most, very simple modification in a variety of other contexts including fractal estimation given irregularly sampled data or nonstationary measurement noise and the estimation of fractal parameters for 2-D random fields

}, keywords = {2-D random fields, Brownian motion, fractal estimation, fractal parameter, fractals, fractional Brownian motion, Hurst parameter, irregularly sampled data, likelihood function evaluation, maximum likelihood estimate, maximum likelihood estimation, multiresolution framework, nonstationary measurement noise, random noise, random processes, signal resolution, signal sampling, stochastic processes, trees (mathematics)}, issn = {1053-587X}, doi = {http://dx.doi.org/10.1109/78.502347}, author = {P Fieguth and A S. Willsky} } @inproceedings {453, title = {Multiresolution model development for overlapping trees via canonical correlation analysis}, booktitle = {International Conference on Image Processing}, year = {1995}, abstract = {

A class of multiscale stochastic models has been introduced in which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a tree. One of the primary reasons the framework is useful is that it leads to an extremely fast, statistically optimal algorithm for least-squares estimation in the context of 2-D images. We refine this approach to estimation by eliminating the visually distracting blockiness that has been observed in the previous work. We eliminate the blockiness by discarding the standard assumption that distinct nodes at a given level of our tree correspond to disjoint portions of the image domain; as a consequence of this simple idea, a given image pixel may now correspond to several tree nodes. We develop tools for systematically building overlapping-tree multiscale representations of prespecified statistics, and we develop a corresponding estimation algorithm for this processes. In this way, we achieve nearly optimal estimation results, we generate corresponding error covariance information, and we eliminate blockiness without sacrificing the resolution of fine-scale detail

}, keywords = {canonical correlation analysis, correlation methods, covariance analysis, error analysis, error covariance information, estimation algorithm, estimation theory, fast statistically optimal algorithm, Gaussian processes, Gaussian random processes, image domain, image pixel, image representation, image resolution, multiresolution model, multiscale representations, multiscale stochastic models, optimal estimation results, overlapping trees, random processes, scale recursive dynamics, statistics, tree nodes, trees (mathematics)}, doi = {http://dx.doi.org/10.1109/ICIP.1995.529035}, author = {P Fieguth and W W. Irving and A S. Willsky} }