• Title/Summary/Keyword: 평균 자승 에러

Search Result 34, Processing Time 0.017 seconds

A new watermark for copyright protection of digital images (디지철 영상의 저작권 보호를 위한 새로운 서명 문양)

  • 서정일;우석훈;원치선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1814-1822
    • /
    • 1997
  • In this paper, we present a new digital signature for copyright protection of digital images. The proposed algorithm is designed to be more robust to both the compression (quantization) errors and the illegal signature attack by a third party. More specifically, to maximize the watermaking effect, we embed the watermark by randomly adding or subtracking a fixed number instead of executing the XORs. Also, to improve the reliability of the watermark detection, we extact the watermark only on some image blocks, which are less sensitive to the compression error. Futhermore, the unrecovered compression errors are further detected by the Hypothesis testing. The illegal signalture attack of a third party is also protected by using some probabilistic decisions of the MSE between the orignal image and the signed image. Experimental results show that the peroposed algorithm is more robust to the quantization errors and illegal signature attack by a third party.

  • PDF

The Segmented Polynomial Curve Fitting for Improving Non-linear Gamma Curve Algorithm (비선형 감마 곡선 알고리즘 개선을 위한 구간 분할 다항식 곡선 접합)

  • Jang, Kyoung-Hoon;Jo, Ho-Sang;Jang, Won-Woo;Kang, Bong-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.3
    • /
    • pp.163-168
    • /
    • 2011
  • In this paper, we proposed non-linear gamma curve algorithm for gamma correction. The previous non-linear gamma curve algorithm is generated by the least square polynomial using the Gauss-Jordan inverse matrix. However, the previous algorithm has some weak points. When calculating coefficients using inverse matrix of higher degree, occurred truncation errors. Also, only if input sample points are existed regular interval on 10-bit scale, the least square polynomial is accurately works. To compensate weak-points, we calculated accurate coefficients of polynomial using eigenvalue and orthogonal value of mat11x from singular value decomposition (SVD) and QR decomposition of vandemond matrix. Also, we used input data part segmentation, then we performed polynomial curve fitting and merged curve fitting results. When compared the previous method and proposed method using the mean square error (MSE) and the standard deviation (STD), the proposed segmented polynomial curve fitting is highly accuracy that MSE under the least significant bit (LSB) error range is approximately $10^{-9}$ and STD is about $10^{-5}$.

Accelerated compression of sub-images by use of effective motion estimation and difference image methods in integral imaging (집적영상에서 효율적인 물체움직임 추정 및 차 영상 기법을 이용한 서브영상의 고속 압축)

  • Lee, Hyoung-Woo;Kim, Eun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.12
    • /
    • pp.2762-2770
    • /
    • 2012
  • In this paper, we propose a novel approach to effectively compress the sub-images transformed from the picked-up elemental images in integral imaging, in which motion vectors of the object in each sub-image are fast and accurately estimated and compensated by combined use of MSE(mean square error)-based TSS(tree-step search) and FS(full search) schemes. This is, the possible object areas in each sub-image are searched by using the fast TSS algorithm in advance, then the these selected object areas are fully searched with the accurate FS algorithm. Furthermore, the sub-images in which all object's motion vectors are compensated, are transformed into the residual images by using the difference image method and finally compressed with the MPEG-4 algorithm. Experimental results reveal that the proposed method shows 214% improvement in the compression time per each image frame compared to that of the conventional method while keeping the same compression ratio with the conventional method. These successful results confirm the feasibility of the proposed method in the practical application.

Digital predistorters for communication systems with dynamic spectrum allocation (가변 스펙트럼 할당을 지원하는 광대역 전력 증폭기를 위한 디지털 전치왜곡기)

  • Choi, Sung-Ho;Seo, Sung-Won;Mah, Bak-Il;Jeong, Eui-Rim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.307-314
    • /
    • 2011
  • A new predistortion technique for dynamic spectrum allocation systems such as cognitive radio (CR) is proposed. The system model considered in this paper occupies a small band at a time, but the center frequency can be changed in the wide range of frequency. In this scenario. the front-end filter may not eliminate the harmonics of the power amplifier (PA) output. The proposed PD reduces the spectral regrowth of the fundamental signal at the carrier frequency (${\omega}_0$) and removes the harmonics ($2{\omega}_0$, $3{\omega}_0$, ...) at the same time. The proposed PD structure is composed of multiple predistorters (PDs) centered at integer multiples of ${\omega}_0$. The PD at ${\omega}_0$ is for removing spectral regrowth of the fundamental signal, and the others are for harmonic reduction. In the proposed PD structure, parameters of PDs are found jointly. Simulation results show that the spectral regrowth can be reduced by 20dB, and the 2nd and 3rd harmonics can be reduced down to -70dB from the power of the fundamental signal.