• Title/Summary/Keyword: 최대최소 알고리듬

Search Result 41, Processing Time 0.028 seconds

Numerical Prediction of three-Dimensional Extrudate Swell (3차원 압출팽창에 대한 수치모사 연구)

  • 이성재;이승종
    • The Korean Journal of Rheology
    • /
    • v.2 no.2
    • /
    • pp.35-44
    • /
    • 1990
  • 자유표면 유동을 수반하여 복잡한 구조를 지나는 유동문제를 수치모사할 수 있는 삼차원 유한요소법코드를 개발하였다. 정사각관을 대상으로 하는 삼차원 압출팽창 문제를 등온 뉴톤 유동뿐만아니라 비뉴톤유동 및 비등온 유동문제의 경우까지 다룰수 있도록 확장 하여 수치모사하였다. 삼차원 유한요소법 알고리듬에 pathline approach 방법과 사상방법을 적용시켜 등온 뉴톤 유체의 미동흐름에 대하여 압출 팽창문제를 푼 결과 팽창비가 대칭면에 서 최대 21.0%관의 모서리 부분에서 최소 4.1%로 나타났다 전단박화현상이 있는 비뉴톤 유 동의 경우 뉴톤유동에 비해 팽창이 작게 일어났고 비등온 유동의 경우 관벽온도가 낮은 쪽 이 높은 쪽에 비해 팽창이 크게 일어남을 알수 있었다.

  • PDF

Implementation of Real Time 3 channel Transmission System Using ECG Data Compression Algorithm by Max-Min Slope Update (최대 및 최소 기울기 갱신에 의한 ECG 압축 알고리듬을 이용한 실시간 3채널 전송시스템 구현)

  • 조진호;김명남
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.3
    • /
    • pp.271-278
    • /
    • 1995
  • An ECG data compression algorithM using max-min slope update is proposed and a real time 3 channel ECG transmission system is implemented using the proposed algorithm. In order to effectively compress ECG data, we compare a threshold value with the max-min slope difference (MMSD) which is updated at each sample values. If this MMSD value is smaller than the threshold value, then the data is compressed. Conversely, when the MMSD value is larger than threshold value, the data is transmitted after storing the value and the length between the data which is beyond previous threshold level. As a result, it can accurately compress both the region of QRS, P, and T wave that has fast-changing and the region of the base line that slope is changing slow. Therefore, it Is possible to enhance the compression rate and the percent roms difference. In addition, because of the simplicity, this algorithm is more suitable for real-time implementation.

  • PDF

An Edge Enhancement Algorithm using Morphological Processing (형태학적 처리를 이용한 윤곽선의 선명도 향상 알고리듬)

  • 남진우
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.109-112
    • /
    • 2000
  • 고역의 주파수 성분이 감쇠되어 선명도가 저하된 이미지나 선형 보간법에 의해 확대된 이미지의 계단모양 왜곡을 감소시킴으로써 경계선의 선명도가 저하된 이미지들을 위해 형태학적 처리(morphological processing)에 의한 이미지 윤곽선의 선명도를 향상시키는 방법을 제안하였다. 본 논문에서는 블러링(blurring)된 이미지를 화소의 명암에 따라 다수개의 평판 이미지(slice image)로 나누고 각 평판 이미지에 대해 반복적인 최대/최소값 필터(min/max filter)의 적용으로 얻어진 윤곽선의 중심을 기준으로 하여 팽창(dilation)과 침식(erosion)을 수행함으로 이미지의 윤곽선에서의 명암 변화에 대한 경사도를 크게 만들고 이로써 이미지 윤곽선의 선명도를 향상시키는 방법을 사용하였으며 모의 시험결과를 통하여 고역 주파수 강조에 의한 방법에 비하여 인위적인 잡음(artifact)없이 효과적으로 선명도를 향상시킬 수 있음을 보였다.

  • PDF

