基于NSST和MCM纹理特征提取算法

纹理特征提取作为图像处理的重要环节,对图像的后续处理有着至关重要的影响.文中在多分辨共生矩阵算法的基础上,针对标准Brodatz纹理图像检索,通过非下采样剪切波变换的多分辨共生矩阵和混合高斯模型相结合,提出了一种纹理特征提取算法.文中首先对Brodatz纹理图像进行非下采样剪切波变换得到子带系数,通过对细节子带直方图分析,引入了拟合效果较好的混合高斯模型.然后利用优化的非均匀量化策略,提取多分辨共生矩阵纹理特征F2和F10.最后将提取的纹理特征与统计特征级联融合并结合具有权重系数的相似性度量公式,用于最终纹理图像检索.仿真实验表明:与传统多分辨共生矩阵的方法相比,文中所提算法的平均检索率分别提高了2.01%和8.87%.     

基于方向多尺度变换和统计建模的纹理分类方法

纹理是图像分析和识别中经常使用的关键特征, 而小波变换则是图像纹理表示和分类中的常用工具. 然而, 基于小波变换的纹理分类方法常常忽略了小波低频子带信息, 并且无法提取图像纹理的块状奇异信息. 本文提出小波子带系数的局部能量直方图建模方法、轮廓波特征的Poisson 混合模型建模方法和基于轮廓波子带系数聚类的特征提取方法, 并将其应用于图像纹理分类上. 基于局部能量直方图的纹理分类方法解决了小波低频子带的建模难题, 基于Poisson 混合模型的纹理分类方法则首次将Poisson 混合模型用于轮廓子带特征的建模, 而基于轮廓波域聚类的纹理分类方法是一种快速的分类方法. 实验结果显示, 本文所提出的三类方法都超过了当前典型的纹理分类方法.     

基于多尺度几何分解的光照不均图像增强方法

针对光照不均匀的图像,结合W系统和NSCT变换,提出了一种新的图像增强方法.方法首先利用W变换对图像进行多尺度分解,然后利用NSCT中的非下采样方向滤波器组对尺度分解中的高频部分进行方向分解,得到不同尺度不同方向上的变换系数.在多尺度几何分解的基础上,对低频子带图像采用动态直方图均衡化、高频子带图像采用同态滤波的方法进行增强处理,最后利用非线性函数减小图像明、暗部分灰度值的差异,得到最后的增强结果.仿真实验结果表明,算法无论在视觉效果上还是客观评价指标上都优于其他被比较的四种增强算法,对于过亮、过暗以及局部光照不均匀的图像均取得了更好的增强效果,在增强图像细节的同时能有效抑制图像的伪吉布斯失真和过增强失真.在评价指标上,算法对三组经典图像处理后的增强图像的信息熵分别达到了10.0755、9.7879、10.5338,明显优于其他方法.     

基于Curvelet域高斯尺度混合模型的地震信号降噪方法

结合曲波变换和高斯尺度混合模型提出地震信号随机噪声压制方法.该方法首先运用曲波变换对含有随机噪声的地震信号进行分解,然后对各小波子带系数分别建立高斯尺度混合模型估计出原始地震信号所对应的小波系数,最后经曲波逆变换重构获得降噪处理后的地震信号.仿真地震信号和实际地震信号的实验结果均表明本文方法能够有效压制地震信号中的随机噪声干扰,较多地保留了有效信号.     

多小波图像插值算法研究

与单小波变换一样,多小波变换同样具有多分辨分析的特性,1次多小波变换可以将图像分解成4个低频子带和12个高频子带,而且原图像的大小是每个子带的4倍.根据多小波变换的这一特点,利用原图像与经过1次多小波变换后的各高频子带的信息,并考虑各子带的分形维数,提出了一种新颖的灰度图像插值算法.实验结果表明,与传统的插值算法相比,例如双线性插值与双三次多项式插值,该算法的插值效果较好,且克服了单小波插值中出现的斑点干扰.     

分数扩散模型的参数估计及其应用

研究分数扩散模型的参数估计及其应用问题.分数扩散模型是一类由分数Brownian运动驱动的随机微分方程.主要结果有:(1)利用二次变差方法给出模型中扩散系数的估计量,通过最小二乘法给出模型中漂移系数的估计量;(2)证明这些估计量的一致收敛性和渐近正态性;(3)利用MCMC方法对此估计量进行验证,并通过R软件将上述模型以及参数估计量应用到SHIBOR利率中进行实证研究.     

