遗传模糊聚类算法在图像边缘检测中的应用

将一种改进的遗传模糊c-均值聚类(GFGA)算法应用到图像的边缘检测中.我们将灰度图像中的每一个像素点看成是一个数据样本,将该点的灰度值经过Robert算子、Sobel算子和Prewitt算子处理构成它的特性向量,形成具有三维特征的数据集,然后对这个数据集应用遗传模糊聚类算法进行分类,自适应地检测出图像的边缘点,达到提取边缘的目的.实验结果表明,这种混合算法能得到很好的边缘效果,并且得到的结果无需再细化处理,提高了边缘定位的精度.     

基于模糊中值滤波的椒盐噪声去除方法

研究基于模糊中值滤波的椒盐噪声去除方法。通过比较图像各像素点的灰度值,定义基于图像梯度信息的各点被判别为噪声点的模糊隶属函数。利用此模糊隶属函数对中值滤波方法进行加权,得到了一种加权中值滤波器,可实现边缘处椒盐噪声的有效滤除。讨论这种模糊加权方法与其它先进滤波方法的结合途径,指出了其推广应用价值。最后利用数值实验验证本文方法的有效性,结果表明,相比于自适应中值滤波方法,本文方法得到的滤波图像在峰值信噪比及结构相似度方面均有明显提高。     

基于方向信息测度的图像边缘检测

边缘检测是图像处理中—个重要的研究课题．针对传统图像边缘检测算法对噪声敏感的问题,本文在分析图像像素灰度信息的基础上,建立了—个改进的确定方向信息测度的方法,并利用震动滤波对边缘检测图像进行增强,该方法在滤除噪声的同时,能有效地保留图像的基本目标信息,正确提取图像的边缘．     

基于D-S证据理论的杂草图像边缘检测的研究

为了解决杂草图像边缘检测的不确定性问题,构造出图像边缘的邻域一致性、方向性和结构性三种信息测度统计,利用D-S证据理论对三种测度进行融合来实现分割后杂草图像的边缘检测,实验表明,此算法能够有效的降低噪声的影响,准确的提取出杂草边缘.     

一种结合小波模极大值法和Canny算子的目标提取方法

针对基于小波变换的目标提取中忽略低频子图像的一些重要信息的问题.提出了一种基于小波变换的模极大值法和Canny算子的目标提取方法.在小波域中,通过求解局部小波系数模型的极大值点提取(检测)高频边缘,利用Canny算子提取(检测)低频边缘.然后根据融合规则对两个子图像边缘进行融合.实验结果表明,该方法不仅能有效地增强图像边缘,而且能准确地定位图像边缘.     

改进Canny算法在钢印数字特征提取中的应用

边缘检测是实现图像分割、特征提取和图像理解的基础.研究了传统Canny算子的优势与不足.在此基础上,提出了一种快速分块自适应Canny算法.方法首先按字符大小分割图像,然后在每一块上进行自适应边缘检测.自适应边缘检测是在平滑图像的同时得到高斯滤波尺度参数,然后采用Otsu方法的自适应阈值计算Canny算子的高、低门限值.实验结果表明,方法不需人工设定参数就能自动提取不同光照背景下的钢印数字边缘,而且能有效抑制噪声,与传统Canny算子相比,边缘连接程度最佳,噪声敏感程度较低,实时性较强.     

图像的多层次模糊增强与边缘提取

在单层次模糊增强算法中,某个灰度层次附近的边缘得到了增强,同时其它的一些边缘受到了抑制。为了同时增强图像中不同灰度层次的边缘信息,提出一种多层次模糊增强算法,并且给出了快速实现算法。此外,把多层次模糊增强算法应用于图像边缘提取中,取得了优于单层次模糊增强的效果。     

估计运动模糊图像方向角的数学模型研究

