Turbo segmentation of textured images

We consider the problem of semi-supervised segmentation of textured images. Existing model-based approaches model the intensity field of textured images as a Gauss-Markov random field to take into account the local spatial dependencies between the pixels. Classical Bayesian segmentation consists of also modeling the label field as a Markov random field to ensure that neighboring pixels correspond to the same texture class with high probability. Well-known relaxation techniques are available which find the optimal label field with respect to the maximum a posteriori or the maximum posterior mode criterion. But, these techniques are usually computationally intensive because they require a large number of iterations to converge. In this paper, we propose a new Bayesian framework by modeling two-dimensional textured images as the concatenation of two one-dimensional hidden Markov autoregressive models for the lines and the columns, respectively. A segmentation algorithm, which is similar to turbo decoding in the context of error-correcting codes, is obtained based on a factor graph approach. The proposed method estimates the unknown parameters using the Expectation-Maximization algorithm.     

Adaptive segmentation of noisy and textured images

An image segmentation algorithm is described which is based on the integration of signal model parameter estimates and maximum a posteriori labelling. The parameter estimation is based on either a maximum likelihood-based method for a quadric signal model or a maximum pseudo-likelihood based method for a Gauss-Markov signal model. The first case is applicable to standard grey-level image segmentation as well as segmentation of shaded 3D surfaces, while the second case is applicable to texture segmentation. A key aspect of the algorithm is the incorporation of a coarse to fine processing strategy which limits the search for the optimum labelling at any one resolution to a subset of labellings which are consistent with the optimum labelling at the previous coarser resolution. Consistency is in terms of a prior label model which specifies the conditional probability of a given label in terms of the labelling at the previous level of resolution. It is shown how such an approach leads to a simple relaxation procedure based on local pyramid node computations. An extension of the algorithm is also described which performs accurate inter-region boundary placement using a step-wise refinement procedure based on a simple adaptive filter. The problem of automatic determination of the number of regions is also addressed. It is shown how a simple agglomerative clustering idea, again based on pyramid node computations, can effectively solve this problem.     

基于马尔可夫随机场的纹理图像并行分割

基于消息传递接口（Message Passing Interface,MPI）和消息传递并行编程模型,提出了一种针对计算机集群（Cluster）的纹理图像并行分割算法。该算法使用马尔可夫随机场作为纹理特征,通过将图像分块,把特征提取的计算量均匀的分布到并行系统中的各个节点上,从而极大地减少了计算时间。在遥感图像上的实验发现,该算法在4机并行的环境下可以取得与单机串行程序一样精确的分割,而耗时仅为串行程序的31.95％。令人满意的实验结果表明该并行算法不但可以有效的应用于纹理图像分割,而且也为使用计算机集群实现高时间复杂度的图像处理提供了有益的启示。     

A genetic algorithm for MRF-based segmentation of multi-spectral textured images

A segmentation approach based on a Markov random field (MRF) model is an iterative algorithm; it needs many iteration steps to approximate a near optimal solution or gets a non-suitable solution with a few iteration steps. In this paper, we use a genetic algorithm (GA) to improve an unsupervised MRF-based segmentation approach for multi-spectral textured images. The proposed hybrid approach has the advantage that combines the fast convergence of the MRF-based iterative algorithm and the powerful global exploration of the GA. In experiments, synthesized color textured images and multi-spectral remote-sensing images were processed by the proposed approach to evaluate the segmentation performance. The experimental results reveal that the proposed approach really improves the MRF-based segmentation for the multi-spectral textured images.     

Unsupervised segmentation of textured images by edge detection inmultidimensional feature

An algorithm for unsupervised texture segmentation is developed that is based on detecting changes in textural characteristics of small local regions. Six features derived from two, two-dimensional, noncausal random field models are used to represent texture. These features contain information about gray-level-value variations in the eight principal directions. An algorithm for automatic selection of the size of the observation windows over which textural activity and change are measured has been developed. Effects of changes in individual features are considered simultaneously by constructing a one-dimensional measure of textural change from them. Edges in this measure correspond to the sought-after textural edges. Experiments results with images containing regions of natural texture show that the algorithm performs very well     

Modeling and segmentation of noisy and textured images using gibbs random fields

