A New Image Analysis Based Method for Measuring Electrospun Nanofiber Diameter

In this paper, a new image analysis based method for electrospun nanofiber diameter measurement has been presented. The method was tested by a simulated image with known characteristics and a real web. Mean (M) and standard deviation (STD) of fiber diameter obtained using this method for the simulated image were 15.02 and 4.80 pixels respectively, compared to the true values of 15.35 and 4.47 pixels. For the real web, applying the method resulted in M and STD of 324 and 50.4 nm which are extremely close to the values of 319 and 42 nm obtained using manual method. The results show that this approach is successful in making fast, accurate automated measurements of electrospun fiber diameters.     

基于图像内容的多子波去噪

本文介绍了多子波变换的一般理论及OPTFR多子波的性质,通过改进其一阶平衡器,避免了预滤波,从而简化了运算。在将OPTFR多子波用于图像处理时,采用了一种基于图像内容的阈值方法,实验结果表明,其去噪效果优于CL多子波及一般的阈值方法。     

一种空间自适应小波门限去噪算法

提出了一种空间自适应小波门限去噪算法,该算法在小波域对含噪小波系数做两次自适应去噪,两次自适应门限分别基于最大似然(ML)方差估计和最大后验概率(MAP)方差估计.仿真结果表明,该算法与其它自适应门限去噪算法相比,去噪后的图象具有更高的峰值信噪比(PSNR).     

用基函数神经网络实现多阈值图象分割

本文介绍了一种用基函数神经网络实现多阈值图象分割的新方法。它从函数逼近的角度研究基于灰度直方图的多阈值分割问题，提出了一种模糊反向传播学习算法，采用该算法的高斯基函数网络能够准确检测直方图中包含的子区域和它们的分布函数，而且速度很快。实验表明本文的方法在实际图象分割中是有效的。     

触觉传感器及其图象识别

本文讨论了两种触觉传感器,系统地阐述了这两种触觉传感器的数据采集系统和图象二值化的有关算法。     

Efficient multilevel image segmentation through fuzzy entropy maximization and graph cut optimization

The fuzzy c-partition entropy has been widely adopted as a global optimization technique for finding the optimized thresholds for multilevel image segmentation. However, it involves expensive computation as the number of thresholds increases and often yields noisy segmentation results since spatial coherence is not enforced. In this paper, an iterative calculation scheme is presented for reducing redundant computations in entropy evaluation. The efficiency of threshold selection is further improved through utilizing the artificial bee colony algorithm as the optimization technique. Finally, instead of performing thresholding for each pixel independently, the presented algorithm oversegments the input image into small regions and uses the probabilities of fuzzy events to define the costs of different label assignments for each region. The final segmentation results is computed using graph cut, which produces smooth segmentation results. The experimental results demonstrate the presented iterative calculation scheme can greatly reduce the running time and keep it stable as the number of required thresholds increases. Quantitative evaluations over 20 classic images also show that the presented algorithm outperforms existing multilevel segmentation approaches.     

气液两相流中气泡形态及运动特征参数提取

对气泡发生装置中竖直向上气泡的形态及运动特征提取方法进行了研究。采集原始气泡图像,进行图像灰度化、差影和中值滤波等图像预处理,针对气泡图像的特点,提出动态阈值压缩大津法进行阈值分割,并结合扫描线种子填充算法与图像形态学运算进行孔洞填充,同时基于边缘面积属性对气泡特征区域进行自动识别。实验结果表明,该方法简单有效,鲁棒性强,可以很好地将目标气泡从背景中分离出来,有效提取气泡周长、面积、圆形度和质心坐标等形态特征参数,并实现气泡运动速度的测量。     

利用.NET组件技术实现刀具图像的检测

为了实现刀具图像的轮廓跟踪,提取轮廓点,采用Matlab.NET component与Mi-crosoft Visual Studio C Sharp混和编程技术,并运用模糊C均值聚类（Fuzzy C Mean cluste-ring,FCM）算法对图像进行处理,返回分割阈值,实现对灰度图像的分割.同时为避免出现轮廓断点,引入编码技术,再经过8邻域搜索目标轮廓,最终完成刀具图像轮廓跟踪.与微分算子的边缘检测对比,本文算法利用FCM分割图像,又引入编码技术,实现轮廓连续的跟踪检测,该方法分割效果较好,界面编写简单,运行简便.     

一种新信息熵定义及其在图像分割中的应用

熵阈值法是图像分割中的重要方法,并在图像处理中得到了广泛的应用。针对香农熵阈值法因存在对数计算而导致计算量过大的问题,本文首先提出了一种新的信息熵;其次对其一些性质进行了探讨;最后用于图像分割的阈值选取。实验结果表明,本文的新熵阈值法是可行的,且其计算所需时间量远小于比香农熵阈值法。     

Sparse kernel logistic regression based on L 1/2 regularization

The sparsity driven classification technologies have attracted much attention in recent years, due to their capability of providing more compressive representations and clear interpretation. Two most popular classification approaches are support vector machines (SVMs) and kernel logistic regression (KLR), each having its own advantages. The sparsification of SVM has been well studied, and many sparse versions of 2-norm SVM, such as 1-norm SVM (1-SVM), have been developed. But, the sparsification of KLR has been less studied. The existing sparsification of KLR is mainly based on L ₁ norm and L ₂ norm penalties, which leads to the sparse versions that yield solutions not so sparse as it should be. A very recent study on L _1/2 regularization theory in compressive sensing shows that L _1/2 sparse modeling can yield solutions more sparse than those of 1 norm and 2 norm, and, furthermore, the model can be efficiently solved by a simple iterative thresholding procedure. The objective function dealt with in L _1/2 regularization theory is, however, of square form, the gradient of which is linear in its variables (such an objective function is the so-called linear gradient function). In this paper, through extending the linear gradient function of L _1/2 regularization framework to the logistic function, we propose a novel sparse version of KLR, the 1/2 quasi-norm kernel logistic regression (1/2-KLR). The version integrates advantages of KLR and L _1/2 regularization, and defines an efficient implementation scheme of sparse KLR. We suggest a fast iterative thresholding algorithm for 1/2-KLR and prove its convergence. We provide a series of simulations to demonstrate that 1/2-KLR can often obtain more sparse solutions than the existing sparsity driven versions of KLR, at the same or better accuracy level. The conclusion is also true even in comparison with sparse SVMs (1-SVM and 2-SVM). We show an exclusive advantage of 1/2-KLR that the regularization parameter in the algorithm can be adaptively set whenever the sparsity (correspondingly, the number of support vectors) is given, which suggests a methodology of comparing sparsity promotion capability of different sparsity driven classifiers. As an illustration of benefits of 1/2-KLR, we give two applications of 1/2-KLR in semi-supervised learning, showing that 1/2-KLR can be successfully applied to the classification tasks in which only a few data are labeled.