• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.820-822
• /
• 2003

웨이블릿 변환 영역에 제안한 알고리즘으로 여러 공격에 강인한 워터마크를 삽입하고 성능을 분석하였다. 영상의 저작권 보호를 위해 웨이블릿 변환영역의 LH, HL, HH의 중대역에 128비트열의 워터마크를 삽입하였다. 제안한 방법의 강인성을 실험하기 위해 명도 변화, 콘트라스트 변화, 노이즈, 가우시안 등 과 같은 영상처리를 하였다. 실험결과 화질의 열화를 최소로 하여 워터마크를 삽입하여 높은 효율을 얻었다.

• The Korean Journal of Applied Statistics
• /
• v.27 no.1
• /
• pp.43-59
• /
• 2014

Cut-off sampling has been widely used for a highly skewed population like a business survey by discarding a part of the population, so called a take-nothing stratum. For a more accurate estimate of the population total, Hwang and Shin (2013) suggested a composite estimator of a take-nothing stratum total that combined the survey results of a take-nothing stratum and a take-some sub-stratum (a part of take-some stratum). In this paper we propose a new cut-off sampling scheme by considering a cost function and a composite estimator based on the proposed sampling scheme. Small simulation studies compared the performances of known composite estimators and the new composite estimator suggested in this study. We also use Briquette Consumption Survey data for real data analysis.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.171-178
• /
• 2008

Since the XML standard was introduced by the W3C in 1998, documents that have been written in XML have been gradually increasing. Accordingly, several systems have been developed in order to efficiently manage and retrieve massive XML documents. BitCube-a bitmap indexing system-is a representative system for this field of research. Based on the bitmap indexing technique, the path bitmap indexing system(LH06), which performs the clustering of similar paths, improved the problem that the existing BitCube system could not solve, namely, determining similar paths. The path bitmap indexing system has the advantage of a higher retrieval speed in not only exactly matched path searching but also similar path searching. However, the similarity calculation algorithm of this system has a few particular problems. Consequently, it sometimes cannot calculate the similarity even though some of two paths have extremely similar relationships; further, it results in an increment in the number of meaningless clusters. In this paper, we have proposed a novel method that clustering, the similarity between the paths in order to solve these problems. The proposed system yields a stable result for clustering, and it obtains a high score in clustering precision during a performance evaluation against LH06.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1424-1427
• /
• 2002

This paper proposes a novel postprocessing algorithm for reducing the blocking artifacts in low bit rate block-based transform coded images, that use adaptive neural network filter (NNF) in wavelet transform domain. n this algorithm, after performing a 2-level wavelet transform of the decompressed image, the existence of locking artifacts is determined using statistical characteristic of neighborhood blocks. And then a different one-dimensional (1-D) or 2-D NNF is used to reduce the locking artifacts according to the classified regions. That is, for HL and LH subbands regions with the blocking artifacts, a different 1-D NNF is used. And 2-D NNF is used in HH subband. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjectively and objectively.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.938-943
• /
• 2003

In this paper, we Propose a method using the Tikhonov-Miller process to improve the robustness of watermarking under various attacks. A visually recognizable pattern watermark is embedded in the LH2, HL2 and HH2 subband of wavelet transformed domain using threshold and besides watermark is embeded by utilizing HVS(Human Visual System) feature. The pattern watermark was interlaced after random Permutation for a security and an extraction rate. To demonstrate the improvement of robustness and similarity of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method was able to embed robust watermark invisibility and extract with an excellent normalized correlation of watermark under various attacks.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.82-84
• /
• 2016

We propose a new reliable SVD-based watermarking scheme having high fidelity and strong robustness with no false-positive problem. Each column of the principal component of a watermark image is embedded into singular values of LL, LH, HL and HH sub-bands of cover image with different scale factors. Each scale factor is optimized by trading-off fidelity and robustness using Differential Evolution (DE) algorithm. The proposed scheme improves fidelity and robustness of existing reliable SVD based watermarking schemes without any false-positive problem. Index Terms - watermarking, reliable SVD, DWT, principal component, Differential Evolution.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• 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.

• Journal of Animal Science and Technology
• /
• v.55 no.5
• /
• pp.359-365
• /
• 2013

Estimate breeding value can be used as single trait animal model was developed directly using the Fortran language program. The program is based on data computed by using the indirect method repeatedly. The program develops a common algorithm and imprves efficiency. Algorithm efficiency was compared between the two programs. Estimated using the solution is easy to farm and brand the service, pedigree data base was associated with the development of an improved system. The existing program that uses the single trait animal model and the comparative analysis of efficiency is weak because the estimation of the solution and the conventional algorithm programmed through regular formulation involve many repetition; therefore, the newly developed algorithm was conducted to improve speed by reducing the repetition. Single trait animal model was used to analyze Gauss-Seidel iteration method, and the aforesaid two algorithms were compared thorough the mixed model equation which is used the most commonly in estimating the current breeding value by applying the procedures such as the preparation of information necessary for modelling, removal of duplicative data, verifying the parent information of based population in the pedigree data, and assigning sequential numbers, etc. The existing conventional algorithm is the method for reading and recording the data by utilizing the successive repetitive sentences, while new algorithm is the method for directly generating the left hand side for estimation based on effect. Two programs were developed to ensure the accurate evaluation. BLUPF90 and MTDFREML were compared using the estimated solution. In relation to the pearson and spearman correlation, the estimated breeding value correlation coefficients were highest among all traits over 99.5%. Depending on the breeding value of the high correlation in Model I and Model II, accurate evaluation can be found. The number of iteration to convergence was 2,568 in Model I and 1,038 in Model II. The speed of solving was 256.008 seconds in Model I and 235.729 seconds in Model II. Model II had a speed of approximately 10% more than Model I. Therefore, it is considered to be much more effective to analyze large data through the improved algorithm than the existing method. If the corresponding program is systemized and utilized for the consulting of farm and industrial services, it would make contribution to the early selection of individual, shorten the generation, and cultivation of superior groups, and help develop the Hanwoo industry further through the improvement of breeding value based enhancement, ultimately paving the way for the country to evolve into an advanced livestock country.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.706-715
• /
• 2004

In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4${\times}$4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4${\times}$4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2％ to 8％ in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.