Object Recognition using Multiple Local Features (로컬영역에서 다중 특징을 이용한 물체인식)

  • 최경영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.604-606
    • /
    • 2003
  • 본 논문은 향상된 Scale Invariant Feature Transform (SIFT) 기법과 이로부터 얻어진 로컬 특징 영역에서 다중특징을 이용한 물체인식 방법에 대하여 논하였다. SIFT 기법 [1]은 물체의 크기. 회전. 3차원 좌표변환에 강인한 특성을 갖는다. 이 기법에서는 크기가 다른 가우시안 (Gaussian) 함수를 적용한 영상들의 차이에서의 최대 및 최소값이 특징점으로 결정된다. 하지만 SIFT 알고리듬의 특성상, 인식되어야 될 물체의 비교적 큰 크기 변화, 중요도가 낮은 특징점들의 추출, 그리고 서로 다른 물체에서 추출된 유사한 특징벡터등이 인식 시스템의 신뢰도를 저하 시킬 수 있다. 이에 대응방안으로, 본 논문에서는 상대적으로 낮은 인식정보를 갖는 추출된 특징점을 제거하기 위한 기법과 서로 다른 물체에서 생성된 유사 특징벡터의 구분을 위한 특징점에서의 방위 (orientation) 비교법 및 색차 (chrominance) 정보를 사용에 대하여 기술하였다.

  • PDF

Development of Cardiac Digital Subtraction Angiographic System for Diagnosis of Cardiac Diseases (심장병 진단을 위한 실시간 디지탈 감산 조영 영상기법의 개발)

  • Min, Byoung-Goo;Lee, Tae-Soo
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.132-139
    • /
    • 1989
  • We have designed a real-time Cardiac digital substraction angiography system (C-DSA) and tested the system for the diagnosis of Cardiac patients. The system was developed by interfacing a radiographic angiography system to a computerized motional image analysis system. This new cardiac DSA can perform the real time processing of averaging and subtraction of the 32 image frames to measure the volume changes of the left ventricle after elimination of motional artrifacts, caused by the heart contraction of beats per minute in average. Each frame has a resolution of 512 x 512 pixels and 256 gray levels. Two image data with maximal and minimal volume were moved to the interfaced IBM PC computer system by high speed computer link line for computation of the heart's contraction parameters. First, the boundary of the left ventricule was detected using a dynamic programming of the gray levels, and its volume was computered to determine the parameters, such as the maximal volume of end-diastolic volume (EDV), the minimal volume of end systolic volume (ESV), and ejection fraction (EF).

  • PDF

Automatic Determination of the Azimuth Angle of Reflectors in Borehole Radar Reflection Data Using Direction-finding Antenna (방향탐지 안테나를 이용한 시추공 레이다 반사법 탐사에 있어서 반사층 방위각의 자동 결정)

  • Kim Jung-Ho;Cho Seong-Jun;Yi Myeong-Jong;Chung Seung-Hwan
    • Geophysics and Geophysical Exploration
    • /
    • v.1 no.3
    • /
    • pp.176-182
    • /
    • 1998
  • The borehole radar reflection survey can image the underground structure with high resolution, however, we cannot get any information on the orientation of the reflectors with dipole antenna alone. The direction-finding antenna system is commonly used to give the solution to the problem. However, the interpretation of the data from direction- finding antenna may be time-consuming, and sometimes have ambiguities in the sense of precise determination of the azimuth. To solve the problem, we developed the automatic azimuth finding scheme of reflectors in borehole radar reflection data using direction-finding antenna. The algorithm is based on finding the azimuthal angle possibly showing the maximum reflection amplitude in the least-squared error sense. The developed algorithm was applied to the field data acquired in quarry mine. It was possible to locate nearly all of the reflectors in three dimensional fashion, which coincide with the known geological structures and man-made discontinuities.

  • PDF

