关键词： 边缘检测   数学形态学   边缘细化   Sobel算子  

摘要： 为了解决Sobel算子在阈值选择不当的情况下易造成图像边缘丢失或产生伪边缘的问题,通过最大类间方差的方式选出合适的阈值;同时利用数学形态学细化算法对该边缘图像进行细化处理。实验结果显示,该方法在保持原有边缘图像特征信息的前提下,比传统Sobel算子得到了更好的结果。

关键词： 光学工程   偏振   琼斯算法   反射  

摘要： 采用琼斯算法并结合Poincare球的图示研究了单色椭圆偏振光经理想平面镜正反射的特性,然后将获得的结论推广到圆偏振光及线偏振光经平面镜正反射的情形,再用偏振态几何参量表示法对结论加以验证,并提出便于记住结论的镜像法,以期对椭圆偏振光正反射问题的琼斯算法及获得结果的物理含义给出比较直观的诠释。同时指出采用琼斯算法求解偏振光学问题时需采用的特殊数学处理方法及产生这一现象的原因。

关键词： 脉冲耦合神经网络   数学形态学   去噪  

摘要： 为了更好的去除图像中的噪声,在分析脉冲耦合神经网络（PCNN）的工作原理和数学形态学的基本运算的基础上,提出简化型PCNN和数学形态学的去噪算法,该算法通过PCNN判断噪声点,再由数学形态学运算来去除噪声点。计算机实验表明,该方法去噪效果优于传统的中值滤波的方法,说明该方法的有效性。

关键词： 算法   整合教学   有效性  

摘要： 普通高中信息技术课程的选修1《算法与程序设计》要求学生修习后要达到"从问题出发,分析、发现问题的本质,选择、设计相应的算法,用某种程序设计语言编写程序,最终实现问题的解决,在原有基础上进一步提升信息素养"的目标。但高一学生接触算法与程序设计的机会和应用需求都不多,需要学习的内容比较抽象,学习过程枯燥,需要具备良好的学习态度和一定的逻辑思维能力,课堂教学有效性一直不高。"算法初步"是高中数学课程新增的内容,数学老师对算法知识比较陌生,教学压力普遍较大,需要上机实验的课时来辅助教学。为此,我们与高中数学必修3第一章的"算法初步"进行整合教学实验,课堂教学有效性得到很好的提升。

关键词： 数字水印   隐藏信息   数学算法   信息隐藏   密码学   视频   图像  

摘要： 数字水印概述 数字水印是通过数学算法在各类音频、视频、图像和文本等媒体中嵌入隐藏信息的一种技术，它将密码学和信息隐藏相结合，具有以下四个特性：

关键词： 低频振荡   数学形态学   TLS-ESPRIT算法   振荡模式辨识  

摘要： 针对传统Prony方法对噪声敏感和辨识精度不高的局限性,提出一种新的低频振荡模式辨识方法,实现了在有噪声干扰情况下低频振荡模式的准确辨识。该方法基于数学形态学设计出一种多结构元素的并行复合形态滤波器,可有效滤除多种噪声,保留更多的有用信息。对消噪后的信号采用基于总体最小二乘法-旋转不变技术的信号参数估计(TLS-ESPRIT)算法进行辨识,从而获取低频振荡各个模式参数。通过算例仿真,说明所提出的方法是可行和有效的。

关键词： 小学数学   算法多样化   误区  

摘要： 小学数学算法多样化,是指在教师的指导下,学生经过对问题进行分析、探索,找出适合的算法,并对同一类问题加以概括、总结,找出这一类问题的通用的和最简单的算法,然后吸收、内化,并在以后的学习中加以运用。小学数学算法多样化有自己的特点,教师在实施的过程中也存在一定的误区,因此教师在教学过程中,要采取有效的措施,避免陷入误区。

关键词： Algebra   Algorithms   Kinematic analysis  

摘要： This paper deals with the formulation and validation of a comprehensive algebraic algorithm for the kinematic analysis of slider-crank/rocker mechanisms, which is based on the use of geometric loci, as the fixed and moving centrodes, along with their evolutes, the cubic of stationary curvature and the inflection circle. In particular, both centrodes are formulated in implicit and explicit algebraic forms by using the complex algebra. Moreover, the algebraic curves representing the moving centrodes are recognized and proven to be Jerabek's curves for the first time. Then, the cubic of stationary curvature along with the inflection circle are expressed in algebraic form by using the instantaneous geometric invariants. Finally, the proposed algorithm has been implemented in a MATLAB code and significant numerical and graphical results are shown, along with the particular cases in which these geometric loci degenerate in lines and circles or give cycloidal positions. [DOI: 10.1115/1.4005527]

关键词： Meshing   Singularity   Root bound   Evaluation bound   Implicit algebraic curve   Complete numerical algorithm   Subdivision algorithm  

摘要： Given a real valued function f (X, Y), a box region B-0 subset of R-2 and epsilon > 0, we want to compute an E-isotopic polygonal approximation to the restriction of the curve S = f(-1) (0) = {p is an element of R-2 : f (p) = 0} to B-0. We focus on subdivision algorithms because of their adaptive complexity and ease of implementation. Plantinga & Vegter gave a numerical subdivision algorithm that is exact when the curve S is bounded and non-singular. They used a computational model that relied only on function evaluation and interval arithmetic. We generalize their algorithm to any bounded (but possibly non-simply connected) region that does not contain singularities of S. With this generalization as a subroutine, we provide a method to detect isolated algebraic singularities and their branching degree. This appears to be the first complete purely numerical method to compute isotopic approximations of algebraic curves with isolated singularities. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Principal Component Analysis   Scatter Matrix   Bhattacharyya Upper Margin   Optimal Linear Compression/Decompression   Image Restoration  

摘要： The restoration techniques are usually oriented toward modeling the type of degradation in order to infer the inverse process for recovering the given image. This approach usually involves the option for a criterion to numerically evaluate the quality of the resulted image and consequently the restoration process can be expressed in terms of an optimization problem. Most of the approaches are essentially based on additional hypothesis concerning the statistical properties of images. However, in real life applications, there is no enough information to support a certain particular image model, and consequently model-free developments have to be used instead. In our approaches the problem of image denoising/restoration is viewed as an information transmission/processing system, where the signal representing a certain clean image is transmitted through a noisy channel and only a noise-corrupted version is available. The aim is to recover the available signal as much as possible by using different noise removal techniques that is to build an accurate approximation of the initial image. Unfortunately, a series of image qualities, as for instance clarity, brightness, contrast, are affected by the noise removal techniques and consequently there is a need to partially restore them on the basis of information extracted exclusively from data. Following a brief description of the image restoration framework provided in the introductory part, a PCA-based methodology is presented in the second section of the paper. The basics of a new informational-based development for image restoration purposes and scatter matrix-based methods are given in the next two sections. The final section contains concluding remarks and suggestions for further work. [PUBLICATION ABSTRACT]