Search

Image segmentation is an essential part of medical image processing, which plays a significant role in adjunctive therapy, disease diagnosis, and medical assessment. To solve the problem of insufficient extracting context information, especially for medical image segmentation, this paper proposes a novel network architecture of multi-scale object context dilated transformer network (Multi-OCDTNet) to improve the utilization and segmentation accuracy for context information. The multi-scale object context transformer module can extract the multi-scale context information of the image through a three-layer transformer structure in a parallel way. The dilated convolution self-aware module can enhance the awareness of multi-scale context information in the feature map through layering transformer block groups and a set of transformer layers. In addition, we propose a composite weight-assigned-based loss function based on DDCLoss and Focal Tversky Loss to improve the stability of the segmentation performance of Multi-OCDTNet by adjusting the weight. The performance of Multi-OCDTNet is validated on the DRIVE and STARE datasets with segmentation accuracy of 97.17% and 97.84%, respectively, indicating the Multi-OCDTNet network possesses a significant competitive advantage in improving the segmentation performance of retinal vessel images. [ABSTRACT FROM AUTHOR]

In the medical image-processing field brain tumor segmentation is aquintessential task. Thereby early diagnosis gives us a chance of increasing survival rate. It will be way much complex and time consuming when comes to processing large amount of MRI images manually, so for that we need an automatic way of brain tumor image segmentation process. This paper aims to gives a comparative study of brain tumor segmentation, which are MRI-based. So recent methods of automatic segmentation along with advanced techniques gives us an improved result and can solve issue better than any other methods. Therefore, this paper brings comparative analysis of three models such as Deformable model of Fuzzy C-Mean clustering (DMFCM), Adaptive Cluster with Super Pixel Segmentation (ACSP) and Grey Wolf Optimization based ACSP (GWO_ACSP) and these are tested on CANCER IMAGE ACHRCHIEVE which is a preparation information base containing High Grade and Low-Grade astrocytoma tumors. Here boundaries including Accuracy, Dice coefficient, Jaccard score and MCC are assessed and along these lines produce the outcomes. From this examination the test consequences of Grey Wolf Optimization based ACSP (GWO_ACSP) gives better answer for mind tumor division issue. [ABSTRACT FROM AUTHOR]

Foundation models (FMs) have rapidly evolved and have achieved significant accomplishments in computer vision tasks. Specifically, the prompt mechanism conveniently allows users to integrate image prior information into the model, making it possible to apply models without any training. Therefore, we proposed a workflow based on foundation models and zero training to solve the tasks of photoacoustic (PA) image processing. We employed the Segment Anything Model (SAM) by setting simple prompts and integrating the model’s outputs with prior knowledge of the imaged objects to accomplish various tasks, including: (1) removing the skin signal in three-dimensional PA image rendering; (2) dual speed-of-sound reconstruction, and (3) segmentation of finger blood vessels. Through these demonstrations, we have concluded that FMs can be directly applied in PA imaging without the requirement for network design and training. This potentially allows for a hands-on, convenient approach to achieving efficient and accurate segmentation of PA images. This paper serves as a comprehensive tutorial, facilitating the mastery of the technique through the provision of code and sample datasets. [ABSTRACT FROM AUTHOR]

