Binary Graph Cut Research Articles

Lane Line Identification and Research Based on Markov Random Field

In view of the poor robustness and low accuracy in lane line identification based on digital image processing, this paper proposes a Markov random field intelligent algorithm based on machine learning to identify lane lines. The complete lane line identification steps are as follows: First, high-quality traffic scenario images are created by means of image preprocessing, which includes image graying, grayscale transformation, and the extraction of regions of interest (ROIs). Then, the images are modeled according to Markov random field theory, and model reasoning is performed based on the binary graph cut method. In the reasoning process, to achieve accurate lane line segmentation, i.e., the optimal solution of the model, the energy potential function is introduced to optimize the binary graph cut method. Finally, the lane line pixel label is marked according to the segmentation result. The experiments showed that the algorithm could accurately segment the lane line pixels after only 10 iterations, indicating that the identification method has good performance in both reasoning speed and identification accuracy, which takes account of both accuracy and real-time processing, and can meet the requirements of lane recognition for lightweight automatic driving systems.

Automatic foreground detection based on KDE and binary classification

In the recent decades, several methods have been developed to extract moving objects in the presence of dynamic background. However, most of them use a global threshold, and ignore the correlation between neighboring pixels. To address these issues, this paper presents a new approach to generate a probability image based on Kernel Density Estimation (KDE) method, and then apply the Maximum A Posteriori in the Markov Random Field (MAP-MRF) based on probability image, so as to generate an energy function, this function will be minimized by the binary graph cut algorithm to detect the moving pixels instead of applying a thresholding step. The proposed method was tested on various video sequences, and the obtained results showed its effectiveness in presence of a dynamic scene, compared to other background subtraction models.

Digital Multi-Focusing From a Single Photograph Taken With an Uncalibrated Conventional Camera

The demand to restore all-in-focus images from defocused images and produce photographs focused at different depths is emerging in more and more cases, such as low-end hand-held cameras and surveillance cameras. In this paper, we manage to solve this challenging multi-focusing problem with a single image taken with an uncalibrated conventional camera. Different from all existing multi-focusing approaches, our method does not need to include a deconvolution process, which is quite time-consuming and will cause ringing artifacts in the focused region and low depth-of-field. This paper proposes a novel systematic approach to realize multi-focusing from a single photograph. First of all, with the optical explanation for the local smooth assumption, we present a new point-to-point defocus model. Next, the blur map of the input image, which reflects the amount of defocus blur at each pixel in the image, is estimated by two steps. 1) With the sharp edge prior, a rough blur map is obtained by estimating the blur amount at the edge regions. 2) The guided image filter is applied to propagate the blur value from the edge regions to the whole image by which a refined blur map is obtained. Thus far, we can restore the all-in-focus photograph from a defocused input. To further produce photographs focused at different depths, the depth map from the blur map must be derived. To eliminate the ambiguity over the focal plane, user interaction is introduced and a binary graph cut algorithm is used. So we introduce user interaction and use a binary graph cut algorithm to eliminate the ambiguity over the focal plane. Coupled with the camera parameters, this approach produces images focused at different depths. The performance of this new multi-focusing algorithm is evaluated both objectively and subjectively by various test images. Both results demonstrate that this algorithm produces high quality depth maps and multi-focusing results, outperforming the previous approaches.

Unsupervised color–texture segmentation based on multiscale quaternion Gabor filters and splitting strategy

This paper proposes a new method for color–texture segmentation based on a splitting framework with graph cut technique. To process the scale difference of quaternion Gabor filter (QGF) features of a color textured image, a new multiscale QGF (MQGF) is introduced to describe texture attributes of the given image. Then, the segmentation is formulated in terms of energy minimization gradually obtained using binary graph cuts, where color and MQGF features are modeled with a multivariate finite mixture model, and minimum description length (MDL) principle is integrated into this framework as a splitting criterion. In contrast to previous approaches, our method finds an optimal segmentation by balancing energy cost and coding length, and the segmentation result is determined during the splitting process automatically. Experimental results on both synthetic and real natural color textured images demonstrate the good performance of the proposed method.

Reliable estimation of incoherent motion parametric maps from diffusion-weighted MRI using fusion bootstrap moves

