• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3286-3300
• /
• 2016

High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.105-109
• /
• 2006

Hypercube has a regular and hierarchical structure, therefore it can be applied to the development of efficient diagnosis algorithm. Kranakis and Pelc [7] have proposed HYP-DIAG algorithm to implement different method of HADA/IHADA and adaptive cube partition method after embedding the small size of ring that includes all the faulty nodes. In this paper, we propose new method to reduce testing rounds by analyzing the syndrome of RGC-rings gained in the first step of HYP-DIAG and analyze the proposed algorithm.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.141-145
• /
• 2008

Wireless sensor network (WSN) is expected to be used in many applications. However, sensor nodes still have some secure problems to use them in the real applications. They are typically deployed on open, wide, and unattended environments. An adversary using these features can easily compromise the deployed sensor nodes and use compromised sensor nodes to inject fabricated data to the sensor network (false data injection attack). The injected fabricated data drains much energy of them and causes a false alarm. To detect and drop the injected fabricated data, a filtering-based security method and adaptive methods are proposed. The number of different partitions is important to make event report since they can make a correctness event report if the representative node does not receive message authentication codes made by the different partition keys. The proposed methods cannot guarantee the detection power since they do not consider the filtering scheme. We proposed clustering method for filtering-based secure methods. Our proposed method uses fuzzy system to enhance the detection power of a cluster.

• Journal of the Korean Society of Radiology
• /
• v.8 no.7
• /
• pp.435-441
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the RGB image compression rate and image quality, such as gray-level images and showed good.

• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

• Journal of the Korean Society of Radiology
• /
• v.10 no.4
• /
• pp.263-270
• /
• 2016

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

• Journal of Korea Water Resources Association
• /
• v.37 no.6
• /
• pp.449-460
• /
• 2004

The purpose of this study is to test the applicability of neuro-fuzzy system for monthly dam inflow forecasts by using weather forecasting information. The neuro-fuzzy algorithm adopted in this study is the ANFIS(Adaptive neuro-fuzzy Inference System) in which neural network theory is combined with fuzzy theory. The ANFIS model can experience the difficulties in selection of a control rule by a space partition because the number of control value increases rapidly as the number of fuzzy variable increases. In an effort to overcome this drawback, this study used the subtractive clustering which is one of fuzzy clustering methods. Also, this study proposed a method for converting qualitative weather forecasting information to quantitative one. ANFIS for monthly dam inflow forecasts was tested in cases of with or without weather forecasting information. It can be seen that the model performances obtained from the use of past observed data and future weather forecasting information are much better than those from past observed data only.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.84-86
• /
• 2008

The customer relation marketing in which companies can utilize to control and to get the filtered information efficiently has appeared. It is applying data mining to build the management that can even predict and recommend products to customers. In this paper, we proposed the adaptive customer relation management strategies using the association rules of data mining. The proposed method uses the association rules composes frequent customers with occurrence of candidate customer set creates the rules of associative customers. We analyzed the efficient feature of purchase customers using the hyper graph partition according to the lift of creative association rules. Therefore, we discovered strategies of the cross-selling and the up-selling about customers.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.223-226
• /
• 2003

When we detect side-view face in color image, we decide a candidate face region using skin-tone color, and confirm to the face by template matching. Cang Wei use a left and a right template of face, calculate to similarity value by hausdorff method, and decide the final side-view face. It has a characteristic that side-view face is wide spreading neck region. To get exactly result, face region is separated vertically by 3 pixel unit, and matched template. In this paper, we assume that a side-view face is a right side-view or a left side-view face. We separate a half of the candidate face region vertically, and regard a left side as left candidate face, a right side as right candidate face by template matching. This method detect faster than Gang Wei method.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.