• 전기학회논문지P
• /
• 제59권3호
• /
• pp.258-262
• /
• 2010

This paper describes a watermarking system that has the robust characteristics against the geometric attacks of resizing and the bitrate varying attacks. While the existing watermark methods of marking on AC in DCT coefficients are weak against the geometric attacks, the methods of tiny increasing the DC in DCT coefficients and the system implementations are suggested in this paper. We measure the differences between the original images and the watermarked images and the detecting rate from the geometric and bitrate attacked images. Results of experiments show that our method is robust against that attacks.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 추계학술대회
• /
• pp.87-89
• /
• 2018

We proposed an improved reliable SVD-based watermarking scheme resistant to geometric attacks while having high fidelity with no false-positive problem. Principal components of a watermark image are embedded into singular values of LL, LH, HL, and HH sub-bands of a transformed cover image by RDWT(redundant discrete wavelet transform) with optimal scale factors. Each scale factor is generated by trading-off fidelity and robustness using Differential Evolution (DE) algorithm. Zernike Moment (ZM) is used to estimate the geometric distortion and to correct the watermarked image before extracting watermark. The proposed scheme improves fidelity and robustness of existing reliable SVD based watermarking schemes while resisting to geometric attacks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.73-76
• /
• 2001

In this paper, we utilize a HVS(Human Visual System) watermarking method where watermarks are embedded in a DFT domain. The HVS watermarking method is robust for attacks like JPEC, filtering, noise, etc. But, when images are attacked by basic geometric attacks as cropping, scaling, rotation, a watermarks may not be detected. In this paper, we introduce the HVS watermarking method that inserts references In a domain of LSB(Least Significant Bit) of image. Experimental results show that the proposed method based on HVS watermarking method gives more robustness to the basic geometric attacks compared with original HVS watermarking methods.

• International Journal of Contents
• /
• 제5권2호
• /
• pp.32-37
• /
• 2009

A new video watermarking scheme with robustness against collusion and synchronization attacks is presented. We propose to embed only a few copies of the watermark along the temporal axis into frames, which are located at the borders of each two different plotlines of the video. As a result, each change of the video plotline is transformed into pulse, which is used for watermark embedding and extraction. In addition, since we embed a watermark only into a small number of frames, the distortions of the video are reduced to minimum. Experimental results show the robustness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4042-4059
• /
• 2020

The development of new multimedia techniques such as 3D printing is increasingly attracting the public's attention towards 3D objects. An optimized robust and imperceptible watermarking method based on Ant Colony Optimization (ACO) and Weber Law is proposed for 3D polygonal models. The proposed approach partitions the host model into smaller sub meshes and generates a secret watermark from the sub meshes using Weber Law. ACO based optimized strength factor is identified for embedding the watermark. The secret watermark is embedded and extracted on the wavelet domain. The proposed scheme is robust against geometric and photometric attacks that overcomes the synchronization problem and authenticates the secret watermark from the distorted models. The primary characteristic of the proposed system is the flexibility achieved in data embedding capacity due to the optimized strength factor. Extensive simulation results shows enhanced performance of the recommended framework and robustness towards the most common attacks like geometric transformations, noise, cropping, mesh smoothening, and the combination of such attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2004년도 하계종합학술발표회논문초록집
• /
• pp.348-348
• /
• 2004

• International Journal of Contents
• /
• 제5권2호
• /
• pp.26-31
• /
• 2009

This paper describes a new image watermarking scheme invariant to rotation, scaling and translation (RST) attacks. For obtaining the invariance properties we propose to present an image of watermark by wedges and rings to convert its rotation to shift and then utilize the shift invariance property of the Direct Fourier Transform (DFT). But in contrast to conversional schemes based on the Fourier-Mellin transform (FMT), we do not use a log-polar mapping (LPM). As a result, our scheme preserves high quality of original image since it is not underwent to LPM For withstanding against JPEG compression, noise addition and low-pass (LP) filtering attacks a low frequency watermark is embedded into middle frequencies of the original image. Experiments with various attacks show the robustness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.1078-1099
• /
• 2021

Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

• Nuclear Engineering and Technology
• /
• 제49권3호
• /
• pp.484-494
• /
• 2017

In industrial plants such as nuclear power plants, system operations are performed by embedded controllers orchestrated by Supervisory Control and Data Acquisition (SCADA) software. A targeted attack (also termed a control aware attack) on the controller/SCADA software can lead a control system to operate in an unsafe mode or sometimes to complete shutdown of the plant. Such malware attacks can result in tremendous cost to the organization for recovery, cleanup, and maintenance activity. SCADA systems in operational mode generate huge log files. These files are useful in analysis of the plant behavior and diagnostics during an ongoing attack. However, they are bulky and difficult for manual inspection. Data mining techniques such as least squares approximation and computational methods can be used in the analysis of logs and to take proactive actions when required. This paper explores methodologies and algorithms so as to develop an effective monitoring scheme against control aware cyber attacks. It also explains soft computation techniques such as the computational geometric method and least squares approximation that can be effective in monitor design. This paper provides insights into diagnostic monitoring of its effectiveness by attack simulations on a four-tank model and using computation techniques to diagnose it. Cyber security of instrumentation and control systems used in nuclear power plants is of paramount importance and hence could be a possible target of such applications.