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

Search Result 132, Processing Time 0.022 seconds

Using a Greedy Algorithm for the Improvement of a MapReduce, Theta join, M-Bucket-I Heuristic (그리디 알고리즘을 이용한 맵리듀스 세타조인 M-Bucket-I 휴리스틱의 개선)

  • Kim, Wooyeol;Shim, Kyuseok
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.229-236
    • /
    • 2016
  • Theta join is one of the essential and important types of queries in database systems. As the amount of data needs to be processed increases, processing theta joins with a single machine becomes impractical. Therefore, theta join algorithms using distributed computing frameworks have been studied widely. Although one of the state-of-the-art theta-join algorithms uses M-Bucket-I heuristic, it is hard to use since running time of M-Bucket-I heuristic, which computes a mapping from a record to a reducer (i.e., reducer mapping), is O(n) where n is the size of input data. In this paper, we propose MBI-I algorithm which reduces the running time of M-Bucket-I heuristic to $O(r_{max}log\;n)$ and gives the same result as M-Bucket-I heuristic does. We also conducted several experiments to show algorithm and confirmed that our algorithm can improve the performance of a theta join by 10%.

Excitation Enhancement Based on a Selective-Band Harmonic Model for Low-Bit-Rate Code-Excited Linear Prediction Coders (저전송률 코드여기 선형 예측 부호화기를 위한 선택적 대역 하모닉 모델 기반 여기신호 개선 알고리즘)

  • Lee, Mi-Suk;Kim, Hong-Kook;Choi, Seung-Ho;Kim, Do-Young
    • Speech Sciences
    • /
    • v.11 no.2
    • /
    • pp.259-269
    • /
    • 2004
  • In this paper, we propose a new excitation enhancement technique to improve the speech quality of low bit-rate code-excited linear prediction (CELP) coders. The proposed technique is based on a harmonic model and it is employed only in the decoding process of speech coders without any additional bits. We develop the procedure of harmonic model parameter estimation and harmonic generation, and apply this technique to a current state-of-the-art low bit rate speech coder, ITU-T G.729 Annex D. Also, its performance is measured by using the ITU-T P.862 PESQ score and compared to those of the phase dispersion filter and the long-term postfilter applied to the decoded excitation. It is shown that the proposed excitation enhancement technique can improve the quality of decoded speech and provide better quality for male speech than other techniques.

  • PDF

SIMD Optimization for Improving the Performance of a CPU-Based Graph Engine (SIMD 최적화를 이용한 CPU 기반 그래프 엔진의 성능 개선)

  • Ikhyeon Jo;Myung-Hwan Jang;Sang-Wook Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.05a
    • /
    • pp.383-385
    • /
    • 2023
  • Single-machine-based 그래프 엔진의 state-of-the-art 모델인 RealGraph 는 쓰레드를 이용한 병렬화로 성능을 향상하였으나 쓰레드 내부에서의 병렬성은 고려되지 않았다. 본 논문은 SIMD 명령어를 이용해 RealGraph 의 병렬성을 향상시켰다. 쓰레드 내부의 효율성을 높이기 위해 RealGraph 의 구조와 그래프 알고리즘의 분석을 통한 SIMD 명령어의 적용 가능한 영역을 탐색하였다. 실험으로 SIMD 명령어의 적용을 통해 쓰레드 내부에서 벡터 연산을 수행하여 평균 7.6%, 11.7%, 9.2%의 수행 시간 단축을 이끌어냈으며 SIMD 명령어의 적용이 그래프 엔진의 분석 성능에 얼마나 도움이 될 수 있는지 확인하였다.

A Method to Recover 2D barcodes Contaminated with Dust (2D 바코드의 분진 오염 극복 방법)

  • Ha, Eunjae;Lee, Jaesung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.3
    • /
    • pp.276-281
    • /
    • 2019
  • Food printers must use food ink cartridges approved by the Ministry of Food and Drug Safety (MFDS). A 2D bar code is used to read whether the ink cartridge is authentic. However, since the dye is diverged by heat pressure and printed, the barcode is contaminated. In this paper, we propose a pre-processing algorithm to solve the problem of barcode contamination by food coloring dust in a latte art printer. The algorithm is based on various morphological operations. We apply this algorithm before reading contaminated barcode images with a general QR code reader. It has been confirmed that, as compared with the existing QR code reader, the contamination rate that can be perceived is increased from 25% to 40% and even at a contamination rate of 45%, the recognition rate reaches 50%.

The Study of Visualization for Moving Particles in the Water Using Artificial Neural Network (인공신경망을 이용한 수중 충돌입자의 가시화 연구)

  • Shin Bok-Suk;Je Sung-Kwan;Jin ChunLin;Kim Kwang-baek;Cho Jae-Hyun;Cha Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1732-1739
    • /
    • 2004
  • In this paper, we proposed a visualization system with ANN algorithm that traits the motion of particles that move colliding in the water, where we got a great deal of variable information and predicts the distribution of particles according to the flowing of water and the pattern of their precipitation. We adopted ART2 to detect sensitively the collision between particles in this visualzation. Various particles and their mutual collision influencing the force such as buoyancy force, gravitational force, and the pattern of precipitation are considered in this system. Flowing particles whose motion is changed with the environment can be visualized in the system presented here as they are in real water.