Diffusion-weighted MRI has the potential to provide important new insights into physiological and microstructural properties of the body. The Intra-Voxel Incoherent Motion (IVIM) model relates the observed DW-MRI signal decay to parameters that reflect blood flow in the capillaries (D*), capillaries volume fraction (f), and diffusivity (D). However, the commonly used, independent voxel-wise fitting of the IVIM model leads to imprecise parameter estimates, which has hampered their practical usage. In this work, we improve the precision of estimates by introducing a spatially-constrained Incoherent Motion (IM) model of DW-MRI signal decay. We also introduce an efficient iterative "fusion bootstrap moves" (FBM) solver that enables precise parameter estimates with this new IM model. This solver updates parameter estimates by applying a binary graph-cut solver to fuse the current estimate of parameter values with a new proposal of the parameter values into a new estimate of parameter values that better fits the observed DW-MRI data. The proposals of parameter values are sampled from the independent voxel-wise distributions of the parameter values with a model-based bootstrap resampling of the residuals. We assessed both the improvement in the precision of the incoherent motion parameter estimates and the characterization of heterogeneous tumor environments by analyzing simulated and in vivo abdominal DW-MRI data of 30 patients, and in vivo DW-MRI data of three patients with musculoskeletal lesions. We found our IM-FBM reduces the relative root mean square error of the D* parameter estimates by 80%, and of the f and D parameter estimates by 50% compared to the IVIM model with the simulated data. Similarly, we observed that our IM-FBM method significantly reduces the coefficient of variation of parameter estimates of the D* parameter by 43%, the f parameter by 37%, and the D parameter by 17% compared to the IVIM model (paired Student's t-test, p<0.0001). In addition, we found our IM-FBM method improved the characterization of heterogeneous musculoskeletal lesions by means of increased contrast-to-noise ratio of 19.3%. The IM model and FBM solver combined, provide more precise estimate of the physiological model parameter values that describing the DW-MRI signal decay and a better mechanism for characterizing heterogeneous lesions than does the independent voxel-wise IVIM model.

Segmentation of epithelium in H&amp;E stained odontogenic cysts

An algorithm for the automated segmentation of epithelial tissue in digital images of histologic tissue sections of odontogenic cysts (cysts originating from residual odontogenic epithelium) is presented. The algorithm features an image standardization process that greatly reduces variation in luminance and chrominance between images due to variations in sample preparation. Segmentation of the epithelial regions of images uses an algorithm based on binary graph cuts where graph weights depend on probabilities obtained from colour histogram models of epithelium and stroma image regions. Algorithm training used a data set of 38 images of four types of odontogenic cyst and was tested using a separate data set of 35 images of the same four cyst types. The best parameters for the segmentation algorithm were determined using a response-surface optimizer. The best parameter set resulted in an overall mean (± std. dev.) sensitivity of 91.5 ± 17% and overall mean specificity of 85.1 ± 18.6% on the training set. Particularly good results were obtained for dentigerous and odontogenic keratocysts for which the mean sensitivities/specificities were 91.9 ± 6.15%/97.4 ± 2.15% and 96.1 ± 1.98%/98.7 ± 3.16%, respectively. Our method is potentially applicable to many pathological conditions in similar tissues, such as skin and mucous membranes where there is a clear microscopic distinction between epithelium and connective tissues.

Multi-view video based multiple objects segmentation using graph cut and spatiotemporal projections

In this paper, we present an automatic algorithm to segment multiple objects from multi-view video. The Initial Interested Objects (IIOs) are automatically extracted in the key view of the initial frame based on the saliency model. Multiple objects segmentation is decomposed into several sub-segmentation problems, and solved by minimizing the energy function using binary label graph cut. In the proposed novel energy function, the color and depth cues are integrated with the data term, which is then modified with background penalty with occlusion reasoning. In the smoothness term, foreground contrast enhancement is developed to strengthen the moving objects boundary, and at the same time attenuates the background contrast. To segment the multi-view video, the coarse predictions of the other views and the successive frame are projected by pixel-based disparity and motion compensation, respectively, which exploits the inherent spatiotemporal consistency. Uncertain band along the object boundary is shaped based on activity measure and refined with graph cut, resulting in a more accurate Interested Objects (IOs) layer across all views of the frames. The experiments are implemented on a couple of multi-view videos with real and complex scenes. Excellent subjective results have shown the robustness and efficiency of the proposed algorithm.

Graph Cuts and Efficient N-D Image Segmentation

Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features of combinatorial graph cuts methods in vision: global optima, practical efficiency, numerical robustness, ability to fuse a wide range of visual cues and constraints, unrestricted topological properties of segments, and applicability to N-D problems. Graph cuts based approaches to object extraction have also been shown to have interesting connections with earlier segmentation methods such as snakes, geodesic active contours, and level-sets. The segmentation energies optimized by graph cuts combine boundary regularization with region-based properties in the same fashion as Mumford-Shah style functionals. We present motivation and detailed technical description of the basic combinatorial optimization framework for image segmentation via s/t graph cuts. After the general concept of using binary graph cut algorithms for object segmentation was first proposed and tested in Boykov and Jolly (2001), this idea was widely studied in computer vision and graphics communities. We provide links to a large number of known extensions based on iterative parameter re-estimation and learning, multi-scale or hierarchical approaches, narrow bands, and other techniques for demanding photo, video, and medical applications.