• Title/Summary/Keyword: SWEET 알고리즘

Search Result 14, Processing Time 0.024 seconds

SWEET algorithm을 이용한 탄성매질의 traveltime과 amplitude 계산

  • 차영호;신창수;서정희;임해룡
    • Proceedings of the KSEEG Conference
    • /
    • 2001.04a
    • /
    • pp.115-118
    • /
    • 2001
  • Suppressed Wave equation Estimation of Traveltime (SWEET, Shin et, al., 2000) 알고리즘을 이용하여 등방성 및 이방성 탄성 매질에 대한 ched 주시와 진폭을 계산하는 방법을 개발하였다. SWEET 알고리즘을 2차원 등방성 및 이방성 탄성 매질의 속도 구조에 적용하여 P파의 초동 주시와 진폭을 계산 할 수 있었다. 본 논문에서는 간단한 등방성 균질 탄성 모형, 복잡한 등방성 탄성 모형 및 간단한 이방성 균질 모형에 대한 수치 계산 결과를 보여 줄 것이다.

  • PDF

Sweet Spot Search of Antenna Beam using the Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 안테나 빔의 스위트 스폿 탐색)

  • Eom, Ki-Hwan;Jung, Kyung-Kwon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.47-54
    • /
    • 2005
  • In this paper, we propose a method that search the sweet spot of antenna beam, and keep it for fast speed transmission in millimeter wave on point-to-point link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on point-to-point link.

Loudspeaker Driving Algorithm for Optimal Sweet Spot (최적 Sweet Spot 제공을 위한 스피커 구동 알고리즘)

  • Boo, Jeong-Yong;Choi, Su-Jin;Kim, Ki-Jun;Park, Hochong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.06a
    • /
    • pp.46-49
    • /
    • 2014
  • 본 논문에서는 4개의 스피커를 이용한 음향 재생 환경에서 청취자의 위치에 따라 최적의 sweet spot을 제공하도록 스피커를 구동하는 방법을 제안한다. 먼저 청취자 위치에 대하여 대칭 구조를 가지는 스피커 쌍(pair) 후보들을 선택한다. 다음, ringing 현상을 감소시키기 위하여 앞에서 선택한 스피커 쌍 후보 중에서 스피커 간 간격이 가장 먼 스피커 쌍과 이 스피커 쌍 사이에 있는 모든 스피커를 구동 스피커로 결정한다. 마지막으로, cross-talk cancellation 행렬의 크기를 제한하여 ringing 현상을 감소시킨다. 모의실험을 통해, 청취자 위치가 변할 때 제안하는 스피커 구동 방법을 사용하여 sweet spot 면적이 일정한 수준으로 유지되어 기존 방법에 비하여 성능이 향상된 것을 확인하였다.

  • PDF

Loudspeaker Driving Algorithm for Optimal Sweet Spot in 2-Dimensional Loudspeaker Layout (2차원 스피커 환경에서 최적 Sweet Spot을 제공하는 스피커 구동 알고리즘)

  • Choi, Su-Jin;Boo, Jeong-Yong;Kim, Ki-Jun;Park, Ho-chong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.84-86
    • /
    • 2015
  • 본 논문에서는 2차원으로 배열된 4개의 스피커를 이용한 음향 재생환경에서 청취자의 위치에 따라 최적의 sweet spot을 제공하도록 스피커를 구동하는 방법을 제안한다. 먼저 청취자의 위치를 추적하여 청취자의 귀와 스피커 쌍 후보 사이의 경로의 비율을 구한다. 다음, 청취자의 위치를 고려하여 스피커 쌍 후보들의 스피커 간 거리 비율을 구한다. 마지막으로, 앞서 구한 두 개 거리 비율의 비율이 1에 가까운 스피커 쌍을 구동 스피커로 결정하고 cross-talk cancellation을 음원에 적용하여 청취자에게 제공한다. 모의실험을 통해, 청취자의 위치가 변할 때 제안하는 스피커 구동 방법을 사용하여 기존의 방법보다 청취자에게 넓은 sweet spot을 제공할 수 있음을 확인하였다.

  • PDF

3-D Traveltime and Amplitude Calculation using High-performance Parallel Finite-element Solver (고성능 병렬 유한요소 솔버를 이용한 3차원 주시와 진폭계산)

  • Yang, Dong-Woo;Kim, Jung-Ho
    • Geophysics and Geophysical Exploration
    • /
    • v.7 no.4
    • /
    • pp.234-244
    • /
    • 2004
  • In order to calculate 3-dimensional wavefield using finite-element method in frequency domain, we must factor so huge sparse impedance matrix. Because of difficulties of handling of this huge impedance matrix, 3-dimensional wave equation modeling is conducted mainly in time domain. In this study, we simulate the 3-D wavefield using finite-element method in Laplace domain by combining high-performance parallel finite-element solver and SWEET (Suppressed Wave Equation Estimation of Traveltime) algorithm which can calculate the traveltime and the amplitude. To verify this combination, we applied it to the SEG/EAGE 3D salt model in serial and parallel computing environments.

