Target maneuver recognition is a prerequisite for air combat situation awareness,trajectory prediction,threat assessment and maneuver decision.To get rid of the dependence of the current target maneuver recognition me...Target maneuver recognition is a prerequisite for air combat situation awareness,trajectory prediction,threat assessment and maneuver decision.To get rid of the dependence of the current target maneuver recognition method on empirical criteria and sample data,and automatically and adaptively complete the task of extracting the target maneuver pattern,in this paper,an air combat maneuver pattern extraction based on time series segmentation and clustering analysis is proposed by combining autoencoder,G-G clustering algorithm and the selective ensemble clustering analysis algorithm.Firstly,the autoencoder is used to extract key features of maneuvering trajectory to remove the impacts of redundant variables and reduce the data dimension;Then,taking the time information into account,the segmentation of Maneuver characteristic time series is realized with the improved FSTS-AEGG algorithm,and a large number of maneuver primitives are extracted;Finally,the maneuver primitives are grouped into some categories by using the selective ensemble multiple time series clustering algorithm,which can prove that each class represents a maneuver action.The maneuver pattern extraction method is applied to small scale air combat trajectory and can recognize and correctly partition at least 71.3%of maneuver actions,indicating that the method is effective and satisfies the requirements for engineering accuracy.In addition,this method can provide data support for various target maneuvering recognition methods proposed in the literature,greatly reduce the workload and improve the recognition accuracy.展开更多
With the development of underwater sonar detection technology,simultaneous localization and mapping(SLAM)approach has attracted much attention in underwater navigation field in recent years.But the weak detection abil...With the development of underwater sonar detection technology,simultaneous localization and mapping(SLAM)approach has attracted much attention in underwater navigation field in recent years.But the weak detection ability of a single vehicle limits the SLAM performance in wide areas.Thereby,cooperative SLAM using multiple vehicles has become an important research direction.The key factor of cooperative SLAM is timely and efficient sonar image transmission among underwater vehicles.However,the limited bandwidth of underwater acoustic channels contradicts a large amount of sonar image data.It is essential to compress the images before transmission.Recently,deep neural networks have great value in image compression by virtue of the powerful learning ability of neural networks,but the existing sonar image compression methods based on neural network usually focus on the pixel-level information without the semantic-level information.In this paper,we propose a novel underwater acoustic transmission scheme called UAT-SSIC that includes semantic segmentation-based sonar image compression(SSIC)framework and the joint source-channel codec,to improve the accuracy of the semantic information of the reconstructed sonar image at the receiver.The SSIC framework consists of Auto-Encoder structure-based sonar image compression network,which is measured by a semantic segmentation network's residual.Considering that sonar images have the characteristics of blurred target edges,the semantic segmentation network used a special dilated convolution neural network(DiCNN)to enhance segmentation accuracy by expanding the range of receptive fields.The joint source-channel codec with unequal error protection is proposed that adjusts the power level of the transmitted data,which deal with sonar image transmission error caused by the serious underwater acoustic channel.Experiment results demonstrate that our method preserves more semantic information,with advantages over existing methods at the same compression ratio.It also improves the error tolerance and packet loss resistance of transmission.展开更多
X-ray computed tomography(CT)has been an important technology in paleontology for several decades.It helps researchers to acquire detailed anatomical structures of fossils non-destructively.Despite its widespread appl...X-ray computed tomography(CT)has been an important technology in paleontology for several decades.It helps researchers to acquire detailed anatomical structures of fossils non-destructively.Despite its widespread application,developing an efficient and user-friendly method for segmenting CT data continues to be a formidable challenge in the field.Most CT data segmentation software operates on 2D interfaces,which limits flexibility for real-time adjustments in 3D segmentation.Here,we introduce Curves Mode in Drishti Paint 3.2,an open-source tool for CT data segmentation.Drishti Paint 3.2 allows users to manually or semi-automatically segment the CT data in both 2D and 3D environments,providing a novel solution for revisualizing CT data in paleontological studies.展开更多
Color quantization is bound to lose spatial information of color distribution. If too much necessary spatial distribution information of color is lost in JSEG, it is difficult or even impossible for JSEG to segment im...Color quantization is bound to lose spatial information of color distribution. If too much necessary spatial distribution information of color is lost in JSEG, it is difficult or even impossible for JSEG to segment image correctly. Enlightened from segmentation based on fuzzy theories, soft class-map is constracted to solve that problem. The definitions of values and other related ones are adjusted according to the soft class-map. With more detailed values obtained from soft class map, more color distribution information is preserved. Experiments on a synthetic image and many other color images illustrate that JSEG with soft class-map can solve efficiently the problem that in a region there may exist color gradual variation in a smooth transition. It is a more robust method especially for images which haven＇ t been heavily blurred near boundaries of underlying regions.展开更多
A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the seg...A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.展开更多
Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for S...Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for SAR image is proposed. The approach is firstly used to perform coarse segmentation in blocks. Then the image is modeled with simple MRF and adaptive variable weighting forms are applied in homogeneous and heterogeneous regions. As a result, the convergent speed is accelerated while the segmentation results in homogeneous regions and boarders are improved. Simulations with synthetic and real SAR images demonstrate the effectiveness of the proposed approach.展开更多
A modified artificial bee colony optimizer(MABC)is proposed for image segmentation by using a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff.The main idea of MABC is to enrich...A modified artificial bee colony optimizer(MABC)is proposed for image segmentation by using a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff.The main idea of MABC is to enrichartificial bee foraging behaviors by combining local search and comprehensive learning using multi-dimensional PSO-based equation.With comprehensive learning,the bees incorporate the information of global best solution into the solution search equation to improve the exploration while the local search enables the bees deeply exploit around the promising area,which provides a proper balance between exploration and exploitation.The experimental results on comparing the MABC to several successful EA and SI algorithms on a set of benchmarks demonstrated the effectiveness of the proposed algorithm.Furthermore,we applied the MABC algorithm to image segmentation problem.Experimental results verify the effectiveness of the proposed algorithm.展开更多
Fuzzy c-means （FCM） algorithm is one of the most popular methods for image segmentation. However, the standard FCM algorithm is sensitive to noise because of not taking into account the spatial information in the im...Fuzzy c-means （FCM） algorithm is one of the most popular methods for image segmentation. However, the standard FCM algorithm is sensitive to noise because of not taking into account the spatial information in the image. An improved FCM algorithm is proposed to improve the antinoise performance of FCM algorithm. The new algorithm is formulated by incorporating the spatial neighborhood information into the membership function for clustering. The distribution statistics of the neighborhood pixels and the prior probability are used to form a new membership func- tion. It is not only effective to remove the noise spots but also can reduce the misclassified pixels. Experimental results indicate that the proposed algorithm is more accurate and robust to noise than the standard FCM algorithm.展开更多
In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy ...In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy c means(FCM) algorithm. Through the attributes of size and shape pattern spectrum,the optimal morphological structuring element was determined.According to the optimal parameters,some image noises were removed with an improved area opening and closing by reconstruction operation,which consist of image regional markers,and the bubbles were finely separated from each other by watershed transform.The experimental results show that the structural element can be determined adaptively by shape and size pattern spectrum,and the froth image is segmented accurately.Compared with other froth image segmentation method,the proposed method achieves much high accuracy,based on which,the bubble size and shape features are extracted effectively.展开更多
According to the characteristics of dynamic firing in pulse coupled neural network (PCNN) and regional configuration in retinal blood vessel network, a new method combined with simplified PCNN and fast 2D-Otsu algorit...According to the characteristics of dynamic firing in pulse coupled neural network (PCNN) and regional configuration in retinal blood vessel network, a new method combined with simplified PCNN and fast 2D-Otsu algorithm was proposed for automated retinal blood vessels segmentation. Firstly, 2D Gaussian matched filter was used to enhance the retinal images and simplified PCNN was employed to segment the blood vessels by firing neighborhood neurons. Then, fast 2D-Otsu algorithm was introduced to search the best segmentation results and iteration times with less computation time. Finally, the whole vessel network was obtained via analyzing the regional connectivity. Experiments implemented on the public Hoover database indicate that this new method gets a 0.803 5 true positive rate and a 0.028 0 false positive rate on an average. According to the test results, compared with Hoover algorithm and method of PCNN and 1D-Otsu, the proposed method shows much better performance.展开更多
Semantic segmentation is a crucial step for document understanding.In this paper,an NVIDIA Jetson Nano-based platform is applied for implementing semantic segmentation for teaching artificial intelligence concepts and...Semantic segmentation is a crucial step for document understanding.In this paper,an NVIDIA Jetson Nano-based platform is applied for implementing semantic segmentation for teaching artificial intelligence concepts and programming.To extract semantic structures from document images,we present an end-to-end dilated convolution network architecture.Dilated convolutions have well-known advantages for extracting multi-scale context information without losing spatial resolution.Our model utilizes dilated convolutions with residual network to represent the image features and predicting pixel labels.The convolution part works as feature extractor to obtain multidimensional and hierarchical image features.The consecutive deconvolution is used for producing full resolution segmentation prediction.The probability of each pixel decides its predefined semantic class label.To understand segmentation granularity,we compare performances at three different levels.From fine grained class to coarse class levels,the proposed dilated convolution network architecture is evaluated on three document datasets.The experimental results have shown that both semantic data distribution imbalance and network depth are import factors that influence the document’s semantic segmentation performances.The research is aimed at offering an education resource for teaching artificial intelligence concepts and techniques.展开更多
In the methods of image thresholding segmentation, such methods based on two-dimensional （2D） histogram and optimal objective functions are important. However, when they are used for infrared image segmentation, the...In the methods of image thresholding segmentation, such methods based on two-dimensional （2D） histogram and optimal objective functions are important. However, when they are used for infrared image segmentation, they are weak in suppressing background noises and worse in segmenting targets with non-uniform gray level. The concept of 2D histogram shape modification is proposed, which is realized by target information prior restraint after enhancing target information using plateau histogram equalization. The formula of 2D minimum Renyi entropy is deduced for image segmentation, then the shape-modified 2D histogram is combined wfth four optimal objective functions （i.e., maximum between-class variance, maximum entropy, maximum correlation and minimum Renyi entropy） respectively for the appli- cation of infrared image segmentation. Simultaneously, F-measure is introduced to evaluate the segmentation effects objectively. The experimental results show that F-measure is an effective evaluation index for image segmentation since its value is fully consistent with the subjective evaluation, and after 2D histogram shape modification, the methods of optimal objective functions can overcome their original forms＇ deficiency and their segmentation effects are more or less improvements, where the best one is the maximum entropy method based on 2D histogram shape modification.展开更多
A new algorithm for segmentation of suspected lung ROI(regions of interest)by mean-shift clustering and multi-scale HESSIAN matrix dot filtering was proposed.Original image was firstly filtered by multi-scale HESSIAN ...A new algorithm for segmentation of suspected lung ROI(regions of interest)by mean-shift clustering and multi-scale HESSIAN matrix dot filtering was proposed.Original image was firstly filtered by multi-scale HESSIAN matrix dot filters,round suspected nodular lesions in the image were enhanced,and linear shape regions of the trachea and vascular were suppressed.Then,three types of information,such as,shape filtering value of HESSIAN matrix,gray value,and spatial location,were introduced to feature space.The kernel function of mean-shift clustering was divided into product form of three kinds of kernel functions corresponding to the three feature information.Finally,bandwidths were calculated adaptively to determine the bandwidth of each suspected area,and they were used in mean-shift clustering segmentation.Experimental results show that by the introduction of HESSIAN matrix of dot filtering information to mean-shift clustering,nodular regions can be segmented from blood vessels,trachea,or cross regions connected to the nodule,non-nodular areas can be removed from ROIs properly,and ground glass object(GGO)nodular areas can also be segmented.For the experimental data set of 127 different forms of nodules,the average accuracy of the proposed algorithm is more than 90%.展开更多
Mixture model based image segmentation method, which assumes that image pixels are independent and do not consider the position relationship between pixels, is not robust to noise and usually leads to misclassificatio...Mixture model based image segmentation method, which assumes that image pixels are independent and do not consider the position relationship between pixels, is not robust to noise and usually leads to misclassification. A new segmentation method, called multi-resolution Ganssian mixture model method, is proposed. First, an image pyramid is constructed and son-father link relationship is built between each level of pyramid. Then the mixture model segmentation method is applied to the top level. The segmentation result on the top level is passed top-down to the bottom level according to the son-father link relationship between levels. The proposed method considers not only local but also global information of image, it overcomes the effect of noise and can obtain better segmentation result. Experimental result demonstrates its effectiveness.展开更多
An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift ...An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.展开更多
To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can ...To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can preserve the discontinuity characteristics of an image are segmented by MS algorithm,and then they are represented by a graph in which every region is represented by a node.In order to solve the graph partition problem,an improved ant clustering algorithm,called similarity carrying ant model(SCAM-ant),is proposed,in which a new similarity calculation method is given.Using SCAM-ant,the maximum number of items that each ant can carry will increase,the clustering time will be effectively reduced,and globally optimized clustering can also be realized.Because the graph is not based on the pixels of original image but on the segmentation result of MS algorithm,the computational complexity is greatly reduced.Experiments show that the proposed method can realize color image segmentation efficiently,and compared with the conventional methods based on the image pixels,it improves the image segmentation quality and the anti-interference ability.展开更多
To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this...To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.展开更多
The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance m...The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.展开更多
Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the sup...Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the support vector machine（SVM）models. First, the images are segmented by using SVM and textural statistics. A likelihood measurement for every pixel is derived by using the initial segmentation. The Chan-Vese model then is modified by adding two items： the likelihood and the distance between the initial segmentation and the evolving contour. Experimental results using real SAR images demonstrate the good performance of the proposed method compared to several classic GAC models.展开更多
Real-time hand gesture recognition technology significantly improves the user's experience for virtual reality/augmented reality(VR/AR) applications, which relies on the identification of the orientation of the ha...Real-time hand gesture recognition technology significantly improves the user's experience for virtual reality/augmented reality(VR/AR) applications, which relies on the identification of the orientation of the hand in captured images or videos. A new three-stage pipeline approach for fast and accurate hand segmentation for the hand from a single depth image is proposed. Firstly, a depth frame is segmented into several regions by histogrambased threshold selection algorithm and by tracing the exterior boundaries of objects after thresholding. Secondly, each segmentation proposal is evaluated by a three-layers shallow convolutional neural network(CNN) to determine whether or not the boundary is associated with the hand. Finally, all hand components are merged as the hand segmentation result. Compared with algorithms based on random decision forest(RDF), the experimental results demonstrate that the approach achieves better performance with high-accuracy(88.34% mean intersection over union, mIoU) and a shorter processing time(≤8 ms).展开更多
基金supported by the National Natural Science Foundation of China (Project No.72301293)。
文摘Target maneuver recognition is a prerequisite for air combat situation awareness,trajectory prediction,threat assessment and maneuver decision.To get rid of the dependence of the current target maneuver recognition method on empirical criteria and sample data,and automatically and adaptively complete the task of extracting the target maneuver pattern,in this paper,an air combat maneuver pattern extraction based on time series segmentation and clustering analysis is proposed by combining autoencoder,G-G clustering algorithm and the selective ensemble clustering analysis algorithm.Firstly,the autoencoder is used to extract key features of maneuvering trajectory to remove the impacts of redundant variables and reduce the data dimension;Then,taking the time information into account,the segmentation of Maneuver characteristic time series is realized with the improved FSTS-AEGG algorithm,and a large number of maneuver primitives are extracted;Finally,the maneuver primitives are grouped into some categories by using the selective ensemble multiple time series clustering algorithm,which can prove that each class represents a maneuver action.The maneuver pattern extraction method is applied to small scale air combat trajectory and can recognize and correctly partition at least 71.3%of maneuver actions,indicating that the method is effective and satisfies the requirements for engineering accuracy.In addition,this method can provide data support for various target maneuvering recognition methods proposed in the literature,greatly reduce the workload and improve the recognition accuracy.
基金supported in part by the Tianjin Technology Innovation Guidance Special Fund Project under Grant No.21YDTPJC00850in part by the National Natural Science Foundation of China under Grant No.41906161in part by the Natural Science Foundation of Tianjin under Grant No.21JCQNJC00650。
文摘With the development of underwater sonar detection technology,simultaneous localization and mapping(SLAM)approach has attracted much attention in underwater navigation field in recent years.But the weak detection ability of a single vehicle limits the SLAM performance in wide areas.Thereby,cooperative SLAM using multiple vehicles has become an important research direction.The key factor of cooperative SLAM is timely and efficient sonar image transmission among underwater vehicles.However,the limited bandwidth of underwater acoustic channels contradicts a large amount of sonar image data.It is essential to compress the images before transmission.Recently,deep neural networks have great value in image compression by virtue of the powerful learning ability of neural networks,but the existing sonar image compression methods based on neural network usually focus on the pixel-level information without the semantic-level information.In this paper,we propose a novel underwater acoustic transmission scheme called UAT-SSIC that includes semantic segmentation-based sonar image compression(SSIC)framework and the joint source-channel codec,to improve the accuracy of the semantic information of the reconstructed sonar image at the receiver.The SSIC framework consists of Auto-Encoder structure-based sonar image compression network,which is measured by a semantic segmentation network's residual.Considering that sonar images have the characteristics of blurred target edges,the semantic segmentation network used a special dilated convolution neural network(DiCNN)to enhance segmentation accuracy by expanding the range of receptive fields.The joint source-channel codec with unequal error protection is proposed that adjusts the power level of the transmitted data,which deal with sonar image transmission error caused by the serious underwater acoustic channel.Experiment results demonstrate that our method preserves more semantic information,with advantages over existing methods at the same compression ratio.It also improves the error tolerance and packet loss resistance of transmission.
文摘X-ray computed tomography(CT)has been an important technology in paleontology for several decades.It helps researchers to acquire detailed anatomical structures of fossils non-destructively.Despite its widespread application,developing an efficient and user-friendly method for segmenting CT data continues to be a formidable challenge in the field.Most CT data segmentation software operates on 2D interfaces,which limits flexibility for real-time adjustments in 3D segmentation.Here,we introduce Curves Mode in Drishti Paint 3.2,an open-source tool for CT data segmentation.Drishti Paint 3.2 allows users to manually or semi-automatically segment the CT data in both 2D and 3D environments,providing a novel solution for revisualizing CT data in paleontological studies.
文摘Color quantization is bound to lose spatial information of color distribution. If too much necessary spatial distribution information of color is lost in JSEG, it is difficult or even impossible for JSEG to segment image correctly. Enlightened from segmentation based on fuzzy theories, soft class-map is constracted to solve that problem. The definitions of values and other related ones are adjusted according to the soft class-map. With more detailed values obtained from soft class map, more color distribution information is preserved. Experiments on a synthetic image and many other color images illustrate that JSEG with soft class-map can solve efficiently the problem that in a region there may exist color gradual variation in a smooth transition. It is a more robust method especially for images which haven＇ t been heavily blurred near boundaries of underlying regions.
文摘A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.
基金supported by the Specialized Research Found for the Doctoral Program of Higher Education (20070699013)the Natural Science Foundation of Shaanxi Province (2006F05)the Aeronautical Science Foundation (05I53076)
文摘Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for SAR image is proposed. The approach is firstly used to perform coarse segmentation in blocks. Then the image is modeled with simple MRF and adaptive variable weighting forms are applied in homogeneous and heterogeneous regions. As a result, the convergent speed is accelerated while the segmentation results in homogeneous regions and boarders are improved. Simulations with synthetic and real SAR images demonstrate the effectiveness of the proposed approach.
基金Projects(6177021519,61503373)supported by National Natural Science Foundation of ChinaProject(N161705001)supported by Fundamental Research Funds for the Central University,China
文摘A modified artificial bee colony optimizer(MABC)is proposed for image segmentation by using a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff.The main idea of MABC is to enrichartificial bee foraging behaviors by combining local search and comprehensive learning using multi-dimensional PSO-based equation.With comprehensive learning,the bees incorporate the information of global best solution into the solution search equation to improve the exploration while the local search enables the bees deeply exploit around the promising area,which provides a proper balance between exploration and exploitation.The experimental results on comparing the MABC to several successful EA and SI algorithms on a set of benchmarks demonstrated the effectiveness of the proposed algorithm.Furthermore,we applied the MABC algorithm to image segmentation problem.Experimental results verify the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(6087403160740430664)
文摘Fuzzy c-means （FCM） algorithm is one of the most popular methods for image segmentation. However, the standard FCM algorithm is sensitive to noise because of not taking into account the spatial information in the image. An improved FCM algorithm is proposed to improve the antinoise performance of FCM algorithm. The new algorithm is formulated by incorporating the spatial neighborhood information into the membership function for clustering. The distribution statistics of the neighborhood pixels and the prior probability are used to form a new membership func- tion. It is not only effective to remove the noise spots but also can reduce the misclassified pixels. Experimental results indicate that the proposed algorithm is more accurate and robust to noise than the standard FCM algorithm.
基金Projects(60634020,60874069) supported by the National Natural Science Foundation of ChinaProject(2009AA04Z137) supported by the National High-Tech Research and Development Program of China
文摘In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy c means(FCM) algorithm. Through the attributes of size and shape pattern spectrum,the optimal morphological structuring element was determined.According to the optimal parameters,some image noises were removed with an improved area opening and closing by reconstruction operation,which consist of image regional markers,and the bubbles were finely separated from each other by watershed transform.The experimental results show that the structural element can be determined adaptively by shape and size pattern spectrum,and the froth image is segmented accurately.Compared with other froth image segmentation method,the proposed method achieves much high accuracy,based on which,the bubble size and shape features are extracted effectively.
基金Project (60872081) supported by the National Natural Science Foundation of ChinaProject (50051) supported by the Program for New Century Excellent Talents in UniversityProject (4092034) supported by the Natural Science Foundation of Beijing
文摘According to the characteristics of dynamic firing in pulse coupled neural network (PCNN) and regional configuration in retinal blood vessel network, a new method combined with simplified PCNN and fast 2D-Otsu algorithm was proposed for automated retinal blood vessels segmentation. Firstly, 2D Gaussian matched filter was used to enhance the retinal images and simplified PCNN was employed to segment the blood vessels by firing neighborhood neurons. Then, fast 2D-Otsu algorithm was introduced to search the best segmentation results and iteration times with less computation time. Finally, the whole vessel network was obtained via analyzing the regional connectivity. Experiments implemented on the public Hoover database indicate that this new method gets a 0.803 5 true positive rate and a 0.028 0 false positive rate on an average. According to the test results, compared with Hoover algorithm and method of PCNN and 1D-Otsu, the proposed method shows much better performance.
基金Project(61806107)supported by the National Natural Science Foundation of ChinaProject supported by the Shandong Key Laboratory of Wisdom Mine Information Technology,ChinaProject supported by the Opening Project of State Key Laboratory of Digital Publishing Technology,China。
文摘Semantic segmentation is a crucial step for document understanding.In this paper,an NVIDIA Jetson Nano-based platform is applied for implementing semantic segmentation for teaching artificial intelligence concepts and programming.To extract semantic structures from document images,we present an end-to-end dilated convolution network architecture.Dilated convolutions have well-known advantages for extracting multi-scale context information without losing spatial resolution.Our model utilizes dilated convolutions with residual network to represent the image features and predicting pixel labels.The convolution part works as feature extractor to obtain multidimensional and hierarchical image features.The consecutive deconvolution is used for producing full resolution segmentation prediction.The probability of each pixel decides its predefined semantic class label.To understand segmentation granularity,we compare performances at three different levels.From fine grained class to coarse class levels,the proposed dilated convolution network architecture is evaluated on three document datasets.The experimental results have shown that both semantic data distribution imbalance and network depth are import factors that influence the document’s semantic segmentation performances.The research is aimed at offering an education resource for teaching artificial intelligence concepts and techniques.
基金supported by the China Postdoctoral Science Foundation(20100471451)the Science and Technology Foundation of State Key Laboratory of Underwater Measurement&Control Technology(9140C2603051003)
文摘In the methods of image thresholding segmentation, such methods based on two-dimensional （2D） histogram and optimal objective functions are important. However, when they are used for infrared image segmentation, they are weak in suppressing background noises and worse in segmenting targets with non-uniform gray level. The concept of 2D histogram shape modification is proposed, which is realized by target information prior restraint after enhancing target information using plateau histogram equalization. The formula of 2D minimum Renyi entropy is deduced for image segmentation, then the shape-modified 2D histogram is combined wfth four optimal objective functions （i.e., maximum between-class variance, maximum entropy, maximum correlation and minimum Renyi entropy） respectively for the appli- cation of infrared image segmentation. Simultaneously, F-measure is introduced to evaluate the segmentation effects objectively. The experimental results show that F-measure is an effective evaluation index for image segmentation since its value is fully consistent with the subjective evaluation, and after 2D histogram shape modification, the methods of optimal objective functions can overcome their original forms＇ deficiency and their segmentation effects are more or less improvements, where the best one is the maximum entropy method based on 2D histogram shape modification.
基金Projects(61172002,61001047,60671050)supported by the National Natural Science Foundation of ChinaProject(N100404010)supported by Fundamental Research Grant Scheme for the Central Universities,China
文摘A new algorithm for segmentation of suspected lung ROI(regions of interest)by mean-shift clustering and multi-scale HESSIAN matrix dot filtering was proposed.Original image was firstly filtered by multi-scale HESSIAN matrix dot filters,round suspected nodular lesions in the image were enhanced,and linear shape regions of the trachea and vascular were suppressed.Then,three types of information,such as,shape filtering value of HESSIAN matrix,gray value,and spatial location,were introduced to feature space.The kernel function of mean-shift clustering was divided into product form of three kinds of kernel functions corresponding to the three feature information.Finally,bandwidths were calculated adaptively to determine the bandwidth of each suspected area,and they were used in mean-shift clustering segmentation.Experimental results show that by the introduction of HESSIAN matrix of dot filtering information to mean-shift clustering,nodular regions can be segmented from blood vessels,trachea,or cross regions connected to the nodule,non-nodular areas can be removed from ROIs properly,and ground glass object(GGO)nodular areas can also be segmented.For the experimental data set of 127 different forms of nodules,the average accuracy of the proposed algorithm is more than 90%.
基金This project was supported by the National Natural Foundation of China (60404022) and the Foundation of Department ofEducation of Hebei Province (2002209).
文摘Mixture model based image segmentation method, which assumes that image pixels are independent and do not consider the position relationship between pixels, is not robust to noise and usually leads to misclassification. A new segmentation method, called multi-resolution Ganssian mixture model method, is proposed. First, an image pyramid is constructed and son-father link relationship is built between each level of pyramid. Then the mixture model segmentation method is applied to the top level. The segmentation result on the top level is passed top-down to the bottom level according to the son-father link relationship between levels. The proposed method considers not only local but also global information of image, it overcomes the effect of noise and can obtain better segmentation result. Experimental result demonstrates its effectiveness.
文摘An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.
基金Project(60874070) supported by the National Natural Science Foundation of China
文摘To improve the segmentation quality and efficiency of color image,a novel approach which combines the advantages of the mean shift(MS) segmentation and improved ant clustering method is proposed.The regions which can preserve the discontinuity characteristics of an image are segmented by MS algorithm,and then they are represented by a graph in which every region is represented by a node.In order to solve the graph partition problem,an improved ant clustering algorithm,called similarity carrying ant model(SCAM-ant),is proposed,in which a new similarity calculation method is given.Using SCAM-ant,the maximum number of items that each ant can carry will increase,the clustering time will be effectively reduced,and globally optimized clustering can also be realized.Because the graph is not based on the pixels of original image but on the segmentation result of MS algorithm,the computational complexity is greatly reduced.Experiments show that the proposed method can realize color image segmentation efficiently,and compared with the conventional methods based on the image pixels,it improves the image segmentation quality and the anti-interference ability.
基金Project(06JJ50110) supported by the Natural Science Foundation of Hunan Province, China
文摘To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.
基金supported by the National Natural Science Foundationof China(61272119)
文摘The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.
基金supported by the National Natural Science Foundation of China(4117132741301361)+2 种基金the National Key Basic Research Program of China(973 Program)(2012CB719903)the Science and Technology Project of Ministry of Transport of People’s Republic of China(2012-364-X11-803)the Shanghai Municipal Natural Science Foundation(12ZR1433200)
文摘Segmentation is the key step in auto-interpretation of high-resolution spaceborne synthetic aperture radar（SAR） images. A novel method is proposed based on integrating the geometric active contour（GAC） and the support vector machine（SVM）models. First, the images are segmented by using SVM and textural statistics. A likelihood measurement for every pixel is derived by using the initial segmentation. The Chan-Vese model then is modified by adding two items： the likelihood and the distance between the initial segmentation and the evolving contour. Experimental results using real SAR images demonstrate the good performance of the proposed method compared to several classic GAC models.
文摘Real-time hand gesture recognition technology significantly improves the user's experience for virtual reality/augmented reality(VR/AR) applications, which relies on the identification of the orientation of the hand in captured images or videos. A new three-stage pipeline approach for fast and accurate hand segmentation for the hand from a single depth image is proposed. Firstly, a depth frame is segmented into several regions by histogrambased threshold selection algorithm and by tracing the exterior boundaries of objects after thresholding. Secondly, each segmentation proposal is evaluated by a three-layers shallow convolutional neural network(CNN) to determine whether or not the boundary is associated with the hand. Finally, all hand components are merged as the hand segmentation result. Compared with algorithms based on random decision forest(RDF), the experimental results demonstrate that the approach achieves better performance with high-accuracy(88.34% mean intersection over union, mIoU) and a shorter processing time(≤8 ms).
