Author(s):  
Chauhan Usha ◽  
Singh Rajeev Kumar

Digital Watermarking is a technology, to facilitate the authentication, copyright protection and Security of digital media. The objective of developing a robust watermarking technique is to incorporate the maximum possible robustness without compromising with the transparency. Singular Value Decomposition (SVD) using Firefly Algorithm provides this objective of an optimal robust watermarking technique. Multiple scaling factors are used to embed the watermark image into the host by multiplying these scaling factors with the Singular Values (SV) of the host image. Firefly Algorithm is used to optimize the modified host image to achieve the highest possible robustness and transparency. This approach can significantly increase the quality of watermarked image and provide more robustness to the embedded watermark against various attacks such as noise, geometric attacks, filtering attacks etc.


2011 ◽  
Vol 33 (9) ◽  
pp. 2039-2044 ◽  
Author(s):  
Xin-peng Zhou ◽  
Feng Han ◽  
Guo-hua Wei ◽  
Si-liang Wu

Author(s):  
Shaya Shakerian

In this paper, we study the existence and multiplicity of solutions for the following fractional problem involving the Hardy potential and concave–convex nonlinearities: [Formula: see text] where [Formula: see text] is a smooth bounded domain in [Formula: see text] containing [Formula: see text] in its interior, and [Formula: see text] with [Formula: see text] which may change sign in [Formula: see text]. We use the variational methods and the Nehari manifold decomposition to prove that this problem has at least two positive solutions for [Formula: see text] sufficiently small. The variational approach requires that [Formula: see text] [Formula: see text] [Formula: see text], and [Formula: see text], the latter being the best fractional Hardy constant on [Formula: see text].


2015 ◽  
Vol 76 (2) ◽  
pp. 205-218 ◽  
Author(s):  
L. A. Mironovskii ◽  
T. N. Solov’eva

2020 ◽  
Vol 18 (1) ◽  
pp. 1727-1741
Author(s):  
Yoonjin Lee ◽  
Yoon Kyung Park

Abstract We study the modularity of Ramanujan’s function k ( τ ) = r ( τ ) r 2 ( 2 τ ) k(\tau )=r(\tau ){r}^{2}(2\tau ) , where r ( τ ) r(\tau ) is the Rogers-Ramanujan continued fraction. We first find the modular equation of k ( τ ) k(\tau ) of “an” level, and we obtain some symmetry relations and some congruence relations which are satisfied by the modular equations; these relations are quite useful for reduction of the computation cost for finding the modular equations. We also show that for some τ \tau in an imaginary quadratic field, the value k ( τ ) k(\tau ) generates the ray class field over an imaginary quadratic field modulo 10; this is because the function k is a generator of the field of the modular function on Γ 1 ( 10 ) {{\mathrm{\Gamma}}}_{1}(10) . Furthermore, we suggest a rather optimal way of evaluating the singular values of k ( τ ) k(\tau ) using the modular equations in the following two ways: one is that if j ( τ ) j(\tau ) is the elliptic modular function, then one can explicitly evaluate the value k ( τ ) k(\tau ) , and the other is that once the value k ( τ ) k(\tau ) is given, we can obtain the value k ( r τ ) k(r\tau ) for any positive rational number r immediately.


Robotica ◽  
2021 ◽  
pp. 1-22
Author(s):  
Zhouxiang Jiang ◽  
Min Huang

SUMMARY In typical calibration methods (kinematic or non-kinematic) for serial industrial robot, though measurement instruments with high resolutions are adopted, measurement configurations are optimized, and redundant parameters are eliminated from identification model, calibration accuracy is still limited under measurement noise. This might be because huge gaps still exist among the singular values of typical identification Jacobians, thereby causing the identification models ill conditioned. This paper addresses such problem by using new identification models established in two steps. First, the typical models are divided into the submodels with truncated singular values. In this way, the unknown parameters corresponding to the abnormal singular values are removed, thereby reducing the condition numbers of the new submodels. However, these models might still be ill conditioned. Therefore, the second step is to further centralize the singular values of each submodel by using a matrix balance method. Afterward, all submodels are well conditioned and obtain much higher observability indices compared with those of typical models. Simulation results indicate that significant improvements in the stability of identification results and the identifiability of unknown parameters are acquired by using the new identification submodels. Experimental results indicate that the proposed calibration method increases the identification accuracy without incurring additional hardware setup costs to the typical calibration method.


Sign in / Sign up

Export Citation Format

Share Document