• Title/Summary/Keyword: weighted algorithm

검색결과 1,102건 처리시간 0.025초

배경색을 고려한 중심 이동 추적 알고리즘 (Centroids Shift Tracking Algorithm Considering Background Colors)

  • 최은철;장준영;강문기
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.813-814
    • /
    • 2008
  • In this paper, we propose a new tracking algorithm which uses weighted sum of color bin's centroids to find the main centroid of the target. The weights are determined by the proportion of colors of the target and by the colors of background. That is, A color which has high occupation in forming the target is highly weighted and a color which has low occupation is lowly weighted. Moreover, the proposed algorithm prevent track failure by lowering the weight of the colors which forms the background. Therefore, the proposed algorithm performs stable tracking inspite of occlusion and existence of confusing backgrounds.

  • PDF

A NEW FIFTH-ORDER WEIGHTED RUNGE-KUTTA ALGORITHM BASED ON HERONIAN MEAN FOR INITIAL VALUE PROBLEMS IN ORDINARY DIFFERENTIAL EQUATIONS

  • CHANDRU, M.;PONALAGUSAMY, R.;ALPHONSE, P.J.A.
    • Journal of applied mathematics & informatics
    • /
    • 제35권1_2호
    • /
    • pp.191-204
    • /
    • 2017
  • A new fifth-order weighted Runge-Kutta algorithm based on heronian mean for solving initial value problem in ordinary differential equations is considered in this paper. Comparisons in terms of numerical accuracy and size of the stability region between new proposed Runge-Kutta(5,5) algorithm, Runge-Kutta (5,5) based on Harmonic Mean, Runge-Kutta(5,5) based on Contra Harmonic Mean and Runge-Kutta(5,5) based on Geometric Mean are carried out as well. The problems, methods and comparison criteria are specified very carefully. Numerical experiments show that the new algorithm performs better than other three methods in solving variety of initial value problems. The error analysis is discussed and stability polynomials and regions have also been presented.

Development of 3D Mapping Algorithm with Non Linear Curve Fitting Method in Dynamic Contrast Enhanced MRI

  • Yoon Seong-Ik;Jahng Geon-Ho;Khang Hyun-Soo;Kim Young-Joo;Choe Bo-Young
    • 한국자기공명학회논문지
    • /
    • 제9권2호
    • /
    • pp.93-102
    • /
    • 2005
  • Purpose: To develop an advanced non-linear curve fitting (NLCF) algorithm for dynamic susceptibility contrast study of brain. Materials and Methods: The first pass effects give rise to spuriously high estimates of $K^{trans}$ in voxels with large vascular components. An explicit threshold value has been used to reject voxels. Results: By using this non-linear curve fitting algorithm, the blood perfusion and the volume estimation were accurately evaluated in T2*-weighted dynamic contrast enhanced (DCE)-MR images. From the recalculated each parameters, perfusion weighted image were outlined by using modified non-linear curve fitting algorithm. This results were improved estimation of T2*-weighted dynamic series. Conclusion: The present study demonstrated an improvement of an estimation of kinetic parameters from dynamic contrast-enhanced (DCE) T2*-weighted magnetic resonance imaging data, using contrast agents. The advanced kinetic models include the relation of volume transfer constant $K^{trans}\;(min^{-1})$ and the volume of extravascular extracellular space (EES) per unit volume of tissue $\nu_e$.

  • PDF

EDI와 NAL 알고리듬을 기반으로 한 거리 가중치 비월주사 방식 알고리듬 (Weighted Distance De-interlacing Algorithm Based on EDI and NAL)

  • 이세영;구수일;정제창
    • 한국통신학회논문지
    • /
    • 제33권9C호
    • /
    • pp.704-711
    • /
    • 2008
  • 본 논문은 효율적인 시각적 향상을 보여주는 새로운 비월 주사 방식 기법을 제안한다. 제안하는 알고리듬은 새로운 거리 가중치를 고려하며 이전에 개발되었던 EDI (Edge Dependent Interpolation) 알고리듬과 NAL (New Adaptive Linear interpolation) 알고리듬을 이용한다. 비월 주사 기법은 크게 2단계로 나된다. 우선 에지의 방향을 근접한 화소들의 정보를 이용하여 결정한다. 그리고 나서 잃어버린 화소 값들을 결정된 에지의 방향을 따라 보간 한다. 본 논문에서는 EDI 알고리듬을 통해 에지를 예측한 후에 NAL 알고리듬을 바탕으로 거리 가중치를 이용함으로써 잃어버린 화소들을 보간 한다. 실험 결과는 제안된 알고리듬이 기존의 알고리듬들보다 객관적 및 주관적인 평가에서 우수함을 입증한다.