This paper presents a new approach to the use of Gibbs distributions (GD) for modeling and segmentation of noisy and textured images. Specifically, the paper presents random field models for noisy and textured image data based upon a hierarchy of GD. It then presents dynamic programming based segmentation algorithms for noisy and textured images, considering a statistical maximum a posteriori (MAP) criterion. Due to computational concerns, however, sub-optimal versions of the algorithms are devised through simplifying approximations in the model. Since model parameters are needed for the segmentation algorithms, a new parameter estimation technique is developed for estimating the parameters in a GD. Finally, a number of examples are presented which show the usefulness of the Gibbsian model and the effectiveness of the segmentation algorithms and the parameter estimation procedures.     

均值漂移高分辨率遥感影像多尺度分割的集群实现

多尺度分割是高分辨率遥感信息计算的重要基础,是高分辨率遥感影像图谱认知中“图”提取的关键技术。当前提出的多尺度分割方法普遍存在着占用内存大,耗费计算资源、计算时间长的缺点,并且这些问题随着遥感数据量的增大、算法的改进等进一步加剧。针对这种情况,根据当前集群计算技术的发展,以均值漂移的多尺度分割方法为例,实现了一种基于集群计算环境的多尺度分割算法,集中解决任务分配和结果回收以及数据并行的方式,统计了算法所消耗的时间,对其的效率进行了分析,通过实验说明了集群化对提高多尺度分割效率的有效性。     

A novel method for assessing the segmentation quality of high-spatial resolution remote-sensing images

Image segmentation quality significantly affects subsequent image classification accuracy. It is necessary to develop effective methods for assessing image segmentation quality. In this paper, we present a novel method for assessing the segmentation quality of high-spatial resolution remote-sensing images by measuring both area and position discrepancies between the delineated image region (DIR) and the actual image region (AIR) of a scene object. In comparison with the most frequently used area coincidence-based methods, our method can assess the segmentation quality more objectively in that it takes into consideration all image objects intersecting with the AIR of a scene object. Moreover, the proposed method is more convenient to use than the existing boundary coincidence-based methods in that the calculation of the distance between the boundary of the image object and that of the corresponding AIR of the scene object is not required. Another benefit of this method over the two types of method above is that the assessment procedure of the segmentation quality can be conducted with less human intervention. The obtained optimal segmentation result can ensure maximal delineation of the extent of scene objects and can be beneficial to subsequent classification operations. The experimental results have shown the effectiveness of this new method for both segmentation quality assessment and optimal segmentation parameter selection.     

Unsupervised linear contact distributions segmentation algorithm for land cover high resolution panchromatic images

Multimedia Tools and Applications - Automatic segmentation of land use and land cover from high resolution remote sensing imagery has been an essential research area in image processing for the...     

A method for the segmentation of very high spatial resolution images of forested landscapes

Pixel-by-pixel image analysis methods are not applicable when using VHR image material in multisource forest inventory applications. One possible solution to this problem is to define the units of image analysis by means of image segmentation. The paper presents a two-phase segmentation method (COS) based on segmentation in the feature space and co-occurrence region merging (CRM). The resulting segments were tested in the spectral feature extraction, and the estimation of plot-level total volume and volumes by tree species. The study material consisted of an AISA spectrometer image and 254 relascope field data plots. Two different segmentations were derived and the performance of segment-based feature sets were compared to that of a feature set extracted from the local neighbourhood of the field plots. Cross-validation techniques and a k-nn estimator were applied in the estimation tests. The estimation results which had the smallest rms errors were achieved with segment-based features in the cases of total volume and the volume of deciduous species. In the cases of pine and spruce, the features from the local neighbourhood performed best. The study suggests that COS produces segments which can be used as units for further image analysis.     

Semantic segmentation of high-resolution images

Image semantic segmentation is a research topic that has emerged recently. Although existing approaches have achieved satisfactory accuracy, they are limited to handling low-resolution images owing to their large memory consumption. In this paper, we present a semantic segmentation method for high-resolution images. First, we downsample the input image to a lower resolution and then obtain a low-resolution semantic segmentation image using state-of-the-art methods. Next, we use joint bilateral upsampling to upsample the low-resolution solution and obtain a high-resolution semantic segmentation image. To modify joint bilateral upsampling to handle discrete semantic segmentation data, we propose using voting instead of interpolation in filtering computation. Compared to state-of-the-art methods, our method significantly reduces memory cost without reducing result quality.     

