• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.653-660
• /
• 2004

Object-oriented analysis-synthesis coding (OOASC) subdivides each image of a sequence into a number of moving objects and estimates and compensates the motion of each object. It employs a motion parameter technique for estimating motion information of each object. The motion parameter technique employing gradient operators requires a high computational load. The main objective of this paper is to present efficient motion parameter estimation techniques using the hierarchical structure in object-oriented analysis-synthesis coding. In order to achieve this goal, this paper proposes two algorithms : hybrid motion parameter estimation method (HMPEM) and adaptive motion parameter estimation method (AMPEM) using the hierarchical structure. HMPEM uses the proposed hierarchical structure, in which six or eight motion parameters are estimated by a parameter verification process in a low-resolution image, whose size is equal to one fourth of that of an original image. AMPEM uses the same hierarchical structure with the motion detection criterion that measures the amount of motion based on the temporal co-occurrence matrices for adaptive estimation of the motion parameters. This method is fast and easily implemented using parallel processing techniques. Theoretical analysis and computer simulation show that the peak signal to noise ratio (PSNR) of the image reconstructed by the proposed method lies between those of images reconstructed by the conventional 6- and 8-parameter estimation methods with a greatly reduced computational load by a factor of about four.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.2 no.2
• /
• pp.97-104
• /
• 2004

Neutron induced prompt gamma-ray spectroscopy(NIPS) system measures the prompt gamma-ray emitting by the interaction of a neutron with various materials. This system will be of great benefit to scientists worldwide, since it provides the non-destructive measurement of many element in either solid or liquid wastes. In this study, the full-energy-peak (FEP) efficiency calibration for a HPGe detector was constructed in the ${\gamma}$-ray energy range from 80 keV to 8 MeV, using $^{l33}$Ba and >TEX>$^{152}Eu$ RI sources and $ ^{35}Cl(n, ${\gamma}$)^{36}Cl$ thermal neutron captured reaction. The FEP efficiency curve for the higher energies using the $^{35}Cl(n, ${\gamma}$)^{36}Cl$ reaction was normalized with the curve obtained from the RI sources, since the accurate activity of its prompt ${\gamma}$-ray is unknown. The average thermal neutron flux was theoretically calculated using the FEP efficiency curve for the KCl standard solutions. The NIPS system equipped with a ${\gamma}$-${\gamma}$ coincidence setup with two n-type coaxial HPGe detectors was considered in order to reduce the interfering ${\gamma}$-ray background. The FEP efficiency curve for the ${\gamma}$-${\gamma}$ coincidence system was also obtained for full energy range. The performance of the normal and coincidence NIPS system was tested by comparing signal-to-noise ratio in each mode using the reference sample.e.

• Geophysics and Geophysical Exploration
• /
• v.18 no.3
• /
• pp.154-161
• /
• 2015

For efficiently designing neutron induced gamma spectroscopy sonde, Monte Carlo simulation is employed to understand a dominant location of thermal neutron and classify the formation elements from the energy peak of capture gamma spectrum. A pulsed neutron generator emitting 14 MeV neutron particles was used as a source, and flux of thermal neutron was calculated from the twelve detectors arranged at each 10 cm intervals from the source. Design for reducing borehole effects using shielding materials was also applied to numerical sonde model. Moreover, principal elements and quantities of numerical earth models were verified through the energy spectrum analysis of capture gamma detected from a gamma detector. These results can help to enhance the signal-to-noise ratio, and determine an optimal placement of capture gamma detectors of neutron induced gamma spectroscopy sonde.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.310-318
• /
• 2008

The H.264/AVC standard achieves higher coding efficiency than previous video coding standards with the rate-distortion optimization (RDO) technique which selects the best coding mode and reference frame for each macroblock. As a result, the complexity of the encoder have been significantly increased. In this paper, a fast intra-mode decision algorithm is proposed to reduce the computational load of intra-mode search, which is based on the inverse tree-structure edge prediction algorithm. First, we obtained the dominant edge for each $4{\times}4$ block from local edge information, then the RDO process is only performed by the mode which corresponds to dominant edge direction. Then, for the $8{\times}8$ (or $16{\times}16$) block stage, the dominant edge is calculated from its four $4{\times}4$ (or $16{\times}16$) blocks' dominant edges without additional calculation and the RDO process is also performed by the mode which is related to dominant edge direction. Experimental results show that proposed scheme can significantly improve the speed of the intra prediction with a negligible loss in the peak signal to noise ratio (PSNR) and a little increase of bits.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.498-512
• /
• 2010

