Copy-move tampering detection using affine transformation property preservation on clustered keypoints

2017 ◽  
Vol 12 (3) ◽  
pp. 549-556 ◽  
Author(s):  
V. T. Manu ◽  
B. M. Mehtre
Keyword(s):  
Affine Transformation ◽  
Transformation Property ◽  
Tampering Detection ◽  
Property Preservation

scholarly journals Efficient resampling features and convolution neural network model for image forgery detection

2022 ◽  
Vol 25 (1) ◽  
pp. 183
Author(s):  
Manjunatha S ◽  
Malini M. Patil
Keyword(s):  
Neural Network ◽  
Affine Transformation ◽  
Convolution Neural Network ◽  
Multimedia Data ◽  
Joint Photographic Expert Group ◽  
Laplacian Operator ◽  
Expert Group ◽  
Forgery Detection ◽  
Tampering Detection ◽  
Image Forensic

The extended utilization of picture-enhancing or manipulating tools has led to ease of manipulating multimedia data which includes digital images. These manipulations will disturb the truthfulness and lawfulness of images, resulting in misapprehension, and might disturb social security. The image forensic approach has been employed for detecting whether or not an image has been manipulated with the usage of positive attacks which includes splicing, and copy-move. This paper provides a competent tampering detection technique using resampling features and convolution neural network (CNN). In this model range spatial filtering (RSF)-CNN, throughout preprocessing the image is divided into consistent patches. Then, within every patch, the resampling features are extracted by utilizing affine transformation and the Laplacian operator. Then, the extracted features are accumulated for creating descriptors by using CNN. A wide-ranging analysis is performed for assessing tampering detection and tampered region segmentation accuracies of proposed RSF-CNN based tampering detection procedures considering various falsifications and post-processing attacks which include joint photographic expert group (JPEG) compression, scaling, rotations, noise additions, and more than one manipulation. From the achieved results, it can be visible the RSF-CNN primarily based tampering detection with adequately higher accurateness than existing tampering detection methodologies.

The Standard Metric

2017 ◽  
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss
Keyword(s):  
Affine Transformation ◽  
Convex Sets ◽  
Finite Dimension ◽  
Affine Subspace ◽  
Affine Transformations ◽  
Real Vector ◽  
Euclidean Metric ◽  
Affine Hyperplane ◽  
Tits Building ◽  
Convex Closure

This chapter presents some results about groups generated by reflections and the standard metric on a Bruhat-Tits building. It begins with definitions relating to an affine subspace, an affine hyperplane, an affine span, an affine map, and an affine transformation. It then considers a notation stating that the convex closure of a subset a of X is the intersection of all convex sets containing a and another notation that denotes by AGL(X) the group of all affine transformations of X and by Trans(X) the set of all translations of X. It also describes Euclidean spaces and assumes that the real vector space X is of finite dimension n and that d is a Euclidean metric on X. Finally, it discusses Euclidean representations and the standard metric.

A quasi-affine transformation artificial bee colony algorithm for global optimization

2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang
Keyword(s):  
Affine Transformation ◽  
Artificial Bee Colony ◽  
Triangular Matrix ◽  
Convergence Speed ◽  
Test Set ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Search Mechanism ◽  
Multiple Dimensions ◽  
Collaborative Search

The artificial bee colony (ABC) algorithm is one of the classical bioinspired swarm-based intelligence algorithms that has strong search ability, because of its special search mechanism, but its development ability is slightly insufficient and its convergence speed is slow. In view of its weak development ability and slow convergence speed, this paper proposes the QABC algorithm in which a new search equation is based on the idea of quasi-affine transformation, which greatly improves the cooperative ability between particles and enhances its exploitability. During the process of location updating, the convergence speed is accelerated by updating multiple dimensions instead of one dimension. Finally, in the overall search framework, a collaborative search matrix is introduced to update the position of particles. The collaborative search matrix is transformed from the lower triangular matrix, which not only ensures the randomness of the search, but also ensures its balance and integrity. To evaluate the performance of the QABC algorithm, CEC2013 test set and CEC2014 test set are used in the experiment. After comparing with the conventional ABC algorithm and some famous ABC variants, QABC algorithm is proved to be superior in efficiency, development ability, and robustness.

scholarly journals Affine transformation of virtual 3D object using 2D localization of fingertips

2020 ◽  
Vol 2 (6) ◽  
pp. 534-555
Author(s):  
Mohammad Mahmudul Alam ◽  
S.M. Mahbubur Rahman
Keyword(s):  
Affine Transformation ◽  
3D Object

scholarly journals Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials

2021 ◽  
Author(s):  
Mareike Dressler ◽  
Adam Kurpisz ◽  
Timo de Wolff
Keyword(s):  
Computer Science ◽  
Affine Transformation ◽  
Optimization Problems ◽  
Polynomial Optimization ◽  
Theoretical Computer Science ◽  
Sums Of Squares ◽  
Theoretical Computer ◽  
Complexity Bounds ◽  
Polynomial Optimization Problems ◽  
Transformation Of Variables

AbstractVarious key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS-based certificates remain valid: First, for polynomials, which are nonnegative over the n-variate boolean hypercube with constraints of degree d there exists a SONC certificate of degree at most $$n+d$$ n + d . Second, if there exists a degree d SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree d SONC certificate that includes at most $$n^{O(d)}$$ n O ( d ) nonnegative circuit polynomials. Moreover, we prove that, in opposite to SOS, the SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar’s Positivstellensatz for SOS. We discuss these results from both the algebraic and the optimization perspective.

Affine transformation in random iterated function systems

2001 ◽  
Vol 22 (7) ◽  
pp. 820-826 ◽  
Author(s):  
Xiong Yong ◽  
Shi Ding-hua
Keyword(s):  
Affine Transformation ◽  
Iterated Function Systems ◽  
Iterated Function
Sign in / Sign up

Export Citation Format

Share Document