A key study area throughout the medical sector for image processing and analysis is medical image segmentation. The diagnosis and treatment strategies of doctors may have a solid foundation owing to accurate and effective medical image segmentation. Conventional approaches in this field rely on manual feature extraction, which makes segmentation complex, costs doctors’ time and energy, and involves a subjective evaluation that is readily susceptible to diagnostic errors. Researchers have applied convolutional neural network-based deep learning techniques to the segmentation of medical images as a result of their impressive advancements and successes in the field of computer vision. The research described here uses the U-Net network’s outstanding feature learning capabilities and end-to-end processing mode for lung CT image segmentation via fully convolutional network (FCN) research. However, focusing on valuable, crucial information aspects in the U-Net network is challenging. This study employed multilevel attention mechanisms on the basis of U-Net networks to enhance the model’s accuracy in lung CT image segmentation. These mechanisms were inspired by attention mechanisms. By improving the segmentation accuracy and optimizing the segmentation effect, the new model embeds a self-attention module in front of each upsampling layer in the U-Net model. This module provides more detailed information by stitching the self-attention module of the original image and then suppresses irrelevant and redundant information by using the effect of feature extraction of the upsampling layer. Several additional comparative experiments were conducted on the 2019nCoVR dataset. The outcomes demonstrate the efficacy of the optimized model described in this paper and its application results in improved segmentation effects in lung CT images. Additionally, the new model has distinct advantages over existing approaches that are typical of medical image segmentation, which represent its higher level of lung CT image segmentation. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm of segmentation of diseased part in apple leaf images. In agriculture-based image processing, leaf diseases segmentation is the main processing task for region of interest extraction. It is also extremely important to segment the plant leaf from the background in case on live images. Automated segmentation of plant leaves from the background is a common challenge in the processing of plant images. Although numerous methods have been proposed, still it is tough to segment the diseased part of the leaf from the live leaf images accurately by one particular method. In the proposed work, leaves of apple having different background have been segmented. Firstly, the leaves have been enhanced by using Brightness-Preserving Dynamic Fuzzy Histogram Equalization technique and then the extraction of diseased apple leaf part is done using a novel extraction algorithm. Real-time plant leaf database is used to validate the proposed approach. The results of the proposed novel methodology give better results when compared to existing segmentation algorithms. From the segmented apple leaves, color and texture features are extracted which are further classified as marsonina coronaria or apple scab using different machine learning classifiers. Best accuracy of 96.4% is achieved using K nearest neighbor classifier. [ABSTRACT FROM AUTHOR]

LSS-Target (the Low altitude, Slow speed and Small Target) is likely to be a threat to the observation platform, thus infrared LSS-Target detection is an urgent task. LSS-Target is a challenging issue due to the low Signal-to-Noise Ratio (SNR) and sophisticated background. Motivated by the analysis of infrared imaging characteristics, this paper proposes a novel fusion method for IR LSS-Target detection with complex urban background, which is suitable for precise guidance and self defense. First, an adaptive threshold segmentation based on accumulative histogram and maximum likelihood estimation are utilized to eliminate the clutter and improve SNR of the initial image. Second, a template is set up to identify the seed points in the image. Third, a constrained four criteria region growth algorithm is performed to separate the entire regions. Finally, the confidence measure is constructed, which can eliminate false targets and the background edges. Experimental results show that the method in this paper can screen out the real LSS-Target in real time with high accuracy under sophisticated background. [ABSTRACT FROM AUTHOR]

Generation of random fields (GRF) for image segmentation represents partitioning an image into different regions that are homogeneous or have similar facets of the image. It is one of the most challenging tasks in image processing and a very important pre-processing step in the fields of computer vision, image analysis, medical image processing, pattern recognition, remote sensing, and geographical information system. Many researchers have presented numerous image segmentation approaches, but still, there are challenges like segmentation of low contrast images, removal of shadow in the images, reduction of high dimensional images, and computational complexity of segmentation techniques. In this review paper, the authors address these issues. The experiments are conducted and tested on the Berkely dataset (BSD500), Semantic dataset, and our own dataset, and the results are shown in the form of tables and graphs. [ABSTRACT FROM AUTHOR]

Solar image consists of obvious regions of solar activities and peaceful regions of no activity. Identifying effective solar active areas from solar image is a typical application of image-processing technology in astronomical research. Benefiting from real-time solar observation data provided by Heliophysics Event Knowledgebase (HEK) of Solar Dynamics Observatory (SDO), this paper presents a method of solar activity identification based on HEK. In this method, we gather data of six kinds of solar activities (time, location, and area) and establish a multiscale transformation model for the full-disk solar image of the corresponding time. Combining both location data and area data, we design different gradient thresholds to segment different solar activities’ regions. Two kinds of boundary-identification methods are used to locate and recognize solar activities’ regions, respectively. Furthermore, we study the correlation of the characteristic parameters (six kinds of solar activities’ data) of solar image and get the best combination of the characteristic parameters of each solar activity. The method in the paper provides precise positioning and efficient identification of solar activities, which lays the foundation for further work. In addition to that, extracting specific combination of features from different solar activities’ regions can provide a feasible way to build a streamlined image feature set for content-based image retrieval (CBIR) systems. [ABSTRACT FROM AUTHOR]

