Radon odd radial harmonic Fourier moments in detecting cloned forgery image

Over the past decades, due to the progress of computing abilities and easy access to powerful photo editing software, more digital photos and images are created commonplace. Unfortunately, this technology progress may also bring with a big risk of the information security. Image region cloning is a popular and simple manner to create realistic forgery images. Most relevant researches have been carried out, but the methods based on those researches are only able to detect some simple duplicated successfully. So we present a new Radon Odd Radial Harmonic Fourier Moments (RORHFMs) method. Compared with other relevant methods, this method is more robust to resist post-processed operations, such as anti-translation, anti-rotation, anti-scaling, anti-mirror operations and resisted Gaussian noise contamination. We also introduce an auxiliary circle template to slide and detect the suspicious image in order to locate the cloned region. The invariant moment features of image are extracted and analyzed by our method. Each feature of similar region is arranged orderly by Lexicographic sorting for detecting. Pearson Correlation Coefficient is applied to calculate and classify the statistical data. Then, the statistical data is searched, analyzed. At last, the original coordinates of cloned and pasted region are detected and denoted. Extensive experiments verified better robustness of RORHFMs method than other relevant methods in detecting cloned forgery.     

A Compound Algorithm of Denoising Using Second-Order and Fourth-Order Partial Differential Equations

In this paper, we propose a compound algorithm for the image restoration. The algorithm is a convex combination of the ROF model and the LLT model with a parameter function 6. The numerical experiments demonstrate that our compound algorithm is efficient and preserves the main advantages of the two models. In particular, the errors of the compound algorithm in L2 norm between the exact images and corresponding restored images are the smallest among the three models. For images with strong noises, the restored images of the compound algorithm are the best in the corresponding restored images. The proposed algorithm combines the fixed point method, an improved AMG method and the Krylov acceleration. It is found that the combination of these methods is efficient and robust in the image restoration.     

Image registration with iterated local search

This contribution is devoted to the application of iterated local search to image registration, a very complex, real-world problem in the field of image processing. To do so, we first re-define this parameter estimation problem as a combinatorial optimization problem, then analyze the use of image-specific information to guide the search in the form of an heuristic function, and finally propose its solution by iterated local search. Our algorithm is tested by comparing its performance to that of two different baseline algorithms: iterative closest point, a well-known, image registration technique, a hybrid algorithm including the latter technique within a simulated annealing approach, a multi-start local search procedure, that allows us to check the influence of the search scheme considered in the problem solving, and a real coded genetic algorithm. Four different problem instances are tackled in the experimental study, resulting from two images and two transformations applied on them. Three parameter settings are analyzed in our approach in order to check three heuristic information scenarios where the heuristic is not used at all, is partially used or almost completely guides the search process, as well as two different number of iterations in the algorithms outer-inner loops. This work was partially supported by the Spanish Ministerio de Ciencia y Tecnología under project TIC2003-00877 (including FEDER fundings) and under Network HEUR TIC2002-10866-E.     

Multiscale singularity trees

We propose MultiScale Singularity Trees (MSSTs) as a structure to represent images, and we propose an algorithm for image comparison based on comparing MSSTs. The algorithm is tested on 3 public image databases and compared to 2 state-of-theart methods. We conclude that the computational complexity of our algorithm only allows for the comparison of small trees, and that the results of our method are comparable with state-of-the-art using much fewer parameters for image representation. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Improved variational image registration model and a fast algorithm for its numerical approximation

In a multimodal image registration scenario, where two given images have similar features, but noncomparable intensity variations, the sum of squared differences is not suitable for inferring image similarities. In this article, we first propose a new variational model based on combining intensity and geometric transformations, as an alternative to use mutual information and an improvement to the work by Modersitzki and Wirtz (Modersitzki and Wirtz, Lect Notes Comput Sci 4057 (2006), 257–263), and then develop a fast multigrid (MG) algorithm for solving the underlying system of fourth‐order and nonlinear partial differential equations. We can demonstrate the effective smoothing property of the adopted primal‐dual smoother by a local Fourier analysis. Numerical tests will be presented to show both the improvements achieved in image registration quality and MG efficiency. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Image Denoising by a Local Clustering Framework

Images often contain noise due to imperfections in various image acquisition techniques. Noise should be removed from images so that the details of image objects (e.g., blood vessels, inner foldings, or tumors in the human brain) can be clearly seen, and the subsequent image analyses are reliable. With broad usage of images in many disciplines—for example, medical science—image denoising has become an important research area. In the literature, there are many different types of image denoising techniques, most of which aim to preserve image features, such as edges and edge structures, by estimating them explicitly or implicitly. Techniques based on explicit edge detection usually require certain assumptions on the smoothness of the image intensity surface and the edge curves which are often invalid especially when the image resolution is low. Methods that are based on implicit edge detection often use multiresolution smoothing, weighted local smoothing, and so forth. For such methods, the task of determining the correct image resolution or choosing a reasonable weight function is challenging. If the edge structure of an image is complicated or the image has many details, then these methods would blur such details. This article presents a novel image denoising framework based on local clustering of image intensities and adaptive smoothing. The new denoising method can preserve complicated edge structures well even if the image resolution is low. Theoretical properties and numerical studies show that it works well in various applications.     

