• Title/Summary/Keyword: Algorithm composition

Search Result 279, Processing Time 0.023 seconds

Real-time Optimized Composition and Broadcasting of Multimedia Information (다중 미디어 정보의 실시간 최적화 합성 및 방송)

  • Lee, Sang-Yeob;Park, Seong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.177-185
    • /
    • 2012
  • In this paper, we developed the composition system that it can efficiently edit camera recording data, images, office document such as powerpoint data, MS word data etc in real-time and broadcasting system that the file is made by the composition system. In this Study, we developed two kinds of algorithm; Approximate Composition for Optimization (ACFO) and Sequence Composition using Memory Que (SCUMQ). Especially, the system is inexpensive and useful because the system is based on mobile devices and PCs when lectures hope to make video institutional contents. Therefore, it can be contributed for e-learning and m-learning. In addition, the system can be applied to various fields, different kinds of multimedia creation, remote conferencing, and e-commerce.

Decentralization Analysis and Control Model Design for PoN Distributed Consensus Algorithm (PoN 분산합의 알고리즘 탈중앙화 분석 및 제어 모델 설계)

  • Choi, Jin Young;Kim, Young Chang;Oh, Jintae;Kim, Kiyoung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.45 no.1
    • /
    • pp.1-9
    • /
    • 2022
  • The PoN (Proof of Nonce) distributed consensus algorithm basically uses a non-competitive consensus method that can guarantee an equal opportunity for all nodes to participate in the block generation process, and this method was expected to resolve the first trilemma of the blockchain, called the decentralization problem. However, the decentralization performance of the PoN distributed consensus algorithm can be greatly affected by the network transaction transmission delay characteristics of the nodes composing the block chain system. In particular, in the consensus process, differences in network node performance may significantly affect the composition of the congress and committee on a first-come, first-served basis. Therefore, in this paper, we presented a problem by analyzing the decentralization performance of the PoN distributed consensus algorithm, and suggested a fairness control algorithm using a learning-based probabilistic acceptance rule to improve it. In addition, we verified the superiority of the proposed algorithm by conducting a numerical experiment, while considering the block chain systems composed of various heterogeneous characteristic systems with different network transmission delay.

Efficiency Pixel Recomposition Algorithm for Fractional Motion Estimation (부화소 움직임 추정을 위한 효과적인 화소 재구성 알고리즘)

  • Shin, Wang-Ho;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.64-70
    • /
    • 2011
  • In an H.264/AVC video encoder, the motion estimation at fractional pixel accuracy improves a coding efficiency and image quality. However, it requires additional computation overheads for fractional search and interpolation, and thus, reducing the computation complexity of fractional search becomes more important. This paper proposes a Pixel Re-composition Fractional Motion Estimation (PRFME) algorithm for an H.264/AVC video encoder. Fractional Motion Estimation performs interpolation for the overlapped pixels which increases the computational complexity. PRFME can reduce the computational complexity by eliminating the overlapped pixel interpolation. Compared with the fast full search, the proposed algorithm can reduce 18.1% of computational complexity, meanwhile, the maximum PSNR degradation is less than 0.067dB. Therefore, the proposed PRFME algorithm is quite suitable for mobile applications requiring low power and complexity.

Algorithm to Search for the Original Song from a Cover Song Using Inflection Points of the Melody Line (멜로디 라인의 변곡점을 활용한 커버곡의 원곡 검색 알고리즘)

  • Lee, Bo Hyun;Kim, Myung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.5
    • /
    • pp.195-200
    • /
    • 2021
  • Due to the development of video sharing platforms, the amount of video uploads is exploding. Such videos often include various types of music, among which cover songs are included. In order to protect the copyright of music, an algorithm to find the original song of the cover song is essential. However, it is not easy to find the original song because the cover song is a modification of the composition, speed and overall structure of the original song. So far, there is no known effective algorithm for searching the original song of the cover song. In this paper, we propose an algorithm for searching the original song of the cover song using the inflection points of the melody line. Inflection points represent the characteristic points of change in the melody sequence. The proposed algorithm compares the original song and the cover song using the sequence of inflection points for the representative phrase of the original song. Since the characteristics of the representative phrase are used, even if the cover song is a song made by modifying the overall composition of the song, the algorithm's search performance is excellent. Also, since the proposed algorithm uses only the features of the inflection point sequence, the memory usage is very low. The efficiency of the algorithm was verified through performance evaluation.

Research for 3-D Information Reconstruction by Appling Composition Focus Measure Function to Time-series Image (복합초점함수의 시간열 영상적용을 통한 3 차원정보복원에 관한 연구)

  • 김정길;한영준;한헌수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.426-429
    • /
    • 2004
  • To reconstruct the 3-D information of a irregular object, this paper proposes a new method applying the composition focus measure to time-series image. A focus measure function is carefully selected because a focus measure is apt to be affected by the working environment and the characteristics of an object. The proposed focus measure function combines the variance measure which is robust to noise and the Laplacian measure which, regardless of an object shape, has a good performance in calculating the focus measure. And the time-series image, which considers the object shape, is proposed in order to efficiently applying the interesting window. This method, first, divides the image frame by the window. Second, the composition focus measure function be applied to the windows, and the time-series image is constructed. Finally, the 3-D information of an object is reconstructed from the time-series images considering the object shape. The experimental results have shown that the proposed method is suitable algorithm to 3-D reconstruction of an irregular object.

  • PDF

