• Journal of the Korean Association of Geographic Information Studies
• /
• v.15 no.2
• /
• pp.103-112
• /
• 2012

We demonstrate the preliminary results of ship detection application using synthetic aperture radar (SAR) and automatic identification system (AIS) together. Multi-frequency and multi-temporal SAR images such as TerraSAR-X and Cosmo-SkyMed (X-band), and Radarsat-2 (C-band) are acquired over the West Sea in South Korea. In order to compare with SAR data, we also collected an AIS data. The SAR data are pre-processed considering by the characteristics of scattering mechanism as for sea surface. We proposed the "Adaptive Threshold Algorithm" for classification ship efficiently. The analyses using the combination of the SAR and AIS data with time series will be very useful to ship detection or tracing of the ship.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1145-1156
• /
• 2002

A method to measure the speed and distance of moving object is proposed using the stereo vision system. One of the most important factors for measuring the speed and distance of moving object is the accuracy of object tracking. Accordingly, the background image algorithm is adopted to track the rapidly moving object and the local opening operator algorithm is used to remove the shadow and noise of object. The extraction efficiency of moving object is improved by using the adaptive threshold algorithm independent to variation of brightness. Since the left and right central points are compensated, the more exact speed and distance of object can be measured. Using the background image algorithm and local opening operator algorithm, the computational processes are reduced and it is possible to achieve the real-time processing of the speed and distance of moving object. The simulation results show that background image algorithm can track the moving object more rapidly than any other algorithm. The application of adaptive threshold algorithm improved the extraction efficiency of the target by reducing the candidate areas. Since the central point of the target is compensated by using the binocular parallax, the error of measurement for the speed and distance of moving object is reduced. The error rate of measurement for the distance from the stereo camera to moving object and for the speed of moving object are 2.68% and 3.32%, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.111-116
• /
• 2009

LEACH is a important hierarchical protocol in wireless sensor network. In LEACH, the head is randomly selected for balanced energy consume. In LEACH-C, the node that has more energy than the average value is selected for the network life cycle. However, the round continues, the improved protocol is needed because the energy and network are changed. In this paper, LEACH, LEACH-C is not considered the energy consumed in the round because of wasted energy and reduce the time for presenting a new round time was set. And proposed the new algorithm using the energy threshold for the cluster head selection and the round time. In simulation, we show the improved performance compared to existing protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5877-5897
• /
• 2018

With the popularity of mobile networks and smartphones, geo-textual publish/subscribe messaging has attracted wide attention. Different from the traditional publish/subscribe format, geo-textual data is published and subscribed in the form of dynamic data flow in the mobile network. The difference creates more requirements for efficiency and flexibility. However, most of the existing Top-k geo-textual publish/subscribe schemes have the following deficiencies: (1) All publications have to be scored for each subscription, which is not efficient enough. (2) A user should take time to set a threshold for each subscription, which is not flexible enough. Therefore, we propose an efficient and flexible Top-k geo-textual publish/subscribe scheme. First, our scheme groups publish and subscribe based on text classification. Thus, only a few parts of related publications should be scored for each subscription, which significantly enhances efficiency. Second, our scheme proposes an adaptive publish/subscribe matching algorithm. The algorithm does not require the user to set a threshold. It can adaptively return Top-k results to the user for each subscription, which significantly enhances flexibility. Finally, theoretical analysis and experimental evaluation verify the efficiency and effectiveness of our scheme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.2
• /
• pp.342-348
• /
• 2009

