工程图标注字符的提取与识别

本文介绍了一种基于连通域检测的工程图标注字符的提取与识别方法；首先建立了一种基于连通域和子连通域的工程图的层次表示，然后利用大小判据从连通域中找出字符候选，再利用共线判据提取出标注字符串，最后在预先总结出来的字符串模板的指导下，对提取出的字符串进行分析和识别。     

基于快速连通域标记的车牌字符分割

对车牌图像的二值图进行连通域提取可以解决倾斜带来的问题.提出了一种基于快速连通域标记的字符分割方法.先用改进的Otsu法对车牌图像进行二值化分割,之后基于快速连通域标记算法进行连通域标记,最后对各个连通域进行后续处理提取出全部车牌字符连通域.实验表明,改进的快速连通域标记算法克服了倾斜问题,而且有效地提高了连通域提取的速度,获得较好的字符分割的鲁棒性和实时性.     

复杂背景下的车辆牌照字符提取方法研究

针对复杂背景中字符难于提取的问题，提出了 一种通用的提取字符的方法．该方法很好地利用了字符固有的特性，先对图像进行基于变分 法的自适应二值化，再用一种快速区域标号算法求取连通域，然后对连通域进行处理，提取 出字符行，最后进行倾斜校正．实验结果表明，该方法简单可行，成功率达到了96%以上．     

基于DCT压缩域的图象字符定位

为了能够利用图象中所含的文字信息来进行图象的快速高效浏览检查，其中，快速字符定位是很重要的工作，为此设计了一种直接在图象压缩域中进行字符定位的方法，该方法主要是利用图象中字符纹理所具有的方向性特点，首先直接在DCT域中提取字符的横向、竖向、斜向纹理的方向信息，然后根据各自的阈值把字符区域从图象背景中分割出来，在处理过程中，用形态滤波的方法可有效地消除噪音点，该算法可直接处理JPEG、MPEG等以DCT为编码基础的压缩数据，仅需少量的解码过程（Huffman解码）即可完成字符定位，因此要处理的数据量较少，用该算法既提高了处理速度，又减少了对计算机资源的需求，试验结果表明，此方法具有较高的准确率。     

HSV色彩空间中的多阈值车牌定位分割方法

本文是在HSV颜色空间下,根据车牌区域的颜色和几何特征,通过多阈值分割的方法,综合利用数学形态学运算、连通域形状和字符密度检测,有效解决了彩色图片车牌提取的问题。实验表明,该方法效果好,精度高,通过154幅实测机动车图象进行车牌定住分割。准确率91％。     

基于连通域的模板匹配法用于字符识别的算法研究

文章介绍了一种用于字符识别的基于连通域的模板匹配算法.该算法是在传统的模板匹配法的基础上,运用了重心重叠等处理方法,并且对字符块进行连通域处理后再实施匹配,最后利用最大相似法得出识别结果.该算法在光学仪器读数图象的动态识别中取得了良好的识别效果.     

一种字符图像线段提取及细化算法

为了对字符图像进行稳定有效的细化和线段特征提取，提出了一种同时完成字符图像线段提取和细化的算法。在定义字符图像的线段区域、交点区域和子段区域，同时指出待细化字符图像是线段区域的集合的基础上，该算法首先基于图像行(列)连通像素段来提取字符图像中所有的交点区域和子段区域，然后对属于同一线段区域的所有子段区域和交点区域进行合并，最后用Bernstein—Bezier多项式方法拟合每个线段区域的骨架。该算法的鲁棒性分析及实验结果表明，该算法可取得稳定有效的细化及线段提取效果。     

基于新模板的算法在车牌字符分割中的应用

针对以往车牌字符分割算法在复杂情况下分割准确率低的问题,提出了一种基于新邻域模板的连通域算法的车牌字符分割算法。采用基于新模板的连通域算法粗分割字符;通过自适应阈值投影法进行字符细分割;同时使用区域合并算法保证字符的完整性。实验结果表明,该算法将连通域法与投影法有效结合,能够同时解决汉字不连通、字符粘连和边框粘连等复杂情况,该算法对车牌字符进行分割正确率达99.5%。     

一种有意义水印盲提取算法

提出了一种基于匹配滤波的有意义水印盲提取算法，通过构造基于特征子空间的正交水印信号集，水印的提取不需要原始图象，而且误码率可以控制在较低的水平，基于特征子空间分解特性，具有简单有效的特点，同时由于水印信号集由原始图象唯一生成，并具有一定的不可逆性，因此可以防止水印攻击者利用非法产生的水印集来伪造有意义的水印。实验结果证明了该算法具有较好的稳健性和不可见性，为了对提取字符的可靠性进行评价，还提出了一种置信度门限，利用置信度门限可以有效地评估单个字符及整体水印的可靠性，弥补了一些算法只提取有意义水印，而不加评估的缺点。     

轴承防尘盖缺陷机器视觉自动检测方法研究

