Interactive object segmentation is widely used for extracting any user-interested objects from natural images. A common problem with many interactive segmentation approaches is that the object segmentation quality is ...
详细信息
In this paper, according to the development of the fractional differentiation and its applications in the modern signal processing, we improve the numerical calculation of fractional differentiation by piecewise quadr...
详细信息
A novel image threshold selection approach based on structural similarity (SSIM) is proposed. The thresholded image is obtained first, then comparison regions are extracted based on the local variance of the neighborh...
详细信息
A novel image threshold selection approach based on structural similarity (SSIM) is proposed. The thresholded image is obtained first, then comparison regions are extracted based on the local variance of the neighborhood of the thresholded image. Due to the characteristic of comparison regions, the conventional SSIM expression is simplified as a nonparametric form, and the partial SSIM (PSSIM) is defined. The optimal threshold is selected by maximizing the PSSIM criterion function at last. Besides the introduction of a novel approach, this is also the first attempt to expand the application scope of SSIM to range image thresholding in general. The proposed approach has an advantage over thresholding methods based on the histogram. The method was tested on a variety of images including the synthetic image and real images. Experimental results show that the proposed approach achieves better applicability, preferable ability for extracting object and better anti-noise capability than popular methods.
作者:
Z. ChenJ. G. LiuG. Y. WangIntelligence Control
Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China Intelligence Control
Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China
According to the drawback of the traditional circle target extraction algorithm from high resolution remote sensing imagery used by Hough Transform, such as computation complexity, low efficiency and etc, a new circle...
详细信息
According to the drawback of the traditional circle target extraction algorithm from high resolution remote sensing imagery used by Hough Transform, such as computation complexity, low efficiency and etc, a new circle target extraction method is proposed in this paper which can extract multiple circle targets with different radius at one time. First, the Average Absolute Difference is implemented to enhance the edge of the circle targets and suppress the noise of the background. Secondly, the locally self-adaptive segmentation algorithm is implemented to obtain the binary image. Thirdly, the thinning algorithm based on model computation is implanted to obtain the single pixel edge of the circle targets and in order to reduce the computation times in the following process. Furthermore, a pruning algorithm is necessary; finally, a modified Hough transform algorithm is proposed to obtain the circle targets. The experimental results demonstrate that the new circle targets algorithm can extract the multiple circle targets quickly and accurately, which has three advantages: low time consuming, high detection rate, robust to noise and fragmentary boundaries.
Fault tolerance is a central issue in the design and implementation of interconnection networks for large parallel systems. Connection probability of a network is a good network fault tolerance measure. For a mesh of ...
详细信息
Fault tolerance is a central issue in the design and implementation of interconnection networks for large parallel systems. Connection probability of a network is a good network fault tolerance measure. For a mesh of given size and node failure probability, the gap between the known upper and lower bounds on the connection probability is often very large. In this paper we design algorithms to estimate the connection probability for 2-D meshes by Monte Carlo methods. The experiment is carefully designed and performed, and the simulation results give good estimates of the connection probability for 2-D meshes and can be used to evaluate the known lower and upper bounds on connection probability for 2-D meshes.
This paper presents a novel fast single-pass contour tracing algorithm in a binary image. The proposed algorithm is viewed as follow steps: firstly a set of contour segments of all object contours can be generated and...
详细信息
ISBN:
(纸本)9781612847719
This paper presents a novel fast single-pass contour tracing algorithm in a binary image. The proposed algorithm is viewed as follow steps: firstly a set of contour segments of all object contours can be generated and traced in a top-down line scan fashion; then all contour segments are employed to be integrated into respective intact contours; finally all results are converted into the chain code as the final output. This algorithm can extract multiple contours of an image in one pass and never lose any outer and inner contour of object region. It is faster on implementation. Experiments results prove those advantages.
According to the feature that the gray distribution of the transition region (locating between the objects and the background) is more scattered than that of the regions of targets or background in an image, this pape...
详细信息
According to the feature that the gray distribution of the transition region (locating between the objects and the background) is more scattered than that of the regions of targets or background in an image, this paper proposes a novel method concerning about transition region extraction and segmentation, which is based on local variance of different areas of an image. The experiments indicate that the proposed approach can achieve better segmentation results than the local complexity method (one of the previous methods for extracting transition region).What's more, the novel approach outperforms the local complexity method about more complete and more accurate transition regions, less interference from backgrounds, more detail information of segmented targets, clearer and better segmented targets, easier calculation, and higher processing speed.
Fractional calculus is relative to the traditional integer order calculus put forward, which is the order of calculus from integer orders extended to any order of the mathematical promotion. From the theoretical point...
详细信息
An efficient algorithm is presented to label the connected components in the case that the primary memory is smaller than the image data. Our algorithm uses only the memory of two image rows to label the huge image or...
详细信息
An efficient algorithm is presented to label the connected components in the case that the primary memory is smaller than the image data. Our algorithm uses only the memory of two image rows to label the huge image or any image larger than the available memory. The search path compression is a applied for improving the performance further. An extensive comparison with the state-of-art algorithms is proposed, both on random and real datasets. Our algorithm shows an impressive speedup, while the auxiliary memory is not required at all comparing with all competitors.
SIFT (Scale Invariant Feature Transform) is one of most popular approach for feature detection and matching. Many parallelized algorithms have been proposed to accelerate SIFT to apply into real-time systems. This pap...
详细信息
SIFT (Scale Invariant Feature Transform) is one of most popular approach for feature detection and matching. Many parallelized algorithms have been proposed to accelerate SIFT to apply into real-time systems. This paper divides the researches into three different categories, that is, optimizing parallel algorithms based on general purpose multi-core processors, designing customized multi-core processor dedicated for SIFT and implementing SIFT based FPGA (Field Programmable Gate Arrays). Overview of the three type researches and analysis of task-level parallelism are presented in this paper.
暂无评论