Search

In the realm of digital image applications, image processing technology occupies a pivotal position, with image segmentation serving as a foundational component. As the digital image application domain expands across industries, the conventional segmentation techniques increasingly challenge to cater to modern demands. To address this gap, this paper introduces an MCMC-based image segmentation algorithm based on the Markov Random Field (MRF) model, marking a significant stride in the field. The novelty of this research lies in its method that capitalizes on domain information in pixel space, amplifying the local segmentation precision of image segmentation algorithms. Further innovation is manifested in the development of an adaptive segmentation image denoising algorithm based on MCMC sampling. This algorithm not only elevates image segmentation outcomes, but also proficiently denoises the image. In the experimental results, MRF-MCMC achieves better segmentation performance, with an average segmentation accuracy of 94.26% in Lena images, significantly superior to other common image segmentation algorithms. In addition, the study proposes that the denoising model outperforms other algorithms in peak signal-to-noise ratio and structural similarity in environments with noise standard deviations of 15, 25, and 50. In essence, these experimental findings affirm the efficacy of this study, opening avenues for refining digital image segmentation methodologies. [ABSTRACT FROM AUTHOR]

Cloud detection is critical in remote sensing image processing, and convolutional neural networks (CNNs) have significantly advanced this field. However, traditional CNNs primarily focus on extracting local features, which can be challenging for cloud detection due to the variability in the size, shape, and boundaries of clouds. To address this limitation, we propose a hybrid Swin transformer–CNN cloud detection (STCCD) network that combines the strengths of both architectures. The STCCD network employs a novel dual-stream encoder that integrates Swin transformer and CNN blocks. Swin transformers can capture global context features more effectively than traditional CNNs, while CNNs excel at extracting local features. The two streams are fused via a fusion coupling module (FCM) to produce a richer representation of the input image. To further enhance the network's ability in extracting cloud features, we incorporate a feature fusion module based on the attention mechanism (FFMAM) and an aggregation multiscale feature module (AMSFM). The FFMAM selectively merges global and local features based on their importance, while the AMSFM aggregates feature maps from different spatial scales to obtain a more comprehensive representation of the cloud mask. We evaluated the STCCD network on three challenging cloud detection datasets (GF1-WHU, SPARCS, and AIR-CD), as well as the L8-Biome dataset to assess its generalization capability. The results show that the STCCD network outperformed other state-of-the-art methods on all datasets. Notably, the STCCD model, trained on only four bands (visible and near-infrared) of the GF1-WHU dataset, outperformed the official Landsat-8 Fmask algorithm in the L8-Biome dataset, which uses additional bands (shortwave infrared, cirrus, and thermal). [ABSTRACT FROM AUTHOR]

Background: Image segmentation pipelines are commonly used in microscopy to identify cellular compartments like nucleus and cytoplasm, but there are few standards for comparing segmentation accuracy across pipelines. The process of selecting a segmentation assessment pipeline can seem daunting to researchers due to the number and variety of metrics available for evaluating segmentation quality. Results: Here we present automated pipelines to obtain a comprehensive set of 69 metrics to evaluate segmented data and propose a selection methodology for models based on quantitative analysis, dimension reduction or unsupervised classification techniques and informed selection criteria. Conclusion: We show that the metrics used here can often be reduced to a small number of metrics that give a more complete understanding of segmentation accuracy, with different groups of metrics providing sensitivity to different types of segmentation error. These tools are delivered as easy to use python libraries, command line tools, Common Workflow Language Tools, and as Web Image Processing Pipeline interactive plugins to ensure a wide range of users can access and use them. We also present how our evaluation methods can be used to observe the changes in segmentations across modern machine learning/deep learning workflows and use cases. [ABSTRACT FROM AUTHOR]

The intrinsic high parallelism and entanglement characteristics of quantum computing have made quantum image processing techniques a focus of great interest. One of the most widely used techniques in image processing is segmentation, which in one of their most basic forms can be carried out using thresholding algorithms. In this paper, a fault-tolerant quantum dual-threshold algorithm has been proposed. This algorithm has been built using only Clifford+T gates for compatibility with error detection and correction codes. Because fault-tolerant implementation of T gates has a much higher cost than other quantum gates, our focus has been on reducing the number of these gates. This has allowed adding noise tolerance, computational cost reduction, and fault tolerance to the state-of-the-art dual-threshold segmentation circuits. Since the dual-threshold image segmentation involves the comparison operation, as part of this work we have implemented two full comparator circuits. These circuits optimize the metrics T-count and T-depth with respect to the best circuit comparators currently available in the literature. [ABSTRACT FROM AUTHOR]

Cracks are fractures or breaks that occur in materials such as concrete, metals, rocks, and other solids. Various methods are used to detect and monitor cracks; among many of them, image-based methodologies allow fast identification of the distress and easy quantification of the percentage of cracks in the scene. Two main categories can be identified: classical and deep learning approaches. In the last decade, the tendency has moved towards the use of the latter. Even though they have proven their outstanding predicting performance, they suffer some drawbacks: a "black-box" nature leaves the user blind and without the possibility of modifying any parameters, a huge amount of labeled data is generally needed, a process that requires expert judgment is always required, and, finally, they tend to be time-consuming. Accordingly, the present study details the methodology for a new algorithm for crack segmentation based on the theory of minimal path selection combined with a region-based approach obtained through the segmentation of texture features extracted using Gabor filters. A pre-processing step is described, enabling the equalization of brightness and shadows, which results in better detection of local minima. These local minimal are constrained by a minimum distance between adjacent points, enabling a better coverage of the cracks. Afterward, a region-based segmentation technique is introduced to determine two areas that are used to determine threshold values used for rejection. This step is critical to generalize the algorithm to images presenting close-up scenes or wide cracks. Finally, a geometrical thresholding step is presented, allowing the exclusion of rounded areas and small isolated cracks. The results showed a very competitive F1-score (0.839), close to state-of-the-art values achieved with deep learning techniques. The main advantage of this approach is the transparency of the workflow, contrary to what happens with deep learning frameworks. In the proposed approach, no prior information is required; however, the statistical parameters may have to be adjusted to the particular case and requirements of the situation. The proposed algorithm results in a useful tool for researchers and practitioners needing to validate their results against some reference or needing labeled data for their models. Moreover, the current study could establish the grounds to standardize the procedure for crack segmentation with a lower human bias and faster results. The direct application of the methodology to images obtained with any low-cost sensor makes the proposed algorithm an operational support tool for authorities needing crack detection systems in order to monitor and evaluate the current state of the infrastructures, such as roads, tunnels, or bridges. [ABSTRACT FROM AUTHOR]

