• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.315-320
• /
• 2012

In H.264/AVC, the first frame of a group of pictures (GOP) is encoded in intra mode which generates a large number of bits. The number of bits for the I-frame affects the qualities of the following frames of a GOP since they are encoded using the bits remaining among the bits allocated to the GOP. In addition, the first frame is used for the inter mode encoding of the following frames. Thus, the initial quantization parameter (QP) affects the following frames as well as the first frame. In this paper, an adaptive peak signal to noise ratio (PSNR)-based initial QP determination algorithm is presented. In the proposed algorithm, a novel linear model is established based on the observation of the relation between the initial QPs and PSNRs of frames. Using the linear model and PSNR results of the encoded GOPs, the proposed algorithm accurately estimates the optimal initial QP which maximizes the PSNR of the current GOP. It is shown by experimental results that the proposed algorithm predicts the optimal initial QP accurately and thus achieves better PSNR performance than that of the existing algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1447-1454
• /
• 2014

In H.264 standard, an intra frame is the first frame of a GOP (Group of Pictures) and all macroblocks of an intra frame are encoded using the same quantization parameter. In addition, an intra frame is used for encoding the following frames of the same GOP so the encoding results of an intra frame affect the encoding results of the entire GOP. Thus, it is important to find the optimal quantization parameter of an intra frame for improving the quality of a GOP. In this paper, we propose an searching method for an optimal quantization parameter of an intra frame in real time. The proposed method uses a gradient descent method to find the optimal value based on characteristics of the optimal quantization parameters. Experimental results show that the proposed method captures the characteristics of the optimal quantization parameter and accurately estimates the optimal value.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.147-154
• /
• 2015

In this paper, we employed a model which defines the sensitivity according to the background luminance, so called JND (Just Noticeable Difference), and applied to the video coding. The proposed method finds out the maximum possible quantization parameter for the current unit based on the threshold of JND model and reduce the bitrate with similar perceptual quality. It selects the higher quantization parameter and reduce the bitrate when the reconstructed signal which is coded with higher quantization parameter is in a range of allowance based on the JND threshold, i.e. the signal has the similar perceptual quality compared to that is coded with the initial quantization parameter. The proposed algorithm was implemented on HM16.0, which is a reference software of the latest video coding standard HEVC (High Efficiency Video Coding) and the coding performance was evaluated. Compared to HM16.0, the proposed algorithm achieved maximum 20.21% and 6.18% of average bitrate reduction with the similar perceptual quality.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1207-1214
• /
• 2014

The first frame of a GOP is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the encoding results of the intra frame affects the first frame as well as the following frames. Traditionally, the quantization parameter for an intra frame is determined only depending on the bpp not considering the characteristics of the intra frame. For accurate intra frame encoding, we should consider not only bpp but also the complexity of the video sequence and the output bandwidth. In this paper, we propose a real-time quantization model which is used to calculate the quantization parameter for an intra frame encoding based on the investigation on the characteristics of a GOP. It is shown by experimental results that the proposed quantization model captures the characteristics of an intra frame effectively and the proposed method for model parameters accurately estimates the real values.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2071-2078
• /
• 2009

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP (Quantization Parameter) for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 35 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we use a linear model because there is a linear inverse proportional relationship between the output bandwidth and the optimal intial QP. Model parameters of the model are determined depending on the spatial complexity of the first frame. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.235-242
• /
• 2008

To improve video quality and coding efficiency, H.264/AVC adopted an adaptive rate control. But this method has a problem as it cannot predict an accurate quantization parameter(QP) for the first frame. The first QP is decided among four constant values by using encoder input parameters. It does not consider encoding bits, results in significant fluctuation of the image quality and decreases the average quality of the whole coded sequence. In this paper, we propose a new algorithm for the first frame QP decision in the H.264/AVC encoder. The QP is decided by the existing algorithm and the first frame is encoded. According to the encoded bits, the new initial QP is decided. We can predict optimal value because there is a linear relationship between encoded bits and the new initial QP. Next, we re-encode the first frame using the new initial QP. Experimental results show that the proposed algorithm not only achieves better quality than the state of the art algorithm, but also adopts a rate control forthe sequence that was impossible with the existing algorithm. By reducing fluctuation, subjective quality also improved.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.6
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

• Journal of Astronomy and Space Sciences
• /
• v.31 no.2
• /
• pp.121-130
• /
• 2014

Essential ideas, successes, and difficulties of Areal Density Analysis (ADA) for color-magnitude diagrams (CMD's) of resolved stellar populations are examined, with explanation of various algorithms and strategies for optimal performance. A CMD-generation program computes theoretical datasets with simulated observational error and a solution program inverts the problem by the method of Differential Corrections (DC) so as to compute parameter values from observed magnitudes and colors, with standard error estimates and correlation coefficients. ADA promises not only impersonal results, but also significant saving of labor, especially where a given dataset is analyzed with several evolution models. Observational errors and multiple star systems, along with various single star characteristics and phenomena, are modeled directly via the Functional Statistics Algorithm (FSA). Unlike Monte Carlo, FSA is not dependent on a random number generator. Discussions include difficulties and overall requirements, such as need for fast evolutionary computation and realization of goals within machine memory limits. Degradation of results due to influence of pixelization on derivatives, Initial Mass Function (IMF) quantization, IMF steepness, low Areal Densities ($\mathcal{A}$), and large variation in $\mathcal{A}$ are reduced or eliminated through a variety of schemes that are explained sufficiently for general application. The Levenberg-Marquardt and MMS algorithms for improvement of solution convergence are contained within the DC program. An example of convergence, which typically is very good, is shown in tabular form. A number of theoretical and practical solution issues are discussed, as are prospects for further development.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.488-504
• /
• 2005

In this paper, we propose a new bitrate control scheme to improve the quality of image encoded by SVC and to resolve the problems of conventional scheme. In JSVM2.0, bitrate of a frame is controlled by an initial quantization parameter and scaling factor that it hasdifferent value according to frame. Itis difficult to get the best of video quality at arbitrary bitrate because the conventional scheme has two defects. One is that we have to know proper initial QP's fur all sequences. Another is that QP's control skill for macroblocks is very inefficient. In this paper, we propose an efficient bit allocation algorithm to reduce the effect of the initial QP and to increase the efficiency of bit allocation by using proper QP's for macroblocks. In simulation results, it can be seen that using the proposed scheme enables the SVC encoder to control the bitrate by the macroblock unit and outperforms the conventional schemes in the respect of rate-distortion.