• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.499-502
• /
• 2001

Fractal image coding suffers from the long search time of domain pool although it provides many properties including the high compression ratio. We find that the normalized variance of a block is independent of contrast, brightness. Using this observation, we introduce a self similar block searching method employing the d-dimensional nearest neighbor searching. This method takes Ο(log/N) time for searching the self similar domain blocks for each range block where N is the number of domain blocks. PSNR (Peak Signal Noise Ratio) of this method is similar to that of the full search method that requires Ο(N) time for each range block. Moreover, the image quality of this method is independent of the number of edges in the image.

• Journal of the Korean Statistical Society
• /
• v.16 no.1
• /
• pp.21-25
• /
• 1987

The combined estimator of inter- and intra-block estimators in incomplete block designs can be expressed as a weighted average of two location estimators. The weight should be between 0 and 1. However, the negative variance component estimate could result in the weight being negative or larger than 1. In this paper, we show that if two location estimators have symmetric unimodal distributions, truncating the weight to 0 or 1 accordingly improves the combined estimator under an arbitrary convex loss function.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.643-651
• /
• 2017

Steganography is one of information hiding technologies and discriminated from cryptography in that it focuses on avoiding the existence the hidden information from being detected by third parties, rather than protecting it from being decoded. In this paper, as an image steganography method which uses images as media, we propose a new block matching method that embeds information into the discrete wavelet transform (DWT) domain. The proposed method, based on a statistical analysis, reduces loss of embedding capacity due to inequable use of candidate blocks. It works in such a way that computes the variance of each candidate block, preserves candidate blocks with high frequency components while reducing candidate blocks with low frequency components by compressing them exploiting the k-means clustering algorithm. Compared with the previous block matching method, the proposed method can reconstruct secret images with similar PSNRs while embedding higher-capacity information.

• The Korean Journal of Applied Statistics
• /
• v.29 no.3
• /
• pp.449-462
• /
• 2016

This paper considers a long-run variance estimation using a block bootstrap method under strong dependence also known as long range dependence. We extend currently available methods in two ways. First, it extends bootstrap methods under short range dependence to long range dependence. Second, to accommodate the observation that strong dependence may come from deterministic trend plus noise models, we propose to utilize residuals obtained from the nonparametric kernel estimation with the bimodal kernel. The simulation study shows that our method works well; in addition, a data illustration is presented for practitioners.

• Journal of the Semiconductor & Display Technology
• /
• v.12 no.1
• /
• pp.35-39
• /
• 2013

H.264/AVC is an authoritative international video coding standard which shows code and efficiency more improved than the existing video standards. Above all, the parameter block mode of H.264/AVC significantly contributes much to high compression efficiency. However, as the occasion demands, users tend to pass while overlooking the part that can produce a little higher compression efficiency. We, taking notice of this point, are designed to bring in much higher compression efficiency by gathering up the overlooked parts. This paper suggests the algorithm that produces efficient performance improvement by using the histogram of luminance in the pixel unit (Macroblock) of respective prediction block and applying specific thresholds. The experimental results proves that the technique proposed by this paper increases the compression efficiency of the existing H.264/AVC algorithm by 0.4% without any increase in the whole encoding time and PSNR complexity.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.514-521
• /
• 2016

The High Efficiency Video Coding (HEVC) standard provides superior coding efficiency by utilizing highly flexible block structure and more diverse coding modes. However, rate-distortion optimization (RDO) process for the decision of optimal block size and prediction mode requires excessive computational complexity. To alleviate the computation load, this paper proposes a new moment-based fast CU size decision algorithm for intra coding in HEVC. In the proposed method, moment values are computed in each CU block to estimate the texture complexity of the block from which the decision on an additional CU splitting procedure is performed. Unlike conventional methods which are mostly variance-based approaches, the proposed method incorporates the third-order moments of the CU block in the design of the fast CU size decision algorithm, which enables an elaborate classification of CU types and thus improves the RD-performance of the fast algorithm. Experimental results show that the proposed method saves 32% encoding time with 1.1% increase of BD-rate compared to HM-10.0, and 4.2% decrease of BD-rate compared to the conventional variance-based fast algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4467-4486
• /
• 2018

