• Title/Summary/Keyword: 동적 임계치

Search Result 75, Processing Time 0.025 seconds

A Recommendation Agent System for E-Mail Classification (이메일 분류를 위한 추천 에이전트 시스템)

  • 정옥란;조동섭
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.94-96
    • /
    • 2003
  • 급속도로 발전하는 인터넷의 발달로 인한 정보의 과부하와 이메일의 급증은 이젠 모든 네티즌들이 겪는 불편함이 아닐 수 없다. 본 논문에서는 이런 이메일 관리를 사용자가 효율적으로 할 수 있도록 추천 에이전트(Recommendation Agent)를 제안하고자 한다. 추천 에이전트 시스템에서는 이메일의 자동 분류에서 가장 핵심인 정확도(Accuracy)를 개선시키기 위해 최종 결정을 사용자가 하는 방식으로 접근하였으며, 또한 절기에 이용되는 학습 및 분류 알고리즘을 동적 임계치를 적용한 베이지안 학습 알고리즘을 이용하여 알고리즘적 방법도 병행하였다. 새로운 메일이 도착했을 때 최적의 분류를 할 수 있도록 메일 카테고리를 추천하는 시스템이다. 또한 사용자 편의를 위하여 필요없는 메일이나 스팸으로 간주되는 메일은 자동 삭제하는 기능을 추가하였다.

  • PDF

Adaptive Background Subtraction Based on Genetic Evolution of the Global Threshold Vector (전역 임계치 벡터의 유전적 진화에 기반한 적응형 배경차분화)

  • Lim, Yang-Mi
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.10
    • /
    • pp.1418-1426
    • /
    • 2009
  • There has been a lot of interest in an effective method for background subtraction in an effort to separate foreground objects from a predefined background image. Promising results on background subtraction using statistical methods have recently been reported are robust enough to operate in dynamic environments, but generally require very large computational resources and still have difficulty in obtaining clear segmentation of objects. We use a simple running-average method to model a gradually changing background, instead of using a complicated statistical technique. We employ a single global threshold vector, optimized by a genetic algorithm, instead of pixel-by-pixel thresholds. A new fitness function is defined and trained to evaluate segmentation result. The system has been implemented on a PC with a webcam, and experimental results on real images show that the new method outperforms an existing method based on a mixture of Gaussian.

  • PDF

A Study on Performance Enhancement of the Rate Scheme for ABR Traffic on ATM Networks (ATM 망에서 ABR 트래픽을 위한 Rate 기법이 성능 향상 연구)

  • Lee, Yo-Seob;Yu, Eun-Jin;Chang, Hyun-Hee;Pang, Hea-Ja;Jun, Moon-Seog
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2605-2614
    • /
    • 1997
  • Recently, we are concerned with effective service according as the demand increase for high speed data service. We can use high speed transfer and multiple traffic service on the ATM networks, so we concentrate on preventive-control method rather than reactive-control one. But it is possible to have low QoS and traffic congestion due to unpredictable traffic and burst traffic. Specially, ATM Forum has discussed to standardization of traffic management of ABR(Available Bit Rate) service. Because ABR traffic controls the flow of traffic using the feedback information and the current status information of cell, it allocates bandwidth systematically and dynamically to the user. In this paper, we propose a new Rate-based flow control scheme which adapted double threshold buffer idea. The double threshold buffer controls the traffic control by establishing two threshold in buffer.

  • PDF

Design and Implementation of Web Mail Filtering Agent for Personalized Classification (개인화된 분류를 위한 웹 메일 필터링 에이전트)

  • Jeong, Ok-Ran;Cho, Dong-Sub
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.853-862
    • /
    • 2003
  • Many more use e-mail purely on a personal basis and the pool of e-mail users is growing daily. Also, the amount of mails, which are transmitted in electronic commerce, is getting more and more. Because of its convenience, a mass of spam mails is flooding everyday. And yet automated techniques for learning to filter e-mail have yet to significantly affect the e-mail market. This paper suggests Web Mail Filtering Agent for Personalized Classification, which automatically manages mails adjusting to the user. It is based on web mail, which can be logged in any time, any place and has no limitation in any system. In case new mails are received, it first makes some personal rules in use of the result of observation ; and based on the personal rules, it automatically classifies the mails into categories according to the contents of mails and saves the classified mails in the relevant folders or deletes the unnecessary mails and spam mails. And, we applied Bayesian Algorithm using Dynamic Threshold for our system's accuracy.

A Dynamic Multicast Method for Efficient Utilization of Available Bandwidth (가용 대역폭의 효율적 이용을 위한 동적 멀티캐스트기법)

  • Koo Myung-Mo;Kim Sang-Bok
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.315-322
    • /
    • 2006
  • In the application rising IP multicast, the waste of available bandwidth occurs of reducing of transmission rate in non-congestion local caused by reducing of transmission rate in congestion local. In this paper, to solve such a problem, we propose a dynamic multicast method using IP multicast and overlay multicast. In proposed method, we elected a local representative for overlay multicasting. When the transmission rate of a group is less than transmission rate threshold, the representative can transmits duplicative packets. In simulation results, it was known that proposed method uses bandwidth more efficiently.

  • PDF