Tooth Region Segmentation by Oral Cavity Model and Watershed Algorithm (구강구조모델과 워터쉐드를 이용한 치아영역 분할)

  • Na, S.D.;Lee, G.H.;Lee, J.H.;Kim, M.N.
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.10
    • /
    • pp.1135-1146
    • /
    • 2013
  • In this paper, we proposed a new algorithm for individual tooth region segmentation on tooth color images. The proposed algorithm used oral cavity model based on structural feature of tooth and new boundary of watershed algorithm. First, the gray scale image is obtained with emphasized tooth regions from the color images and unnecessary regions are removed on tooth images. Next, the image enhancement of tooth images is implemented using the proposed oral cavity model, and the individual tooth regions are segmented by watershed algorithm on the enhanced images. Boundary and seeds necessary to watershed algorithm are applied boundary of binary image using minimum thresholding and region maximum value. In order to evaluate performance of proposed algorithm, we conduct experiment to compare conventional algorithm with proposed algorithm. As a result of experiment, we confirmed that the proposed algorithm is more improved detection ratio than conventional algorithm at molar regions and the tooth region detection performance is improved by preventing overlap detection on oral cavity.

Resource Allocation Algorithm for Throughput Enhancement in IEEE 802.11e (IEEE 802.11e의 전송률 향상을 위한 자원할당 알고리듬)

  • Joung, Soo-Kyoung;Park, In-Kap
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.63-70
    • /
    • 2010
  • In IEEE 802.11e system providing differentiated services, there exist some problems as follows; collision probability increase due to the increase in the number of nodes by employing CSMA/CA transmission mode, transmission speed declining tendency towards the worst of it, which is caused by different transmission mode and decrease of TCP transmission rate as the result of the link occupancy by UDP when TCP shares the link with UDP by the TCP’s flow control characteristic. In this thesis, the initial minimum and maximum CW are set differently according to the number of connected nodes in the network to avoid collisions and TXOP is adjusted according to the channel state, in which ACs with low priority but better channel state will get gradually more chances to transmit leading to optimal channel capacity. Also, by allowing higher priority for ACK frames which control the TCP transmission, the flow control becomes better because that reduces the channel occupancy by UDP flow, and by this, fair transmission is obtained from the result of the more fair transmission and active resource allocation.

Low Power Force-Directed scheduling for Optimal module selection Architecture Synthesis (최적 모듈 선택 아키텍쳐 합성을 위한 전력 감소 Force-Directed 스케쥴링)

  • Choi, Ji-Young;Kim, Hi-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.1091-1100
    • /
    • 2004
  • In this paper, we present a reducing power conswnption of a scheduling for module selection under the time constraint. The proposed low power scheduling executes FDS_LP considering low power to exist the FDS scheduling by inputted the behavioral language. The proposed FDS_LP perfonns lower power consumption with dynamic power which is minimized the switching activity, based on force conception In the time step of module selection, an optimal RT(Register Transfer) library is composed by exploration of the parameters such as power, area, and delay. To find optimal parameters of RT library, an optimal module selection algorithm using Branch and Bound algorithm is also proposed. In the comparison and experimental results, The proposed FDS_LP algorithm reduce maximum power saving up to 23.9% comparing to previous FDS algorithm.

An analysis of the effects of LLR approximation on LDPC decoder performance (LLR 근사화에 따른 LDPC 디코더의 성능 분석)

  • Na, Yeong-Heon;Jeong, Sang-Hyeok;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.405-409
    • /
    • 2009
  • In this paper, the effects of LLR (Log-Likelihood Ratio) approximation on LDPC (Low-Density Parity-Check) decoder performance are analyzed, and optimal design conditions of LDPC decoder are derived. The min-sum LDPC decoding algorithm which is based on an approximation of LLR sum-product algorithm is modeled and simulated by MATLAB, and it is analyzed that the effects of LLR approximation bit-width and maximum iteration cycles on the bit error rate (BER) performance of LDCP decoder. The parity check matrix for IEEE 802.11n standard which has block length of 1,944 bits and code rate of 1/2 is used, and AWGN channel with QPSK modulation is assumed. The simulation results show that optimal BER performance is achieved for 7 iteration cycles and LLR bit-width of (7,5).

  • PDF