轴承防尘盖在装配过程中易出现各种擦伤、压痕等缺陷，从而影响配套主机的精度、可靠性及寿命，急需研发自动化的轴承表面缺陷检测设备来提高我国轴承生产水平。采用自主设计的自动化检测设备，利用机器视觉结合图像处理方法对轴承表面图像进行采集、分析和处理；采用连通域检测和轮廓筛选方法对轴承外轮廓进行提取；采用最小二乘法拟合外轮廓圆得到圆心及外径，结合半径占比分离法实现防尘盖圆环区域的提取；采用改进算法对防尘盖圆环图像进行展开以避免图像展开时字符或缺陷的误分割；采用垂直方向投影法分离字符区和非字符区，通过连通域检测法对两部分是否存在缺陷分别进行判别。实验结果表明，采用自主设计的轴承检测设备结合最小二乘法、OTSU法、改进的图像展开和投影算法，可实现轴承防尘盖缺陷的自动化检测，正确识别率为96.9%。     

基于减法聚类的无线传感器网络分簇路由算法

在LEACH（Low-Energy Adaptive Clustering Hierarchy）算法的基础上,提出一种基于减法聚类的 无线传感器网络分簇路由算法SCC（Subtractive Clustering based Clustering routing algorithm for wireless sensor networks）．在SCC 中,簇头的选择采用减法聚类的方法,使簇头节点在节点密集处产生;在簇形成算法中,修 正了现有的非簇头节点的归属机制,将能量消耗平均分配到整个网络中．仿真实验表明,SCC 算法不但可以 得到合理的簇头节点分布,推迟第一个节点死亡时间,而且延长了网络生命周期,使节点能耗均衡．     

An object-oriented high-level design-based class cohesion metric

ContextClass cohesion is an important object-oriented software quality attribute. Assessing class cohesion during the object-oriented design phase is one important way to obtain more comprehensible and maintainable software. In practice, assessing and controlling cohesion in large systems implies measuring it automatically. One issue with the few existing cohesion metrics targeted at the high-level design phase is that they are not based on realistic assumptions and do not fulfill expected mathematical properties.ObjectiveThis paper proposes a High-Level Design (HLD) class cohesion metric, which is based on realistic assumptions, complies with expected mathematical properties, and can be used to automatically assess design quality at early stages using UML diagrams.MethodThe notion of similarity between pairs of methods and pairs of attribute types in a class is introduced and used as a basis to introduce a novel high-level design class cohesion metric. The metric considers method–method, attribute–attribute, and attribute–method direct and transitive interactions. We validate this Similarity-based Class Cohesion (SCC) metric theoretically and empirically. The former includes a careful study of the mathematical properties of the metric whereas the latter investigates, using four open source software systems and 10 cohesion metrics, whether SCC is based on realistic assumptions and whether it better explains the presence of faults, from a statistical standpoint, than other comparable cohesion metrics, considered individually or in combination.ResultsResults confirm that SCC is based on clearly justified theoretical principles, relies on realistic assumptions, and is an early indicator of quality (fault occurrences).ConclusionIt is concluded that SCC is both theoretically valid and supported by empirical evidence. It is a better alternative to measure class cohesion than existing HLD class cohesion metrics.     

A motion observable representation using color correlogram and its applications to tracking

This paper presents a special form of color correlogram as representation for object tracking and carries out a motion observability analysis to obtain the optimal correlogram in a kernel based tracking framework. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial information explicitly and enables an estimation algorithm to recover the object orientation. In this paper, based on the SCC representation, the mean shift algorithm is developed in a translation–rotation joint domain to track the positions and orientations of objects. The ability of the SCC in detecting and estimating object motion is analyzed and a principled way to obtain the optimal SCC as object representation is proposed to ensure reliable tracking. Extensive experimental results demonstrate SCC as a viable object representation for tracking.     

三种谱聚类算法及其应用研究

聚类分析是数据挖掘领域中一个重要研究内容,谱聚类(Spectral Clustering, SC)由于具有计算简便,性能优越等特点,已经成为最流行的聚类算法之一。本文利用四类几何结构数据,对规范化割(Normalized Cut, NCUT)、稀疏子空间聚类(Sparse subspace clustering, SSC)和谱曲率聚类(Spectral Curvature Clustering, SCC)三种谱聚类算法进行了分析和比较。实验结果表明,针对本文实验数据三种算法的聚类结果各有差异,但每类数据都可以找到相对最有效的聚类算法,方便读者对算法的选择和使用。NCUT无法处理相交的数据,适用性较差,但对于不相交的二次曲线聚类精度较高,并且优于SSC和SCC算法;相比NCUT算法,SSC算法适用性较强,能够实现四类几何结构数据的聚类,但在聚类过程中常出现误分现象,导致聚类精度不高;与前两种算法相比,SCC算法具有适用性强,精度高等特点,能够实现四类几何结构数据有效聚类,尤其对于实验数据中“横”和“竖”两类点组成的十字,SCC算法能够得到较好的聚类结果,解决由于数据量大SSC算法无法处理的问题。此外,针对有数据间断的两条相交螺旋线聚类问题,本文在现有SCC算法基础上进行改进,结果表明,改进后算法能够有效地实现数据聚类,具有良好的实用性。最后,文章分析了现有SCC算法存在的不足,并指出进一步研究的方向。     

