边缘图像滤波算法

图像经过边缘提取之后常会带有各种噪声,提取的边缘还不能满足需要,讨论了对边缘图像的滤波算法,先对边缘的图像进行闭运算,再进行区域标记。实验结果表明,该算法对提高边缘图像的质量是非常有效的。     

Meaningful Secret Image Sharing with Saliency Detection

Secret image sharing (SIS), as one of the applications of information theory in information security protection, has been widely used in many areas, such as blockchain, identity authentication and distributed cloud storage. In traditional secret image sharing schemes, noise-like shadows introduce difficulties into shadow management and increase the risk of attacks. Meaningful secret image sharing is thus proposed to solve these problems. Previous meaningful SIS schemes have employed steganography to hide shares into cover images, and their covers are always binary images. These schemes usually include pixel expansion and low visual quality shadows. To improve the shadow quality, we design a meaningful secret image sharing scheme with saliency detection. Saliency detection is used to determine the salient regions of cover images. In our proposed scheme, we improve the quality of salient regions that are sensitive to the human vision system. In this way, we obtain meaningful shadows with better visual quality. Experiment results and comparisons demonstrate the effectiveness of our proposed scheme.     

Convergence of the Klein-Gordon equation to the wave map equation with magnetic field

This paper is devoted to the proof of the convergence from the modulated cubic nonlinear defocusing Klein-Gordon equation with magnetic field to the wave map equation. More precisely, we discuss the nonrelativistic-semiclassical limit of the modulated cubic nonlinear Klein-Gordon equation with magnetic field where the Planck's constant ?=ε and the speed of light c are related by c=ε−α for some α?1. When α=1 the limit wave function satisfies the wave map with one extra term coming from the magnetic field. However, α>1, the effect of the magnetic filed disappears and the limit is the typical wave map equation only.     

Spin-lattice relaxation and a fast T1-map acquisition method in MRI with transient-state magnetization

The magnetization under the spin-lattice relaxation and the nuclear magnetic resonance radiofrequency (RF) pulses is calculated for a signal RF pulse train and for a sequence of multiple RF pulse-trains. It is assumed that the transverse magnetization is zero when each RF pulse is applied. The result expressions can be grouped into two terms: a decay term, which is proportional to the initial magnetization M0, and a recovery term, which has no M0 dependence but strongly depends on the spin-lattice relaxation and the equilibrium magnetization Meq. In magnetic resonance pulse sequences using magnetization in transient state, the recovery term produces artifacts and can seriously degrade the function of the preparation sequence for slice selection, contrast weighting, phase encoding, etc. This work shows that the detrimental effect can be removed by signal averaging in an eliminative fashion. A novel fast data acquisition method for constructing the spin-lattice relaxation (T1) map is introduced. The method has two features: (i) By using eliminative averaging, the curve to fit the T1 value is a decay exponential function rather than a recovery one as in conventional techniques; therefore, the measurement of Meq is not required and the result is less susceptible to the accuracy of the inversion RF pulse. (ii) The decay exponential curve is sampled by using a sequence of multiple pulse-trains. An image is reconstructed from each train and represents a sample point of the curve. Hence a single imaging sequence can yield multiple sample points needed for fitting the T1 value in contrast to conventional techniques that require repeating the imaging sequence for various delay values but obtain only one sample point from each repetition.     

Noise-induced asymptotic periodicity in a piecewise linear map

We examine asymptotically periodic density evolution in one-dimensional maps perturbed by noise, associating the macroscopic state of these dynamical systems with a phase space density. For asymptotically periodic systems density evolution becomes periodic in time, as do some macroscopic properties calculated from them. The general formalism of asymptotic periodicity is examined and used to calculate time correlations along trajectories of these maps as well as their limiting conditional entropy. The time correlation is shown to naturally decouple into periodic and stochastic components. Finally, asymptotic periodicity is studied in a noise-perturbed piecewise linear map, focusing on how the variation of noise amplitude can cause a transition from asymptotic periodicity to asymptotic stability in the density evolution of this system.     

Computing the topological entropy of maps of the interval with three monotone pieces

An algorithm is presented for computing the topological entropy of a piecewise monotone map of the interval having three monotone pieces. The accuracy of the algorithm is discussed and some graphs of the topological entropy obtained using the algorithm are displayed. Some of the ideas behind the algorithm have application to piecewise monotone functions with more than three monotone pieces.     

Tolerance of edge cascades with coupled map lattices methods

This paper studies the cascading failure on random networks and scale-free networks by introducing the tolerance parameter of edge based on the coupled map lattices methods. The whole work focuses on investigating some indices including the number of failed edges, dynamic edge tolerance capacity and the perturbation of edge. In general, it assumes that the perturbation is attributed to the normal distribution in adopted simulations. By investigating the effectiveness of edge tolerance in scale-free and random networks, it finds that the larger tolerance parameter λ can more efficiently delay the cascading failure process for scale-free networks than random networks. These results indicate that the cascading failure process can be effectively controlled by increasing the tolerance parameter λ. Moreover, the simulations also show that, larger variance of perturbation can easily trigger the cascading failures than the smaller one. This study may be useful for evaluating efficiency of whole traffic systems, and for alleviating cascading failure in such systems.     

Benson真有效意义下集值优化的广义最优性条件

本文引入了关于集值映射的α-阶Clarke切导数、α-阶邻接切导数及α-阶 伴随切导数的概念,借此建立了约束向量集值优化Benson真有效解导数型的Kuhn- Tucker条件.