Multi-level thresholding image segmentation divides an image into multiple regions of interest and is a key step in image processing and image analysis. Aiming toward the problems of the low segmentation accuracy and slow convergence speed of traditional multi-level threshold image segmentation methods, in this paper, we present multi-level thresholding image segmentation based on an improved slime mould algorithm (ISMA) and symmetric cross-entropy for global optimization and image segmentation tasks. First, elite opposition-based learning (EOBL) was used to improve the quality and diversity of the initial population and accelerate the convergence speed. The adaptive probability threshold was used to adjust the selection probability of the slime mould to enhance the ability of the algorithm to jump out of the local optimum. The historical leader strategy, which selects the optimal historical information as the leader for the position update, was found to improve the convergence accuracy. Subsequently, 14 benchmark functions were used to evaluate the performance of ISMA, comparing it with other well-known algorithms in terms of the optimization accuracy, convergence speed, and significant differences. Subsequently, we tested the segmentation quality of the method proposed in this paper on eight grayscale images and compared it with other image segmentation criteria and well-known algorithms. The experimental metrics include the average fitness (mean), standard deviation (std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), and feature similarity index (FSIM), which we utilized to evaluate the quality of the segmentation. The experimental results demonstrated that the improved slime mould algorithm is superior to the other compared algorithms, and multi-level thresholding image segmentation based on the improved slime mould algorithm and symmetric cross-entropy can be effectively applied to the task of multi-level threshold image segmentation. [ABSTRACT FROM AUTHOR]

The density peaks clustering (DPC) algorithm can identify clusters with various shapes and densities in the underlying dataset. However, the DPC algorithm cannot exactly find the true quantity of clustering centers when computing the local density, and it is difficult to handle non‐convex datasets. Moreover, the DPC algorithm is difficult to identify boundary points and outliers without a reasonable allocation strategy when dealing with low‐density points. To solve these limitations, a novel deviation density peaks clustering (DeDPC) algorithm is proposed. First, the local deviation of the spatial distance of datasets with different structures is utilised to replace the local density to generate a more reasonable clustering center decision graph. Second, a threshold is defined to further divide and process low‐density points. Finally, outliers in low‐density points can be accurately found to accurately cluster the dataset. To evaluate the performance of the DeDPC algorithm, experiments are conducted on synthetic and real‐world datasets and the DeDPC is compared with other clustering methods. The DeDPC is also applied to medical image segmentation to further demonstrate its capability for medical image processing. The simulation results show that the DeDPC method has good validity and utility for both non‐convex datasets and medical image segmentation. [ABSTRACT FROM AUTHOR]

Three-dimensional (3D) ground-penetrating radar is an effective method for detecting internal crack damage in pavement structures. Inefficient manual interpretation of radar images and high personnel requirements have substantially restrained the generalization of 3D ground-penetrating radar. An improved Crack Unet model based on the Unet semantic segmentation model is proposed herein for 3D ground-penetrating radar crack image processing. The experiment showed that the MPA, MioU, and accuracy of the model were improved, and it displayed better capacity in the radar image crack segmentation task than current mainstream algorithms do, such as deepLabv3, PSPNet, and Unet. In the test dataset without cracks, Crack Unet is on the same level as deepLabv3 and PSPNet, which can meet engineering requirements and display a significant improvement compared with Unet. According to the ablation experiment, the MPA and MioU of Unet configured with PMDA, MC-FS, and RS modules were larger than those of Unet configured with one or two modules. The PMDA module adopted by the Crack Unet model showed a higher MPA and MioU than the SE module and the CBAM module did, respectively. The results show that the Crack Unet model has a better segmentation ability than the current mainstream algorithms do in the task of the crack segmentation of radar images, and the performance of crack segmentation is significantly improved compared with the Unet model. The Crack Unet model has excellent engineering application value in the task of the crack segmentation of radar images. [ABSTRACT FROM AUTHOR]

There is a constant rise in the amount of data being copied or plagiarized because of the abundance of content and information freely available across the internet. Even though the systems try to check documents for the plagiarism, there have been trials to overcome these system checks. In this paper, the concept of character injection is used to trick plagiarism checker is presented. It is also showcased that how does the similarity check algorithms based on k-grams fail to detect the character injection. In order to eradicate the problem or error in similarity rates caused due to the problem of character injection, image processing based approach of multiple histogram projections are used. An application is developed to detect the character injection in the document and produce the accurate similarity rate. The results are shown with some test documents and the proposed method eliminates any kind of character injected in the document that tricks plagiarism. The proposed method has addressed the problem of character injection with image processing based changes in the existing methods of document-similarity check algorithms using k-grams. The proposed method can detect 100% injected character be it any alphabet of any language, The processing time for conversion, histogram projections and applying winnowing algorithm takes 1.2 sec per page on average when experimented on multiple types of document varying in size from 2 KB to 10 MB. [ABSTRACT FROM AUTHOR]

As we know, image colorization is widely used in computer graphics and has become a research hotspot in the field of image processing. Current image colorization technology has the phenomenon of single coloring effect and unreal color, which is too complicated to be implemented and struggled to gain popularity. In this paper, a new method based on a convolution neural network is proposed to study the reasonable coloring of human images and ensures the realism of the coloring effect and the diversity of coloring at the same time. First, this paper selects about 5000 pictures of people and plants from the Imagenet dataset and makes a small dataset containing only people and backgrounds. Secondly, in order to obtain the image segmentation results, this paper improves the U-net network and carries out three times of down sampling and three times of up-sampling. Finally, we add the expanded convolution, and use the sigmoid activation function to replace the ReLU (The Rectified Linear Unit) activation function and put the BN (Batch Normalization) before the activation function. Experimental results show that our proposed image colorization algorithm based on the deep learning scheme can reduce the training time of the network and achieve higher quality segmentation results. [ABSTRACT FROM AUTHOR]

Among the congenital coronary heart diseases, atrial septal defect constitutes the 1/3 most common type. In many cases, the affected person stays asymptomatic for the duration of the youth even having big shunts. Methodologies that may be hired for figuring out the defects are: echocardiogram, chest X-ray, electrocardiogram, cardiac catheterization, MRI, CT scan, phonocardiogram. Deep learning may be correctly utilised for the automatic estimation of the illness from the test result. The purpose of this review paper is to offer an perception into ASD, the strategies for figuring out it and the application of deep learning models for distinguishing the illness. The paper opinions diverse algorithms used for identity of defects also points out the restrictions of every algorithm. [ABSTRACT FROM AUTHOR]