Image segmentation (IE) in several disciplines of image processing and computer vision is an essential topic. Segmentation splits a picture into the areas or items that it constitutes. Image segmentation may be achieved with many approaches, some easier than others because of sophisticated programming requirements. The most common technique for segmenting pictures is edge detection (ED) based on sudden (locomotive) intensity fluctuations. This paper aims to study edge detection approaches for the division of images and acquired experimental findings, Sobel, Prewitt, Robert, CannyLoG (Laplacian of Gaussian). It is vital to ensure that picture segmentation algorithms deliver correct results quickly and efficiently for computer vision to reach its full potential. Computer vision approaches require more investigation in hierarchical architectural IoT networks created for seeing the world. In this work, the new way to provide joint image detection (JID) algorithm is to provide multi-scaling approaches for edge detection and segmentation using IoT edge computing (EC). This JID-EC method avoids the requirement to choose and track the edge explicitly. This study provides an overview of fundamental ideas, techniques, and algorithms common to segment images and edge detection, focusing on the segmentation and visualization of joint-articular cartilage images. The reason for this failure is that it is an image noise-sensitive high pass filter. The need for improved algorithms to meet a suitable value of low and high thresholds should thus be stressed for picture noise such as a canny edge, and the performance is achieved with an efficiency of 95.2%. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of image segmentation, an improved adaptive level set method is proposed based on level set evolution without re-initialization method and adaptive distance preserving level set evolution method. A new definition of weight coefficient in evolution equations is the main innovation of this paper. The improved method can detect certain object boundaries, interior and exterior contours of an object, edges of multi-objects and weak boundaries of an object by synthetic and real images numerical experiments. Numerical results show that the improved adaptive level set method has faster segmentation speed and higher segmentation accuracy compared with the previous two methods, especially in weak boundaries and edges of multi-objects segmentation problems. [ABSTRACT FROM AUTHOR]

Deep learning artificial intelligence (AI) is a booming area in the research field. It allows the development of end-to-end models to predict outcomes based on input data without the need for manual extraction of features. This paper aims for evaluating the automatic crack detection process that is used in identifying the cracks in building structures such as bridges, foundations or other large structures using images. A hybrid approach involving image processing and deep learning algorithms is proposed to detect automatic cracks in structures. As cracks are detected in the images they are segmented using a segmentation process. The proposed deep learning models include a hybrid architecture combining Mask R-CNN with single layer CNN, 3-layer CNN, and8-layer CNN. These models utilizes depth wise convolution with varying dilation rates for efficiently extracting diversified features from the crack images. Further, performance evaluation shows that Mask R-CNN with a single layer CNN achieves an accuracy of 97.5% on a normal dataset and 97.8% on a segmented dataset. The Mask R-CNN with 2-layer convolution resulted in an accuracy of 98.32% on a normal dataset and 98.39% on a segmented dataset. The Mask R-CNN with 8-layers convolution achieves an accuracy of 98.4% on a normal dataset and 98.75% on a segmented dataset. The proposed Mask R-CNN have proved its feasibility in detecting cracks in huge building and structures. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new phase field approximation of the Mumford–Shah functional similar to the well-known one from Ambrosio and Tortorelli. However, in our setting the phase field is allowed to be a function of bounded variation, instead of an H 1 -function. In the context of image segmentation, we also show how this new approximation can be used for numerical computations, which contains a total variation minimization of the phase field variable, as it appears in many problems of image processing. A comparison to the classical Ambrosio–Tortorelli approximation, where the phase field is an H 1 -function, shows that the new model leads to sharper phase fields. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) have achieved prominent performance in a series of image processing problems. CNNs become the first choice for dense classification problems such as semantic segmentation. However, CNNs predict the class of each pixel independently in semantic segmentation tasks, spatial regularity of the segmented objects is still a problem for these methods. Especially when given few training data, CNN could not perform well in the details, isolated and scattered small regions often appear in all kinds of CNN segmentation results. In this paper, we propose a method to add spatial regularization to the segmented objects. In our method, the spatial regularization such as total variation (TV) can be easily integrated into CNN network and it produces smooth edges and eliminate isolated points. We apply our proposed method to Unet and Segnet, which are well-established CNNs for image segmentation, and test them on WBC and CamVid datasets, respectively. The results show that the details of predictions are well improved by regularized networks. [ABSTRACT FROM AUTHOR]