Intra coding is an indispensable coding tool since it can provide random accessibility as well as error resiliency. However, it is the problem that intra coding has relatively low coding efficiency compared with inter coding in the area of video coding. Even though H.264/AVC has significantly improved the intra coding performance compared with previous video standards, H.264/AVC encoder complexity is significantly increased, which is not suitable for low bit rate interactive services. In this paper, a Voting-based Intra Mode Bit Skip (V-IMBS) scheme is proposed to improve coding efficiency as well as to reduce encoding time complexity using decoder-side prediction. In case that the decoder can determine the same prediction mode as what is chosen by the encoder, the encoder does not send that intra prediction mode; otherwise, the conventional H.264/AVC intra coding is performed. Simulation results reveal a performance increase up to 4.44% overall rate savings and 0.24 dB in peak signal-to-noise ratio while the frame encoding speed of proposed method is about 42.8% better than that of H.264/AVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1330-1338
• /
• 2015

In wireless communication network, the amount of packet data for the video streaming in the playout buffer of the receiver is changed with time according to network condition. If the amount of packet data is less than a specific buffer amount, the buffer underflow problem is generated. On the contrary, if the amount of packet data is more than a given buffer amount, the buffer overflow problem is occurred. When the playout of the video streaming is processed, these buffer underflow and overflow problems cause stop and skip phenomenons and then provide the discontinuity of playout. Therefore, to solve the buffer underflow and overflow problems of the video streaming in wireless communication network, This paper analyzes the combined effect of Token Bucket scheme, which controls the bursty traffic, and AMP(Adaptive Media Playout) scheme, which adaptively changes the playout speed of receiver. Through simulation, we found that the combination of Token Bucket and AMP schemes provides the superiority in terms of the occurrence number of buffer underflow and overflow, the stop duration time and the number of removed frames generated by underflow and overflow, and PSNR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.84-95
• /
• 2011

In this paper, we present a deblocking algorithm that removes grid and staircase noises, which are called "blocking artifacts", occurred in the compressed satellite images. Particularly, the given satellite images are compressed with equal quantization coefficients in row according to region complexity, and more complicated regions are compressed more. However, this approach has a problem that relatively less complicated regions within the same row of complicated regions have blocking artifacts. Removing these artifacts with a general deblocking algorithm can blur complex and undesired regions as well. Additionally, the general filter lacks in preserving the curved edges. Therefore, the proposed algorithm presents an adaptive filtering scheme for removing blocking artifacts while preserving the image details including curved edges using the given quantization step size and content analysis. Particularly, WLFPCA (weighted lowpass filter using principle component analysis) is employed to reduce the artifacts around edges. Experimental results showed that the proposed method outperforms SA-DCT in terms of subjective image quality.

• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.274-292
• /
• 2011

This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.

• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.135-142
• /
• 2016

When video service is performed in simulation using NS-2(Network Simulation-2), the video replay is performed as the received frame order. In the existing video replay method based on the received frame order, as the frame orders of receiver and transmitter are different, the receiver buffer does not have the effect that the packets between the frames of transmitter buffer holds a regular size and packet dense and sparsity phenomenon in the receiver buffer is made by the irregular packet size due to the unpredictable reversed order of received partial frames. The above dense and sparsity phenomenon increases the probability of buffer overflow and underflow generation. To prevent these problems, the proposed frame receive order relocation method adds an extra replay buffer which rearranges the order of receive frame as the order of transmit frame, so it has the effect that the packets between the transmit frames keeps a regular size. Through the simulation using NS-2 and JSVM(Joint Scalable Video Model), the generation number of buffer overflow and underflow, and PSNR(Required Peak Signal to Noise Ratio) performance between the existing method and proposed method were compared. As a result, it was found that the proposed method would have better performance than the existing method.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.