Superpixel segmentation for polarimetric synthetic aperture radar (PolSAR) images plays a key role in remote-sensing tasks, such as ship detection and land-cover classification. However, the existing methods cannot directly generate multi-scale superpixels in a hierarchical style and they will take a long time when multi-scale segmentation is executed separately. In this article, we propose an effective and accurate hierarchical superpixel segmentation method, by introducing a minimum spanning tree (MST) algorithm called the Boruvka algorithm. To accurately measure the difference between neighboring pixels, we obtain the scattering mechanism information derived from the model-based refined 5-component decomposition (RFCD) and construct a comprehensive dissimilarity measure. In addition, the edge strength map and homogeneity measurement are considered to make use of the structural and spatial distribution information in the PolSAR image. On this basis, we can generate superpixels using the distance metric along with the MST framework. The proposed method can maintain good segmentation accuracy at multiple scales, and it generates superpixels in real time. According to the experimental results on the ESAR and AIRSAR datasets, our method is faster than the current state-of-the-art algorithms and preserves somewhat more image details in different segmentation scales. [ABSTRACT FROM AUTHOR]

In the field of medical image processing, due to the differences in tissues, organs, and imaging methods, obtained medical images have significant differences. With the development of intelligence in medicine, an increasing number of computing optimization algorithms based on AI technology have also been applied to the field of medicine. Because the image segmentation algorithm based on the semisupervised self-training algorithm solves initialization class center large randomness problem in the traditional cluster-based image segmentation algorithm, this article aims to integrate the artificial intelligence semisupervised self-training algorithm into the pathological tissue image segmentation problem. An experimental group is designed to collect sample images and the algorithm proposed in this article is used to perform image segmentation to achieve a better visual experience and images. Although there is no general image segmentation theory, many scholars have been committed to applying new concepts and new methods to image segmentation in recent years and combining specific theoretical image segmentation methods has achieved good application results in image segmentation. For example, wavelet analysis, wavelet transform, neural networks, and genetic algorithms can effectively improve the segmentation effect. The results of the Seg cutting method designed in this article show that, in retinal blood vessel segmentation results on a database of healthy people, the sensitivity value is 0.941633, the false-positive rate is 0.952933, the specificity is 0.956787, and the accuracy rate is 0.96182, which are all higher than those in other methods. Image cutting methods such as FNN, CNN, and AWN have addressed the case tissue image cutting problem. Using the Seg cutting method designed in this article to segment the retinal blood vessels on a diabetes patient database, the sensitivity value is 0.8106, the false-positive rate is 0.0511, the specificity is 0.9712, the accuracy is 0.9421, and the false-positive rate is omitted. The false-positive rate is lower than AWN, and other indicators are higher than FNN, CNN, AWN, and other image cutting methods. The application of artificial intelligence-based semisupervised self-training algorithms in pathological tissue image segmentation is realized. [ABSTRACT FROM AUTHOR]

Accurate digital image segmentation is necessary for analyzing the characteristics of fuel spray from various optical measurements. However, some conventional segmentation methods cannot achieve the desired effect for the difficult task with severe noises such as schlieren images under diesel engine-like conditions. In this work, an image processing algorithm named Texture Assessment by Gradient Statistics (TAGS) was proposed for improving the recognition of spray images with noisy backgrounds, which utilizes gradient statistics reflecting texture to distinguish the spray region from the background region. The effects of the key parameters in the proposed algorithm on the segmentation quality were studied. And for validating the applicability and generalization of the proposed algorithm, a series of experiments on diesel evaporating sprays were conducted through high-speed photography of Mie-scattering and double-pass schlieren. It was found that the extraction of gradient statistics can enhance the difference between the spray and the background regions when their gray values are close, which contributes to the image segmentation. For the schlieren images with noisy backgrounds, the signal-to-noise ratio of the TAGS method increased from 1.24 to 9.40 compared with the conventional gray value subtraction thresholding method. The segmentation quality has low dependence on the algorithm parameters of TAGS, and a parameter setting method for its image processing program has been recommended, which enables the analysis of spray characteristics including the macroscopic morphology, the tip penetration and the projected area of liquid/vapor phases. [ABSTRACT FROM AUTHOR]

Background: Image segmentation is considered an important step in image processing. Fuzzy c-means clustering is one of the common methods of image segmentation. However, this method suffers from drawbacks, such as sensitivity to initial values, entrapment in local optima, and the inability to distinguish objects with similar color intensity. This paper proposes the hybrid Fuzzy c-means clustering and Gray wolf optimization for image segmentation to overcome the shortcomings of Fuzzy c-means clustering. The Gray wolf optimization has a high exploration capability in finding the best solution to the problem, which prevents the entrapment of the algorithm in local optima. In this study, breast cytology images were used to validate the methods, and the results of the proposed method were compared to those of c-means clustering. Results: FCMGWO has performed better than FCM in separating the nucleus from the other dark objects in the cell. The clustering was validated using Vpc, Vpe, Davies-Bouldin, and Calinski Harabasz criteria. The FCM and FCMGWO methods have a significant difference with respect to the Vpc and Vpe indexes. However, there is no significant difference between the performances of the two clustering methods with respect to the Calinski-Harabasz and Davies-Bouldin indices. The results indicate the better efficacy of the proposed method. Conclusions: The hybrid FCMGWO algorithm distinguishes the cells better in images with less detail than in images with high detail. However, FCM exhibits unacceptable performance in both low- and high-detail images. [ABSTRACT FROM AUTHOR]

We introduce a novel edge tracing algorithm using Gaussian process regression. Our edge-based segmentation algorithm models an edge of interest using Gaussian process regression and iteratively searches the image for edge pixels in a recursive Bayesian scheme. This procedure combines local edge information from the image gradient and global structural information from posterior curves, sampled from the model’s posterior predictive distribution, to sequentially build and refine an observation set of edge pixels. This accumulation of pixels converges the distribution to the edge of interest. Hyperparameters can be tuned by the user at initialisation and optimised given the refined observation set. This tunable approach does not require any prior training and is not restricted to any particular type of imaging domain. Due to the model’s uncertainty quantification, the algorithm is robust to artefacts and occlusions which degrade the quality and continuity of edges in images. Our approach also has the ability to efficiently trace edges in image sequences by using previous-image edge traces as a priori information for consecutive images. Various applications to medical imaging and satellite imaging are used to validate the technique and comparisons are made with two commonly used edge tracing algorithms. [ABSTRACT FROM AUTHOR]