基于最大惩罚似然的高斯混合模型无监督分类研究

本文提出了一个基于高斯混合模型的无监督分类算法. 考虑到利用EM算法求解高斯混合模型的参数参数估计问题容易陷入局部最优解, 我们引入逆Wishart分布来代替传统的Jeffery先验. 几个实验数据的结果表明, 采用该方法估计无监督分类的成分数, 无论是估计的正确率, 还是运算速度, 都有较大提高.     

遥感图像小波变换系数的统计分布

本文研究了遥感图像经张量积小波与非张量积多元小波变换后得到的小波系数的统计分布及其特性,得出了遥感图像经双正交9-7整数小波变换后的系数的每个高频子带在能量分布上近似关于原点对称,每个高上频子带都具有“非高斯”性,每层的三个高频子带分布相似,第一层的各子带的值在零点附近更为集中,所以在零点形成更陡更窄的“尖峰”的结论.     

基于改进无迹卡尔曼滤波的波动率研究

波动率估计是金融学的核心,波动几乎渗透金融市场的每一个领域.为了快速而精确地提取波动率,文章将比例UT变换与最小偏度单行采样技术和无迹卡尔曼滤波(UKF)算法相结合,提出一种适用于非线性高斯状态空间模型的改进的无迹卡尔曼滤波(MUKF)算法,并将该算法应用到扩散的期权定价模型中.最后通过对Heston随机波动模型进行模拟研究,发现在同时使用股票价格数据和期权数据时,可以精确地提取波动率,而且MUKF算法比UKF算法的计算时间更短.文章也对Heston模型中的波动率的波动参数进行了研究,研究发现MUKF算法可以准确地捕捉这种波动率特性.     

带跳扩散过程的经验似然推断

本文对带跳扩散过程的经验似然推断进行了讨论.基于经验似然方法,我们可以针对带跳扩散过程的各项系数构造置信区间.这种置信区间的性质比基于渐近正态性构造出来的置信区间要好.     

Estimation of coefficient of variation in a weighted inverse Gaussian model

The coefficient of variation is an important parameter in many physical, biological and medical sciences. In this paper we study the estimation of the square of the coefficient of variation in a weighted inverse Gaussian model which is a mixture of the inverse Gaussian and the length biased inverse Gaussian distribution. This represents a rich family of distributions for different values of the mixing parameter and can be used for modelling various life testing situations. The maximum likelihood as well as the Bayes estimates of the parameters are obtained. These estimates are used to derive the estimates of the square of the coefficient of variation of the model under study. Several important data sets are analysed to illustrate the results. © 1996 John Wiley & Sons, Ltd.     

Testing for Varying Dispersion in Exponential Family Nonlinear Models

A diagnostic model and several new diagnostic statistics are proposed for testing for varying dispersion in exponential family nonlinear models. A score statistic and an adjusted score statistic based on Cox and Reid (1987, J. Roy. Statist. Soc. Ser. B, 55, 467-471) are derived in normal, inverse Gaussian, and gamma nonlinear models. An adjusted likelihood ratio statistic is also given for normal and inverse Gaussian nonlinear models. The results of simulation studies are presented, which show that the adjusted tests keep their sizes better and are more powerful than the ordinary tests.     

Image decoding optimization based on compressive sensing

Transform-based image codec follows the basic principle: the reconstructed quality is decided by the quantization level. Compressive sensing (CS) breaks the limit and states that sparse signals can be perfectly recovered from incomplete or even corrupted information by solving convex optimization. Under the same acquisition of images, if images are represented sparsely enough, they can be reconstructed more accurately by CS recovery than inverse transform. So, in this paper, we utilize a modified TV operator to enhance image sparse representation and reconstruction accuracy, and we acquire image information from transform coefficients corrupted by quantization noise. We can reconstruct the images by CS recovery instead of inverse transform. A CS-based JPEG decoding scheme is obtained and experimental results demonstrate that the proposed methods significantly improve the PSNR and visual quality of reconstructed images compared with original JPEG decoder.     

Image decoding optimization based on compressive sensing

