• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.111-118
• /
• 2012

The burst is to require abruptly high transmission rate in case of transmitting pre-stored variable bit rate video data, and it causes to be inefficient use of network resource, resource reservation. To avoid these problems, smoothing is transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA and others. To evaluate amount of burst reduction in the existing CBA, MCBA, MVBA algorithm, this paper compares the burst-related-factors of transmission plan in smoothing algorithms with original video sources which were stored Variable Bit Rate. There are maximum frame bytes, maximum GOP bytes, transmission rate variability per frame, transmission rate variability per GOP in burst-related evaluation factors. Experimental result shows burst-related factors of smoothing algorithms which were used for experiment lower than that of pre-stored video data, except special case.

• Journal of Internet of Things and Convergence
• /
• v.8 no.4
• /
• pp.41-47
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a fixed bit rate. Algorithms for smoothing include CBA, which aims to minimize the number of transmission rate increases, MCBA, which minimizes the number of transmission rate changes, and MVBA algorithms that minimize the amount of transmission rate change. This paper compares the proposed algorithm with the CBA algorithm with various video data, buffer size, and performance evaluation factors as a follow-up to the proposed smoothing algorithm that minimizes (maximizes) the transmission rate increase (decrease) when the server requires more bandwidth The evaluation factors used were compared with the number of changes in the fps rate, the minimum fps, the average fps, fps variability, and the number of frames to be discarded. As a result of the comparison, the proposed algorithm showed superiority in comparing the number of fps rate changes and the number of frames discarded.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.1
• /
• pp.77-88
• /
• 1998

Smoothing spline estimators are modified to remove boundary bias effects using the technique proposed in Eubank and Speckman (1991). An O(n) algorithm is developed for the computation of the resulting estimator as well as associated generalized cross-validation criteria, etc. The asymptotic properties of the estimator are studied for the case of a linear smoothing spline and the upper bound for the average mean squared error of the estimator given in Eubank and Speckman (1991) is shown to be asymptotically sharp in this case.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.6
• /
• pp.800-809
• /
• 2014

The gridded environmental data is usually provided by the numerical simulation coupled with a data assimilation technique and various inter- or extrapolation algorithms, both of which are based on the observation spanning from simple equipments to satellites. But it is difficult to represent the natural phenomenon such as sea mount, internal-wave, warm eddy in modeling or observation because of increase in the complexity of model. This paper introduces the algorithm artificially representing the natural phenomenon and the techniques applying it to the gridded volume data and smoothing for natural effects. Moreover, the inserted results are analyzed by use of graphical tool. The results can be used for the battle simulation or acoustic model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.122-125
• /
• 2003

An adaptive contour smoothing algorithm designed as a preprocessor for shape coders is presented. In the proposed method, the degree of the adaptive smoothing is controlled based on the significance of each contour point, which is quantified according to inter-region contrast in an intensity image. The actual smoothing consists of an expansion operator and a thinning algorithm. Experimental results show that the proposed method results in a saving of about 20% in number of coded bits with a negligible additional texture degradation in the reconstructed intensity image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.345-346
• /
• 2009

The segmentation of vessel including portal vein, hepatic vein and artery, from Computed Tomography (CT) images plays an important role in the therapeutic strategies for hepatic diseases. Representing segmented vessels in three dimensional spaces is extremely useful for doctors to plan liver surgery. In this paper, proposed method is focused on smoothing technique of segmented 3D liver vessels, which derived from 3D region growing approach. A pixel expand algorithm has been developed first to avoid vessel lose and disconnection cased by the next smoothing technique. And then a binary volume filtering technique has been implemented and applied to make the segmented binary vessel volume qualitatively smoother. This strategy uses an iterative relaxation process to extract isosurfaces from binary volumes while retaining anatomical structure and important features in the volume. Hard and irregular place in volume image has been eliminated as shown in the result part, which also demonstrated that proposed method is a suitable smoothing solution for post processing of fine vessel segmentation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.227-236
• /
• 2001

This paper proposes a frequency-domain partially adaptive algorithm, called a censoring algorithm, to reduce the computational complexity of the frequency domain adaptive array. The proposed censoring algorithm determines the existence of interferences in the frequency-domain at each frequency bin using a constant false alarm rate (CFAR) processor. The censoring algorithm adapts only those parts of the weights that correspond to the frequency bins expected to contain interferences. The censoring algorithm is also expanded to overcome the signal cancellation phenomenon caused by smart jammers. Accordingly, a censoring spatial smoothing, which combines the censoring algorithm with spatial smoothing, is proposed. Simulation results show that the proposed algorithms are effective in removing interferences with only part of the computational complexity of conventional algorithms yet with the same level of performance.

• Journal of Radiation Protection and Research
• /
• v.42 no.2
• /
• pp.91-97
• /
• 2017

Background: A gamma energy identifying algorithm using spectral decomposition combined with smoothing method was suggested to confirm the existence of the artificial radio isotopes. The algorithm is composed by original pattern recognition method and smoothing method to enhance the performance to identify gamma energy of radiation sensors that have low energy resolution. Materials and Methods: The gamma energy identifying algorithm for the compact radiation sensor is a three-step of refinement process. Firstly, the magnitude set is calculated by the original spectral decomposition. Secondly, the magnitude of modeling error in the magnitude set is reduced by the smoothing method. Thirdly, the expected gamma energy is finally decided based on the enhanced magnitude set as a result of the spectral decomposition with the smoothing method. The algorithm was optimized for the designed radiation sensor composed of a CsI (Tl) scintillator and a silicon pin diode. Results and Discussion: The two performance parameters used to estimate the algorithm are the accuracy of expected gamma energy and the number of repeated calculations. The original gamma energy was accurately identified with the single energy of gamma radiation by adapting this modeling error reduction method. Also the average error decreased by half with the multi energies of gamma radiation in comparison to the original spectral decomposition. In addition, the number of repeated calculations also decreased by half even in low fluence conditions under $10^4$ ($/0.09cm^2$ of the scintillator surface). Conclusion: Through the development of this algorithm, we have confirmed the possibility of developing a product that can identify artificial radionuclides nearby using inexpensive radiation sensors that are easy to use by the public. Therefore, it can contribute to reduce the anxiety of the public exposure by determining the presence of artificial radionuclides in the vicinity.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.3
• /
• pp.136-148
• /
• 2000

In this work, a general method for the mathematical description of three-dimensional trimmed surface is proposed by introducing the base parametric surface and boundary curves. Since mesh density distribution for the analysis may vary by cases, a grid-based mesh generation algorithm using quadtree is proposed in the present work. For the assurance of connectivity of generated meshes among surfaces, a method for the pre-cleaning of boundary curves has been developed to be used in the automatic generation of the finite elements. In addition, mesh-smoothing algorithm is suggested which can be used in the general trimmed surface. In this algorithm nodes are moved on the original surface by the normal projection in each iterative smoothing procedure.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.217-225
• /
• 2016

In this paper, we propose an improved path planning method and obstacle avoidance algorithm for two-wheel mobile robots, which can be effectively applied in an environment where obstacles can be represented by circles. Firstly, we briefly introduce the rapidly exploring random tree (RRT) and single polar polynomial (SPP) algorithm. Secondly, we present additional two methods for applying our proposed method. Thirdly, we propose a global path planning, smoothing and obstacle avoidance method that combines the RRT and SPP algorithms. Finally, we present a simulation using our proposed method and check the feasibility. This shows that proposed method is better than existing methods in terms of the optimality of the trajectory and the satisfaction of the kinematic constraints.