从实拍的运动模糊图像出发,建立了数学模型来估计运动模糊的方向角.经理论推导,得出了运动模糊方向角、图像尺寸和频谱图像中平行条纹方向角三者的关系,将问题转化为估计频谱平行条纹方向角.在模型求解部分,分析了常用的Radon变换法以及两种改进方法即Gabor变换法和频谱分块法的不足,并提出了基于频谱边缘检测的改进方法.数值实验部分比较了三种方法,结果表明,方法的估计精度更高,具有更广泛的应用性.     

基于多特征与卷积神经网络的SAR图像分类方法

针对合成孔径雷达图像的分类优化方法,提出一种基于多特征与卷积神经网络的SAR图像分类方法Canny-WTD-CNN.将Canny算子提取的边缘特征,与小波阈值去噪法提取的小波特征进行自适应融合,作为卷积神经网络的输入;以softmax为分类器,对SAR图像进行分类识别检测.最后利用MSTAR公开数据集的三类目标数据进行试验,并给出该方法与其他方法结果的对比,表明该方法的有效性,识别率达到99.14%.     

一种基于模糊信息的距离测度及应用

通过借用Shannon信息理论中的相关概念,提出了基于模糊信息测度的模糊对称交互熵(FSCE)这一距离测度。接下来证明了它是度量空间中的度量,满足非负性、对称性、三角不等式三个条件。最后利用数值例子说明了在模糊模式识别中,FSCE与常见的模糊贴近度可以得到一致的识别结果,并有其优势和实际意义,为模糊模式识别提供了新的研究方法。     

Using Conventional Edge Detectors and Postsmoothing for Segmentation of Spotted Microarray Images

Segmentation of spotted microarray images is important in generating gene expression data. It aims to distinguish foreground pixels from background pixels for a given spot of a microarray image. Edge detection in the image processing literature is a closely related research area, because spot boundary curves separating foregrounds from backgrounds in a microarray image can be treated as edges. However, for generating gene expression data, segmentation methods for handling spotted microarray images are required to classify each pixel as either a foreground or a background pixel; most conventional edge detectors in the image processing literature do not have this classification property, because their detected edge pixels are often scattered in the whole design space and consequently the foreground or background pixels are not defined. In this article, we propose a general postsmoothing procedure for estimating spot boundary curves from the detected edge pixels of conventional edge detectors, such that these conventional edge detectors together with the proposed postsmoothing procedure can be used for segmentation of spotted microarray images. Numerical studies show that this proposal works well in applications.

Datasets and computer code are available in the online supplements.     

A Subpixel Image Restoration Algorithm

Abstract

In statistical image reconstruction, data are often recorded on a regular grid of squares, known as pixels, and the reconstructed image is defined on the same pixel grid. Thus, the reconstruction of a continuous planar image is piecewise constant on pixels, and boundaries in the image consist of horizontal and vertical edges lying between pixels. This approximation to the true boundary can result in a loss of information that may be quite noticeable for small objects, only a few pixels in size. Increasing the resolution of the sensor may not be a practical alternative. If some prior assumptions are made about the true image, however, reconstruction to a greater accuracy than that of the recording sensor's pixel grid is possible. We adopt a Bayesian approach, incorporating prior information about the true image in a stochastic model that attaches higher probability to images with shorter total edge length. In reconstructions, pixels may be of a single color or split between two colors. The model is illustrated using both real and simulated data.     

A DC optimization-based clustering technique for edge detection

We introduce a method for edge detection which is based on clustering the pixels representing any given digital image into two sets (the edge pixels and the non-edge ones). The process is based on associating to each pixel an appropriate vector representing the differences in brightness w.r.t. the surrounding pixels. Clustering is driven by the norms of such vectors, thus it takes place in \(\mathbb {R}\), which allows us to use a (simple) DC (Difference of Convex) optimization algorithm to get the clusters. A novel thinning technique, based on calculation of the edge phase angles, refines the classification obtained by the clustering algorithm. The results of some numerical experiments are also provided.     

A fractional order derivative based active contour model for inhomogeneous image segmentation

