共查询到20条相似文献,搜索用时 46 毫秒
1.
基于小波矩不变量的模式识别方法 总被引:17,自引:1,他引:17
为了得到一组局产最优的特征组,提出一种结合分散度和顺序前进法(SFS)的特征选择方法。实验结果表明小液矩不变量比Zernike矩不变量有更好的识别效果,尤其对于形体相似的物体,效果更明显。 相似文献
2.
用矩不变量实现印鉴自动识别 总被引:4,自引:0,他引:4
本文提出的方法主要优点是无需对印鉴图象进行旋转、定位、配准、识别速度快,内存空间小,对印鉴的形状也无限制。实验结果表明,文中提出的方法有较高的识别率,可作为印鉴识别中的方法之一。 相似文献
3.
4.
四元数域彩色图像整体式水印算法 总被引:4,自引:0,他引:4
该文提出一种结合四元数变换域和四元数分解方法的整体式彩色图像水印算法。首先对彩色载体图像进行分块四元数傅里叶变换得到其频域矩阵,然后对频域单位小块进行四元数奇异值分解,根据分解得到四元数酉矩阵前若干列中对角线元素的幅值构造水印序列,并将水印隐藏到分解得到的实系数奇异值中。仿真实验表明,该文提出的水印方法不仅可以把嵌入水印带来的误差扩散到载体图像的各个颜色分量上,而且比传统的将彩色图像划分为各个单独色彩通道,分别进行水印嵌入的方法不可见性更好,并且,通过构造与奇异值酉矩阵相关的水印序列可以有效解决现有四元数水印算法存在的误检测率以及水印图像易伪造问题。 相似文献
5.
基于离散四元数余弦变换的彩色图像数字水印技术 总被引:1,自引:0,他引:1
将离散四元数余弦变换(DQCT)应用于彩色图像的数字水印技术中,提出了一种在彩色图像中嵌入水印的新技术。应用四元数理论把彩色图像作为一整体进行余弦变换,在彩色宿主图像的DQCT域中实现彩色水印图像的嵌入。实验表明,该方法具有较好的抗压缩能力,对高斯噪声、椒盐噪声和缩放攻击具有较好的鲁棒性。 相似文献
6.
为了实现彩色图像边缘检测,建立了彩色图像自动边缘检测算法。对彩色图像基于四元数的表示方法进行描述,针对基于snake算子实现彩色图像边缘检测算法进行了研究。首先,根据彩色图像三原色的基本特征,利用四元数的矢量表示方法以及四元数基本运算方法进行描述;其次,介绍了snake算子的基本原理,检测过程等。最后,构造了双四元数和snake算子的彩色图像边缘检测算法。实验结果表明,利用文中算法获得的彩色图像边缘检测保留了原图像的自身信息,边缘信息完整。该算法基本满足彩色图像边缘检测的稳定可靠、信息完整、抗干扰能力强等要求。 相似文献
7.
针对仿射变换所造成的某些特征点提取不稳定,提出一种新的适合于目标识别的仿射不变量,它是基于特征点和几乎不受仿射变换影响的目标轮廓线.当目标无遮挡时,新不变量仅依赖于当前特征点和整个轮廓线;当目标有遮挡时,新不变量依赖于当前特征点、与它直接相邻的两个特征点以及它们之间的轮廓线.在已有的基于特征点的仿射不变量中,新不变量所依赖的特征点是最少的,可以很好地应用于特征点提取不稳定场合的目标识别. 相似文献
8.
9.
本文证明了异步离散四元数神经网络模型在其动力学演化过程中,网络的能量函数单调递减,网络最终将稳定在一个平衡态上,存贮图像在能量函数空间中对应一能量极小点,为网络的稳定吸引子。 相似文献
10.
11.
12.
Bin Xiao Guo-yin Wang 《Journal of Visual Communication and Image Representation》2013,24(7):1002-1008
As the variation of parameters in Jacobi polynomial, Jacobi–Fourier moments can form various types of orthogonal moments: Legendre–Fourier moments, Orthogonal Fourier–Mellin moments, Zernike moments, pseudo-Zernike moments, and so on. In this paper, we present a generic approach based on Jacobi–Fourier moments for scale and rotation invariant analysis of radial orthogonal moments, named Jacobi–Fourier moment invariants (JFMIs). It provides a fundamental mathematical tool for invariant analysis of the radial orthogonal moments since Jacobi–Fourier moments are the generic expressions of radial orthogonal moments. Theoretical and experimental results also show the superiority of the proposed method and its robustness to noise in comparison with some exist methods. 相似文献
13.
In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time. 相似文献
14.
15.
16.
Bin Xiao Jian-Feng MaJiang-Tao Cui 《Journal of Visual Communication and Image Representation》2012,23(2):381-386
Radial Tchebichef moments as discrete orthogonal moments in the polar coordinate have been successfully used in the field of image recognition. However, the scale invariant property of these moments has not been studied due to its complexity of the problem. In this paper, we present a method to construct a set of scale and rotation invariants extracted from radial Tchebichef moments, named radial Tchebichef moment invariants (RTMI). Experimental results show the efficiency and the robustness to noise of the proposed method for recognition tasks. 相似文献
17.
18.
Copy-move forgery is one of the most common image tampering schemes, with the potential use for misleading the opinion of the general public. Keypoint-based detection methods exhibit remarkable performance in terms of computational cost and robustness. However, these methods are difficult to effectively deal with the cases when 1) forgery only involves small or smooth regions, 2) multiple clones are conducted or 3) duplicated regions undergo geometric transformations or signal corruptions. To overcome such limitations, we propose a fast and accurate copy-move forgery detection algorithm, based on complex-valued invariant features. First, dense and uniform keypoints are extracted from the whole image, even in small and smooth regions. Then, these keypoints are represented by robust and discriminative moment invariants, where a novel fast algorithm is designed especially for the computation of dense keypoint features. Next, an effective magnitude-phase hierarchical matching strategy is proposed for fast matching a massive number of keypoints while maintaining the accuracy. Finally, a reliable post-processing algorithm is developed, which can simultaneously reduce false negative rate and false positive rate. Extensive experimental results demonstrate the superior performance of our proposed scheme compared with existing state-of-the-art algorithms, with average pixel-level F-measure of 94.54% and average CPU-time of 36.25 s on four publicly available datasets. 相似文献
19.
20.
The quaternion representation (QR) used in current quaternion-based color image processing creates redundancy when representing a color image of three components by a quaternion matrix having four components. In this paper, both RGB and depth (RGB-D) information are considered to improve QR for efficiently representing RGB-D images. The improved QR fully utilizes the four-dimensional quaternion domain. Using this improved QR, firstly we define the new quaternion pseudo-Zernike moments (NQPZMs) and then propose an efficient computational algorithm for NQPZMs through the conventional pseudo-Zernike moments (PZMs). Finally, we propose an algorithm for color image splicing detection based on the NQPZMs and the quaternion back-propagation neural network (QBPNN). Experimental results on four public datasets (DVMM, CASIA v1.0 and v2.0, Wild Web) demonstrate that the proposed splicing detection algorithm can achieve almost 100% accuracy with the appropriate feature dimensionality and outperforms 14 existing algorithms. Moreover, the comparison of six color spaces (RGB, HSI, HSV, YCbCr, YUV, and YIQ) shows that the proposed algorithm using YCbCr color space has the overall best performance in splicing detection. 相似文献