Image segmentation is one of the pivotal steps in image processing. Actually, it deals with the partitioning of the image into different classes based on pixel intensities. This work introduces a new image segmentation method based on the constriction coefficient‐based particle swarm optimization and gravitational search algorithm (CPSOGSA). The random samples of the image act as searcher agents of the CPSOGSA algorithm. The optimal number of thresholds is determined using Kapur's entropy method. The effectiveness and applicability of CPSOGSA in image segmentation is accomplished by applying it to five standard images from the USC‐SIPI image database, namely Aeroplane, Cameraman, Clock, Lena, and Pirate. Various performance metrics are employed to investigate the simulation outcomes, including optimal thresholds, standard deviation, MSE (mean square error), run time analysis, PSNR (peak signal to noise ratio), best fitness value calculation, convergence maps, segmented image graphs, and box plot analysis. Moreover, image accuracy is benchmarked by utilizing SSIM (structural similarity index measure) and FSIM (feature similarity index measure) metrics. Also, a pairwise non‐parametric signed Wilcoxon rank‐sum test is utilized for statistical verification of simulation results. In addition, the experimental outcomes of CPSOGSA are compared with eight different algorithms including standard PSO, classical GSA, PSOGSA, SCA (sine cosine algorithm), SSA (salp swarm algorithm), GWO (grey wolf optimizer), MFO (moth flame optimizer), and ABC (artificial bee colony). The simulation results clearly indicate that the hybrid CPSOGSA has successfully provided the best SSIM, FSIM, and threshold values to the benchmark images. [ABSTRACT FROM AUTHOR]

Background: Immunofluorescent confocal microscopy uses labeled antibodies as probes against specific macromolecules to discriminate between multiple cell types. For images of the developmental mouse lung, these cells are themselves organized into densely packed higher-level anatomical structures. These types of images can be challenging to segment automatically for several reasons, including the relevance of biomedical context, dependence on the specific set of probes used, prohibitive cost of generating labeled training data, as well as the complexity and dense packing of anatomical structures in the image. The use of an application ontology helps surmount these challenges by combining image data with its metadata to provide a meaningful biological context, modeled after how a human expert would make use of contextual information to identify histological structures, that constrains and simplifies the process of segmentation and object identification. Results: We propose an innovative approach for the semi-supervised analysis of complex and densely packed anatomical structures from immunofluorescent images that utilizes an application ontology to provide a simplified context for image segmentation and object identification. We describe how the logical organization of biological facts in the form of an ontology can provide useful constraints that facilitate automatic processing of complex images. We demonstrate the results of ontology-guided segmentation and object identification in mouse developmental lung images from the Bioinformatics REsource ATlas for the Healthy lung database of the Molecular Atlas of Lung Development (LungMAP1) program Conclusion: We describe a novel ontology-guided approach to segmentation and classification of complex immunofluorescence images of the developing mouse lung. The ontology is used to automatically generate constraints for each image based on its biomedical context, which facilitates image segmentation and classification. [ABSTRACT FROM AUTHOR]

In this article, a method is presented for automatic scaling of the F-layer from ionograms based on an image processing technique for the extraction of curvilinear structures. The algorithm obtains the ordinary and extraordinary traces and determines the F2 critical frequency. The performance was tested using a wide data set of ionograms recorded by the Advanced Ionospheric Sounder/Istituto Nazionale di Geofisica e Vulcanologia (AIS/INGV) ionosonde located at Universidad Nacional de Tucumán, Tucuman, Argentina, and the results are compared with manual scaling and also with Autoscala method. Results from these tests show that the method is feasible and can be the seed for the development of a robust automated scaling system. [ABSTRACT FROM AUTHOR]

Aiming at the fault states of the split pins in the catenary fastening devices of high-speed railway, such as missing, loosening, and improper installation, a method for detecting the defects in the split pins is proposed. First, the split pins are localized by a two-stage positioning method based on the improved YOLOV3 algorithm. The first stage is used to localize five joint components on the catenary support devices and the second stage is applied to locate the split pins in the joint component images. Then, the deeplabv3+ algorithm is implemented for semantic segmentation on the split-pin images. Finally, the split pins are classified based on the semantic segmentation images, in accordance with the split-pins’ semantic information of the head, body, and tail. In order to verify the adaptability and accuracy of the proposed method, the catenary support device images in the multihigh-speed railway lines and multienvironments were tested. Meanwhile, our algorithm is compared with other deep learning algorithm. The results show that the proposed method has a higher accuracy in detecting the defects in the split pins, which can guarantee the stable operation of the catenary support devices. [ABSTRACT FROM AUTHOR]

The classification methods based on minimum spanning forest (MSF) have yielded impressive results for hyperspectral image. However, previous methods exist several drawbacks, i.e., marker selection methods are easily affected by boundary noise pixels, dissimilarity measure methods between pixels are inaccurate, and also image segmentation process is not robust, since they have not effectively utilized spatial information. To this end, in this paper, novel gradient-based marker selection technique, dissimilarity measures, and adaptive connection weighting method are proposed by making full use of spatial information in hyperspectral image. Concretely, for a given hyperspectral image, a pixel-wise classification is firstly performed, and meanwhile the gradient map is generated by a morphology-based algorithm. Secondly, the most reliable pixels are selected as the markers from the classification map, and then the boundary noise pixels are excluded from the marker map by using the gradient map. Thirdly, several new dissimilarity measures are proposed by incorporating gradient information or probability information of pixels. Furthermore, in the growth procedure of MSF, the connection weighting between pixels is adjusted adaptively to improve the robustness of the MSF algorithm. Finally, when building the final classification map by using the majority voting rule, the labels of the training samples are used to dominate the label prediction. Experimental results are performed on two hyperspectral image sets Indian Pines and University of Pavia with different resolutions and contexts. The proposed approach yields higher classification accuracies compared to previously proposed classification methods, and provides accurate segmentation maps. [ABSTRACT FROM AUTHOR]

Background: Acne vulgaris is one of the most common human pathologies worldwide. Its prevalence causes a high healthcare expenditure. Acne healthcare costs and effects on individuals' quality of life lead to the need of analysing current acne evaluation, treatment and monitoring methods. One of the most common ones is manual lesion counting by a dermatologist. However, this technique has several limitations, such as time spent. That is the reason why the development of new computer‐assisted techniques is needed in order to automatically count the acne lesions. Materials and Methods: Using the fluorescence images, a segmentation algorithm is implemented in MATLAB. Results: A new counting tool has been obtained that provides a form of objective evaluation of acne vulgaris disease. The effectiveness of the application of the segmentation method is more than 90%, being valid for the follow‐up and diagnosis of injuries. Conclusion: Automated counting of acne lesions has been proposed to solve current limitations of evaluation and monitoring methods for acne vulgaris. It is clear that the use of machine learning algorithms such as k‐means enables clinicians to objectively and quickly evaluate the severity of acne. [ABSTRACT FROM AUTHOR]