In the domain of computer technology, image processing strategies have become a part of various applications. A few broadly used image segmentation methods have been characterized as seeded region growing (SRG), edge-based image segmentation, fuzzy k -means image segmentation, etc. SRG is a quick, strongly formed and impressive image segmentation algorithm. In this paper, we delve into different applications of SRG and their analysis. SRG delivers better results in analysis of magnetic resonance images, brain image, breast images, etc. On the other hand, it has some limitations as well. For example, the seed points have to be selected manually and this manual selection of seed points at the time of segmentation brings about wrong selection of regions. So, a review of some automatic seed selection methods with their advantages, disadvantages and applications in different fields has been presented. [ABSTRACT FROM AUTHOR]

Image enhancement and segmentation are the two imperative steps while processing digital images. The goal of enhancement is to improve the quality of images so as to nullify the effect of poor illumination conditions during image acquisition. Afterwards, segmentation is performed to extract region of interest (ROI) from the background details of the image. There is a vast literature available for both the techniques. Therefore, this paper is intended to summarize the basic as well as advanced enhancement and segmentation techniques under a single heading; to provide an insight for future researches in the field of pattern recognition. [ABSTRACT FROM AUTHOR]

The classical image segmentation algorithm based on local adaptive threshold can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem gradually emerges. In this paper, a quantum segmentation algorithm based on local adaptive threshold for NEQR image is proposed, which can use quantum mechanism to simultaneously compute local thresholds for all pixels in a gray-scale image and quickly segment the image into a binary image. In addition, several quantum circuit units, including median calculation, quantum binarization, etc. are designed in detail, and then a complete quantum circuit is designed to segment NEQR images by using fewer qubits and quantum gates. For a 2 n × 2 n image with q gray-scale levels, the complexity of our algorithm can be reduced to O (n 2 + q) , which is an exponential speedup compared to the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era. [ABSTRACT FROM AUTHOR]

Subspace clustering analysis algorithms are often employed when dealing with high-dimensional data. As a representative approach, Low-Rank Representation (LRR) of data has achieved great success for subspace segmentation tasks in applications such as image processing. The traditional LRR-related methods consist of two separate tasks: first, the affinity graph construction by using lowrank minimization techniques, and then the spectral clustering, which is done on the affinity graph to get the final segmentation. Since these two steps are independent of each other, this method does not guarantee that the results obtained by the algorithm are globally optimal. In this paper, a method called Robust Structured Low-Rank Representation (RSLRR) is proposed, by integrating the two above mentioned tasks and solve a joint optimization problem. This paper also puts forward a method to solve the joint optimization problem, which can efficiently get both the segmentation and the structured low-rank representation. Experiments on several standard datasets show that, compared with other algorithms, the algorithm proposed in this paper can achieve better clustering results. [ABSTRACT FROM AUTHOR]

In this paper, we propose an image-based approach to detect the presence of a vehicle license plate (VLP) in a traffic image. This method is based on the fractal character difference between the VLP region and the other regions. The technique extracts information from fractal feature blocks and computes the dimension zone that describes the difference between the license plate and the other areas in the scene. A new fractal-dimension computing method aimed at gray-image data has been presented and been applied to image segmentation. Three indexes have been defined to measure the performance of the method. The fractal-dimension parameter's choice and self-adapting adjustment have been discussed in detail. Further, the proposed system has been evaluated using test and verification datasets and has been proven to be robust against common issues of traffic images, such as varying illumination, camera vibration, insensitivity to vehicle plate's color and location, and high noise levels. Since there is always a large number of fractal characteristic blocks around the same spatial location in traffic video frames, the efficiency of the proposed algorithm for video will be greatly improved. [ABSTRACT FROM AUTHOR]

Edge detection is an active and critical topic in the field of image processing, and plays a vital role for some important applications such as image segmentation, pattern classification, object tracking, etc. In this paper, an edge detection approach is proposed using local edge pattern descriptor which possesses multiscale and multiresolution property, and is named varied local edge pattern (VLEP) descriptor. This method contains the following steps: firstly, Gaussian filter is used to smooth the original image. Secondly, the edge strength values, which are used to calculate the edge gradient values and can be obtained by one or more groups of VLEPs. Then, weighted fusion idea is considered when multiple groups of VLEP descriptors are used. Finally, the appropriate threshold is set to perform binarization processing on the gradient version of the image. Experimental results show that the proposed edge detection method achieved better performance than other state-of-the-art edge detection methods. [ABSTRACT FROM AUTHOR]

