• International Journal of Quality Innovation
• /
• v.2 no.1
• /
• pp.30-49
• /
• 2001

This paper considers a recent environment in the manufacturing process in which data in large amounts can be obtained on-line in real-time. Under this environment an on-line real-time Statistical Process Control (SPC) scheme equipped with detection of a process change, change-point estimation, and recognition of the change pattern is proposed. The proposed SPC scheme is composed of a Cusum chart, filtering methods and Akaike Information Criterion (AIC). We examine the performance of this scheme by Monte Carlo simulation and show its usefulness.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.195-201
• /
• 2015

For median filtering (MF) detection in altered digital images, this paper presents a new feature vector that is formed from autoregressive (AR) coefficients via an AR model of the gradients between the neighboring row and column lines in an image. Subsequently, the defined 10-D feature vector is trained in a support vector machine (SVM) for MF detection among forged images. The MF classification is compared to the median filter residual (MFR) scheme that had the same 10-D feature vector. In the experiment, three kinds of test items are area under receiver operating characteristic (ROC) curve (AUC), classification ratio, and minimal average decision error. The performance is excellent for unaltered (ORI) or once-altered images, such as $3{\times}3$ average filtering (AVE3), QF=90 JPEG (JPG90), 90% down, and 110% up to scale (DN0.9 and Up1.1) images, versus $3{\times}3$ and $5{\times}5$ median filtering (MF3 and MF5, respectively) and MF3 and MF5 composite images (MF35). When the forged image was post-altered with AVE3, DN0.9, UP1.1 and JPG70 after MF3, MF5 and MF35, the performance of the proposed scheme is lower than the MFR scheme. In particular, the feature vector in this paper has a superior classification ratio compared to AVE3. However, in the measured performances with unaltered, once-altered and post-altered images versus MF3, MF5 and MF35, the resultant AUC by 'sensitivity' (TP: true positive rate) and '1-specificity' (FN: false negative rate) is achieved closer to 1. Thus, it is confirmed that the grade evaluation of the proposed scheme can be rated as 'Excellent (A)'.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.335-345
• /
• 2017

Recently, location systems using RFID technology have been studied in indoor environments. However, the existing techniques require high computational cost to compute the location of a moving object because they compare the location proximity of all reference tags and objects. In this paper, we propose an RFID based location positioning scheme using event filtering, which reduces the computation cost of calculating the locations of moving objects while maintaining the accuracy of location estimation. In addition, we propose an incremental location update policy to reduce the location update cost for moving objects. We also compare the proposed scheme with one of the localization schemes, LANDMARC using a performance evaluation. As a result, the proposed scheme outperforms LANDMARC in terms of the computational cost of location estimation. The proposed scheme also reduces the cost of location update by using the RFID-based update policy.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.389-394
• /
• 2007

Recently, a location-based threshold-endorsement(LTE) scheme is proposed to thwart bogus data injection attacks. The scheme exhibits much greater filtering power than earlier symmetric schemes and results in enhanced energy savings. In this paper, we show that LTE has fatal vulnerabilities. We also propose an improved scheme that mitigates the weakness and thereby achieves the original claims without lessening remarkable filtering power intended in LTE.

• The KIPS Transactions:PartD
• /
• v.15D no.3
• /
• pp.421-428
• /
• 2008

Collaborative filtering is a popular technique used for the recommendation system, but its performance, especially the accuracy of recommendation, depends on how to define the reference group. This paper proposes a new contents recommendation scheme based on collaborative filtering technique whose reference groups are created by consumer's affection and consumption type in order to improve the accuracy of recommendation. In this paper, joy, sadness, anger, happiness, and relax are considered as the consumer's affection. And, low-utility / low-pleasure, low-utility / high-pleasure, high-utility / low-pleasure, and high-utility / high-pleasure are considered as the consumer's shopping types. Experimental results show that the proposed scheme improves the accuracy of recommendation compared to the recommendation scheme considering neither consumer's affection nor consumption type.

• 한국정보통신설비학회:학술대회논문집
• /
• 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.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.145-148
• /
• 2000

This paper presents the performance of a GHICW(Group-wise Hybrid Interference Cancellation scheme based on Wiener filtering) receiver for the multi-rate DS-CDMA system. Our scheme has a small processing delay and a simple hardware complexity compared to ordinary interference cancellation schemes by grouping users with the same date rate. The performance improvement of the low rate user is obtained by using a Wiener filter which precisely estimates the high rate users' bit.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.123-136
• /
• 2006

The prefetching technique is an effective way to reduce the latency caused memory access. However, excessively aggressive prefetch not only leads to cache pollution so as to cancel out the benefits of prefetch but also increase bus traffic leading to overall performance degradation. In this thesis, a prefetch filtering scheme is proposed which dynamically decides whether to commence prefetching by referring a filtering table to reduce the cache pollution due to unnecessary prefetches In this thesis, First, prefetch hashing table 1bitSC filtering scheme(PHT1bSC) has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete block address table filtering scheme(CBAT) has been introduced to be used as a reference for the comparative study. A prefetch block address lookup table scheme(PBALT) has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the PHT1bSC scheme, the contents of each entry have the fields the same as CBAT scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. On commonly used prefetch schemes and general benchmarks and multimedia programs simulates change cache parameters. The PBALT scheme compared with no filtering has shown enhanced the greatest 22%, the cache miss ratio has been decreased by 7.9% by virtue of enhanced filtering accuracy compared with conventional PHT2bSC. The MADT of the proposed PBALT scheme has been decreased by 6.1% compared with conventional schemes to reduce the total execution time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.2
• /
• pp.113-119
• /
• 2016

Wireless sensor networks are vulnerable to an adversary due to scarce resources and wireless communication. An adversary can compromise a sensor node and launch a variety of attacks such as false report injection attacks. This attack may cause monetary damage resulting in energy drain by forwarding the false reports and false alarms at the base station. In order to address this problem, a number of en-route filtering schemes has been proposed. Notably, a dynamic en-route filtering scheme can save energy by filtering of the false report. In the key dissemination phase of the existing scheme, the nodes closer to the source node may not have matching keys to detect the false report. Therefore, continuous attacks may result in unnecessary energy wastage. In this paper, we propose a key re-distribution scheme to solve this issue. The proposed scheme early detects the false report injection attacks using initially assigned secret keys in the phase of the key pre-distribution. The experimental results demonstrate the validity of our scheme with energy efficiency of up to 26.63% and filtering capacity up to 15.92% as compared to the existing scheme.