• Korean Journal of Remote Sensing
• /
• v.24 no.1
• /
• pp.65-78
• /
• 2008

This study compares the relative accuracy and consistency of four split-window land surface temperature (LST) algorithms (Becker and Li, Kerr et ai., Price, Ulivieri et al.) using 24 sets of Terra (Aqua)/Moderate Resolution Imaging Spectroradiometer (MODIS) data, observed ground grass temperature and air temperature over South Korea. The effective spectral emissivities of two thermal infrared bands have been retrieved by vegetation coverage method using the normalized difference vegetation index. The intercomparison results among the four LST algorithms show that the three algorithms (Becker-Li, Price, and Ulivieri et al.) show very similar performances. The LST estimated by the Becker and Li's algorithm is the highest, whereas that by the Kerr et al.'s algorithm is the lowest without regard to the geographic locations and seasons. The performance of four LST algorithms is significantly better during cold season (night) than warm season (day). And the LST derived from Terra/MODIS is closer to the observed LST than that of Aqua/MODIS. In general, the performances of Becker-Li and Ulivieri et al algorithms are systematically better than the others without regard to the day/night, seasons, and satellites. And the root mean square error and bias of Ulivieri et al. algorithm are consistently less than that of Becker-Li for the four seasons.

• Journal of IKEEE
• /
• v.25 no.1
• /
• pp.10-14
• /
• 2021

This paper presents a hardware that improves the complexity of the CIE1931 color coordinate algorithm operation. The conventional algorithm has disadvantage of growing hardware due to 4-Split Multiply operations used to calculate large bits in the computation process. But the proposed algorithm pre-calculates the defined R2X, X2R Matrix operations of the conventional algorithm and makes them a matrix. By applying the matrix to the images and improving the color, it is possible to reduce the amount of computation and hardware size. By comparing the results of Xilinx synthesis of hardware designed with Verilog, we can check the performance for real-time processing in 4K environments with reduced hardware resources. Furthermore, this paper validates the hardware mount behavior by presenting the execution results of the FPGA board.

• The Journal of Korean Society for Radiation Therapy
• /
• v.27 no.2
• /
• pp.145-156
• /
• 2015

Purpose : The purpose of this study is to evaluate the efficiency of Split VMAT planning(Contouring rectum divided into an upper and a lower for reduce rectum dose) compare to Conventional VMAT planning(Contouring whole rectum) for prostate cancer radiotherapy involving pelvic lymph nodes. Materials and Methods : A total of 9 cases were enrolled. Each case received radiotherapy with Split VMAT planning to the prostate involving pelvic lymph nodes. Treatment was delivered using TrueBeam STX(Varian Medical Systems, USA) and planned on Eclipse(Ver. 10.0.42, Varian, USA), PRO3(Progressive Resolution Optimizer 10.0.28), AAA(Anisotropic Analytic Algorithm Ver. 10.0.28). Lower rectum contour was defined as starting 1cm superior and ending 1cm inferior to the prostate PTV, upper rectum is a part, except lower rectum from the whole rectum. Split VMAT plan parameters consisted of 10MV coplanar $360^{\circ}$ arcs. Each arc had $30^{\circ}$ and $30^{\circ}$ collimator angle, respectively. An SIB(Simultaneous Integrated Boost) treatment prescription was employed delivering 50.4Gy to pelvic lymph nodes and 63~70Gy to the prostate in 28 fractions. $D_{mean}$ of whole rectum on Split VMAT plan was applied for DVC(Dose Volume Constraint) of the whole rectum for Conventional VMAT plan. In addition, all parameters were set to be the same of existing treatment plans. To minimize the dose difference that shows up randomly on optimizing, all plans were optimized and calculated twice respectively using a 0.2cm grid. All plans were normalized to the prostate $PTV_{100%}$ = 90% or 95%. A comparison of $D_{mean}$ of whole rectum, upperr ectum, lower rectum, and bladder, $V_{50%}$ of upper rectum, total MU and H.I.(Homogeneity Index) and C.I.(Conformity Index) of the PTV was used for technique evaluation. All Split VMAT plans were verified by gamma test with portal dosimetry using EPID. Results : Using DVH analysis, a difference between the Conventional and the Split VMAT plans was demonstrated. The Split VMAT plan demonstrated better in the $D_{mean}$ of whole rectum, Up to 134.4 cGy, at least 43.5 cGy, the average difference was 75.6 cGy and in the $D_{mean}$ of upper rectum, Up to 1113.5 cGy, at least 87.2 cGy, the average difference was 550.5 cGy and in the $D_{mean}$ of lower rectum, Up to 100.5 cGy, at least -34.6 cGy, the average difference was 34.3 cGy and in the $D_{mean}$ of bladder, Up to 271 cGy, at least -55.5 cGy, the average difference was 117.8 cGy and in $V_{50%}$ of upper rectum, Up to 63.4%, at least 3.2%, the average difference was 23.2%. There was no significant difference on H.I., and C.I. of the PTV among two plans. The Split VMAT plan is average 77 MU more than another. All IMRT verification gamma test results for the Split VMAT plan passed over 90.0% at 2 mm / 2%. Conclusion : As a result, the Split VMAT plan appeared to be more favorable in most cases than the Conventional VMAT plan for prostate cancer radiotherapy involving pelvic lymph nodes. By using the split VMAT planning technique it was possible to reduce the upper rectum dose, thus reducing whole rectal dose when compared to conventional VMAT planning. Also using the split VMAT planning technique increase the treatment efficiency.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.3E
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.943-945
• /
• 1996