The quality of olive fruit and its virgin olive oil is a main concern for consumers and fruit industrial companies. The effectiveness and fast detection of olive's skin defects is the most decisive factor in determining its quality. It is necessary to design and implement image processing tools for segmentation and correct classification of the different fresh incoming olive batches. In this paper, we propose a new automatic image segmentation algorithm, based on discrete wavelets transform. The aim of the segmentation algorithm is to discriminate between olives and the background with the challenge of irregular and dispersive lesion borders, low contrast, artifacts in the olive fruit and variety of colors within the interest region. The second part of our work proposes a scheme for olive fruit classification. The classifier first identifies the olive fruit color and then, based upon discrete wavelets transform and Tamura statistical texture features, the healthy olive fruit is distinguished from the damaged one. The new texture feature vector is, then, compared with the robust Local Binary Pattern feature vector. The simplicity of our segmentation and classification algorithms makes them appropriate for designing a productive and profitable computer vision machine. [ABSTRACT FROM AUTHOR]

In this paper we present two architectures for image segmentation using Sobel Operators. The first architecture is designed for optimum speed whereas the second one is designed for low power. To improve the speed of operation and to reduce the memory access two identical processing units operate parallelly. The first architecture is able to segment up to 800 images each of 640 x 480 pixels in one second at 500 MHz clock frequency consuming 27.31 mW dynamic power. The second architecture is able to segment up to 488 images each of 640 x 480 pixels in one second at 300 MHz clock frequency consuming 13.6mW dynamic power. [ABSTRACT FROM AUTHOR]

Image segmentation is an important component in image processing, pattern recognition and computer vision. Many segmentation algorithms have been proposed. However, segmentation methods for both noisy and noise-free images have not been studied in much detail. Neutrosophic set (NS), a part of neutrosophy theory, studies the origin, nature, and scope of neutralities, as well as their interaction with different ideational spectra. However, neutrosophic set needs to be specified and clarified from a technical point of view for a given application or field to demonstrate its usefulness. In this paper, we apply neutrosophic set and define some operations. Neutrosphic set is integrated with an improved fuzzy c-means method and employed for image segmentation. A new operation, α-mean operation, is proposed to reduce the set indeterminacy. An improved fuzzy c-means (IFCM) is proposed based on neutrosophic set. The computation of membership and the convergence criterion of clustering are redefined accordingly. We have conducted experiments on a variety of images. The experimental results demonstrate that the proposed approach can segment images accurately and effectively. Especially, it can segment the clean images and the images having different gray levels and complex objects, which is the most difficult task for image segmentation. [ABSTRACT FROM AUTHOR]

Film and photography archives nowadays go through an accelerated process of degradation. Since the preservation of cultural heritage plays an important role in our society, photograph/film restoration has drawn a lot of attention recently. In this paper, an extent of exemplar based inpainting at determining patch priority and patch matching is proposed. Patch priority is defined by two terms: the number of homogeneous regions within the patch (heterogeneous term) obtained by image segmentation and the variance of the pixels within each homogeneous region. The first term prioritizes the heterogeneous patches and the second term defines the inconsistency within each homogeneous region of the heterogeneous patch to discriminate patches having similar heterogeneous term. Patch inpainting is done in two stages. First, the missing pixels of the patch under consideration are interpolated and then a weighted patch matching criterion is applied for finding the candidate patch. Experimental results on damaged digitized photographs and natural images are presented, which demonstrate the effectiveness of the image-completion framework for tasks such as scratch/text, object removal and image inpainting. [ABSTRACT FROM AUTHOR]

