• Title/Summary/Keyword: vector computer

Search Result 2,007, Processing Time 0.055 seconds

An Efficient Vehicle Image Compensation Algorithm based on Histogram Equalization (히스토그램 균등화 기반의 효율적인 차량용 영상 보정 알고리즘)

  • Hong, Sung-Il;Lin, Chi-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.2192-2200
    • /
    • 2015
  • In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.

Speech Recognition Accuracy Prediction Using Speech Quality Measure (음성 특성 지표를 이용한 음성 인식 성능 예측)

  • Ji, Seung-eun;Kim, Wooil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.471-476
    • /
    • 2016
  • This paper presents our study on speech recognition performance prediction. Our initial study shows that a combination of speech quality measures effectively improves correlation with Word Error Rate (WER) compared to each speech measure alone. In this paper we demonstrate a new combination of various types of speech quality measures shows more significantly improves correlation with WER compared to the speech measure combination of our initial study. In our study, SNR, PESQ, acoustic model score, and MFCC distance are used as the speech quality measures. This paper also presents our speech database verification system for speech recognition employing the speech measures. We develop a WER prediction system using Gaussian mixture model and the speech quality measures as a feature vector. The experimental results show the proposed system is highly effective at predicting WER in a low SNR condition of speech babble and car noise environments.

Learning Networks for Learning the Pattern Vectors causing Classification Error (분류오차유발 패턴벡터 학습을 위한 학습네트워크)

  • Lee Yong-Gu;Choi Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.77-86
    • /
    • 2005
  • In this paper, we designed a learning algorithm of LVQ that extracts classification errors and learns ones and improves classification performance. The proposed LVQ learning algorithm is the learning Networks which is use SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of LVQ. To extract pattern vectors which cause classification errors, we proposed the error-cause condition, which uses that condition and constructed the pattern vector space which consists of the input pattern vectors that cause the classification errors and learned these pattern vectors , and improved performance of the pattern classification. To prove the performance of the proposed learning algorithm, the simulation is performed by using training vectors and test vectors that are Fisher' Iris data and EMG data, and classification performance of the proposed learning method is compared with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional classification.

  • PDF

Design of Systolic Array for High Speed Processing of Block Matching Motion Estimation Algorithm (블록 정합 움직임추정 알고리즘의 고속처리를 위한 시스토릭 어레이의 설계)

  • 추봉조;김혁진;이수진
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.2
    • /
    • pp.119-124
    • /
    • 1998
  • Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

  • PDF

An Energy Efficient Routing Protocol using MAC-layer resources in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 MAC 계층 자원을 이용한 에너지 효율 라우팅 프로토콜)

  • Yoo, Dae-Hun;Choi, Woong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.219-228
    • /
    • 2007
  • End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

  • PDF

A Survey on Oil Spill and Weather Forecast Using Machine Learning Based on Neural Networks and Statistical Methods (신경망 및 통계 기법 기반의 기계학습을 이용한 유류유출 및 기상 예측 연구 동향)

  • Kim, Gyoung-Do;Kim, Yong-Hyuk
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.10
    • /
    • pp.1-8
    • /
    • 2017
  • Accurate forecasting enables to effectively prepare for future phenomenon. Especially, meteorological phenomenon is closely related with human life, and it can prevent from damage such as human life and property through forecasting of weather and disaster that can occur. To respond quickly and effectively to oil spill accidents, it is important to accurately predict the movement of oil spills and the weather in the surrounding waters. In this paper, we selected four representative machine learning techniques: support vector machine, Gaussian process, multilayer perceptron, and radial basis function network that have shown good performance and predictability in the previous studies related to oil spill detection and prediction in meteorology such as wind, rainfall and ozone. we suggest the applicability of oil spill prediction model based on machine learning.

Effect of Discrete Walsh Transform in Metamodel-assisted Genetic Algorithms (이산 월시 변환이 메타모델을 사용한 유전 알고리즘에 미치는 영향)

  • Yu, Dong-Pil;Kim, Yong-Hyuk
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.12
    • /
    • pp.29-34
    • /
    • 2019
  • If it takes much time to calculate the fitness of the solution in genetic algorithms, it is essential to create a metamodel. Much research has been completed to improve the performance of metamodels. In this study, we tried to get a better performance of metamotel using discrete Walsh transform in discrete domain. We transforms the basis of the solution and creates a metamodel using the transformed solution. We experimented with NK-landscape, a representative function of the pseudo-boolean function, and provided empirical evidence on the performance of the proposed model. When we performed the genetic algorithm using the proposed model, we confirmed that the genetic algorithm found a better solution. In particular, our metamodel showed better performance than that using the radial basis function network that modified the similarity function for the discrete domain.

Blocking Artifacts Detection in Frequency Domain for Frame Rate Up-conversion (프레임율 변환을 위한 주파수 영역에서의 블로킹 현상 검출)

  • Kim, Nam-Uk;Jun, Dongsan;Lee, Jinho;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.472-483
    • /
    • 2016
  • This paper proposes a blocking artifacts detection algorithm in frequency domain for MC-FRUC (Motion Compensated Frame Rate Up-Conversion). Conventional MC-FRUC algorithms occur blocking artifacts near interpolated block boundaries since motion compensation is performed from block-based motion vector. For efficiently decreasing blocking artifacts, this paper analyses frequency characteristics of the interpolated frame and reduces blocking artifacts on block boundaries. In experimental results the proposed method shows better subjective quality than some conventional FRUC method and also increases the PSNR(Peak Signal to Noise Ratio) value on average 0.45 dB compared with BDMC(Bi-Directional Motion Compensation).

A Study on Speech Recognition using DMS Model (DMS 모델을 이용한 음성인식에 관한 연구)

  • An, Tae-Ock;Byun, Yong-Kyu
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.2E
    • /
    • pp.41-50
    • /
    • 1994
  • This paper proposes a DMS(Dynamic Multi-Section) model based on the information of the similar features in word pattern. This model represents each word as a time series of several sections and each section implies duration time information and typical feature vectors. The procedure to make a model in the word pattern is that typical feature vector and duration time information are reflected in the distance, when matching between word pattern and model is repeated. As the result of it, the accumulated distance by matching is to be minimized.

  • PDF

Fast Block-Matching Motion Estimation Using Constrained Diamond Search Algorithm (구속조건을 적용한 다이아몬드 탐색 알고리즘에 의한 고속블록정합움직임추정)

  • 홍성용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.13-20
    • /
    • 2003
  • Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

  • PDF