This paper introduces a novel denoising algorithm for the partial-discharge(PD) signals from power apparatuses. The developed algorithm includes three kinds of specific denoising sub-algorithms. The first sub-algorithm uses the fuzzy logic which classifies the noise types in the magnitude versus phase PD pattern. This sub-algorithm is especially effective in the rejection of the noise with high and constant magnitude. The second one is the method simply removing the pulses in the phase sections below the threshold count in the count versus phase pattern. This method is effective in removing the occasional high level noise pulses. The last denoising sub-algorithm uses the grouping characteristics of PD pulses in the 3D plot of the magnitude versus phase versus cycle. This special technique can remove the periodical noise pulses with varying magnitudes, which are very difficult to be removed by other denoising methods. Each of the sub-algorithm has different characteristic and shows different quality of the noise rejection. On that account, a parameter which numerically expresses the noise possessing degree of signal, is defined and evaluated. Using the parameter and above three sub-algorithms, an adaptive complex noise rejection algorithm for the on-line PD diagnosis system is developed. Proposed algorithm shows good performances in the various real PD signals measured from the power apparatuses in the Korean plants.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.253-260
• /
• 2008

The research for a 3-axial accelerometer sensor has increased dramatically in the fields of cellular phone, PDA, etc. In this paper, we develop a human walking detection algorithm using 3-axial accelerometer sensor and a user interface system to show the activity expenditure in real-time. To measure a walking number more correctly in a variety of walking activities including walking, walking in place, running, slow walking, we propose a new walking number detection algorithm using adaptive threshold value. In addition, we calculate the activity expenditure base on counted walking number and display calculated activity expenditure on UI in real-time. From the experimental results, we could obtain that the detection rate of proposal algorithm is higher than that of existing algorithm using a fixed threshold value about $5{\sim}10%$. Especially, it could be found out high detection rate in walking in place.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.419-428
• /
• 2003

Recently, digital watermarking has been proposed as a viable solution to the need of copyright protection and authentication of multimedia data. A robust wavelet-based watermark casting scheme and a watermark retrieval technique are suggested in this paper. We present a method which can add the watermark to the significant coefficients in the DWT domain, and does not require the original image in the detection process. In adaptive watermark casting method is developed to select perceptually significant coefficients for each subband using multiple threshold. In the proposed method, an adaptive multiple threshold scheme is used to reflect characteristics of each subband and complexity of image. The watermark is adaptively weighted in different subbands to achieve robustness as well as high perceptual quality. The watermark, Gaussian random sequence is added to the large coefficients but not in the lowest subband in the DWT domain. Experimental results show that the proposed algorithm produced visually very good watermarked image which has good invisibility to human eyes and very robust against various image processing and compression attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.661-663
• /
• 2016

Corruption occurs in the process of processing image signal and the corruption changes the pixel value within the image to damage the original information. AWGN(additive white Gaussian noise) is a representative example. For filters to remove AWGN, there are filters such as MF(mean filter), WF(wiener filter), and AWMF(adaptive weighted mean filter). However images processed through standard previous filters lock preservation characteristics in edge areas. Therefore, threshold value is applied for processing on the standard deviation of the local mask in this study and if the standard deviation is smaller than the threshold value, it is not filtered and if the value is bigger than the threshold value, the study suggested an algorithm that processes using weighted value utilizing standard deviation.

• Journal of Biosystems Engineering
• /
• v.38 no.1
• /
• pp.55-63
• /
• 2013

Purpose: The present study aimed at image processing methods for automatic cell pattern recognition and morphological analysis for tissue engineering applications. The primary aim was to ascertain the novel algorithm of adaptive brightness correction from microscopic images for use as a potential image analysis. Methods: General microscopic image of cells has a minor problem which the central area is brighter than edge-area because of the light source. This may affect serious problems to threshold process for cell-number counting or cell pattern recognition. In order to compensate the problem, we processed to find the central point of brightness and give less weight-value as the distance to centroid. Results: The results presented that microscopic images through the brightness correction were performed clearer than those without brightness compensation. And the classification of mixed cells was performed as well, which is expected to be completed with pattern recognition later. Beside each detection ratio of hBMSCs and HeLa cells was 95% and 92%, respectively. Conclusions: Using this novel algorithm of adaptive brightness correction could control the easier approach to cell pattern recognition and counting cell numbers.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.