Transform-based image codec follows the basic principle: the reconstructed quality is decided by the quantization level. Compressive sensing (CS) breaks the limit and states that sparse signals can be perfectly recovered from incomplete or even corrupted information by solving convex optimization. Under the same acquisition of images, if images are represented sparsely enough, they can be reconstructed more accurately by CS recovery than inverse transform. So, in this paper, we utilize a modified TV operator to enhance image sparse representation and reconstruction accuracy, and we acquire image information from transform coefficients corrupted by quantization noise. We can reconstruct the images by CS recovery instead of inverse transform. A CS-based JPEG decoding scheme is obtained and experimental results demonstrate that the proposed methods significantly improve the PSNR and visual quality of reconstructed images compared with original JPEG decoder.     

A general truncated regularization framework for contrast-preserving variational signal and image restoration: Motivation and implementation

Variational methods have become an important kind of methods in signal and image restoration—a typical inverse problem. One important minimization model consists of the squared ?_2 data fidelity(corresponding to Gaussian noise) and a regularization term constructed by a potential function composed of first order difference operators. It is well known that total variation(TV) regularization, although achieved great successes,suffers from a contrast reduction effect. Using a typical signal, we show that, actually all convex regularizers and most nonconvex regularizers have this effect. With this motivation, we present a general truncated regularization framework. The potential function is a truncation of existing nonsmooth potential functions and thus flat on(τ, +∞) for some positive τ. Some analysis in 1 D theoretically demonstrate the good contrast-preserving ability of the framework. We also give optimization algorithms with convergence verification in 2 D, where global minimizers of each subproblem(either convex or nonconvex) are calculated. Experiments numerically show the advantages of the framework.     

Matrix probing: A randomized preconditioner for the wave-equation Hessian

This paper considers the problem of approximating the inverse of the wave-equation Hessian, also called normal operator, in seismology and other types of wave-based imaging. An expansion scheme for the pseudodifferential symbol of the inverse Hessian is set up. The coefficients in this expansion are found via least-squares fitting from a certain number of applications of the normal operator on adequate randomized trial functions built in curvelet space. It is found that the number of parameters that can be fitted increases with the amount of information present in the trial functions, with high probability. Once an approximate inverse Hessian is available, application to an image of the model can be done in very low complexity. Numerical experiments show that randomized operator fitting offers a compelling preconditioner for the linearized seismic inversion problem.     

Approximation for the Normal Inverse Gaussian Process Using Random Sums

Abstract

We approximate the normal inverse Gaussian (NIG) process with random summations. The random sum we introduce is a random walk subordinated to the first passage time of another independent random walk; the model is interpreted as an internal mechanism at small scale that generates the NIG process. The main result is a functional limit theorem of weak convergence in the Skorohod topology.     

High-order total variation-based Poissonian image deconvolution with spatially adapted regularization parameter

Images captured by image acquisition systems using photon-counting devices such as astronomical imaging, positron emission tomography and confocal microscopy imaging, are often contaminated by Poisson noise. Total variation (TV) regularization, which is a classic regularization technique in image restoration, is well-known for recovering sharp edges of an image. Since the regularization parameter is important for a good recovery, Chen and Cheng (2012) proposed an effective TV-based Poissonian image deblurring model with a spatially adapted regularization parameter. However, it has drawbacks since the TV regularization produces staircase artifacts. In this paper, in order to remedy the shortcoming of TV of their model, we introduce an extra high-order total variation (HTV) regularization term. Furthermore, to balance the trade-off between edges and the smooth regions in the images, we also incorporate a weighting parameter to discriminate the TV and the HTV penalty. The proposed model is solved by an iterative algorithm under the framework of the well-known alternating direction method of multipliers. Our numerical results demonstrate the effectiveness and efficiency of the proposed method, in terms of signal-to-noise ratio (SNR) and relative error (RelRrr).     

Novel Linear Image Denoising Approach Based on a Modified Gaussian Filter Kernel

A Gaussian noise reduction technique for grayscale images is proposed in this article. It uses a modified Gaussian filter kernel based on a hyperbolic second-order equation. The introduced mathematical model differs from the classic Gaussian model provided by the heat equations, by a localization property. Our filtering approach reduces the amount of Gaussian noise and also enhances the image contrast. Some image denoising experiments that prove the effectiveness of the proposed method are also described in this article.