Segmenting intensity inhomogeneous images is a challenging task for both local and global methods. Some hybrid methods have great advantages over the traditional methods in inhomogeneous image segmentation. In this paper, a new hybrid method is presented, which incorporates image gradient, local environment and global information into a framework, called adaptive-weighting active contour model. The energy or level set functions in the framework mainly include two parts: a global term and local term. The global term aims to enhance the image contrast, and it can also accelerate the convergence rate when minimizing the energy function. The local term integrates fractional order differentiation, fractional order gradient magnitude, and difference image information into the well-known local Chan–Vese model, which has been shown to be effective and efficient in modeling the local information. The local term can also enhance low frequency information and improve the inhomogeneous image segmentation. An adaptive weighting strategy is proposed to balance the actions of the global and local terms automatically. When minimizing the level set functions, regularization can be imposed by applying Gaussian filtering to ensure smoothness in the evolution process. In addition, a corresponding stopping criterion is proposed to ensure the evolving curve automatically stops on true boundaries of objects. Dice similarity coefficient is employed as the comparative quantitative measures for the segmented results. Experiments on synthetic images as well as real images are performed to demonstrate the segmentation accuracy and computational efficiency of the presented hybrid method.     

A “Nonconvex+Nonconvex” approach for image restoration with impulse noise removal

In this paper, we propose a new method for image restoration problems, which are degraded by impulsive noise, with nonconvex data fitting term and nonconvex regularizer.The proposed method possesses the advantages of nonconvex data fitting and nonconvex regularizer simultaneously, namely, robustness for impulsive noise and efficiency for restoring neat edge images.Further, we propose an efficient algorithm to solve the “Nonconvex+Nonconvex” structure problem via using the alternating direction minimization, and prove that the algorithm is globally convergent when the regularization parameter is known. However, the regularization parameter is unavailable in general. Thereby, we combine the algorithm with the continuation technique and modified Morozov’s discrepancy principle to get an improved algorithm in which a suitable regularization parameter can be chosen automatically. The experiments reveal the superior performances of the proposed algorithm in comparison with some existing methods.     

Linear interpolation for image conversion between square structure and hexagonal structure

Spiral Architecture (SA) is a relatively new and powerful image structure consisting of hexagonal pixels arranged in a onedimensional coordinate system. However, all the existing hardware for capturing image and for displaying image are produced based on traditional square image structure. In this paper, we present a software approach to represent an image on SA based on linear interpolation method. We perform edge detection on SA to demonstrate the advantages of image processing on SA. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于迭代函数系统和编码空间的数字图像置乱方法研究

针对数字图像的安全保密问题 ,本文介绍了一种基于位置空间的数字图像置乱技术 .首先利用伴随于迭代函数系统 ( IFS)的编码空间对数字图像各像素赋予不同编码 ,然后通过对编码的特定置换使各像素位置改变以达到图像置乱的目的 .本文讨论了置乱变换对原图信息分散的规律以及变换的周期性 .理论和实践表明 ,该方法克服了图像信息量大造成的编码上的困难 ,置乱变换后原图的信息按照特定的规律分散开 ,增强了信息隐藏的不可感知性 .     

Application of new advanced CNN structure with adaptive thresholds to color edge detection

Color edge detection is much more efficient than gray scale detection when edges exist at the boundary between regions of different colors with no change in intensity. This paper presents adaptive templates, which are capable of detecting various color and intensity changes in color image. To avoid conception of multilayer proposed in literatures, modification has been done to the CNN structure. This modified structure allows a matrix C, which carries the change information of pixels, to replace the control parts in the basic CNN equation. This modification is necessary because in multilayer structure, it faces the challenge of how to represent the intrinsic relationship among each primary layer. Additionally, in order to enhance the accuracy of edge detection, adaptive detection threshold is employed. The adaptive thresholds are considered to be alterable criteria in designing matrix C. The proposed synthetic system not only avoids the problem which is engendered by multi-layers but also exploits full information of pixels themselves. Experimental results prove that the proposed method is efficient.