An Automatic Extraction Method of Glomerulus Region from Human Renal Tissue Image (신장조직영상에서 사구체 영역의 자동 추출법)

  • Kim, Eung-Kyeu;Lee, Choong-Ho
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2006.06a
    • /
    • pp.21-24
    • /
    • 2006
  • 본 논문에서는 신장조직 영상에서 사구체 영역을 자동적으로 추출하는 방법을 제안한다. 사구체 조직은 신장의 상태를 나타내는 많은 정보를 포함하고 있기 때문에 사구체 영역의 추출은 신장 검사를 자동화하기 위한 첫 번째 단계이다. 그러나 사구체 영역을 단순한 2치화 방법으로 직접 추출함은 어려운 일이다. 이에 본 연구자들은 우선, 가우스 함수에 의한 원영상의 빛바랜 영상을 동적인 임계값으로 사용함으로써 원영상을 2치화한다. 다음으로, 획득한 영상으로부터 간단한 영상처리 기법에 의한 사구체 영역의 경계 에지를 포함하는 모든 에지를 추출한다. 그 다음으로 사구체 영역의 경계 에지를 판별함으로써 사구체 영역을 추출하였다. 이 방법은 다수의 샘플에 적용해서 유효성을 확인한 바 양호한 결과를 얻을 수 있었다.

  • PDF

A Design of DDPT(Dynamic Data Protection Technique) using k-anonymity and ℓ-diversity (k-anonymity와 ℓ-diversity를 이용한 동적 데이터 보호 기법 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.3
    • /
    • pp.217-224
    • /
    • 2011
  • This paper proposes DDPT(Dynamic Data Protection Technique) which solves the problem of private information exposure occurring in a dynamic database environment. The DDPT in this paper generates the MAG(Multi-Attribute Generalization) rules using multi-attributes generalization algorithm, and the EC(equivalence class) satisfying the k-anonymity according to the MAG rules. Whenever data is changed, it reconstructs the EC according to the MAC rules, and protects the identification exposure which is caused by the EC change. Also, it measures the information loss rates of the EC which satisfies the ${\ell}$-diversity. It keeps data accuracy by selecting the EC which is less than critical value and enhances private information protection.

Calculation of Critical Speed of Railway Vehicle by Multibody Dynamics Analysis (다물체 동역학 해석방법을 이용한 철도차량의 임계속도 계산)

  • Kang, Juseok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.11
    • /
    • pp.1371-1377
    • /
    • 2013
  • In this analysis, a method is presented to calculate the critical speed of a railway vehicle by using a multibody dynamic model. The contact conditions and contact forces between the wheel and the rail are formularized for the wheelset model. This is combined with the bogie model to obtain a multibody dynamic model of a railway vehicle with constraint conditions. First-order linear dynamic equations with independent coordinates are derived from the constraint equations and dynamic equations of railway vehicles using the QR decomposition method. Critical speeds are calculated for the wheelset and bogie dynamic models through an eigenvalue analysis. The influences of the design parameters on the critical speed are presented.

Activity Recognition based on Multi-modal Sensors using Dynamic Bayesian Networks (동적 베이지안 네트워크를 이용한 델티모달센서기반 사용자 행동인식)

  • Yang, Sung-Ihk;Hong, Jin-Hyuk;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.72-76
    • /
    • 2009
  • Recently, as the interest of ubiquitous computing has been increased there has been lots of research about recognizing human activities to provide services in this environment. Especially, in mobile environment, contrary to the conventional vision based recognition researches, lots of researches are sensor based recognition. In this paper we propose to recognize the user's activity with multi-modal sensors using hierarchical dynamic Bayesian networks. Dynamic Bayesian networks are trained by the OVR(One-Versus-Rest) strategy. The inferring part of this network uses less calculation cost by selecting the activity with the higher percentage of the result of a simpler Bayesian network. For the experiment, we used an accelerometer and a physiological sensor recognizing eight kinds of activities, and as a result of the experiment we gain 97.4% of accuracy recognizing the user's activity.

Improved Fuzzy Binarization Method with Trapezoid type Membership Function and Adaptive α_cut (사다리꼴 형태의 소속 함수와 동적 α_cut 을이용한 개선된 퍼지 이진화)

  • Woo, Hyun-su;Kim, Kwang-baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.10
    • /
    • pp.1852-1859
    • /
    • 2016
  • The effectiveness of a binarization algorithm in image processing depends on how to eliminate the uncertainty of determining threshold in a reasonable way and on minimizing information loss due to the binarization effect. Fuzzy binarization technique was proposed to handle that uncertainty with fuzzy logic. However, that method is known to be inefficient when the given image has low intensity contrast. In this paper, we propose an improved fuzzy binarization method to overcome such known drawbacks. Our method proposes a trapezoid type fuzzy membership function instead of most-frequently used triangle type one. We also propose an adaptive ${\alpha}$_cut determination policy. Our proposed method has less information loss than other algorithms since we do not use any stretching based preprocessing for enhancing the intensity contrast. In experiment, our proposed method is verified to be more effective in binarization with less information loss for many different types of images with low intensity contrast such as night scenery, lumber scoliosis, and lipoma images.