基于Huber正则化的红外与可见光图像融合

图像融合通常是指从多源信道采集同一目标图像,将互补的多焦点、多模态、多时相和/或多视点图像集成在一起,形成新图像的过程.在本文中,我们采用基于Huber正则化的红外与可见光图像的融合模型.该模型通过约束融合图像与红外图像相似的像素强度保持热辐射信息,以及约束融合图像与可见光图像相似的灰度梯度和像素强度保持图像的边缘和纹理等外观信息,同时能够改善图像灰度梯度相对较小区域的阶梯效应.为了最小化这种变分模型,我们结合增广拉格朗日方法(ALM)和量身定做有限点方法(TFPM)的思想设计数值算法,并给出了算法的收敛性分析.最后,我们将所提模型和算法与其他七种图像融合方法进行定性和定量的比较,分析了本文所提模型的特点和所提数值算法的有效性.     

Mass Transport Based Multi-Model Color Transfer

Image editing is a hot research topic in the image processing region, and one of the most basic problems in this field is the color transfer. It modifies the color style of the target image to match the color palette of the source while preserving the content of the target. Although there exist many algorithms to deal with this problem, none of existing methods can handle all kinds of images, especially complex landscape images. In this paper, we propose a Mass Transport based color transfer method in the CIELab color space, which can generate natural transfer results for different kinds of images including landscapes. Different from previous methods using the same transfer model for all the channels, we adopt different models for the luminance channel and color channels. For the luminance channel, a global transfer method is adopted for keeping the consistence in the visual perception. For the color channels, we construct a model based on histogram and Mass Transport, which perfectly transfers the colors of all the pixels from the source to the target and simultaneously preserves the content. What is more, experiments on real images demonstrate that our approach performs favorably against most of the existing methods.     

A Nash-game approach to joint image restoration and segmentation

We propose a game-theoretic approach to simultaneously restore and segment noisy images. We define two players: one is restoration, with the image intensity as strategy, and the other is segmentation with contours as strategy. Cost functions are the classical relevant ones for restoration and segmentation, respectively. The two players play a static game with complete information, and we consider as solution to the game the so-called Nash equilibrium. For the computation of this equilibrium we present an iterative method with relaxation. The results of numerical experiments performed on some real images show the relevance and efficiency of the proposed algorithm.     

Directional Frames for Image Recovery: Multi-scale Discrete Gabor Frames

Sparsity-driven image recovery methods assume that images of interest can be sparsely approximated under some suitable system. As discontinuities of 2D images often show geometrical regularities along image edges with different orientations, an effective sparsifying system should have high orientation selectivity. There have been enduring efforts on constructing discrete frames and tight frames for improving the orientation selectivity of tensor product real-valued wavelet bases/frames. In this paper, we studied the general theory of discrete Gabor frames for finite signals, and constructed a class of discrete 2D Gabor frames with optimal orientation selectivity for sparse image approximation. Besides high orientation selectivity, the proposed multi-scale discrete 2D Gabor frames also allow us to simultaneously exploit sparsity prior of cartoon image regions in spatial domain and the sparsity prior of textural image regions in local frequency domain. Using a composite sparse image model, we showed the advantages of the proposed discrete Gabor frames over the existing wavelet frames in several image recovery experiments.     

Unsupervised construction of fuzzy measures through self-organizing feature maps and its application in color image segmentation

The paper presents a framework for the segmentation of multi-dimensional images, e.g., color, satellite, multi-sensory images, based on the employment of the fuzzy integral, which undertakes the classification of the input features. The framework makes use of a self-organizing feature map, whereby the coefficients of the fuzzy measure are determined. This process is unsupervised and therefore constitutes one of the main contributions of the paper.The performance of the framework is shown by successfully realizing the segmentation of color images in two different applications. First, the features of the framework and its parameterization are analyzed by segmenting different images used as benchmark in image processing. Finally, the framework is applied in the segmentation of different images taken under difficult illumination conditions. The images serve the development of an automated cashier system, where the weak segmentation constitutes the first step for the identification of different market items. The presented framework succeeds in the segmentation of all these color images.     

The Momentum Map Representation of Images

This paper discusses the mathematical framework for designing methods of Large Deformation Diffeomorphic Matching (LDM) for image registration in computational anatomy. After reviewing the geometrical framework of LDM image registration methods, we prove a theorem showing that these methods may be designed by using the actions of diffeomorphisms on the image data structure to define their associated momentum representations as (cotangent-lift) momentum maps. To illustrate its use, the momentum map theorem is shown to recover the known algorithms for matching landmarks, scalar images, and vector fields. After briefly discussing the use of this approach for diffusion tensor (DT) images, we explain how to use momentum maps in the design of registration algorithms for more general data structures. For example, we extend our methods to determine the corresponding momentum map for registration using semidirect product groups, for the purpose of matching images at two different length scales. Finally, we discuss the use of momentum maps in the design of image registration algorithms when the image data is defined on manifolds instead of vector spaces.     