Multi-agent segmentation of IVUS images

A novel multi-agent image interpretation system has been developed which is markedly different from previous approaches in especially its elaborate high-level knowledge-based control over low-level image segmentation algorithms. Agents dynamically adapt segmentation algorithms based on knowledge about global constraints, contextual knowledge, local image information and personal beliefs. Generally agent control allows the underlying segmentation algorithms to be simpler and be applied to a wider range of problems with a higher reliability.The agent knowledge model is general and modular to support easy construction and addition of agents to any image processing task. Each agent in the system is further responsible for one type of high-level object and cooperates with other agents to come to a consistent overall image interpretation. Cooperation involves communicating hypotheses and resolving conflicts between the interpretations of individual agents.The system has been applied to IntraVascular UltraSound (IVUS) images which are segmented by five agents, specialized in lumen, vessel, calcified-plaque, shadow and sidebranch detection. IVUS image sequences from 7 patients were processed and vessel and lumen contours were detected fully automatically. These were compared with expert-corrected semiautomatically detected contours. Results show good correlations between agents and expert with r=0.84 for the lumen and r=0.92 for the vessel cross-sectional areas, respectively.     

Model-based segmentation of grey-tone images

A model-based approach to grey-tone image segmentation is presented. A conceptual and computational frame is described, in which a variety of image models can be accommodated. Each model is defined by a feature pair and implies a uniformity criterion for ideal regions. Some particularly relevant models are described in detail and illustrated by means of experimental results obtained with real-world images.     

Edge-region-based segmentation of range images

In this correspondence, we present a new computationally efficient three-dimensional (3-D) object segmentation technique. The technique is based on the detection of edges in the image. The edges can be classified as belonging to one of the three categories: fold edges, semistep edges (defined here), and secondary edges. The 3-D image is sliced to create equidepth contours (EDCs). Three types of critical points are extracted from the EDCs. A subset of the edge pixels is extracted first using these critical points. The edges are grown from these pixels through the application of some masks proposed in this correspondence. The constraints of the masks can be adjusted depending on the noise present in the image. The total computational effort is small since the masks are applied only over a small neighborhood of critical points (edge regions). Furthermore, the algorithm can be implemented in parallel, as edge growing from different regions can be carried out independently of each other     

Histogram-based automatic segmentation of images

Neural Computing and Applications - The segmentation process is defined by separating the objects as clustering in the images. The most used method in the segmentation is k-means clustering...     

Modeling textured images using generalized long correlation models

The long correlation (LC) models are a general class of random field (RF) models which are able to model correlations, extending over large image regions with few model parameters. The LC models have seen limited use, due to lack of an effective method for estimating the model parameters. In this work, we develop an estimation scheme for a very general form of this model and demonstrate its applicability to texture modeling applications. The relationship of the generalized LC models to other classes of RF models, namely the simultaneous autoregressive (SAR) and Markov random field (MRF) models, is shown. While it is known that the SAR model is a special case of the LC model, we show that the MRF model is also encompassed by this model. Consequently, the LC model may be considered as a generalization of the SAR and MRF models     

多图像融合的连续腹腔影像图像分割

为实现连续腹腔影像图像分割的实时性和准确性,提出多图像融合的水平集图像分割模型。该模型通过Chan-Vese模型在预分割图像基础上获取形状信息,同时利用Li模型进一步在原始图像上获取边缘信息,以提取腹腔影像图中感兴趣区域;对相邻且变化缓慢的连续腹腔影像图,可将前一幅的分割结果作为下一幅的预分割图像,从而提高连续影像图像的分割效率。初步实验结果表明,该模型能实现目标区域相对连通的腹腔影像图像的有效分割,并且在处理连续腹腔影像图时处理效率较传统的方法有较大提高。     

Automated segmentation of brain MR images

A simple, robust and efficient image segmentation algorithm for classifying brain tissues from dual echo Magnetic Resonance (MR) images is presented. The algorithm consists of a sequence of adaptive histogram analysis, morphological operations and knowledge based rules to accurately classify various regions such as the brain matter and the cerebrospinal fluid, and detect if there are any abnormal regions. It can be completely automated and has been tested on over hundred images from several patient studies. Experimental results are provided.