• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2715-2720
• /
• 2014

Median filtering is very effective to remove impulse type noises, so it has been widely used in many signal processing applications. However, due to the time complexity of its non-linearity, median filtering is often used using a small filter window size. A lot of work has been done on devising fast median filtering algorithms, but most of them can be efficiently applied to input data with finite integer values like images. Little work has been carried out on fast 2-d median filtering algorithms that can deal with real-valued 2-d data. In this paper, a fast and simple median 2-d filter is presented, and its performance is compared with the Matlab's 2-d median filter and a heap-based 2-d median filter. The proposed algorithm is shown to be much faster than the Matlab's 2-d median filter and consistently faster than the heap-based algorithm that is much more complicated than the proposed one. Also, a more efficient median filtering scheme for 2-d real valued data with a finite range of values is presented that uses higher-bit integer 2-d median filtering with negligible quantization errors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.569-578
• /
• 2003

Data dependencies are one of major hurdles to limit ILP(Instruction Level Parallelism), so several related works have suggested that the limit imposed by data dependencies can be overcome to some extent with use of the data value prediction. Hybrid value predictor can obtain the high prediction accuracy using advantages of various predictors, but it has a defect that same instruction has overlapping entries in all predictor. In this paper, we propose a new hybrid value predictor which achieves high performance by using the information of static and dynamic classification. The proposed predictor can enhance the prediction accuracy and efficiently decrease the prediction table size of predictor, because it allocates each instruction into single best-suited predictor during the fetch stage by using the information of static classification. Also, it can enhance the prediction accuracy because it selects a best- suited prediction method for the “Unknown”pattern instructions by using the dynamic classification mechanism. Simulation results based on the SimpleScalar/PISA tool set and the SPECint95 benchmarks show the average correct prediction rate of 85.1% by using the static classification mechanism. Also, we achieve the average correction prediction rate of 87.6% by using static and dynamic classification mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.555-567
• /
• 2010

Unlike single-hop systems, multi-hop systems that use relay nodes assign a part of the overall resources to relay communications. If efficient resource allocation schemes are not adopted, this leads to a loss of resources. Moreover, because we may not be able to guarantee high-link performance due to the adjacent-cell interference in relay-based cellular systems, resource efficiency can be severely decreased. In this paper, we propose efficient resource allocation schemes for downlink relay-based networks in 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution)-Advanced systems. Unlike conventional schemes that have static resource regions for each data link, the proposed schemes dynamically allocate the resources of each link to resource blocks, by considering the channel state and the capacity of each link. We also propose resource overlapping schemes in which two different links overlap at the same resource region, so as to improve cell or user throughput performance. The proposed resource overlapping schemes do not require additional processes such as interference cancellation in users, thank to considering additional interference from resource overlapping in advance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.649-660
• /
• 2017

In electronic warfare, the pulse amplitude, one of information of a pulse signal emitted by an enemy, is used for estimating distance from the source and for deinterleaving mixed source signals. An estimate of pulse amplitude is conventionally determined as the maximum magnitude of a Fourier transformed signal within its pulse width which is estimated pre-step in an electronic warfare receiver. However, when frequency modulated signals are received, it is difficult to estimate their pulse amplitudes with this conventional method because the energy of signals is dispersed in frequency domain. In order to overcome this limitation, this paper proposes an enhanced pulse amplitude estimation method which calculates the average power of the received pulse signal in time domain and removes the noise power of the receiver. Simulation results show that even in case the frequency modulated signal is received, the proposed method has the same performance as estimating the pulse amplitude when unmodulated signal is received. In addition, the proposed method is shown to be more robust to an estimation error of pulse width, which affects the estimation performance of pulse amplitude, than the conventional method.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.147-156
• /
• 2011

This paper proposes a 3-stage (preprocessing, feature extraction, and classification) fault detection and classification algorithm for induction motors. In the first stage, a low-pass filter is used to remove noise components in the fault signal. In the second stage, a discrete cosine transform (DCT) and a statistical method are used to extract features of the fault signal. Finally, a back propagation neural network (BPNN) method is applied to classify the fault signal. To evaluate the performance of the proposed algorithm, we used one second long normal/abnormal vibration signals of an induction motor sampled at 8kHz. Experimental results showed that the proposed algorithm achieves about 100% accuracy in fault classification, and it provides 50% improved accuracy when compared to the existing fault detection algorithm using a cross-covariance method. In a real-world data acquisition environment, unnecessary noise components are usually included to the real signal. Thus, we conducted an additional simulation to evaluate how well the proposed algorithm classifies the fault signals in a circumstance where a white Gaussian noise is inserted into the fault signals. The simulation results showed that the proposed algorithm achieves over 98% accuracy in fault classification. Moreover, we developed a testbed system including a TI's DSP (digital signal processor) to implement and verify the functionality of the proposed algorithm.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.7-16
• /
• 2009