Trying to deal with the problem of low robustness of Copy-Move Forgery Detection (CMFD) under various transformation and degradation attacks, a novel CMFD method is proposed in this paper. The main advantages of proposed work include: (1) Discrete Analytical Fourier-Mellin Transform (DAFMT) and Locality Sensitive Hashing (LSH) are combined to extract the block features and detect the potential copy-move pairs; (2) The Euclidian distance is incorporated in the pixel variance to filter out the false potential copy-move pairs in the post-verification step. In addition to extracting the effective features of an image block, the DAMFT has the properties of rotation and scale invariance. Unlike the traditional lexicographic sorting method, LSH is robust to the degradations of Gaussian noise and JEPG compression. Because most of the false copy-move pairs locate closely to each other in the spatial domain or are in the homogeneous regions, the Euclidian distance and pixel variance are employed in the post-verification step. After evaluating the proposed method by the precision-recall-$F_1$ model quantitatively based on the Image Manipulation Dataset (IMD) and Copy-Move Hard Dataset (CMHD), our method outperforms Emam et al.'s and Li et al.'s works in the recall and $F_1$ aspects.

• Journal of Technologic Dentistry
• /
• v.33 no.4
• /
• pp.283-289
• /
• 2011

Purpose: The purpose of this study was to evaluate flexural strength of full zirconia crown using block after clinical work. Methods: The three point bending test was used to measure the flexural strength of zirconia block. Statistical analysis was done using the Statistical Package for Social Sciences version 19.0 for Windows. As for the analysis methods, the study used analysis of variance, Tukey's test. Results: The ave Rage value of flexural strengths of WIELAND, Zirkonzahn, Hass, D-MAX were 516.2 MPa, 612.6MPa, 566.2MPa, 744.6MPa. The ave Rage value of Surface Roughness of WIELAND, Zirkonzahn, Hass, D-MAX were 0.39Ra, 0.33Ra, 0.33Ra, 0.47Ra. Conclusion: Flexural strength of zirconia block decreased after clinical work. Flexural strength of zirconia block is equal to or higher than flexural strength of dental metal, so zirconia block can be used as dental material.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.393-396
• /
• 2000

본 논문에서는 영상의 화소값으로부터 추출된 유사 특징점(quasi-feature point)을 이용한 이미지 모자이킹 알고리즘을 제안한다. 유사 특징점의 선택은 전역 정합(global matching)의 결과로부터 중첩된 영역을 4개의 부영역(sub-area)으로 분할하고, 각각의 분할된 부 영역에서 국부 분산(local variance)의 크기가 큰 블록을 선정, 이 블록의 중심 화소를 유사 특징점으로 선택한다. 유사 특징점에 대한 정합은 카메라 이동에 따른 왜곡(distortion)과 조명의 변화를 고려한 블록 정합 알고리즘(block matching algorithm)을 이용한다.

• Asian-Australasian Journal of Animal Sciences
• /
• v.8 no.3
• /
• pp.289-293
• /
• 1995

The experiment was conducted to study the effect of supplementary urea molasses block lick with rice straw based diet on the performance of sheep. Six indigenous sheep of about two years of age with an average body weight of 12.88 kg, were selected for this experiment They grouped into two by stratified randomization, and the experiment was conducted for a period of 90 days. Sheep of group A was fed rice straw and group B was feed rice straw with urea molasses block lick, beside this both the groups received 66 g wheat bran and 167 g of Ipil-Ipil leaf meat. The study revealed that the average daily gain of live weight per sheep per day was 41 gm and 70 gm in group-A and group-B respectively. From the analysis of variance it was evident that live weight gain in sheep of group B, supplemented with urea molasses block lick was highly significant (p < 0.01). It was also estimated that group A required 8.12 kg DM to gain 1 kg live weight, whereas group B receiving urea molasses block lick required 5.30 kg DM to gain 1 kg live weight. Therefore, feeding rice straw with urea molasses block lick able to utilize more crop-residues efficiently.