• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.129-135
• /
• 2011

An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.478-483
• /
• 2013

This paper presents an adaptive Retinex algorithm for improving dynamic range of image representation. The proposed Retinex algorithm detects degraded brightness by using skewness and the degraded components are compensated with local statistics. In particular, we propose a new compensation function for dynamic range so that effectinve image representation can be achieved. Experimental results show that the proposed algorithm has the capability to improve the dynamic range with reduction of color degradation.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2331-2334
• /
• 2003

Generally, skin color information has been widely used at the face region extraction step of the face region recognition process. But many experimental results show that they are very sensitive to the given threshold range which is used to extract the face regions at the input image. In this paper, we propose a face region extraction algorithm based on an adaptive range decision for skin color. First we extract the pixels which are regarded as the candidate skin color pixels by using the given range for skin color extraction. Then, the ratio between the total pixels and the extracted pixels is calculated. According to the ratio, we adaptively decide the range of the skin color and extract face region. From the experiment results for the various images, the proposed algorithm shows more accurate results than the conventional algorithm.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.383-386
• /
• 2006

In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3889-3903
• /
• 2017

Fast and accurate localization of randomly deployed nodes is required by many applications in wireless sensor networks (WSNs). However, mobile nodes localization in WSNs is more difficult than static nodes localization since the nodes mobility brings more data. In this paper, we propose a Range-based Monte Carlo Box (RMCB) algorithm, which builds upon the Monte Carlo Localization Boxed (MCB) algorithm to improve the localization accuracy. This algorithm utilizes Received Signal Strength Indication (RSSI) ranging technique to build a sample box and adds a preset error coefficient in sampling and filtering phase to increase the success rate of sampling and accuracy of valid samples. Moreover, simplified Particle Swarm Optimization (sPSO) algorithm is introduced to generate new samples and avoid constantly repeated sampling and filtering process. Simulation results denote that our proposed RMCB algorithm can reduce the location error by 24%, 14% and 14% on average compared to MCB, Range-based Monte Carlo Localization (RMCL) and RSSI Motion Prediction MCB (RMMCB) algorithm respectively and are suitable for high precision required positioning scenes.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.4
• /
• pp.152-159
• /
• 2007

In this paper, a new design technique on the LRF which is useful for low power laser and a CBDA(Cummulative Binary Detection Algorithm) is proposed. The LD(Laser Diode) and Si-APD(Silicon Avalanche Photo Diode) are used for saving a power. In order to prove the detection range, the Si-APD binary data are accumulated before the range computation and the range finding algorithm. A prototype of the proposed DLRF(Diode Laser Range Finder) system was made and tested. An experimental result shows that the DLRF system have the same detection range using a less power(almost 1/32) than an usual military LRF. The proposed DLRF can be applied to the Unmanned Vehicles, Robot and Future Combat System of a tiny size and a low power LRF.

• Journal of Broadcast Engineering
• /
• v.14 no.4
• /
• pp.428-437
• /
• 2009

A high dynamic range (HDR) image can represent real world scenes that have a wide range of luminance intensity. However, compared with the range of real world luminance, conventional display devices have a low dynamic range (LDR). To display HDR images onto conventional displayable devices such as monitors and printers, we propose the logarithmic based global reproduction algorithm that considers the features of the image using reproduction parameters. Based on the characteristics of the image, we first modify the input luminance values for reproducing perceptually tuned images and then obtain the displayable output values directly. The experimental results show that the proposed algorithm achieves good subjective results while preserving details of the image; furthermore, the proposed algorithm has a fast, simple and practical structure for implementation.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2015

Recently, handy pulse measurement method was introduced by using smart phone camera. However, measured values are not consistent with the variations of external light conditions, because the external light interfere with dynamic range of captured pulse image. Thus, adaptive dynamic range reconstruction algorithm is proposed to conduct pulse measurement robust to light condition. The minimum and maximum values for dynamic ranges of green and blue channels are adjusted to appropriate values for pulse measurement. In addition, sigmoid function based curve is applied to adjusted dynamic range. Experimental results show that the proposed algorithm conducts suitably dynamic range reconstruction of pulse image for the interference of external light sources.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.612-619
• /
• 2011

Satellite navigation system such as GPS is becoming more important infrastructure for positioning, navigation and timing. But satellite navigation system is vulnerable to interferences because of the low received power, complementary navigation system such as eLoran is needed. In order to develop eLoran/GPS navigation system, integrated eLoran/GPS navigation algorithm is necessary. In this paper, new integrated eLoran/GPS navigation algorithm is proposed. It combines the position domain integration and the range domain integration to get accurate position with less computational burden. Also an eLoran/GPS evaluation platform is designed and performance evaluation of the proposed algorithm using the evaluation platform is given. The proposed algorithm gives an accuracy of the range domain integration with a computational load of the position domain integration.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.130-138
• /
• 2003

The classical image reconstruction for stripmap-mode Synthetic Aperture Radar is the Range-Doppler algorithm. When the spotlight-mode SAR system was envisioned, Range-Doppler algorithm turned out to fail rapidly in this SAR imaging modality. Thus, what is referred to as Polar format algorithm, which is based on the Plane wave approximation, was introduced for imaging from spotlight-mode SAR raw- data. In this paper, we have studied for the raw data processing schemes in the spotlight-mode Synthetic Aperture Radar. We apply the Wavefront Reconstruction scheme that does not utilize the approximation in spotlight-mode SAR imaging modelity, and compare the performance of target imaging with the Polar format inversion scheme.