Objective: Structural measurements after separation of cortical from trabecular bone are of interest to a wide variety of communities but are difficult to obtain because of the lack of accurate automated techniques. Methods: We present a structure-based algorithm for separating cortical from trabecular bone in binarized images. Using the thickness of the cortex as a seed value, bone connected to the cortex within a spatially local threshold value is identified and separated from the remaining bone. The algorithm was tested on seven biological data sets from four species imaged using micro-computed tomography (μ-CT) and high-resolution peripheral quantitative computed tomography (HR-pQCT). Area and local thickness measurements were compared to images segmented manually. Results: The algorithm was approximately 11 times faster than manual measurements and the median error in cortical area was −4.47 ± 4.15%. The median error in cortical thickness was approximately 0.5 voxels for μ-CT data and less than 0.05 voxels for HR-pQCT images resulting in an overall difference of −28.1 ± 71.1 μm. Conclusion: A simple and readily implementable methodology has been developed that is repeatable, efficient, and requires few user inputs, providing an unbiased means of separating cortical from trabecular bone. Significance: Automating the segmentation of variably thick cortices will allow for the evaluation of large data sets in a time-efficient manner and allow for full-field analyses that have been previously limited to small regions of interest. The MATLAB code can be downloaded from https://github.com/TBL-UIUC/downloads.git. [ABSTRACT FROM AUTHOR]

Image segmentation applied to medical image analysis is still a critical and important task. Although there exist several segmentation algorithms that have been widely studied in literature, these are subject to segmentation problems such as over- and under-segmentation as well as non-closed edges. In this paper, a simple method that combines well-known segmentation algorithms is presented. This method is applied to detect acid-fast bacilli (AFB) in bacilloscopies used to diagnose pulmonary tuberculosis (TB). This diagnosis can be performed through different tests, and the most used worldwide is smear microscopy because of its low cost and effectiveness. This diagnosis technique is based on the analysis and counting of the bacilli in the bacilloscopy observed under an optical microscope. The proposed method is used to segment the bacilli in digital images from bacilloscopies processed using Ziehl-Neelsen (ZN) staining. The proposed method is fast, has a low computational cost and good efficiency compared to other methods. The bacilli image segmentation is performed by image processing and analysis techniques, probability concepts and classifiers. In this work, a Bayesian classifier based on a Gaussian mixture model (GMM) is used. The segmentations' results are validated by using the Jaccard index, which indicates the efficiency of the classifier. [ABSTRACT FROM AUTHOR]

Highlights • Propose indirect diffusion model for extraction of deeply concave edges and sharp corners. • Model is defined as two PDEs, one driving level set motion and one smoothing indirectly level set. • Level set function can be initialized to zero function, so allowing for flexible initialization. • It is easy to set a termination criterion for the proposed algorithm. Abstract In this paper, we put forward an idea of indirect diffusion and further develope an indirect diffusion-based level set model for image segmentation. This model is based on the dynamic process of diffusion that is posed indirectly on level set function by way of auxiliary function, coupled with a transition region-based force that exhibits the desired sign-changing property. It is formulated as a coupled system of two evolution equations, in which the first equation drives the motion of zero level set toward the object edges and makes it possible to set a termination criterion on the algorithm, while the second equation (indirect diffusion) smoothens the auxiliary function and keeps the auxiliary function as close to the level set function as possible. The derived model can effectively be solved purely by the simplest explicit finite difference. Experimental results show that the proposed model not only has the strong capability of noise immunity, but it also can much better conduce to extraction of deeply concave edges and preservation of sharp corners, compared with the direct diffusion-based counterpart. [ABSTRACT FROM AUTHOR]

Selective segmentation methods involve incorporating user input to partition an image into a foreground and background. These methods are often sensitive to some aspect of the user input in a counter intuitive manner, making their use in practice difficult. The most robust methods often involve laborious refinement on the part of the user, and sometimes editing/supervision. The proposed method reduces the burden of the user by simplifying the requirements in the input. Specifically, the fitting term does not depend on a distance function, and so no selection parameter is introduced. Instead, we consider how the user input relates to some general intensity fitting term to ensure the approach is less sensitive to the decisions or intuition of the user. We give comparisons to existing approaches to show the advantages of the new selective segmentation model. [ABSTRACT FROM AUTHOR]

We construct a set of special complex-valued integral images and an algorithm that allows to calculate Zernike moments fast, namely in constant time. The technique is suitable for dense detection procedures, where the image is scanned by a sliding window at multiple scales, and where rotational invariance is required at the level of each window. We assume no preliminary image segmentation. Owing to the proposed integral images and binomial expansions, the extraction of each feature does not depend on the number of pixels in the window and thereby is an $O(1)$ calculation. We analyze algorithmic properties of the proposition, such as: number of needed integral images, complex-conjugacy of integral images, number of operations involved in feature extraction, speed-up possibilities based on lookup tables. We also point out connections between Zernike and orthogonal Fourier–Mellin moments in the context of computations backed with integral images. Finally, we demonstrate three examples of detection tasks of varying difficulty. Detectors are trained on the proposed features by the RealBoost algorithm. When learning, the classifiers get acquainted only with examples of target objects in their upright position or rotated within a limited range. At the testing stage, generalization onto the full $360^\circ$ angle takes place automatically. [ABSTRACT FROM AUTHOR]

Image segmentation, as a key step of microarray image processing, is crucial for obtaining the spot expressions simultaneously. However, state-of-art clustering-based segmentation algorithms are sensitive to noises. To solve this problem and improve the segmentation accuracy, in this article, several improvements are introduced into the fast and simple clustering methods (K-means and Fuzzy C means). Firstly, a contrast enhancement algorithm is implemented in image preprocessing to improve the gridding precision. Secondly, the data-driven means are proposed for cluster center initialization, instead of usual random setting. The third improvement is that the multi features, including intensity features, spatial features, and shape features, are implemented in feature selection to replace the sole pixel intensity feature used in the traditional clustering-based methods to avoid taking noises as spot pixels. Moreover, the principal component analysis is adopted for various feature extraction. Finally, an adaptive adjustment algorithm is proposed based on data mining and learning for further dealing with the missing spots or low contrast spots. Experiments on real and simulation data sets indicate that the proposed improvements made our proposed method obtains higher segmented precision than the traditional K-means and Fuzzy C means clustering methods. [ABSTRACT FROM AUTHOR]

With the increase of the camera resolution, the number of pixels contained in froth image is increased, which brings many challenges to image segmentation. Froth size and distribution are the important index in froth flotation. The segmentation of froth images is always a problem in building flotation model. In segmenting froth images, Otsu method is usually used to get a binary image for classification of froth images, this method can get a satisfactory segmentation result. However, each gray level is required to calculate each of the between-class variance, it takes a longer time in froth images with a large number of pixels. To solve this problem, an improved method is proposed in this paper. Most froth images have the pixel distribution characteristic that the gray histogram curve is a sawtooth shape. The proposed method uses polynomial to fit the curve of gray histogram and takes the characteristic of gray histogram's valley into consideration in Otsu method. Two performance comparison methods are introduced and used. Experimental comparison between Otsu method and the proposed method shows that the proposed method has a satisfactory image segmentation with a low computing time. [ABSTRACT FROM AUTHOR]

