• Title/Summary/Keyword: abstracting algorithm

Search Result 14, Processing Time 0.038 seconds

A Search for Analogous Patients by Abstracting the Results of Arrhythmia Classification (부정맥 분류 결과의 축약에 기반한 유사환자 검색기)

  • Park, Juyoung;Kang, Kyungtae
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.7
    • /
    • pp.464-469
    • /
    • 2015
  • Long-term electrocardiogram data can be acquired by linking a Holter monitor to a mobile phone. However, most systems are designed to detect arrhythmia through heartbeat classification, and not just for supporting clinical decisions. In this paper, we propose an Abstracting algorithm, and introduce an analogous pateint search system using this algorithm. An analogous patient searcher summarizes each patient's typical pattern using the results of heartbeat, which can greatly simplify clinical activity. It helps to find patients with similar arrhythmia patterns, which can help in contributing to diagnostic clues. We have simulated these processes on data from the MIT-BIH arrhythmia database. As a result, the Abstracting algorithm provided a typical pattern to assist in reaching rapid clinical decisions for 64% of the patients. On an average, typical patterns and results generated by the abstracting algorithm summarized the results of heartbeat classification by 98.01%.

Video Abstracting Using Scene Change Detection and Shot Clustering for Construction of Efficient Video Database (대용량 비디오 데이터베이스 구축을 위하여 장면전환 검출과 샷 클러스터링을 이용한 비디오 개요 추출)

  • Shin Seong-Yoon;Pyo Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.2 s.40
    • /
    • pp.111-119
    • /
    • 2006
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with $\chi2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

Video Abstracting Construction of Efficient Video Database (대용량 비디오 데이터베이스 구축을 위한 비디오 개요 추출)

  • Shin Seong-Yoon;Pyo Seong-Bae;Rhee Yang-Won
    • KSCI Review
    • /
    • v.14 no.1
    • /
    • pp.255-264
    • /
    • 2006
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with ${\chi}^2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

Video Abstracting Using Scene Change Detection and Sho Clustering for Construction of Efficient Video Database (비디오 데이터베이스 구축을 위하여 장면전환 검출과 샷 클러스터링을 이용한 비디오 개요 추출)

  • 표성배
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.4
    • /
    • pp.75-82
    • /
    • 2002
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper Propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with χ2 histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

J2dpathway: A Global Metabolic Pathway Viewer with Node-Abstracting Features

  • Song, Eun-Ha;Ham, Seong-Il;Yang, San-Duk;Rhie, A-Rang;Park, Hyun-Seok;Lee, Sang-Ho
    • Genomics & Informatics
    • /
    • v.6 no.2
    • /
    • pp.68-71
    • /
    • 2008
  • The static approach of representing metabolic pathway diagrams offers no flexibility. Thus, many systems adopt automatic graph layout techniques to visualize the topological architecture of pathways. There are weaknesses, however, because automatically drawn figures are generally difficult to understand. The problem becomes even more serious when we attempt to visualize all of the information in a single, big picture, which usually results in a confusing diagram. To provide a partial solution to this thorny issue, we propose J2dpathway, a metabolic pathway atlas viewer that has node-abstracting features.

Reward Shaping for a Reinforcement Learning Method-Based Navigation Framework

  • Roland, Cubahiro;Choi, Donggyu;Jang, Jongwook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.9-11
    • /
    • 2022
  • Applying Reinforcement Learning in everyday applications and varied environments has proved the potential of the of the field and revealed pitfalls along the way. In robotics, a learning agent takes over gradually the control of a robot by abstracting the navigation model of the robot with its inputs and outputs, thus reducing the human intervention. The challenge for the agent is how to implement a feedback function that facilitates the learning process of an MDP problem in an environment while reducing the time of convergence for the method. In this paper we will implement a reward shaping system avoiding sparse rewards which gives fewer data for the learning agent in a ROS environment. Reward shaping prioritizes behaviours that brings the robot closer to the goal by giving intermediate rewards and helps the algorithm converge quickly. We will use a pseudocode implementation as an illustration of the method.

  • PDF

