• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.396-400
• /
• 2007

This paper proposes the fast partial difference elimination (PDE) algorithm. When the conventional PDE cannot skip the rest of matching procedure in a candidate block using a partial matching error, the proposed algorithm estimates to skip it again using the block matching error predicted from the computed partial matching error. The proposed algorithm can eliminate impossible candidate blocks earlier than the conventional PDE since the predicted block matching error is always bigger than the partial matching error. The simulation results show that the proposed algorithm can significantly reduce the computations while keeping image quality as good as the conventional PDE.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.5-10
• /
• 2010

This paper introduces a new fast motion estimation based on estimating a block matching error (i.e., sum of absolute difference (SAD)) between blocks which can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The basic idea of the proposed scheme is based on predicting the total SAD of a candidate block using its partial SAD. In particular, in order to improve prediction accuracy and computational efficiency, a sub-sample based block matching and a selective pixel-based approaches are employed. In order to evaluate the proposed scheme, several baseline approaches are described and compared. The experimental results show that the proposed algorithm can reduce the computations by about 44% for motion estimation at the cost of 0.0005 dB quality degradation versus the general PDE algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.278-281
• /
• 2009

In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion which can reduce only unnecessary computation significantly. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 60% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality, and our algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1439-1445
• /
• 2007

In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.446-460
• /
• 2024

In this paper, we mathematically investigate a downlink non-orthogonal multiple access (NOMA) system for short-packet communications (SPC) in which the near users are used as full-duplex (FD) relays to forward intended signals from the source to a far user. In addition, partial relay selection is employed to enhance the performance of the FD relays under the impact of imperfect interference cancellation. At the far user, selection combining (SC) or maximal ratio combining (MRC) is employed to combine the signals received from the source and the selected FD relay. The analytical expressions for the average block error rate (BLER) of two users over flat Rayleigh fading channels are derived. Furthermore, closed-form asymptotic expressions of the average BLERs at the near and far users in high signal-to-noise ratio (SNR) regimes are obtained. The numerical results show that the analytical BLERs of the near user and far user closely match the simulation results.

• The Journal of Korean Society for Radiation Therapy
• /
• v.16 no.2
• /
• pp.19-24
• /
• 2004

Introduction : The Vaginal, the urethra, the vulva and anal cancer avoid the many dose to femur head and the additional treatment is necessary in inguinal LN. The partial transmission block to use inguinal LN addition there is to a method which it treats and produce partial transmission block a method and the MLC which to it analyzes. Material & Methode : The Inguinal the LN treatment patient partial transmission it used block and the MLC in the object and with solid water phantom with the patient it reappeared the same depth. In order to analyze the error of the junction the EDR2 (Extended dose range, the Kodak and the U.S) it used the Film and it got film scanner it got the beam profile. The partial transmission block and the MLC bias characteristic, accuracy and stability of production for, it shared at hour and comparison it analyzed. Result : The partial the transmission block compares in the MLC and the block production is difficult and production hour also above 1 hours. The custom the block the place where it revises the error of the junction is a difficult problem. If use of the MLC the fabrication will be break and only the periodical calibration of the MLC it will do and it will be able to use easily. Conclusion : The Inguinal there is to LN treatment and partial transmission block and the MLC there is efficiency of each one but there is a place where the junction of block for partial transmission block the production hour is caught long and it fixes and a point where the control of the block is difficult. like this problem it transfers with the MLC and if it treats, it means the effective treatment will be possible.

• Water Engineering Research
• /
• v.3 no.1
• /
• pp.31-44
• /
• 2002

The effect of diurnal cycle, intermittent visit of observation satellite, sensor installation, partial coverage of remote sensing, heterogeneity of soil properties and precipitation to the soil moisture estimation error were analyzed to present the global sampling strategy of soil moisture. Three models, the theoretical soil moisture model, WGR model proposed Waymire of at. (1984) to generate rainfall, and Turning Band Method to generate two dimensional soil porosity, active soil depth and loss coefficient field were used to construct sufficient two-dimensional soil moisture data based on different scenarios. The sampling error is dominated by sampling interval and design scheme. The effect of heterogeneity of soil properties and rainfall to sampling error is smaller than that of temporal gap and spatial gap. Selecting a small sampling interval can dramatically reduce the sampling error generated by other factors such as heterogeneity of rainfall, soil properties, topography, and climatic conditions. If the annual mean of coverage portion is about 90%, the effect of partial coverage to sampling error can be disregarded. The water retention capacity of fields is very important in the sampling error. The smaller the water retention capacity of the field (small soil porosity and thin active soil depth), the greater the sampling error. These results indicate that the sampling error is very sensitive to water retention capacity. Block random installation gets more accurate data than random installation of soil moisture gages. The Walnut Gulch soil moisture data show that the diurnal variation of soil moisture causes sampling error between 1 and 4 % in daily estimation.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.949-955
• /
• 2005

In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.