Some clustering algorithms have a problem that an image is over-segmented since both the spatial information between the segmented regions is not considered and the number of the clusters is defined in advance. Therefore, they are difficult to be applied to the applicable fields. This paper proposes the new post-processing methods, a reclassification of the inhomogeneous clusters and a region merging using Baysian algorithm, that improve the segmentation results of the clustering algorithms. The inhomogeneous cluster is firstly selected based on variance and between-class distance and it is then reclassified into the other clusters in the reclassification step. This reclassification is repeated until the optimal number determined by the minimum average within-class distance. And the similar regions are merged using Baysian algorithm based on Kullbeck-Leibler distance between the adjacent regions. So we can effectively solve the over-segmentation problem and the result can be applied to the applicable fields. Finally, we design a classification system for the segmented regions to validate the proposed method. The segmented regions are classified by SVM(Support Vector Machine) using the principal colors and the texture information of the segmented regions. In experiment, the proposed method showed the validity for various real-images and was effectively applied to the designed classification system.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.5
• /
• pp.101-106
• /
• 2020

Since computer became available, much effort has been made to achieve information security. Even though memory protection defense mechanisms were studied the most among of them, the problems of existing memory protection defense mechanisms were found due to improved performance of computer and new defense mechanisms were needed due to the advent of the side-channel attacks. In this paper, we propose JMP+RAND that embedding random values of 5 to 8 bytes per page to defend against memory sharing based side-channel attacks and bridging the gap of existing memory protection defense mechanism. Unlike the defense mechanism of the existing side-channel attacks, JMP+RAND uses static binary rewriting and continuous jmp instruction and random values to defend against the side-channel attacks in advance. We numerically calculated the time it takes for a memory sharing-based side-channel attack to binary adopted JMP+RAND technique and verified that the attacks are impossible in a realistic time. Modern architectures have very low overhead for JMP+RAND because of the very fast and accurate branching of jmp instruction using branch prediction. Since random value can be embedded only in specific programs using JMP+RAND, it is expected to be highly efficient when used with memory deduplication technique, especially in a cloud computing environment.

• Journal of Sensor Science and Technology
• /
• v.6 no.5
• /
• pp.385-391
• /
• 1997

An objection of this study is to develop a measuring circuit of a gauge using radioisotope for compaction control. The gauge developed in this study makes use of radioisotope with the activity exempted from domestic atomic law and consists of measuring circuits for gamma-rays and thermal neutrons, a high voltage supply unit, and a microprocessor. To obtain meaningful numbers of pulse counts, parallel five and two circuits are provided for gamma-rays and thermal neutrons, respectively. Being simple in electrical characteristics of G-M detector for gamma-rays, pulses are counted through only a shaping circuit. Very small pulses generated from He- 3 proportional detector for thermal neutrons are amplified to the maximum of 50 [dB] and a window comparator accepts only pulses with meaning. To minimize effects of natural environmental radiation and electrical noise, circuits are electrostatically shielded and pulses made by ripples are eliminated by taking frequency of high voltage supplied to the circuit and pulse height of ripples into consideration. One-chip microprocessor is applied to process various counts, results are stored and the gauage is made capable to communicate with PC. Enough and meaningful numbers of pulses are counted with the prototype gauage for compaction control.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2002.02a
• /
• pp.438-443
• /
• 2002