In order to create an image segmentation method robust to lighting changes, two novel homogeneity criteria of an image region were studied. Both were defined using the Logarithmic Image Processing (LIP) framework whose laws model lighting changes. The first criterion estimates the LIP-additive homogeneity and is based on the LIP-additive law. It is theoretically insensitive to lighting changes caused by variations of the camera exposure-time or source intensity. The second, the LIP-multiplicative homogeneity criterion, is based on the LIP-multiplicative law and is insensitive to changes due to variations of the object thickness or opacity. Each criterion is then applied in Revol and Jourlin's (1997) region growing method which is based on the homogeneity of an image region. The region growing method becomes therefore robust to the lighting changes specific to each criterion. Experiments on simulated and on real images presenting lighting variations prove the robustness of the criteria to those variations. Compared to a state-of the art method based on the image component-tree, ours is more robust. These results open the way to numerous applications where the lighting is uncontrolled or partially controlled. [ABSTRACT FROM AUTHOR]

Retrieving information from fish hatcheries is a key need in the Colombian fishing industry because it allows hatchery managers to determine necessary food amounts and measure other population parameters. However, traditional measurement methods involve extracting live fish from the ponds. This results in stress and the possibility of injury. Researchers have proposed automated measuring systems for shortening measurement times and reducing fish stress, but they must fulfill several prerequisites before they can retrieve fish information. These include mounting underwater camera systems and applying image enhancement and segmentation algorithms. In this paper, the literature revolving around these issues is reviewed and a novel approach is proposed. It is shown that using a single camera for image acquisition in a controlled setup is appropriate because it enables better management of sample size and image acquisition conditions. Furthermore, a combination of homomorphic filtering, contrast limited adaptive histogram equalization (CLAHE) and guided filtering for fish image enhancement was used. The fish were then segmented using a combination of 2D saliency detection and morphological operators. Finally, fish length was obtained using a third-degree polynomial regression on the fish mid-points. The length was calculated to estimate the weight with several regression algorithms. This approach was shown to be the most appropriate method for regression of fish weight based on length. [ABSTRACT FROM AUTHOR]

The automatic reconstruction of single neurons from microscopic images is essential to enable large-scale data-driven investigations in neuron morphology research. However, few previous methods were able to generate satisfactory results automatically from 3-D microscopic images without human intervention. In this paper, we developed a new algorithm for automatic 3-D neuron reconstruction. The main idea of the proposed algorithm is to iteratively track backward from the potential neuronal termini to the soma centre. An online confidence score is computed to decide if a tracing iteration should be stopped and discarded from the final reconstruction. The performance improvements comparing with the previous methods are mainly introduced by a more accurate estimation of the traced area and the confidence controlled back-tracking algorithm. The proposed algorithm supports large-scale batch-processing by requiring only one user specified parameter for background segmentation. We bench tested the proposed algorithm on the images obtained from both the DIADEM challenge and the BigNeuron challenge. Our proposed algorithm achieved the state-of-the-art results. [ABSTRACT FROM AUTHOR]

In the current image processing field, medical image segmentation needs a lot of groundtruths, and the process of making these groundtruths is time-consuming and laborious. Thus, a novel retinal vessel segmentation algorithm without groundtruth is proposed in this Letter. The hierarchical clustering algorithm is first used to binary classify vessel and non-vessel pixels. Then classification results based on DRIVE databases are used as pseudo groundtruths to train the neural networks and transfer learning is considered for subsequent processing. Next the trained network is used as the feature extraction tool, by calculating and comparing the difference of image features between the target domain data (DRIVE database) and the source domain data (STARE, CHASE DB1, and HRF databases) extracted from the network. The data required for training is expanded based on semi-supervised clustering in this image feature space, finally the deep neural network is further fine-tuned. Experiments on the publicly available fundus image dataset DRIVE demonstrate that the proposed method outperforms many other state-of-the-art weakly supervised and unsupervised methods. [ABSTRACT FROM AUTHOR]

Image processing methods for automated concrete crack detection are often challenged by binary noise. Noise removal methods decrease the false positive pixels of crack detection results, often at the cost of a reduction in true positives. This paper proposes a novel method for binary noise removal and segmentation of noisy concrete crack images. The method applies an area threshold before reducing the pixel groups in the image to a skeleton. Each skeleton is connected to its nearest neighbour before the remaining short skeletons in the image are removed using a length threshold. A morphological reconstruction follows to remove all elements in the original noisy image that do not intersect with the skeleton. Finally, pixel groups in close proximity to the endpoints of the pixel groups in the resulting image are reinstated. Testing was conducted on a dataset of noisy binary crack images; the proposed method (Skele-Marker) obtained recall, precision, intersection over union, and F1 score results of 77%, 91%, 72%, and 84%, respectively. Skele-Marker was compared to other methods found in literature and was found to outperform other methods in terms of precision, intersection over union and F1 score. The proposed method is used to make crack detection results more reliable, supporting the ever-growing demand for automated inspections of concrete structures. • We use image processing techniques to remove noise in binary concrete crack images. • False positives in binary concrete crack images can be reduced using our method. • We compare our concrete crack noise removal method to others found in literature. • Our method performed better than other concrete crack segmentation methods. [ABSTRACT FROM AUTHOR]

Analyzing geological drilling hole images acquired by Axial View Panoramic Borehole Televiewer (APBT) is a key step to explore the geological structure in a geological exploration. Conventionally, the borehole images are examined by technicians, which is inefficient and subjective. In this paper, three dominant types of borehole-wall images on coal-rock mass structure, namely, border images, fracture images and intact rock mass images are mainly studied. The traditional image classification methods based on unified feature extraction algorithm and single classifier is not effect for the borehole images. Therefore, this paper proposes a novel two-stage classification approach to improve the classification performance of borehole images. In the first-stage classification, the border images are identified from three kinds of images based on texture features and gray-scale histograms features. For the remaining two types of images, in the second-stage classification, Gabor filter is first applied to segment the region of interest (ROI) (such as microfracture, absciss layer and horizontal cracks, etc.) and the central interference region. Then, using the same feature vector after eliminating the central interference region, fracture images are separated from intact rock mass images. We test our two-stage classification system with real borehole images. The results of experimental show that the two-stage classification method can effectively classify three major borehole-wall images with the correction rate of 95.55% in the first stage and 95% in the second stage. [ABSTRACT FROM AUTHOR]