Hybrid linear weighted prediction and intra block copy based light field image coding

Light field imaging can capture both spatial and angular information of a 3D scene and is considered as a prospective acquisition and display solution to supply a more natural and fatigue-free 3D visualization. However, one problem that occupies an important position to deal with the light field data is the sheer size of data volume. In this context, efficient coding schemes for this particular type of image are needed. In this paper, we propose a hybrid linear weighted prediction and intra block copy based light field image codec architecture based on high efficiency video coding screen content coding extensions (HEVC SCC) standard to effectively compress the light field image data. In order to improve the prediction accuracy, a linear weighted prediction method is integrated into HEVC SCC standard, where a locally correction weighted based method is used to derive the weight coefficient vector. However, for the non-homogenous texture area, a best match in linear weighted prediction method does not necessarily lead to a good prediction of the coding block. In order to alleviate such shortcoming, the proposed hybrid codec architecture explores the idea of using the intra block copy scheme to find the best prediction of the coding block based on rate-distortion optimization. For the reason that the used “try all then select best” intra mode decision method is time-consuming, we further propose a fast mode decision scheme for the hybrid codec architecture to reduce the computation complexity. Experimental results demonstrate the advantage of the proposed hybrid codec architecture in terms of different quality metrics as well as the visual quality of views rendered from decompressed light field content, compared to the HEVC intra-prediction method and several other prediction methods in this field.     

高校单片机课程教改研究

本文通过分析高校单片机课程教学存在的问题、结合教学实践提出改进措施,并具体介绍采用系统可编程单片机的编程思想、自制实验装置、自行设计实验项目等教学方法,以期为同行提供参考,推进高校单片机教学的发展。     

Sensitivity Compensating Control: Data-driven model based adaptive approach

A novel Sensitivity Compensating Control (SCC) approach is proposed in a data-driven model based platform and combined with an Extended External Reset Feedback (EERF) method to handle sensitivity, input saturation, and accurate process model requirement problems associated with application of Generic Model Control (GMC). Two versions of Adaptive GMC (AGMC) are proposed using linear-in-parameters time-series models with time-varying parameters for higher relative degree systems, and are used in the formulation of SCC and EERF approaches. The steps involved in the proposed approach consist of defining a new process, control law and set point such that the determined control action drives the original process to its desired set point. The performance of the proposed control algorithms is illustrated by application to a benchmark multi-product polymerization reactor control challenge problem. The proposed approaches are applicable to chemical engineering systems exhibiting input sensitivity.     

Short-circuit Analysis in Large-scale Distribution Systems With High Penetration of Distributed Generators

In this paper a short-circuit computation (SCC) procedure for large-scale distribution systems with high penetration of distributed generators based on contemporary technologies is proposed. The procedure is suitable for real-time calculations. Modeling of modern distributed generators differs from the modeling of traditional synchronous and induction generators. Hence, SCC procedures found on the presumption of distribution systems with only traditional generators are not suitable in nowadays systems. In the work presented in this paper, for computation of the state of the system with short-circuit, the improved backward/forward sweep (IBFS) procedure is used. Computation results show that the IBFS procedure is much more robust than previous SCC procedures, as it takes into account all distribution system elements, including modern distributed generators.      

Strongly connected components based efficient computation of page rank

In this paper, an efficient page rank (PR) exact algorithm is proposed, which can improve the computation efficiency without sacrificing results accuracy. The existing exact algorithms are generally based on the original power method (PM). In order to reduce the number of I/Os required to improve efficiency, they partition the big graph into multiple smaller ones that can be totally fitted in memory. The algorithm proposed in this paper can further reduce the required number of I/Os. Instead of partitioning the graph into the general subgraphs, our algorithm partitions graph into a special kind of subgraphs: SCCs (strongly connected components), the nodes in which are reachable to each other. By exploiting the property of SCC, some theories are proposed, based on which the computation iterations can be constrained on these SCC subgraphs. Our algorithm can reduce lots of I/Os and save a large amount of computations, as well as keeping the results accuracy. In a word, our algorithm is more efficient among the existing exact algorithms. The experiments demonstrate that the algorithms proposed in this paper can make an obvious efficiency improvement and can attain high accurate results.     

An effective Lagrangian relaxation approach for rescheduling a steelmaking-continuous casting process

This paper studies a steelmaking-continuous casting (SCC) rescheduling problem with machine breakdown and processing time variations. Two objectives are considered in this study: the efficiency objective and the stability objective. The former refers to the total weighted completion time and total sojourn time, whereas the latter refers to the number of operations processed on different machines in the initial and revised schedules. We develop a time-index formulation and an effective Lagrangian relaxation (LR) approach with machine capacity relaxation to address the rescheduling problem. The LR approach decomposes the relaxed problem into batch-level subproblems with variable processing times. A polynomial two-stage dynamic programming algorithm is proposed to solve the batch-level subproblems. An efficient subgradient algorithm with global convergence is presented to solve the corresponding Lagrangian dual (LD) problem. Computational experiments based on practical production data show that the proposed approach not only produces a high quality schedule within an acceptable time but also performs much better than a practical SCC rescheduling method from a large iron and steel enterprise in China.