Sweet Spot Search of Array Antenna Beam (Array 안테나 빔의 스위트 스폿 탐색)

  • Eom, Ki-Hwan;Kang, Seong-Ho;Lee, Chang-Young;NamKung, Wook;Hyun, Kyo-Hwan
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.115-119
    • /
    • 2005
  • In this paper, we propose a method that search the sweet spot of array antenna beam, and keep it for fast speed transmission in millimeter wave on single array antenna link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on single array antenna link.

  • PDF

Beam Control Method of Multiple Array Antenna Using The Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 Multiple Array 안테나의 빔 제어방식)

  • Hyun, Kyo-Hwan;Jung, Kyung-Kwon;Eom, Ki-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.2 s.314
    • /
    • pp.39-45
    • /
    • 2007
  • This paper presents a novel scheme that quickly searches for the sweet spot of multiple array antennas, and locks on to it for high-speed millimeter wavelength transmissions, when communications to another antenna array are disconnected. The proposed method utilizes a modified genetic algorithm, which selects a superior initial group through preprocessing in order to solve the local solution in agenetic algorithm. TDD (Time Division Duplex) is utilized as the transfer method and data controller for the antenna. Once the initial communication is completed for the specific number of individuals, no longer antenna's data will be transmitted until each station processes GA in order to produce the next generation. After reproduction, individuals of the next generation become the data, and communication between each station is made again. Simulation results of 1:1, 1:2, 1:5 array antennas confirmed the efficiency of the proposed method. The 16bit split is 8bit, but it has similar performance as 16bit gene.

A Sweet Persimmon Grading Algorithm using Object Detection Techniques and Machine Learning Libraries (객체 탐지 기법과 기계학습 라이브러리를 활용한 단감 등급 선별 알고리즘)

  • Roh, SeungHee;Kang, EunYoung;Park, DongGyu;Kang, Young-Min
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.6
    • /
    • pp.769-782
    • /
    • 2022
  • A study on agricultural automation became more important. In Korea, sweet persimmon farmers spend a lot of time and effort on classifying profitable persimmons. In this paper, we propose and implement an efficient grading algorithm for persimmons before shipment. We gathered more than 1,750 images of persimmons, and the images were graded and labeled for classifications purpose. Our main algorithm is based on EfficientDet object detection model but we implemented more exquisite method for better classification performance. In order to improve the precision of classification, we adopted a machine learning algorithm, which was proposed by PyCaret machine learning workflow generation library. Finally we acquired an improved classification model with the accuracy score of 81%.

Input Pattern Vector Extraction and Pattern Recognition of Taste using fMRI (fMRI를 이용한 맛의 입력패턴벡터 추출 및 패턴인식)

  • Lee, Sun-Yeob;Lee, Yong-Gu;Kim, Dong-Ki
    • Journal of radiological science and technology
    • /
    • v.30 no.4
    • /
    • pp.419-426
    • /
    • 2007
  • In this paper, the input pattern vectors are extracted and the learning algorithms is designed to recognize taste(bitter, sweet, sour and salty) pattern vectors. The signal intensity of taste are used to compose the input pattern vectors. The SOM(Self Organizing Maps) algorithm for taste pattern recognition is used to learn initial reference vectors and the ot-star learning algorithm is used to determine the class of the output neurons of the sunclass layer. The weights of the proposed algorithm which is between the input layer and the subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVQ(Learning Vector Quantization) algorithm. The pattern vectors are classified into subclasses by neurons in the subclass layer, and the weights between subclass layer and output layer are learned to classify the classified subclass, which is enclosed a class. To classify the pattern vectors, the proposed algorithm is simulated with ones of the conventional LVQ, and it is confirmed that the proposed learning method is more successful classification than the conventional LVQ.

  • PDF

Beam Control of Multiple Array Antenna Using The Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 Multiple Array Antenna의 Beam 제어방식)

  • Hyun, Kyo-Hwan;Jung, Kyung-Kwon;Eom, Ki-hwan
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.921-922
    • /
    • 2006
  • This paper presents a novel scheme that quickly searches for the sweet spot of multiple array antennas, and locks on to it for high-speed millimeter wavelength transmissions. The proposed method utilizes a modified genetic algorithm, which selects a superior initial group through preprocessing in order to solve the local solution in a genetic algorithm. TDD (Time Division Duplex) is utilized as the transfer method and data controller for the antenna. Once the initial communication is completed for the specific number of individuals, no longer antenna's data will be transmitted until each station processes GA in order to produce the next generation. After reproduction, individuals of the next generation become the data, and communication between each station is made again. Simulation results confirmed the efficiency of the proposed method.

  • PDF