Studies on monolayer cultures and whole-animal models for the prediction of the response of native human tissue are associated with limitations. Therefore, more and more laboratories are tending towards multicellular spheroids grown in vitro as a model of native tissues. In addition, they are increasingly used in a wide range of biofabrication methodologies. These 3D microspheroids are generated through a self-assembly process that is still poorly characterised, called cellular aggregation. Here, a system is proposed for the automated, non-invasive and high throughput monitoring of the morphological changes during cell aggregation. Microwell patterned inserts were used for spheroid formation while an automated microscope with 4x bright-field objective captured the morphological changes during this process. Subsequently, the acquired time-lapse images were automatically segmented and several morphological features such as minor axis length, major axis length, roundness, area, perimeter and circularity were extracted for each spheroid. The method was quantitatively validated with respect to manual segmentation on four sets of ± 60 spheroids. The average sensitivities and precisions of the proposed segmentation method ranged from 96.67–97.84% and 96.77–97.73%, respectively. In addition, the different morphological features were validated, obtaining average relative errors between 0.78–4.50%. On average, a spheroid was processed 73 times faster than a human operator. As opposed to existing algorithms, our methodology was not only able to automatically monitor compact spheroids but also the aggregation process of individual spheroids, and this in an accurate and high-throughput manner. In total, the aggregation behaviour of more than 700 individual spheroids was monitored over a duration of 16 hours with a time interval of 5 minutes, and this could be increased up to 48,000 for the described culture format. In conclusion, the proposed system has the potential to be used for unravelling the mechanisms involved in spheroid formation and monitoring their formation during large-scale manufacturing protocols. [ABSTRACT FROM AUTHOR]

Retrieving videos from large repositories using image queries is important for many applications, such as brand monitoring or content linking. We introduce a new retrieval architecture, in which the image query can be compared directly with database videos—significantly improving retrieval scalability compared with a baseline system that searches the database on a video frame level. Matching an image to a video is an inherently asymmetric problem. We propose an asymmetric comparison technique for Fisher vectors and systematically explore query or database items with varying amounts of clutter, showing the benefits of the proposed technique. We then propose novel video descriptors that can be compared directly with image descriptors. We start by constructing Fisher vectors for video segments, by exploring different aggregation techniques. For a database of lecture videos, such methods obtain a two orders of magnitude compression gain with respect to a frame-based scheme, with no loss in retrieval accuracy. Then, we consider the design of video descriptors, which combine Fisher embedding with hashing techniques, in a flexible framework based on Bloom filters. Large-scale experiments using three datasets show that this technique enables faster and more memory-efficient retrieval, compared with a frame-based method, with similar accuracy. The proposed techniques are further compared against pre-trained convolutional neural network features, outperforming them on three datasets by a substantial margin. [ABSTRACT FROM AUTHOR]

3D video systems transmit depth maps in order to render synthesized views (SVs) at a receiver. To anticipate this purpose when processing a depth map, a sender-side depth processing algorithm (DPA), e.g. a depth encoder, can also render the SVs, compute their SV distortion (SVD), and adapt to it. This requires a low-complexity algorithm as computational resources are usually limited. We propose such an algorithm in this paper. First, we discuss a measure that relates a depth change to an SVD change using rendering. Then, we present an optimized process combining basic rendering steps, as warping, occlusion handling, interpolation, hole filling, and blending. Furthermore, we analyze which parts of an SV are affected by a depth change and modify the process to re-render only them. The resulting algorithm is significantly less complex than an unoptimized rendering-based variant and quantifies the SVD more accurately than existing estimation methods. The algorithm is used by the 3D-High Efficiency Video Coding reference software encoder as the main method for distortion computation and can also be used by other DPAs. [ABSTRACT FROM AUTHOR]

A methodology is proposed by combining the application of markers along with watershed transformation and thresholding for image segmentation. Use of the traditional watershed algorithm is widespread because of its advantage of being able to produce a complete division of the image. However, its drawbacks include over-segmentation and noise sensitivity. Therefore, the marker-based watershed segmentation is proposed here to overcome these effects. First, the original image is preprocessed by filtering techniques in order to smoothen it. Secondly, the foreground objects are marked. Then, the background markers are computed. Finally, the marked image is transformed through watershed transformation. The area is computed for the segmented objects in the image. It has been proved that this method reduces the error percentage. [ABSTRACT FROM AUTHOR]

We propose a novel fully convolutional network architecture for shapes, denoted by Shape Fully Convolutional Networks (SFCN) . 3D shapes are represented as graph structures in the SFCN architecture, based on novel graph convolution and pooling operations , which are similar to convolution and pooling operations used on images. Meanwhile, to build our SFCN architecture in the original image segmentation fully convolutional network (FCN) architecture, we also design and implement a generating operation with bridging function. This ensures that the convolution and pooling operation we have designed can be successfully applied in the original FCN architecture. In this paper, we also present a new shape segmentation approach based on SFCN. Furthermore, we allow more general and challenging input, such as mixed datasets of different categories of shapes which can prove the ability of our generalisation. In our approach, SFCNs are trained triangles-to-triangles by using three low-level geometric features as input. Finally, the feature voting-based multi-label graph cuts is adopted to optimise the segmentation results obtained by SFCN prediction. The experiment results show that our method can effectively learn and predict mixed shape datasets of either similar or different characteristics, and achieve excellent segmentation results. [ABSTRACT FROM AUTHOR]

The continuous image sequence recognition is more difficult than the single image recognition because the classification of continuous image sequences and the image edge recognition must be very accurate. Hence, a method based on sequence alignment for action segmentation and classification is proposed to reconstruct a template sequence by estimating the mean action of a class category, which calculates the distance between a single image and a template sequence by sparse coding in Dynamic Time Warping. The proposed method, the methods of Kulkarni et al. [Continuous action recognition based on sequence alignment, Int. J. Comput. Vis. pp. 1-26.] and Hoai et al. [Joint segmentation and classification of human actions in video, IEEE Conf. Computer Vision and Pattern Recognition, 2008, pp. 108-119.] are compared on the recognition accuracy of the continuous recognition and isolated recognition, which clearly shows that the proposed method outperforms the other methods. When applied to continuous gesture classification, it not only can recognize the gesture categories more quickly and accurately, but is more realistic in solving continuous action recognition problems in a video than the other existing methods. [ABSTRACT FROM AUTHOR]

Image segmentation is defined as a partition realized to an image into homogeneous regions to modify it into something that is more meaningful and softer to examine. Although several segmentation approaches have been proposed recently, in this paper, we develop a new image segmentation method based on the statistical confidence interval tool along with the well-known Otsu algorithm. According to our numerical experiments, our method has a dissimilar performance in comparison to the standard Otsu algorithm to specially process images with speckle noise perturbation. Actually, the effect of the speckle noise entropy is almost filtered out by our algorithm. Furthermore, our approach is validated by employing some image samples. [ABSTRACT FROM AUTHOR]

We present a novel superpixel generation algorithm based on a new definition of geodesic distance, called bilateral geodesic distance. In contrast to the traditional geodesic distance, the new bilateral geodesic distance of two pixels considers the distance between their positions as well as their color difference. Superpixel generation is essentially a problem of clustering image pixels with respect to a set of properly selected seeds. We first use an adaptive hexagonal subdivision method to determine the initial seed-based image gradient. Then, we use the bilateral geodesic distance to measure the similarity between the pixels and the seeds. We apply an improved fast marching method to generate superpixels’ contour regions with the expansion velocities dependent on a new gradient formulation that depends on the seeds’ properties. The experimental results indicate that our algorithm is not only much faster than the structure-based method, which uses conventional geodesic distance, but also outperforms the existing methods in terms of region compactness and region boundary regularity. [ABSTRACT FROM AUTHOR]