On a New Diffeomorphic Multi-Modality Image Registration Model and Its Convergent Gauss-Newton Solver

In this work, we propose a new variational model for multi-modal image registration and present an efficient numerical implementation. The model minimizes a new functional based on using reformulated normalized gradients of the images as the fidelity term and higher-order derivatives as the regularizer. A key feature of the model is its ability of guaranteeing a diffeomorphic transformation which is achieved by a control term motivated by the quasi-conformal map and Beltrami coefficient. The existence of the solution of this model is established. To solve the model numerically, we design a Gauss-Newton method to solve the resulting discrete optimization problem and prove its convergence; a multilevel technique is employed to speed up the initialization and avoid likely local minima of the underlying functional. Finally, numerical experiments demonstrate that this new model can deliver good performances for multi-modal image registration and simultaneously generate an accurate diffeomorphic transformation.     

Homotopy method for a mean curvature-based denoising model

Variational image denoising models based on regularization of gradients have been extensively studied. The total variation model by Rudin, Osher, and Fatemi (1992) [38] can preserve edges well but for images without edges (jumps), the solution to this model has the undesirable staircasing effect. To overcome this, mean curvature-based energy minimization models offer one approach for restoring both smooth (no edges) and nonsmooth (with edges) images. As such models lead to fourth order (instead of the usual second order) nonlinear partial differential equations, development of fast solvers is a challenging task. Previously stabilized fixed point methods and their associated multigrid methods were developed but the underlying operators must be regularized by a relatively large parameter. In this paper, we first present a fixed point curvature method for solving such equations and then propose a homotopy approach for varying the regularized parameter so that the Newton type method becomes applicable in a predictor-corrector framework. Numerical experiments show that both of our methods are able to maintain all important information in the image, and at the same time to filter out noise.     

IMAGE DENOISING VIA TIME-DELAY REGULARIZATION COUPLED NONLINEAR DIFFUSION EQUATIONS

A novel nonlinear anisotropic diffusion model is proposed for image denoising which can be viewed as a novel regularized model that preserves the cherished features of Perona-Malik to some extent. It is characterized by a local dependence in the diffusivity which manifests itself through the presence of $p(x)$-Laplacian and time-delay regularization. The proposed model offers a new nonlinear anisotropic diffusion which makes it possible to effectively enhance the denoising capability and preserve the details while avoiding artifacts. Accordingly, the restored image is very clear and becomes more distinguishable. By Galerkin's method, we establish the well-posedness in the weak setting. Numerical experiments illustrate that the proposed model appears to be overwhelmingly competitive in restoring the images corrupted by Gaussian noise.     

Content-based image retrieval using visually significant point features

This paper presents a new image retrieval scheme using visually significant point features. The clusters of points around significant curvature regions (high, medium, and weak type) are extracted using a fuzzy set theoretic approach. Some invariant color features are computed from these points to evaluate the similarity between images. A set of relevant and non-redundant features is selected using the mutual information based minimum redundancy-maximum relevance framework. The relative importance of each feature is evaluated using a fuzzy entropy based measure, which is computed from the sets of retrieved images marked relevant and irrelevant by the users. The performance of the system is evaluated using different sets of examples from a general purpose image database. The robustness of the system is also shown when the images undergo different transformations.     

Infinite Dirichlet mixture models learning via expectation propagation

In this article, we propose a novel Bayesian nonparametric clustering algorithm based on a Dirichlet process mixture of Dirichlet distributions which have been shown to be very flexible for modeling proportional data. The idea is to let the number of mixture components increases as new data to cluster arrive in such a manner that the model selection problem (i.e. determination of the number of clusters) can be answered without recourse to classic selection criteria. Thus, the proposed model can be considered as an infinite Dirichlet mixture model. An expectation propagation inference framework is developed to learn this model by obtaining a full posterior distribution on its parameters. Within this learning framework, the model complexity and all the involved parameters are evaluated simultaneously. To show the practical relevance and efficiency of our model, we perform a detailed analysis using extensive simulations based on both synthetic and real data. In particular, real data are generated from three challenging applications namely images categorization, anomaly intrusion detection and videos summarization.     

基于方向信息测度的图像边缘检测

边缘检测是图像处理中—个重要的研究课题．针对传统图像边缘检测算法对噪声敏感的问题,本文在分析图像像素灰度信息的基础上,建立了—个改进的确定方向信息测度的方法,并利用震动滤波对边缘检测图像进行增强,该方法在滤除噪声的同时,能有效地保留图像的基本目标信息,正确提取图像的边缘．     

Conuclear images of substructural logics

Our work proposes to study the conuclear image of a substructural logic and in particular to investigate the relationship between a substructural logic and its conuclear image. We analyze some axioms familiar to substructural logics and we check if they: (a) are preserved under conuclear images, (b) never hold in a conuclear image, or (c) are compatible with conuclear images but are not necessarily preserved under conuclear images. Moreover, we prove that the conuclear image of any substructural logic has the disjunction property. We finally give a sufficient condition in order that an inequality is preserved under conuclear images and observe that if we slightly relax this condition, we meet counterexamples of inequalities that are not preserved under conuclear images.