TWS 레이더 추적을 위한 가중 점수 기반 추적 초기화 알고리즘 연구 (Track Initiation Algorithm Based on Weighted Score for TWS Radar Tracking)

  • 이규정;곽노준;권지훈;양은정;김관성
    • 한국군사과학기술학회지
    • /
    • 제22권1호
    • /
    • pp.1-10
    • /
    • 2019
  • In this paper, we propose the track initiation algorithm based on the weighted score for TWS radar tracking. This algorithm utilizes radar velocity information to calculate the probabilistic track score and applies the Non-Maximum-Suppression(NMS) to confirm the targets to track. This approach is understood as a modification of a conventional track initiation algorithm in a probabilistic manner. Also, we additionally apply the weighted Hough transform to compensate a measurement error, and it helps to improve the track detection probability. We designed the simulator in order to demonstrate the performance of the proposed track initiation algorithm. The simulation result show that the proposed algorithm, which reduces about 40 % of a false track probability, is better than the conventional algorithm.

MWLD 알고리즘을 이용한 문자열정합 1차원 Bit-Serial 어레이 프로세서의 설계 (A Study on 1-D Bit-Serial Array Processor Design for Code-String Matching Using a MWLD Algorithm)

  • 박종진;김은원;조원경
    • 전자공학회논문지B
    • /
    • 제29B권2호
    • /
    • pp.1-8
    • /
    • 1992
  • This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$

  • PDF

Computing Weighted Maximal Flows in Polymatroidal Networks

  • Chung, Nam-Ki
    • 대한산업공학회지
    • /
    • 제10권2호
    • /
    • pp.37-43
    • /
    • 1984
  • For the polymatroidal network, which has set-constraints on arcs, solution procedures to get the weighted maximal flows are investigated. These procedures are composed of the transformation of the polymatroidal network flow problem into a polymatroid intersection problem and a polymatroid intersection algorithm. A greedy polymatroid intersection algorithm is presented, and an example problem is solved. The greedy polymatroid intersection algorithm is a variation of Hassin's. According to these procedures, there is no need to convert the primal problem concerned into dual one. This differs from the procedures of Hassin, in which the dual restricted problem is used.

  • PDF

전자 현미경 영상의 혼합 잡음제거 알고리즘에 관한 연구 (Design of mixed noise reduction algorithm for SEM image)

  • 최재혁;박선우
    • 한국진공학회지
    • /
    • 제8권3B호
    • /
    • pp.315-321
    • /
    • 1999
  • In this paper, the SEM image processing system based on PC is designed, and a new noise reduction filtering algorithm is proposed. The SEM image obtained in semiconductor processing line is sensitive to noise, the weighted-D filter can remove uniform and Gaussian noise effectively, but can not remove impulse noise properly, A new improved filtering algorithm is proposed to reduce mixed-noise. The performance of the proposed filter is quantitatively evaluated by use of the normalized mean square errors (NMSE). The experimental results show that the performance of the proposed filter is obtained between 0.96 and 2.5 times better than that of weighted-D filter in NMSE evaluation.

  • PDF

Perceptron 알고리즘을 이용한 가중 순서 통게 필터의 설계 (A Design Method for Weighted Order Statistic Filters Based on the Perceotron Algorithm)

  • 정병장;이용훈
    • 전자공학회논문지B
    • /
    • 제30B권6호
    • /
    • pp.1-6
    • /
    • 1993
  • In this paper, we observe that the design of optimal weighted order statistic(WOS) filters minimizing the mean absolute error criterion can be though of as a two-class linear classification problem. Based on this observation, the perceptron algorithm is applied to design WOS filters. It is shown, through experiments, that the perceptron algorithm can find optimal or near optimal WOS filters in practical situations.

  • PDF

가중 퍼지 페트리네트 표현에서 경험정보로 확신도를 이용하는 가중 퍼지추론 (Weighted Fuzzy Reasoning Using Certainty Factors as Heuristic Information in Weighted Fuzzy Petri Net Representations)

  • 이무은;이동은;조상엽
    • Journal of Information Technology Applications and Management
    • /
    • 제12권4호
    • /
    • pp.1-12
    • /
    • 2005
  • In general, other conventional researches propose the fuzzy Petri net-based fuzzy reasoning algorithms based on the exhaustive search algorithms. If it can allow the certainty factors representing in the fuzzy production rules to use as the heuristic information, then it can allow the reasoning of rule-based systems to perform fuzzy reasoning in more effective manner. This paper presents a fuzzy Petri net(FPN) model to represent the fuzzy production rules of a rule-based system. Based on the fuzzy Petri net model, a weighted fuzzy reasoning algorithm is proposed to Perform the fuzzy reasoning automatically, This algorithm is more effective and more intelligent reasoning than other reasoning methods because it can perform fuzzy reasoning using the certainty factors which are provided by domain experts as heuristic information

  • PDF