Deriving from the artificial life theory, this paper proposes an artificial co-evolving tribes model and applies it to solve the image segmentation problem. During the evolution process, the individuals in this model making up the tribes effect communication cooperatively from one agent to the other in order to increase the homogeneity of the ensemble of the image regions they represent. Two remarkable properties, that is, the monotone contraction and the conservation of the system are proved. Stability and scale control of the proposed method are carefully analyzed. Experimental results are presented and compared with two latest segmentation methods, both quantitatively and visually. We also discuss the results matching with human visual perception. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low segmentation accuracy of noise image, poor noise immunity of the existing models and poor adaptability to complex noise environment, a noise image segmentation algorithm using anisotropic diffusion and nonconvex functional was proposed. First, focusing on the "staircase effect", a nonconvex functional was introduced into the energy functional model for smooth denoising. Second, the validity and accuracy of the model were established by proving that there was no global minimum in the solution space of the nonconvex energy functional model; the improved model was then used to obtain a smooth and clear image edge while maintaining the edge integrity. Third, the smooth image obtained from the nonconvex energy functional model was combined with the level set model to obtain the anisotropic diffusion gray level set model. The optimal outline of the target was obtained by calculating the minimum value of the energy functional. Finally, an anisotropic diffusion equation with nonconvex energy functional model was built in this algorithm to segment noise image accurately and quickly. A series of comparative experiments on the proposed algorithm and similar algorithms were conducted. The results showed that the proposed algorithm had strong noise resistance and provided precise segmentation for noise image. [ABSTRACT FROM AUTHOR]

Accurate segmentation of human brain image is an essential step for clinical study of magnetic resonance imaging (MRI) images. However, vagueness and other ambiguity present between the brain tissues boundaries can lead to improper segmentation. Possibilistic fuzzy c-means (PFCM) algorithm is the hybridization of fuzzy c-means (FCM) and possibilistic c-means (PCM) algorithms which overcomes the problem of noise in the FCM algorithm and coincident clusters problem in the PCM algorithm. A major challenge posed in the PFCM algorithm for segmentation of ill-defined MRI image with noise is to take into account the ambiguity in the final localization of the feature vectors due to lack of qualitative information. This may lead to improper assignment of membership (typicality) value to their desired cluster. In this paper, we have proposed the possibilistic intuitionistic fuzzy c-means (PIFCM) algorithm for Atanassov's intuitionistic fuzzy sets (A-IFS) which includes the advantages of the PCM, FCM algorithms and A-IFS. Real and simulated MRI brain images are segmented to show the superiority of the proposed PIFCM algorithm. The experimental results demonstrate that the proposed algorithm yields better result. [ABSTRACT FROM AUTHOR]

It is an important segmentation approach of CT/MRI images to automatically extract contours in every slice using active contour models. The key point of the segmentation approach is to automatically construct initial contours for active contour models because any active contour model is sensitive to its initial contour. This paper presents an algorithm to construct such initial contours using a heuristic method. Assume that the contour in previous slice (previous contour) is accurate. The contour in the current slice (current contour) is constructed according to the previous contour using the way: Recognition and link of edge points of tissues according to the previous contour. The contour linking edge points is used as the initial contour of the distance regularized level set evolution (DRLSE) method and then an accurate contour can be extracted in the current slice. [ABSTRACT FROM AUTHOR]

Infrared images have several applications such as security, health, passenger monitoring, and so on. The quality of infrared image gets affected by noise, blurring effect, and low illumination environment. Due to the low contrast, blurring, and hazy effects in infrared images, state-of-the-art techniques are frequently unable to achieve appropriate edge details. Thus, an edge detection algorithm is proposed using a modified Von Neumann neighborhood kernel and taxicab geometry-based shortest path method. It has been found to perform in a better manner compared to earlier studies in a similar field. The objective of the proposed method is to produce sharp, less noisy and robust edge lines. First, pre-processing of the image is done for edge-preserving smoothing of an infrared image using a smoothing parameter. Second, image segmentation is done based on a two-level threshold value computed by a modified Von Neumann-based kernel. Then, Fourier transform of the segmented image is done to remove spike noise followed by the inverse Fourier transform to produce the final edge lines. The simulation experiment results show that the proposed method is found to yield robust and sharp edge lines compared to other state-of-the-art methods both numerically and visually. Moreover, the whole process takes less computation time. [ABSTRACT FROM AUTHOR]

Image segmentation is a fundamental step in several image processing tasks. It is a process where an image is divided into its constituent regions guided by a similarity criterion. One very interesting image segmentation method is the color structure code (CSC), which combines simultaneously split-and-merge and region-growing techniques. In this paper, a segmentation approach based on the CSC method, weighted color structure code (WCSC), is proposed. This method is guided by a nonlinear discrimination function, where the user-inference is captured by the Polynomial Mahalanobis distance, prioritizing, during the merging process, the regions with higher similarity to the user selected pattern. The WCSC has color distribution pattern-oriented characteristic, showing better coherence among the segments with higher similarity to the selected pattern. A qualitative evaluation and parametric paired analysis were performed to compare CSC, WCSC and other segmentation methods results, using images from Berkeley benchmark. The results from these comparison indicate an improvement on the segmentation result obtained by the WCSC. [ABSTRACT FROM AUTHOR]