In this paper, we present an algorithm that allows tracking of a target using measurements obtained from a sensor with limited resolution. The Interacting Multiple Model (IMM) algorithm has been shown to be one of the most cost-effective estimation schemes for hybrid systems. The approach consists of IMM algorithm combined with a coupled version of the Joint Probabilistic Data Association Filter for the target that splits into two targets.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.707-718
• /
• 2008

The methodology of classifying traffics is changing from payload based or port based to machine learning based in order to overcome the dynamic changes of application's characteristics. However, current state of traffic classification using machine learning (ML) algorithms is ongoing under the offline environment. Specifically, most of the current works provide results of traffic classification using cross validation as a test method. Also, they show classification results based on traffic flows. However, these traffic classification results are not useful for practical environments of the network traffic monitoring. This paper compares the classification results using cross validation with those of using split validation as the test method. Also, this paper compares the classification results based on flow to those based on bytes. We classify network traffics by using various feature sets and machine learning algorithms such as J48, REPTree, RBFNetwork, Multilayer perceptron, BayesNet, and NaiveBayes. In this paper, we find the best feature sets and the best ML algorithm for classifying traffics using the split validation.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.7 no.2
• /
• pp.8-15
• /
• 1988

A split-spectrum processing technique for an ultrasonic flaw detection system has been developed, which improves the flaw-to-grain echo ratio in large-grained materials. The enhancement is achieved by partitioning a wide-band received spectrum to obtain frequency shifted bands, which are then processed to suppress the grain echoes with respect to the flaw echo, using a novel signal minimization algorithm. A technique for suppression of grain echoes has also been devised which takes advantage of the fact that the grain echo amplitude changes with the frequency of the incident ultrasound whereas the flaw echo amplitude does not. The combination of this technique and the new flaw detection system greatly improve the capabilities of ultrasonic evaluation of large grain materials.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.135-173
• /
• 2023

The purpose of this paper is to introduce and study a method for solving the split equality of variational inequality and f, g-fixed point problems in reflexive real Banach spaces, where the variational inequality problems are for uniformly continuous pseudomonotone mappings and the fixed point problems are for Bregman relatively f, g-nonexpansive mappings. A strong convergence theorem is proved under some mild conditions. Finally, a numerical example is provided to demonstrate the effectiveness of the algorithm.