Power-based Side-Channel Analysis Against AES Implementations: Evaluation and Comparison

  • Benhadjyoussef, Noura;Karmani, Mouna;Machhout, Mohsen
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.4
    • /
    • pp.264-271
    • /
    • 2021
  • From an information security perspective, protecting sensitive data requires utilizing algorithms which resist theoretical attacks. However, treating an algorithm in a purely mathematical fashion or in other words abstracting away from its physical (hardware or software) implementation opens the door to various real-world security threats. In the modern age of electronics, cryptanalysis attempts to reveal secret information based on cryptosystem physical properties, rather than exploiting the theoretical weaknesses in the implemented cryptographic algorithm. The correlation power attack (CPA) is a Side-Channel Analysis attack used to reveal sensitive information based on the power leakages of a device. In this paper, we present a power Hacking technique to demonstrate how a power analysis can be exploited to reveal the secret information in AES crypto-core. In the proposed case study, we explain the main techniques that can break the security of the considered crypto-core by using CPA attack. Using two cryptographic devices, FPGA and 8051 microcontrollers, the experimental attack procedure shows that the AES hardware implementation has better resistance against power attack compared to the software one. On the other hand, we remark that the efficiency of CPA attack depends statistically on the implementation and the power model used for the power prediction.

The Character Area Extraction and the Character Segmentation on the Color Document (칼라 문서에서 문자 영역 추출믹 문자분리)

  • 김의정
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.9 no.4
    • /
    • pp.444-450
    • /
    • 1999
  • This paper deals with several methods: the clustering method that uses k-means algorithm to abstract the area of characters on the image document and the distance function that suits for the HIS coordinate system to cluster the image. For the prepossessing step to recognize this, or the method of characters segmentate, the algorithm to abstract a discrete character is also proposed, using the linking picture element. This algorithm provides the feature that separates any character such as the touching or overlapped character. The methods of projecting and tracking the edge have so far been used to segment them. However, with the new method proposed here, the picture element extracts a discrete character with only one-time projection after abstracting the character string. it is possible to pull out it. dividing the area into the character and the rest (non-character). This has great significance in terms of processing color documents, not the simple binary image, and already received verification that it is more advanced than the previous document processing system.

  • PDF

Cast-Shadow Elimination of Vehicle Objects Using Backpropagation Neural Network (신경망을 이용한 차량 객체의 그림자 제거)

  • Jeong, Sung-Hwan;Lee, Jun-Whoan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.1
    • /
    • pp.32-41
    • /
    • 2008
  • The moving object tracking in vision based observation using video uses difference method between GMM(Gaussian Mixture Model) based background and present image. In the case of racking object using binary image made by threshold, the object is merged not by object information but by Cast-Shadow. This paper proposed the method that eliminates Cast-Shadow using backpropagation Neural Network. The neural network is trained by abstracting feature value form training image of object range in 10-movies and Cast-Shadow range. The method eliminating Cast-Shadow is based on the method distinguishing shadow from binary image, its Performance is better(16.2%, 38.2%, 28.1%, 22.3%, 44.4%) than existing Cast-Shadow elimination algorithm(SNP, SP, DNM1, DNM2, CNCC).

  • PDF

Rainfall-Runoff Analysis of River Basin Using Spatial Data (지형공간 특성자료를 이용한 하천유역의 강우-유출해석)

  • 안승섭;이증석;도준현
    • Journal of Environmental Science International
    • /
    • v.12 no.9
    • /
    • pp.949-955
    • /
    • 2003
  • The subject basin of the research was the basin of Yeongcheon Dam located in the upper reaches of the Kumho River. The parameters of the model were derived from the results of abstracting topological properties out of rainfall-runoff observation data about heavy rains and Digital Elevation Modeling(DEM) materials. This research aimed at suggesting the applicability of the CELLMOD Model, a distribution-type model, in interpreting runoff based on the topological properties of a river basin, by carrying out runoff interpretation far heavy rains using the model. To examine the applicability of the model, the calculated peaking characteristics in the hydrograph was analyzed in comparison with observed values and interpretation results by the Clark Model. According to the result of analysis using the CELLMOD Model proposed in the present research for interpreting the rainfall-runoff process, the model reduced the physical uncertainty in the rainfall-runoff process, and consequently, generated improved results in forecasting river runoff. Therefore it was concluded that the algorithm is appropriate for interpreting rainfall-runoff in river basins. However, to enhance accuracy in interpreting rainfall-runoff it is necessary to supplement heavy rain patterns in subject basins and to subdivide a basin into minor basins for analysis. In addition, it is necessary to apply the model to basins that have sufficient observation data, and to identify the correlation between model parameters and the basin characteristics(channel characteristics).