본 연구는 수도작에서 토양과 식물체의 분광반사특성과 영상처리를 이용한 기계시각 잡초검출 센서를 개발하기 위한 기초연구로서 분류하고자 하는 대상체들의 분광반사율을 조사하여 주요한 파장을 선정하고 선정된 파장을 이용한 판별분석을 통해 각 대상체에 대한 분류 정확도를 중심으로 잡초검출 가능성을 조사하기 위하여 수행하였으며, 실험으로부터 얻은 결론은 다음과 같다. 1. 토양과 식물체를 구분하는데 효과적인 파장은 마른 토양의 경우 680 nm, 배수 토양에 있어서는 810 nm로 선정하였고, 토양을 배제한 후 벼와 잡초를 구분하기에 효과적인 파장은 580, 680 nm로 선정하였다. 2. 토양과 식물체를 구분하기 위한 판별분석 결과 2가지 토양상태 모두 식물체와 완전히 구분 가능한 것으로 나타났다. 벼와 잡초를 구분하기 위한 실험에서, 벼는 98%의 분류정확도로 구분이 가능하였고, 잡초는 83%의 분류정확도로 구분이 되는 것으로 나타났다. 따라서 차후 분광학적 원리를 이용한 센서를 제작할 때 본 연구에서 선택한 주요 파장과 판별함수를 이용하여 장치를 구성하고 알고리즘을 제작한다면 벼, 잡초, 토양을 효과적으로 구분이 가능할 것으로 판단되었다. 3. 컬러 CCD 카메라를 사용하는 경우에 있어 식물체와 토양을 구분하기 위해 3 종의 파장 중 630 nm 파장만의 이용을 고려하여 그 분류성능을 분석한 결과, 식물체와 토양은 소수의 관측치를 제외하고 완전히 구분이 가능했고, 벼와 잡초를 구분한 결과에서는 비교적 높은 분류능력을 가진 것으로 나타나 차후 컬러 CCD 카메라를 이용하여 장치를 구성하는데 좋은 기초가 될 것으로 판단된다. 배양체의 접종작업은 모든 배양실이 인력에 의존하였으며, 배양체를 배지와 분리하여 불필요한 부분을 제거하고 배양작물에 따라 생육정도를 2~3등급으로 구분하여 배양용기의 배지 위에 치상하는 과정으로 수행되었으며, 작업능률은 호접란의 경우 배양병에 25본을 접종하는데 시간당 6병, 심비디움은 원형 플라스크에 25본을 접종하는데 시간당 10병 정도였다. 바. 식물체의 대량증식에 사용되는 플라스크, 배양병, PE용기 등 배양용기의 세척작업은 농원의 1개배양실에서 간이식 세척기, 이 외의 9개배양실은 모두 물에 담겨 두었다가 세제와 브러쉬 등을 사용하여 인력으로 세척하고 있어 생력화 기술개발이 요구되었다.도가 빠를수록 건조속도가 빨라졌으며, 건조에너지도 1,334kcal/kg.water로 비슷하게 소요되었다. 마. 시험구와 대비구의 건감률은 시험구에서 1.08~1.36w.b./h로 나타나 대비구보다 약 9.9~18.3%가 높게 나타났고, 건조에너지는 10.2~14.6%가 절감되었다. 발아율은 열풍온도가 낮을수록 높게 나타났고 시험구가 대비구보다 발아율이 낮게 나타났으며, 동할률 증가량도 원적외선.열풍 복합건조방법이 높게 나타나 이것은 곡물 표면에 원적외선 방사에의한 복사열이 전달되어 열장해를 받았기 때문으로 판단되며, 금후 더 연구하여 적정 열풍온도 및 방사체 크기를 구명해야 할 것이다.으로 보여진다 따라서 옻나무 유래 F는 포유동물의 생식기능에 중요하게 작용하는 것으로 사료된다.된다.정량 분석한 결과이다. 시편의 조성은 33.6 at% U, 66.4 at% O의 결과를 얻었다. 산화물 핵연료의 표면 관찰 및 정량 분석 시험시 시편 표면을

• Journal of the Society of Disaster Information
• /
• v.9 no.2
• /
• pp.145-152
• /
• 2013

This study was conducted to improve the Nonpoint-source pollutant treatment plant efficiency and maintenance. Field and laboratory permeability test were conducted three times each before and after displacement. The removal efficiency such as TSS, BOD, CODmn, T-N, and T-P were investigated from the year of 2006 to 2011. The coefficient of permeability right after displacement was calculated to be $1.07{\times}10^{-3}(cm/s)$, coefficient of permeability after a year was calculated to be $0.88{\times}10^{-3}(cm/s)$, and after five years, it was calculated to be $0.3{\times}10^{-3}(cm/s)$ and accordingly, the amount of infiltration decreased. In case of the removal efficiency, it generally tended to decrease, but it showed the higher rates than the expected rates BOD 40%, SS 76%, T-N 39% and T-P 53%. It is concluded that displacement cycle should be at least five years and that dredging cycle should be at least three months and at most one year.