Breast cancer occurs in over 8% of women during their lifetime, and is the leading cause of death among women. Sonography is superior to mammography because it has the ability to detect focal abnormalities in the dense breasts and has no side-effect. In this paper, we propose a novel automatic segmentation algorithm based on the characteristics of breast tissue and eliminating particle swarm optimization (EPSO) clustering analysis. The characteristics of mammary gland in breast ultrasound (BUS) images are analyzed and utilized, and a method based on step-down threshold technique is employed to locate the mammary gland area. The EPSO clustering algorithm utilizes the idea of "survival of the superior and weeding out the inferior". The experimental results demonstrate that the proposed approach can segment BUS image with high accuracy and low computational time. The EPSO clustering method reduces the computational time by 32.75% compared with the standard PSO clustering algorithm. The proposed approach would find wide applications in automatic lesion classification and computer aided diagnosis (CAD) systems of breast cancer. [ABSTRACT FROM AUTHOR]

Many algorithms for applications such as pattern recognition, computer vision, and computer graphics seek to compute actual optimal paths in weighted directed graphs. The standard approach for reporting an actual optimal path is based on building a single-source optimal path tree. A technique by Chen et al.2 was given for a class of problems such that a single actual optimal path can be reported without maintaining any single-source optimal path tree, thus significantly reducing the space bound of those problems with no or little increase in their running time. In this paper, we extend the technique by Chen et al.2 to the generalized problem of reporting many actual optimal paths with different starting and ending vertices in certain directed graphs, and show how this new technique yields improved results on several application problems, such as reconstructing a 3-D surface band bounded by two simple closed curves, finding various constrained segmentation of 2-D medical images, and circular string-to-string correction. We also correct an error in the time/space complexity for the well-cited circular string-to-string correction algorithm12 and give an improved result for this problem. Although the generalized many-path problem seems more difficult than the single-path cases, our algorithms have nearly the same space and time bounds as those of the single-path cases. Our technique is likely to help improve many other optimal paths or dynamic programming algorithms. [ABSTRACT FROM AUTHOR]

The use of high-performance computers in computer simulations of physical phenomena has resulted in the generation of massive amounts of data. The analysis of these data can be challenging given their size and the complexity of the structures observed. In this paper, we describe how we can use image processing techniques to identify and count coherent structures in three-dimensional simulations of the Rayleigh-Taylor instability, which occurs when one fluid is being accelerated by a second fluid. As the two fluids mix, coherent structures are formed which grow, shrink, change shape, split, and merge with time. We describe the challenges faced in the analysis and show how we can combine image processing techniques with problem-specific characteristics to successfully analyze terabyte-sized data sets. [ABSTRACT FROM AUTHOR]

In this paper, we discuss how image segmentation can be handled by using Bayesian learning and inference. In particular variational techniques relying on free energy minimization will be introduced. It will be shown how to embed a spatial diffusion process on segmentation labels within the Variational Bayes learning procedure so as to enforce spatial constraints among labels. [ABSTRACT FROM AUTHOR]

Multiscale image analysis has been used successfully in a number of applications to segment image features according to their relative scale. In this paper, we present a new framework for the hierarchical segmentation of gray level image. The proposed scheme comprises a nonlinear scale-space and morphological gradient watersheds. Our aim is to produce a meaningful hierarchy among the objects in the image. The scale-space is based on morphological anisotropic diffusion that uses reconstruction morphological operators. Furthermore, we introduce the method to reconstruct morphological operators and the principle of the dynamics of contours in scale-space that combines scale and contrast information. The performance of the proposed segmentation scheme is presented via experimental results obtained with a wide range of image including natural scenes. [ABSTRACT FROM AUTHOR]

