• The Korean Journal of Applied Statistics
• /
• v.16 no.1
• /
• pp.45-53
• /
• 2003

One of decision tree method is regression trees which are used to predict a continuous response. The general splitting criteria in tree growing are based on a compromise in the impurity between the left and the right child node. By picking or the more interesting subsets and ignoring the other, the proposed new splitting criteria in this paper do not split based on a compromise of child nodes anymore. The tree structure by the new criteria might be unbalanced but plausible. It can find a interesting subset as early as possible and express it by a simple clause. As a result, it is very interpretable by sacrificing a little bit of accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1442-1462
• /
• 2014

Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1219-1226
• /
• 2004

The objective of this paper is to proposed a new Hybrid Interference Cancellation(HlC) receiver to cancel MAI in a multirate DS-CDMA system based on multiple processing gain(MPG). We propose a new improved HIC scheme that divides the active users with different data rates split into a number of groups for effectives cancellation Between each group, GW-PIC is performed to cancel other group signals and within them, SIC is carried out to remove multiple access interference in group. We analyze the performance of the proposed receiver in terms of the bit error rate(BER) and examine its performance. As a conclusion, computer simulations show that the proposed schemes outperforms adaptive multistage PIC and conventional SIC receiver over AWGN channel.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.7
• /
• pp.402-409
• /
• 2005

In this paper. we propose a coding method using a matching pursuit algorithm in a strongly periodic highband signal. Also. we propose an efficient quantizer for the estimated parameters : spectral magnitude and phase. Based on the error concealment principle and sinusoidal model. the MP algorithm requires the high-precision pitch period estimation. To estimate more accurate pitch period. the refined pitch obtained from lowband speech is used. which increases the efficiency of bit allocation. The spectral magnitude parameters are quantized by the method which is combined with MDCT (Modified Discrete Cosine Transform) and multi-stage structure. The spectral phase quantizer uses the $2{\pi}$ modular characteristic of phases and the weighted function by spectral magnitudes. To evaluate the efficiency of the proposed method. we applied it to analysis-by-synthesis system. Furthermore we suggest the possibillity of scalable wideband speech codecs based on band-split structure.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.485-491
• /
• 2012

This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.3
• /
• pp.235-240
• /
• 2018

FTN method which transmits signals faster the Nyquist rate is representative method for improving throughput efficiency sacrificed performance due to inter-symbol interference. To compensate performance loss, in this paper, we propose a multiband FTN method which split the coded bits into several bands and transmits signals applying FTN method. As coded bits are being assigned different bands, number of samples per bit of each band is increased, it induced performance improvement by noise averaging effect. In the simulations, compared the performance of single band FTN method and multiband FTN method when the interference rate is 25%. The results of simulation show the performance of proposed method is better than that of single band FTN one by 0.3dB~0.5dB.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.509-525
• /
• 2005

In this paper, we propose the index structure based on a vector approximation for efficiently supporting the similarity search of multi-dimensional data. The proposed index structure splits a region with the space partition method and allocates to the split region dynamic bits according to the distribution of data. Therefore, the index structure splits a region to the unoverlapped regions and can reduce the depth of the tree by storing the much region information of child nodes in a internal node. Our index structure represents the child node more exactly and provide the efficient search by representing the region information of the child node relatively using the region information of the parent node. We show that our proposed index structure is better than the existing index structure in various experiments. Experimental results show that our proposed index structure achieves about $40\%$ performance improvements on search performance over the existing method.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.31-36
• /
• 2015

Recent years have seen a significant increase in demand for multimedia data over wireless sensor networks for monitoring applications that utilize sensor nodes to collect multimedia data, including sound and video. However, the multimedia streams generate a very large amount of data. When data transmission schemes for traditional wireless sensor networks are applied in wireless multimedia sensor networks, the network lifetime significantly decreases due to the excessive energy consumption of specific nodes. In this paper, we propose a data compression scheme that implements the Chinese remainder theorem to a wireless multimedia sensor network. The proposed scheme uses the Chinese Remainder Theorem (CRT) to compress and split multimedia data, and it then transmits the bit-pattern packets of the remainder to the base station. As a result, the amount of multimedia data that is transmitted is reduced. The superiority of our proposed scheme is demonstrated by comparing its performance to that of an existing scheme. The results of our experiment indicate that our proposed scheme significantly increased the compression ratio and reduced the compression operation in comparison to those of existing compression schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.63-70
• /
• 2016

To increase throughput efficiency and improve performance, FTN(Faster Than Nyquist) method and LDPC(Low Density Parity Code) codes are employed in DVB-S3 system. In this paper, we proposed efficient turbo equalization model to minimize inter symbol interference induced by FTN transmission. This paper introduces two conventional scheme employing SIC(Successive Interference Cancellation) and BCJR equalizer. Then, we proposed new scheme to resolve problems in this two conventional scheme. To make performance improved in turbo equalization model, the outputs of LDPC and BCJR equalizer are iteratively exchange probabilistic information. In fed LDPC outputs as extrinsic informa tion of BCJR equalizer. we split LDPC output to separate bit probabilities. We compare performance of proposed scheme to that of conventional methods through using simulation in AWGN(Additive White Gaussian Noise) channel. We confirmed that performance was improved compared to conventional methods as increasing throughput parameters of FTN.

• Imaging Science in Dentistry
• /
• v.32 no.4
• /
• pp.201-206
• /
• 2002

Purpose : To evaluate the radiographic change of operation sites after orthognathic surgery using the digital image processing and fractal analysis. Materials and Methods : A series of panoramic radiographs of thirty-five randomly selected patients who had undergone mandibular orthognathic surgery (bilateral sagittal split ramus osteotomy) without clinical complication for osseous healing, were taken. The panoramic radiographs of each selected patient were taken at pre-operation (stage 0), 1 or 2 days after operation (stage 1), 1 month after operation (stage 2), 6 months after operation (stage 3), and 12 months after operation (stage 4). The radiographs were digitized at 600 dpi, 8 bit, and 256 gray levels. The region of interest, centered on the bony gap area of the operation site, was selected and the fractal dimension was calculated by using the tile-counting method. The mean values and standard deviations of fractal dimension for each stage were calculated and the differences among stage 0, 1, 2, 3, and 4 were evaluated through repeated measures of the ANOVA and paired t-test. Results : The mean values and standard deviations of the fractal dimensions obtained from stage 0, 1, 2, 3, and 4 were 1.658±0.048, 1.580±0.050, 1.607±0.046, 1.624±0.049, and 1.641 ±0.061, respectively. The fractal dimensions from stage 1 to stage 4 were shown to have a tendency to increase (p < 0.05). Conclusion: The tendency of the fractal dimesion to increase relative to healing time may be a useful means of evaluating post-operative bony healing of the osteotomy site.