DEVELOPMENT OF IONOSPHERIC TOMOGRAPHY MODEL USING GPS (GPS를 이용한 전리층 토모그래피 모델 개발)

  • Choi Byung-Kyu;Park Jong-Uk;Lee Sang-Jeong
    • Journal of Astronomy and Space Sciences
    • /
    • v.23 no.3
    • /
    • pp.237-244
    • /
    • 2006
  • We produced the electron density distribution in the ionosphere over South Korea using the data from nine permanent GPS (Global Positioning System) stations which have been operated by KASI (Korea Astronomy and Space Science Institute). The dual-frequency GPS receiver data was used to precisely estimate the electron density in the ionosphere and we obtained the precise electron density profile based on two-dimensional TEC (Total Electron Contents). We applied ART (Algebraic Reconstruction Technique), which is one of the most commonly used algorithms to develop the tomography model. This paper presented the electron density distribution over South Korea with time. We compared with the electron density profiles derived from the GPS tomography reconstruction, Ionosonde measurement data obtained by observations, and the IRI-2001 values. As a result, the electron density profile by GPS reconstruction was in excellent agreement with the electron density profile obtained by Ionosonde measurement data.

Digital Watermarking using ART2 Algorithm (ART2 알고리즘을 이용한 디지털 워터마킹)

  • 김철기;김광백
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.81-97
    • /
    • 2003
  • In this paper, we suggest a method of robust watermarking for protection of multimedia data using the wavelet transform and artificial neural network. for the purpose of implementation, we decompose a original image using wavelet transform at level 3. After we classify transformed coefficients of other subbands using neural network except fur the lowest subband LL$_3$, we apply a calculated threshold about chosen cluster as the biggest. We used binary logo watermarks to make sure that it is true or not on behalf of the Gaussian Random Vector. Besides, we tested a method of dual watermark insertion and extraction. For the purpose of implementation, we decompose a original image using wavelet transform at level 3. After we classify transformed coefficients of other subbands using neural network except for the lowest subband LL$_3$, we apply a above mentioned watermark insert method. In the experimental results, we found that it has a good quality and robust about many attacks.

  • PDF

One-to-All and All-to-all Broadcasting Algorithms of Matrix Hypercube (매트릭스 하이퍼큐브의 일-대-다 방송과 다-대-다 방송 알고리즘)

  • Kim, Jongseok;Lee, Heongok
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.8 no.8
    • /
    • pp.825-834
    • /
    • 2018
  • Broadcasting is a basic data communication method for interconnection networks. There are two types of broadcasting. One-to-all broadcasting is to transmit a message from one node to all other nodes and all-to-all broadcasting is to transmit a message from all the nodes that have messages to other nodes. And by the using way of the transmission port per unit time, there are two schemes of broadcasting. Single port telecommunication(SLA) is to transmit messages from one node that contains the messages to one adjacent node only and all port telecommunication(MLA) is to transmit messages from one node to all adjacent nodes within a time of unit. Matrix hypercube is that an interconnection network has improved network cost than that of hypercube with the same number of nodes. In this paper, we analyze broadcasting scheme of matirx hypercube. First, we propose one-to-all and all-to-all broadcasting algorithms of matrix hypercube. And we prove that one-to-all broadcasting times are 2n+1 and $2{\lceil}{\frac{n}{2}}{\rceil}+1$ based on the SLA and MLA models, respectively. Also, we show all-to-all broadcasting time using SLA model is $5{\times}2^{\frac{n}{2}}-2$ when n=even, and is $5{\times}2^{\frac{n-1}{2}}+2$ when n=odd.

Kalman Filter for Estimation of Sensor Acceleration Using Six-axis Inertial Sensor (6축 관성센서를 이용한 센서가속도 추정용 칼만필터)

  • Lee, Jung Keun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.39 no.2
    • /
    • pp.179-185
    • /
    • 2015
  • Although an accelerometer is a sensor that measures acceleration, it cannot be used by itself to measure the acceleration when the orientation of the sensor changes. This paper introduces a Kalman filter for the estimation of a sensor acceleration based on a six-axis inertial sensor (i.e., a three-axis accelerometer and three-axis gyroscope). The novelty of the proposed Kalman filter lies in the fact that its state vector includes not only the tilt angle variable but also the sensor acceleration. Thus, the filter can explicitly estimate the latter with a high accuracy. The accuracy of acceleration estimates were validated experimentally under three different dynamic conditions, using an optical motion capture system. It could be concluded that the performance of the proposed Kalman filter was comparable to that of the state-of-the-art estimation algorithm employed by the Xsens MTw. The proposed algorithm may be more suitable than inertial/magnetic sensor-based algorithms for various applications adopting six-axis inertial sensors.

Non-uniform Deblur Algorithm using Gyro Sensor and Different Exposure Image Pair (자이로 센서와 노출시간이 다른 두 장의 영상을 이용한 비균일 디블러 기법)

  • Ryu, Ho-hyeong;Song, Byung Cheol
    • Journal of Broadcast Engineering
    • /
    • v.21 no.2
    • /
    • pp.200-209
    • /
    • 2016
  • This paper proposes a non-uniform de-blur algorithm using IMU sensor and a long/short exposure-time image pair to efficiently remove the blur phenomenon. Conventional blur kernel estimation algorithms using sensor information do not provide acceptable performance due to limitation of sensor performance. In order to overcome such a limitation, we present a kernel refinement step based on images having different exposure times which improves accuracy of the estimated kernel. Also, in order to figure out the phenomenon that conventional non-uniform de-blur algorithms suffer from severe degradation of visual quality in case of large blur kernels, this paper a homography-based residual de-convolution which can minimize quality degradation such as ringing artifacts during de-convolution. Experimental results show that the proposed algorithm is superior to the state-of-the-art methods in terms of subjective as well as objective visual quality.