Image cosegmentation is a newly emerging research area in image processing. It refers to the problem of segmenting the common objects simultaneously in multiple images by utilizing the similarity of foreground regions among these images. In this paper, a new active contour model is proposed by using shape-similarity and foreground discovery scheme. The foreground discovery scheme is used to obtain the rough contours of the common objects which are used as initial evolution curves. The energy function of the proposed model includes two parts: an intra-image energy and an inter-image energy. The intra-image energy explores the differences between foreground regions and background regions in each image. And the inter-image energy is used to explore the similarities of the common objects among target images, which composes of a region color feature energy term and a shape constraint energy term. The region color feature term indicates the foreground consistency and the background consistency among the images; and the shape constraint energy term allows the global changes of shapes and truncates the local variation caused by misleading features. Experimental results show that the proposed model can improve the accuracy of the image cosegmentation significantly through regularizing the changes of shapes. [ABSTRACT FROM AUTHOR]

A novel hybrid-fitting energy-based active contours model in the level set framework is proposed. The method fuses the local image fitting term and the global image fitting term to drive the contour evolution, and a special extra term that penalizes the deviation of the level set function from a signed distance function is also included in our method, so the complex and costly reinitialization procedure is completely eliminated. Our model can efficiently segment the images with intensity inhomogeneity no matter where the initial curve is located in the image. In its numerical implementation, two efficient numerical schemes are used to ensure the sufficient efficiency of the evolution process, one is the Lattice Boltzmann Model (LBM), which is used for breaking the restrictions on time step, the other is the Sparse Field Method (SFM), which is introduced for fast local computation. Compared with the traditional schemes, these two strategies can further shorten the time consumption of the evolution process, this allows the level set to quickly reach the true target location. The extensive and promising experimental results on numerous synthetic and real images have shown that our method can efficiently improve the image segmentation performance, in terms of accuracy, efficiency, and robustness. [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]

Vascular segmentation is a crucial task in biomedical image processing, which is significant for analyzing and modeling vascular networks under physiological and pathological states. With advances in fluorescent labeling and mesoscopic optical techniques, it has become possible to map the whole-mouse-brain vascular networks at capillary resolution. However, segmenting vessels from mesoscopic optical images is a challenging task. The problems, such as vascular signal discontinuities, vessel lumens, and background fluorescence signals in mesoscopic optical images, belong to global semantic information during vascular segmentation. Traditional vascular segmentation methods based on convolutional neural networks (CNNs) have been limited by their insufficient receptive fields, making it challenging to capture global semantic information of vessels and resulting in inaccurate segmentation results. Here, we propose SegVesseler, a vascular segmentation method based on Swin Transformer. SegVesseler adopts 3D Swin Transformer blocks to extract global contextual information in 3D images. This approach is able to maintain the connectivity and topology of blood vessels during segmentation. We evaluated the performance of our method on mouse cerebrovascular datasets generated from three different labeling and imaging modalities. The experimental results demonstrate that the segmentation effect of our method is significantly better than traditional CNNs and achieves state-of-the-art performance. [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]

In order to resolve the problems of low efficiency and large separating difference in fault detection of lamp holders with single soldering lug, an image-detection-based defect detection method is presented in this paper. The selected image is first preprocessed, where the possible area of soldering lug is cut in this preprocessing to narrow the scope for subsequent partition with the consideration that the smooth surface of metal at lamp holder and black insulation glass may reflect the light. Then, the soldering lug is extracted by a series of processing including clustering partition. Based on this, the defects are detected by regional marking, area comparison, circularity and coordinate deviation. The experiment results show that the designed method is simple and practical to detect main quality defects of lamp holder with single soldering lug correctly and efficiently. [ABSTRACT FROM AUTHOR]

This paper investigates how to boost region-based image segmentation by inheriting the advantages of sparse representation and low-rank representation. A novel image segmentation model, called nonconvex regularization based sparse and low-rank coupling model, is presented for such a purpose. We aim at finding the optimal solution which is provided with sparse and low-rank simultaneously. This is achieved by relaxing sparse representation problem as L1/2 norm minimization other than the L1 norm minimization, while relaxing low-rank representation problem as the S1/2 norm minimization other than the nuclear norm minimization. This coupled model can be solved efficiently through the Augmented Lagrange Multiplier (ALM) method and half-threshold operator. Compared to the other state-of-the-art methods, the new method is better at capturing the global structure of the whole data, the robustness is better and the segmentation accuracy is also competitive. Experiments on two public image segmentation databases well validate the superiority of our method. [ABSTRACT FROM AUTHOR]