On free semigroups of automaton transformations

It is established that the subset of freek-generated subsemigroups of the semigroup of all automaton transformations over a finite alphabet is a second category set (in the sense of the Baire category approach) in the set of allk-generated subsemigroups. A continuum series of pairs of automaton transformations each of which generates a free semigroup of rank two is indicated. A criterion is established for this semigroup to be a finite-automaton group. Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 248–259, February, 1998. The author wishes to express his deep gratitude to Professor V. I. Sushchans'kii for permanent help and attention to the research. This research was partially supported by the ISSEP under grant No. GSU 051341.     

The Newton Polygon and Elliptic Problems with Parameter

In the study of the resolvent of a scalar elliptic operator, say, on a manifold without boundary there is a well-known Agmon-Agranovich-Vishik condition of ellipticity with parameter which guarantees the existence of a ray of minimal growth of the resolvent. The paper is devoted to the investigation of the same problem in the case of systems which are elliptic in the sense of Douglis-Nirenberg. We look for algebraic conditions on the symbol providing the existence of the resolvent set containing a ray on the complex plane. We approach the problem using the Newton polyhedron method. The idea of the method is to study simultaneously all the quasihomogeneous parts of the system obtained by assigning to the spectral parameter various weights, defined by the corresponding Newton polygon. On this way several equivalent necessary and sufficient conditions on the symbol of the system guaranteeing the existence and sharp estimates for the resolvent are found. One of the equivalent conditions can be formulated in the following form: all the upper left minors of the symbol satisfy ellipticity conditions. This subclass of systems elliptic in the sense of Douglis-Nirenberg was introduced by A. KOZHEVNIKOV [K2].     

Approximation of weak sense stationary stochastic processes from local averages

We show that a weak sense stationary stochastic process can be approximated by local averages. Explicit error bounds are given. Our result improves an early one from Splettstosser.     

基于人眼视觉特性的火炮内膛图像增强方法

为了提高窥膛图像的观测效果,减小背景和噪声对目标图像的模糊度,根据图像特点提出了一种基于人眼视觉特性的图像增强新方法.该方法根据目标图像与背景、噪声图像特性的差异来进行不同的处理,使待测的疵病图像相对增强,目标图像突出,便于人眼观察.     

Cheating in Visual Cryptography

A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret. In 1995, Naor and Shamir proposed a variant of secret sharing, called visual cryptography, where the shares given to participants are xeroxed onto transparencies. If X is an authorized subset of P, then the participants in X can visually recover the secret image by stacking their transparencies together without performing any computation. In this paper, we address the issue of cheating by dishonest participants, called cheaters, in visual cryptography. The experimental results demonstrate that cheating is possible when the cheaters form a coalition in order to deceive honest participants. We also propose two simple cheating prevention visual cryptographic schemes.     

A correlative classifiers approach based on particle filter and sample set for tracking occluded target

Target tracking is one of the most important issues in computer vision and has been applied in many fields of science, engineering and industry. Because of the occlusion during tracking, typical approaches with single classifier learn much of occluding background information which results in the decrease of tracking performance, and eventually lead to the failure of the tracking algorithm. This paper presents a new correlative classifiers approach to address the above problem. Our idea is to derive a group of correlative classifiers based on sample set method. Then we propose strategy to establish the classifiers and to query the suitable classifiers for the next frame tracking. In order to deal with nonlinear problem, particle filter is adopted and integrated with sample set method. For choosing the target from candidate particles, we define a similarity measurement between particles and sample set. The proposed sample set method includes the following steps. First, we cropped positive samples set around the target and negative samples set far away from the target. Second, we extracted average Haar-like feature from these samples and calculate their statistical characteristic which represents the target model. Third, we define the similarity measurement based on the statistical characteristic of these two sets to judge the similarity between candidate particles and target model. Finally, we choose the largest similarity score particle as the target in the new frame. A number of experiments show the robustness and efficiency of the proposed approach when compared with other state-of-the-art trackers.     

基于HLA和VEGA的海基靶场半实物视景仿真系统研究

为了在导弹试验任务中给指挥员提供决策支持,设计了一种基于HLA和VEGA的海基靶场半实物视景仿真系统。将三轴飞行转台、目标模拟器、负载模拟器等实物接入仿真系统,采用高层体系结构规范构建仿真系统的联邦架构,设计了联邦对象模型,建立了关键联邦成员的数学模型,解决了反射内存网与HLA的时间推进冲突问题,有效提高了仿真系统数据传输的实时性。采用Multigen-Creator软件建立了各个仿真实体的3D模型,利用Vega软件实现模型的渲染、场景驱动、声音仿真等。通过系统测试,结果表明：该视景仿真系统能够实时驱动各个仿真实体运行,视景画面流畅,图像刷新速率达到30帧/秒以上,满足系统实时性要求。     

A segmentation method for noisy photoelectric image

In order to improve the ability of noisy photoelectric image segmentation and satisfy the requirement of human visual apperception, a noisy photoelectric image segmentation method is proposed in this paper. Firstly, the basic principle of FCM algorithm is analyzed in detail. Secondly, on the basis of PCM algorithm, only such pixels affected by noise lesser that centralized in the diagonal area of two-dimensional histogram is actualized image processing, and the probability of the pixel that lie in such area is obtained. Thirdly, objective function, membership matrix and cluster centers are renovated on the basis of PCM algorithm. Finally, experiment contrast between our method and other methods is executed, the results of experiment indicate that our method has relatively better segmentation quality and faster segmentation speed.     

再论高速运动物体视状

采用一种直观解析法，从研究高速运动细棒的视状出发来说明在相对论意义下运动物体（如正方体，球体等）的视状畸变，结果表明，高速运动物体的视状一般不仅仅是发生“表现旋转”而是依具体的条件而发生不同的形变，在特殊条件下，洛伦兹收缩也是可见的。     

视觉模式识别网络及光电实现

在形态学网络及改进的Ｈａｍｍｉｎｇ网络基础上，提出视觉模式识别网络及训练算法，形态学网络作为特征提取网络，具有相对图像平移和尺度不变的特性，改进的Ｈａｍｍｉｎｇ网络加速完成特征矢量的分类操作。经过学习的视觉模式识别网络，可完成图像特征的提取，实现相对于图像平移和尺度不变的模式识别，在此基础上，建立了光电视觉模式识别体系，从而实现实时模式识别。