Region of interest (ROI) is the most important part of an image that expresses the effective content of the image. Extracting regions of interest from images accurately and efficiently can reduce computational complexity and is essential for image analysis and understanding. In order to achieve the automatic extraction of regions of interest and obtain more accurate regions of interest, this paper proposes Optimized Automatic Seeded Region Growing (OASRG) algorithm. The algorithm uses the affinity propagation (AP) clustering algorithm to extract the seeds automatically, and optimizes the traditional region growing algorithm by regrowing strategy to obtain the regions of interest where target objects are contained. Experimental results show that our algorithm can automatically locate seeds and produce results as good as traditional region growing with seeds selected manually. Furthermore, the precision is improved and the extraction effect is better after the optimization with regrowing strategy. [ABSTRACT FROM AUTHOR]

For curves or general interfaces, Euler's elastica energy has a wide range of applications in computer vision and image processing. It is however difficult to minimize the functionals related to the elastica energy due to its non-convexity, nonlinearity and higher order with derivatives. In this paper, we propose a very simple way to combine level set and binary representations for interfaces and then use a fast algorithm to minimize the functionals involving the elastica energy. The proposed algorithm essentially just needs to solve a total variation type minimization problem and a re-distance problem. Nowadays, there are many fast algorithms to solve these two problems and thus the overall efficiency of the proposed algorithm is very high. We then apply the new Euler's elastica minimization algorithm to image segmentation, image inpainting and illusory shape reconstruction problems. Extensive experimental results are finally conducted to validate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

We propose a novel metal artifact reduction (MAR) algorithm for CT images that completes a corrupted sinogram along the metal trace region. When metal implants are located inside a field of view, they create a barrier to the transmitted X-ray beam due to the high attenuation of metals, which significantly degrades the image quality. To fill in the metal trace region efficiently, the proposed algorithm uses multiple prior images with residual error compensation in sinogram space. Multiple prior images are generated by applying a recursive active contour (RAC) segmentation algorithm to the pre-corrected image acquired by MAR with linear interpolation, where the number of prior image is controlled by RAC depending on the object complexity. A sinogram basis is then acquired by forward projection of the prior images. The metal trace region of the original sinogram is replaced by the linearly combined sinogram of the prior images. Then, the additional correction in the metal trace region is performed to compensate the residual errors occurred by non-ideal data acquisition condition. The performance of the proposed MAR algorithm is compared with MAR with linear interpolation and the normalized MAR algorithm using simulated and experimental data. The results show that the proposed algorithm outperforms other MAR algorithms, especially when the object is complex with multiple bone objects. [ABSTRACT FROM AUTHOR]

Accurate image segmentation is an important issue in image processing, where Gaussian mixture models play an important part and have been proven effective. However, most Gaussian mixture model (GMM) based methods suffer from one or more limitations, such as limited noise robustness, over-smoothness for segmentations, and lack of flexibility to fit data. In order to address these issues, in this paper, we propose a rough set bounded asymmetric Gaussian mixture model with spatial constraint for image segmentation. First, based on our previous work where each cluster is characterized by three automatically determined rough-fuzzy regions, we partition the target image into three rough regions with two adaptively computed thresholds. Second, a new bounded indicator function is proposed to determine the bounded support regions of the observed data. The bounded indicator and posterior probability of a pixel that belongs to each sub-region is estimated with respect to the rough region where the pixel lies. Third, to further reduce over-smoothness for segmentations, two novel prior factors are proposed that incorporate the spatial information among neighborhood pixels, which are constructed based on the prior and posterior probabilities of the within- and between-clusters, and considers the spatial direction. We compare our algorithm to state-of-the-art segmentation approaches in both synthetic and real images to demonstrate the superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this article we propose a novel tool that takes an initial segmented image and returns a more accurate segmentation that accurately captures sharp features such as leaf tips, twists and axils. Our algorithm utilizes basic a-priori information about the shape of plant leaves and local image orientations to fit active contour models to important plant features that have been missed during the initial segmentation. We compare the performance of our approach with three state-of-the-art segmentation techniques, using three error metrics. The results show that leaf tips are detected with roughly one half of the original error, segmentation accuracy is almost always improved and more than half of the leaf breakages are corrected. [ABSTRACT FROM AUTHOR]

The parametrization of automatic image processing routines is time-consuming if a lot of image processing parameters are involved. An expert can tune parameters sequentially to get desired results. This may not be productive for applications with difficult image analysis tasks, e.g. when high noise and shading levels in an image are present or images vary in their characteristics due to different acquisition conditions. Parameters are required to be tuned simultaneously. We propose a framework to improve standard image segmentation methods by using feedback-based automatic parameter adaptation. Moreover, we compare algorithms by implementing them in a feedforward fashion and then adapting their parameters. This comparison is proposed to be evaluated by a benchmark data set that contains challenging image distortions in an increasing fashion. This promptly enables us to compare different standard image segmentation algorithms in a feedback vs. feedforward implementation by evaluating their segmentation quality and robustness. We also propose an efficient way of performing automatic image analysis when only abstract ground truth is present. Such a framework evaluates robustness of different image processing pipelines using a graded data set. This is useful for both end-users and experts. [ABSTRACT FROM AUTHOR]

The superpixel segmentation algorithm, as a preprocessing technique, should show good performance in fast segmentation speed, accurate boundary adherence and homogeneous regularity. A fast superpixel segmentation algorithm by iterative edge refinement (IER) works well on optical images. However, it may generate poor superpixels for Polarimetric synthetic aperture radar (PolSAR) images due to the influence of strong speckle noise and many small-sized or slim regions. To solve these problems, we utilized a fast revised Wishart distance instead of Euclidean distance in the local relabeling of unstable pixels, and initialized unstable pixels as all the pixels substituted for the initial grid edge pixels in the initialization step. Then, postprocessing with the dissimilarity measure is employed to remove the generated small isolated regions as well as to preserve strong point targets. Finally, the superiority of the proposed algorithm is validated with extensive experiments on four simulated and two real-world PolSAR images from Experimental Synthetic Aperture Radar (ESAR) and Airborne Synthetic Aperture Radar (AirSAR) data sets, which demonstrate that the proposed method shows better performance with respect to several commonly used evaluation measures, even with about nine times higher computational efficiency, as well as fine boundary adherence and strong point targets preservation, compared with three state-of-the-art methods. [ABSTRACT FROM AUTHOR]