• 한국공간정보시스템학회 논문지
• /
• 제11권2호
• /
• pp.1-6
• /
• 2009

Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

• 인터넷정보학회논문지
• /
• 제5권4호
• /
• pp.115-124
• /
• 2004

본 논문에서는 가중 퍼지 페트리네트에 기반을 둔 규칙기반시스템을 위한 가중 퍼지 후진추론 알고리즘을 제안한다. 규칙기반시스템에 있는 퍼지 생성규칙은 가중 퍼지 페트리네트로 모형화된다. 여기에서 퍼지 생성규칙에 나타나는 퍼지 명제의 진리값과 규칙의 확신도는 퍼지 숫자로 표현한다. 그리고 규칙에 나타나는 퍼지 명제의 가중값도 퍼지 숫자로 표현하다. 제안한 가중 퍼지 후진추론 알고리즘은 목표노드에서 초기노드까지 후진추론 통로를 생성한 후 목표노드의 확신도를 계산한다. 우리가 제안한 알고리즘은 규칙기반시스템이 더 유연하고 사람과 같은 방법으로 가중 퍼지 후진추론을 하는 것을 가능하게 한다.

• Journal of Electrical Engineering and Technology
• /
• 제9권3호
• /
• pp.1023-1033
• /
• 2014

In this paper, performance improved hole-filling algorithm which includes the boundary noise removing pre-process that can be used for an arbitrary virtual view synthesis has been proposed. Boundary noise occurs due to the boundary mismatch between depth and texture images during the 3D warping process and it usually causes unusual defects in a generated virtual view. Common-hole is impossible to recover by using only a given original view as a reference and most of the conventional algorithms generate unnatural views that include constrained parts of the texture. To remove the boundary noise, we first find occlusion regions and expand these regions to the common-hole region in the synthesized view. Then, we fill the common-hole using the spiral weighted average algorithm and the gradient searching algorithm. The spiral weighted average algorithm keeps the boundary of each object well by using depth information and the gradient searching algorithm preserves the details. We tried to combine strong points of both the spiral weighted average algorithm and the gradient searching algorithm. We also tried to reduce the flickering defect that exists around the filled common-hole region by using a probability mask. The experimental results show that the proposed algorithm performs much better than the conventional algorithms.

• ETRI Journal
• /
• 제29권3호
• /
• pp.336-352
• /
• 2007

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2830-2837
• /
• 1999

Image processing steps are consist of image acquisition, preprocessing, region, segmentation and recognition. But image corrupted commonly by noise reduction methods, many filters were proposed like mean filter, median filter, weighted median filter, Cheikh filter, and Kyu-cheol lee filter as spatial noise reduction filtering. We propose a new edge detection algorithm so that we find out edge existence and nonexistence. In non-edge area, we selectively apply weighted median filter based upon using information of difference value between weighted median filter's value and center pixel's value. As a result, we finally prove a better performance of noise reduction by applying adaptive weighted median filter and improvement of processing time through using simple algorithm.

• Communications for Statistical Applications and Methods
• /
• 제2권2호
• /
• pp.135-145
• /
• 1995

A new algorithm was given to successively fit the multiexponential function/nonlinear function to data by a weighted least squares method, using Gauss-Newton, Marquardt, gradient and DUD methods for convergence. This study also considers the problem of linear-nonlimear weighted least squares estimation which is based upon the usual Taylor's formula process.

• Journal of Radiation Protection and Research
• /
• 제45권3호
• /
• pp.117-129
• /
• 2020

Background: Radiation portal monitors (RPMs) involving plastic scintillators installed at the border inspection sites can detect illicit trafficking of radioactive sources in cargo containers within seconds. However, RPMs may generate false alarms because of the naturally occurring radioactive materials. To manage these false alarms, we previously suggested an energy-weighted algorithm that emphasizes the Compton-edge area as an outstanding peak. This study intends to evaluate the identification of radioactive sources using an improved energy-weighted algorithm. Materials and Methods: The algorithm was modified by increasing the energy weighting factor, and different peak combinations of the energy-weighted spectra were tested for source identification. A commercialized RPM system was used to measure the energy-weighted spectra. The RPM comprised two large plastic scintillators with dimensions of 174 × 29 × 7 ㎤ facing each other at a distance of 4.6 m. In addition, the in-house-fabricated signal processing boards were connected to collect the signal converted into a spectrum. Further, the spectra from eight radioactive sources, including special nuclear materials (SNMs), which were set in motion using a linear motion system (LMS) and a cargo truck, were estimated to identify the source identification rate. Results and Discussion: Each energy-weighted spectrum exhibited a specific peak location, although high statistical fluctuation errors could be observed in the spectrum with the increasing source speed. In particular, ¹³⁷Cs and ⁶⁰Co in motion were identified completely (100%) at speeds of 5 and 10 km/hr. Further, SNMs, which trigger the RPM alarm, were identified approximately 80% of the time at both the aforementioned speeds. Conclusion: Using the modified energy-weighted algorithm, several characteristics of the energy weighted spectra could be observed when the used sources were in motion and when the geometric efficiency was low. In particular, the discrimination between ⁶⁰Co and ⁴⁰K, which triggers false alarms at the primary inspection sites, can be improved using the proposed algorithm.

• 전자공학회논문지SC
• /
• 제39권1호
• /
• pp.33-41
• /
• 2002

본 논문에서는 기존의 주파수하중 균형절단 기법과 주파수하중 한켈노옴 근사화 기법에 비하여 더 작은 H∞ 하중 축소오차를 가지는 새로운 알고리듬을 제시한다. 제시한 알고리듬은 제한 실 보조정리로부터 반복적인 두 단계의 선형행렬부등식 형태로 유도한다. 또한 제안한 알고리듬을 성능보장을 위한 제어기 차수축소기법에 적용한다. 수치적 예를 통하여 제안한 알고리듬의 타당성을 보이고 기존의 모델 차수축소기법과 비교 분석하며 HIMAT(highly maneuverable aircraft technology) 시스템의 예를 통하여 성능보장을 위한 제어기 차수축소 기법에 적용할 수 있음을 보인다.

• 한국전자통신학회논문지
• /
• 제17권1호
• /
• pp.153-160
• /
• 2022

그래프신호가 각각의 가중치를 갖고 발생하는 경우 그래프상의 최적의 샘플링 노드집합을 선택하는 탐욕알고리즘에 대해 연구한다. 이를 위해 가중치를 반영한 복원오차를 비용함수로 사용하고 여기에 QR 분해를 적용하여 단순한 형태로 전개한다. 이렇게 도출된 가중치 복원오차를 최소화하기 위해 다양한 수학적 증명을 통해 반복적으로 노드를 선택할 수 있는 수학적 결과식을 유도한다. 이러한 결과식에 기반하여, 노드를 선택하는 샘플링 집합 선택알고리즘을 제안한다. 성능평가를 위해 다양한 그래프에서 발생하는 가중치를 갖는 그래프신호에 적용하여 기존 샘플링 선택 기술대비, 복잡도를 유지하면서 가중치 신호의 복원성능이 우수함을 보인다.

• Journal of information and communication convergence engineering
• /
• 제12권4호
• /
• pp.215-220
• /
• 2014

We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.