Semi-automation Image segmentation system development of using genetic algorithm (유전자 알고리즘을 이용한 반자동 영상분할 시스템 개발)

  • Im Hyuk-Soon;Park Sang-Sung;Jang Dong-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.283-289
    • /
    • 2006
  • The present image segmentation is what user want to segment image and has been studied for technology in composition of segment object with other images. In this paper, we propose a method of novel semi-automatic image segmentation using gradual region merging and genetic algorithm. Proposed algorithm is edge detection of object using genetic algorithm after selecting object which user want. We segment region of object which user want to based on detection edge using watershed algorithm. We separated background and object in indefinite region using gradual region merge from Segment object. And, we have applicable value which user want by making interface based on GUI for efficient perform of algorithm development. In the experiments, we analyzed various images for proving superiority of the proposed method.

  • PDF

A Study of the 3D Unmanned Remote Surveying for the Curved Semi-Shield Tunneling

  • Lee, Jin-Yi;Jun, Jong-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1791-1796
    • /
    • 2005
  • Semi-shield tunneling is one of the propulsion construction methods used to lay pipes underground between two pits named 'entrance' and 'destination', respectively. Usually a simple composition, such as 'a fiducial target at the entrance+a total station (TS)+a target on the machine', is used to confirm the planned course. However, unavoidable curved sections are present in small-sized pipe lines, which are laid after implementation of a road system, for public works such as waterworks, sewer, electrical power, and gas and communication networks. Therefore, if the planned course has a curved section, it is difficult to survey the course with the abovementioned simple composition. This difficulty could be solved by using the multiple total stations (MTS), which attaches the cross type linear LED target to oneself. The MTS are disposed to where each TS can detect the LED target at the other TS or the base point or the machine. And the accurate relative positions between each MTS and target are calculated from measured data. This research proposes the relative and absolute coordinate calculation algorithm by using three MTS to measure a curved course with 20m curvature at 30m maximum distance, and verifies the algorithm experimentally.

  • PDF

Developing a Multiclass Classification and Intelligent Matching System for Cold Rolled Steel Wire using Machine Learning (머신러닝을 활용한 냉간압조용 선재의 다중 분류 및 지능형 매칭 시스템 개발)

  • K.W. Lee;D.K. Lee;Y.J. Kwon;K.H, Cho;S.S. Park;K.S. Cho
    • Journal of the Korean Society for Heat Treatment
    • /
    • v.36 no.2
    • /
    • pp.69-76
    • /
    • 2023
  • In this study, we present a system for identifying equivalent grades of standardized wire rod steel based on alloy composition using machine learning techniques. The system comprises two models, one based on a supervised multi-class classification algorithm and the other based on unsupervised autoencoder algorithm. Our evaluation showed that the supervised model exhibited superior performance in terms of prediction stability and reliability of prediction results. This system provides a useful tool for non-experts seeking similar grades of steel based on alloy composition.

A Feature Set Selection Approach Based on Pearson Correlation Coefficient for Real Time Attack Detection (실시간 공격 탐지를 위한 Pearson 상관계수 기반 특징 집합 선택 방법)

  • Kang, Seung-Ho;Jeong, In-Seon;Lim, Hyeong-Seok
    • Convergence Security Journal
    • /
    • v.18 no.5_1
    • /
    • pp.59-66
    • /
    • 2018
  • The performance of a network intrusion detection system using the machine learning method depends heavily on the composition and the size of the feature set. The detection accuracy, such as the detection rate or the false positive rate, of the system relies on the feature composition. And the time it takes to train and detect depends on the size of the feature set. Therefore, in order to enable the system to detect intrusions in real-time, the feature set to beused should have a small size as well as an appropriate composition. In this paper, we show that the size of the feature set can be further reduced without decreasing the detection rate through using Pearson correlation coefficient between features along with the multi-objective genetic algorithm which was used to shorten the size of the feature set in previous work. For the evaluation of the proposed method, the experiments to classify 10 kinds of attacks and benign traffic are performed against NSL_KDD data set.

  • PDF

Improvement of Confidence Measure Performance in Keyword Spotting using Background Model Set Algorithm (BMS 알고리즘을 이용한 핵심어 검출기 거절기능 성능 향상 실험)

  • Kim Byoung-Don;Kim Jin-Young;Choi Seung-Ho
    • MALSORI
    • /
    • no.46
    • /
    • pp.103-115
    • /
    • 2003
  • In this paper, we proposed Background Model Set algorithm used in the speaker verification to improve calculating confidence measure(CM) in speech recognition. CM is to display relative likelihood between recognized models and antiphone models. In previous method calculating of CM, we calculated probability and standard deviation using all phonemes in composition of antiphone models. At this process, antiphone CM brought bad recognition result. Also, recognition time increases. In order to solve this problem, we studied about method to reconstitute average and standard deviation using BMS algorithm in CM calculation.

  • PDF