• Title/Summary/Keyword: computer algorithm

Search Result 12,740, Processing Time 0.036 seconds

A Novel Red Apple Detection Algorithm Based on AdaBoost Learning

  • Kim, Donggi;Choi, Hongchul;Choi, Jaehoon;Yoo, Seong Joon;Han, Dongil
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.265-271
    • /
    • 2015
  • This study proposes an algorithm for recognizing apple trees in images and detecting apples to measure the number of apples on the trees. The proposed algorithm explores whether there are apple trees or not based on the number of image block-unit edges, and then it detects apple areas. In order to extract colors appropriate for apple areas, the CIE $L^*a^*b^*$ color space is used. In order to extract apple characteristics strong against illumination changes, modified census transform (MCT) is used. Then, using the AdaBoost learning algorithm, characteristics data on the apples are learned and generated. With the generated data, the detection of apple areas is made. The proposed algorithm has a higher detection rate than existing pixel-based image processing algorithms and minimizes false detection.

Genetic algorithm-based content distribution strategy for F-RAN architectures

  • Li, Xujie;Wang, Ziya;Sun, Ying;Zhou, Siyuan;Xu, Yanli;Tan, Guoping
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.348-357
    • /
    • 2019
  • Fog radio access network (F-RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm-based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F-RAN. First, an F-RAN system model is presented that includes a certain number of randomly distributed fog access points (F-APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F-RANs is described. Third, the details of the proposed optimal genetic algorithm-based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.

Formal Analysis of Distributed Shared Memory Algorithms

  • Muhammad Atif;Muhammad Adnan Hashmi;Mudassar Naseer;Ahmad Salman Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.192-196
    • /
    • 2024
  • The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

Recognition of Car License Plates using Morphological Information and SOM Algorithm

  • Lim, Eun-Kyung;Kim, Young-Ju;Kim, Dae-Su;Kwang-Baek, Kim
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.648-651
    • /
    • 2003
  • In this paper, we propose the recognition system of a license plate using SOM algorithm. The recognition of license plate was investigated by means of the SOM algorithm. The morphological information of horizontal and vertical edges was used to extract a plate region from a car image. In addition, the 4-direction contour tracking algorithm was applied to extract the specific area, which includes characters from an extracted plate area. Therefore, we proposed how to extract license plate region using morphological information and how to recognize the character string using SOM algorithm. In this paper, 50 car images were tested. The extraction rate obtained by the proposed extraction method showed better results than that from the color information of RGB and HSI, respectively. And the license plate recognition using SOM algorithm was very efficient.

  • PDF

A New Least Mean Square Algorithm Using a Running Average Process for Speech Enhancement

  • Lee, Soo-Jeong;Ahn, Chan-Sik;Yun, Jong-Mu;Kim, Soon-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.3E
    • /
    • pp.123-130
    • /
    • 2006
  • The adaptive echo canceller (AEC) has become an important component in speech communication systems, including mobile station. In these applications, the acoustic echo path has a long impulse response. We propose a running-average least mean square (RALMS) algorithm with a detection method for acoustic echo cancellation. Using colored input models, the result clearly shows that the RALMS detection algorithm has a convergence performance superior to the least mean square (LMS) detection algorithm alone. The computational complexity of the new RALMS algorithm is only slightly greater than that of the standard LMS detection algorithm but confers a major improvement in stability.

Accelerating Gaussian Hole-Filling Algorithm using GPU (GPU를 이용한 Gaussian Hole-Filling Algorithm 가속)

  • Park, Jun-Ho;Han, Tack-Don
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.07a
    • /
    • pp.79-82
    • /
    • 2012
  • 3차원 멀티미디어 서비스에 대한 관심이 높아짐에 따라 관련 연구들이 현재 다양하게 논의되고 있다. Stereoscopy영상을 생성하기 위한 기존의 방법으로는 두 대의 촬영용 카메라를 일정한 간격으로 띄워놓고 피사체를 촬영한 후 해당 좌시점과 우시점을 생성하는 방법을 이용하였다. 하지만 이는 영상 대역폭의 부담을 가져오게 된다. 이를 해결하기 위하여 Depth정보와 한 장의 영상을 이용한 DIBR(Depth Image Based Rendering) Algorithm에 대한 연구가 많이 이루어지고 있다. 그중 Gaussian Depth Map을 이용한 Hole-Filling 방법은 DIBR에서 가장 자연스러운 결과를 보여주지만 다른 DIBR Algorithm들에 비해 속도가 현저히 느리다는 단점이 있다. 본 논문에서는 영상 생성의 고속화를 위해 GPU를 이용한 Gaussian Hole-Filling Algorithm의 병렬처리 구조를 제안하고 이를 이용한 DIBR Algorithm 생성과정을 제시한다.

  • PDF

Operation Technology of PV-ESS Integrated Module for DC Micro Grid with Constant Power Tracking Algorithm (일정 전력 추종 알고리즘이 적용된 DC 마이크로 그리드용 PV-ESS 통합형 모듈의 운영 기술)

  • Ryu, Kyung;Kim, Jun-Mo;Lee, Jeong;Won, Chung-Yuen
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.25 no.6
    • /
    • pp.433-441
    • /
    • 2020
  • This study proposes a constant power tracking algorithm to compensate for the intermittent characteristics of Photovoltaic connected to a DC micro grid. A PV-ESS integrated module in which distributed ESS is additionally connected is utilized for the proposed algorithm. PV performs P&O MPPT control at all times. To supplement the intermittent characteristics of PV, the proposed constant power tracking algorithm maintains constant power by operating the distributed ESS of the PV-ESS integrated module in accordance with the output state of the PV. By performing PSIM simulation and an experiment, this study verifies the performance of the integrated module of PV-ESS for DC micro grids applying the constant power tracking algorithm.

An Optimized Iterative Semantic Compression Algorithm And Parallel Processing for Large Scale Data

  • Jin, Ran;Chen, Gang;Tung, Anthony K.H.;Shou, Lidan;Ooi, Beng Chin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2761-2781
    • /
    • 2018
  • With the continuous growth of data size and the use of compression technology, data reduction has great research value and practical significance. Aiming at the shortcomings of the existing semantic compression algorithm, this paper is based on the analysis of ItCompress algorithm, and designs a method of bidirectional order selection based on interval partitioning, which named An Optimized Iterative Semantic Compression Algorithm (Optimized ItCompress Algorithm). In order to further improve the speed of the algorithm, we propose a parallel optimization iterative semantic compression algorithm using GPU (POICAG) and an optimized iterative semantic compression algorithm using Spark (DOICAS). A lot of valid experiments are carried out on four kinds of datasets, which fully verified the efficiency of the proposed algorithm.

An Improvement of Bin-slotted Anti-collision Algorithm for Ubiquitous ID System

  • Kim Ji-Yoon;Kang Bong-Soo;Yang Doo-Yeong
    • International Journal of Contents
    • /
    • v.2 no.1
    • /
    • pp.34-38
    • /
    • 2006
  • In this paper, an overview of anti-collision algorithm for RFID system of a standard EPC Class1 protocol is presented, and the binslotted dynamic search algorithm (BDS) based upon the slotted ALOHA and binary tree procedure is proposed and analyzed. Also, the performance is evaluated as comparing the BDS algorithm with the standard bin-slotted algorithm (BSA) through the simulation program. The performance of the proposed BDS algorithm is improved by dynamically identifying the collided-bit position and the collided bins stored in the stack of the reader. As the results, the number of request command that a reader send to tags in the reader s interrogation zone and the total recognition time are decreased to 59% as compared with BSA algorithm. Therefore, the tag identification performance is fairly improved by resolving a collision problem using the proposed BDS algorithm.

  • PDF

Design of optimal BPCGH using combination of GA and SA Algorithm (GA와 SA 알고리듬의 조합을 이용한 최적의 BPCGH의 설계)

  • 조창섭;김철수;김수중
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.468-475
    • /
    • 2003
  • In this Paper, we design an optimal binary phase computer generated hologram for Pattern generation using combined genetic algorithm and simulated annealing algorithm together. To design an optimal binary phase computer generated hologram, in searching process of the proposed method, the simple genetic algorithm is used to get an initial random transmittance function of simulated annealing algorithm. Computer simulation shows that the proposed algorithm has better performance than the genetic algorithm or simulated annealing algorithm of terms of diffraction efficiency