• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.032 seconds

A Sclable Parallel Labeling Algorithm on Mesh Connected SIMD Computers (메쉬 구조형 SIMD 컴퓨터 상에서 신축적인 병렬 레이블링 알고리즘)

  • 박은진;이갑섭성효경최흥문
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.731-734
    • /
    • 1998
  • A scalable parallel algorithm is proposed for efficient image component labeling with local operatos on a mesh connected SIMD computer. In contrast to the conventional parallel labeling algorithms, where a single pixel is assigned to each PE, the algorithm presented here is scalable and can assign m$\times$m pixel set to each PE according to the input image size. The assigned pixel set is converted to a single pixel that has representative value, and the amount of the required memory and processing time can be highly reduced. For N$\times$N image, if m$\times$m pixel set is assigned to each PE of P$\times$P mesh, where P=N/m, the time complexity due to the communication of each PE and the computation complexity are reduced to O(PlogP) bit operations and O(P) bit operations, respectively, which is 1/m of each of the conventional method. This method also diminishes the amount of memory in each PE to O(P), and can decrease the number of PE to O(P2) =Θ(N2/m2) as compared to O(N2) of conventional method. Because the proposed parallel labeling algorithm is scalable, we can adapt to the increase of image size without the hardware change of the given mesh connected SIMD computer.

  • PDF

Data Stream Allocation Algorithm for Maximizing Sum Capacity in Multiuser MIMO Systems (다중 사용자 MIMO 시스템에서 전체 채널 용량을 최대화하기 위한 데이터 스트림 할당 기법)

  • Kim, Bong-Seok;Choi, Kwon-Hue
    • Journal of Satellite, Information and Communications
    • /
    • v.6 no.1
    • /
    • pp.19-27
    • /
    • 2011
  • In this paper, we propose the data stream allocation algorithms for maximizing sum capacity of downlink multiuser MIMO (Multiple-input Multiple-output) systems with BD (Block Diagonalization). The conventional BD precoding algorithms maximize the capacity by controlling power against channel gain of each user. In multiuser MIMO systems, however, the number of data streams for each user can be used to as another control parameter, which determines the capacity. This paper proposes the data stream allocation algorithm of BD for increasing capacity in multiuser MIMO systems. The proposed algorithm allocates unequal bit stream to each user based on channel matrix of each user for maximizing sum capacity. It is proved that proposed algorithm can achieve the significantly improved sum capacity by computer simulation.

Economic Life Assessment of Power Transformer using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 전력용 변압기의 경제적 수명평가)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.3
    • /
    • pp.123-128
    • /
    • 2017
  • Electric utilities has been considered the necessity to introduce AM(asset management) of electric power facilities in order to reduce maintenance cost of existing facilities and to maximize profit. In order to make decisions in terms of repairs and replacements for power transformers, not only measuring by counting parts and labor costs, but comprehensive comparison including reliability and cost is needed. Therefore, this study is modeling input cost for power transformer during its entire life and also the life cycle cost (LCC) technique is applied. In particular, this paper presents an application of heuristic harmony search(HS) optimization algorithm to the convergence and the validity of economic life assessment of power transformer from LCC technique. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through an economic life assessment simulation of power transformer using HS optimization algorithm.

Real-time Slant Face detection using improvement AdaBoost algorithm (개선한 아다부스트 알고리즘을 이용한 기울어진 얼굴 실시간 검출)

  • Na, Jong-Won
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.3
    • /
    • pp.280-285
    • /
    • 2008
  • The traditional face detection method is to use difference picture method are used to detect movement. However, most do not consider this mathematical approach using real-time or real-time implementation of the algorithm is complicated, not easy. This paper, the first to detect real-time facial image is converted YCbCr and RGB video input. Next, you convert the difference between video images of two adjacent to obtain and then to conduct Glassfire Labeling. Labeling value compared to the threshold behavior Area recognizes and converts video extracts. Actions to convert video to conduct face detection, and detection of facial characteristics required for the extraction and use of AdaBoost algorithm.

  • PDF

HVS-Aware Single-Shot HDR Imaging Using Deep Convolutional Neural Network (시각 인지 특성과 딥 컨볼루션 뉴럴 네트워크를 이용한 단일 영상 기반 HDR 영상 취득)

  • Vien, An Gia;Lee, Chul
    • Journal of Broadcast Engineering
    • /
    • v.23 no.3
    • /
    • pp.369-382
    • /
    • 2018
  • We propose a single-shot high dynamic range (HDR) imaging algorithm using a deep convolutional neural network (CNN) for row-wise varying exposures in a single image. The proposed algorithm restores missing information resulting from under- and/or over-exposed pixels in an input image and reconstructs the raw radiance map. The main contribution of this work is the development of a loss function for the CNN employing the human visual system (HVS) properties. Then, the HDR image is obtained by applying a demosaicing algorithm. Experimental results demonstrate that the proposed algorithm provides higher-quality HDR images than conventional algorithms.

RBFNNs-based Recognition System of Vehicle License Plate Using Distortion Correction and Local Binarization (왜곡 보정과 지역 이진화를 이용한 RBFNNs 기반 차량 번호판 인식 시스템)

  • Kim, Sun-Hwan;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1531-1540
    • /
    • 2016
  • In this paper, we propose vehicle license plate recognition system based on Radial Basis Function Neural Networks (RBFNNs) with the use of local binarization functions and canny edge algorithm. In order to detect the area of license plate and also recognize license plate numbers, binary images are generated by using local binarization methods, which consider local brightness, and canny edge detection. The generated binary images provide information related to the size and the position of license plate. Additionally, image warping is used to compensate the distortion of images obtained from the side. After extracting license plate numbers, the dimensionality of number images is reduced through Principal Component Analysis (PCA) and is used as input variables to RBFNNs. Particle Swarm Optimization (PSO) algorithm is used to optimize a number of essential parameters needed to improve the accuracy of RBFNNs. Those optimized parameters include the number of clusters and the fuzzification coefficient used in the FCM algorithm, and the orders of polynomial of networks. Image data sets are obtained by changing the distance between stationary vehicle and camera and then used to evaluate the performance of the proposed system.

A Fast Algorithm for Korean Text Extraction and Segmentation from Subway Signboard Images Utilizing Smartphone Sensors

  • Milevskiy, Igor;Ha, Jin-Young
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.3
    • /
    • pp.161-166
    • /
    • 2011
  • We present a fast algorithm for Korean text extraction and segmentation from subway signboards using smart phone sensors in order to minimize computational time and memory usage. The algorithm can be used as preprocessing steps for optical character recognition (OCR): binarization, text location, and segmentation. An image of a signboard captured by smart phone camera while holding smart phone by an arbitrary angle is rotated by the detected angle, as if the image was taken by holding a smart phone horizontally. Binarization is only performed once on the subset of connected components instead of the whole image area, resulting in a large reduction in computational time. Text location is guided by user's marker-line placed over the region of interest in binarized image via smart phone touch screen. Then, text segmentation utilizes the data of connected components received in the binarization step, and cuts the string into individual images for designated characters. The resulting data could be used as OCR input, hence solving the most difficult part of OCR on text area included in natural scene images. The experimental results showed that the binarization algorithm of our method is 3.5 and 3.7 times faster than Niblack and Sauvola adaptive-thresholding algorithms, respectively. In addition, our method achieved better quality than other methods.

Development of Optimal Design User Interface for Waveguide tee Junction using PSO Algorithm and VBA (PSO 알고리즘과 VBA를 이용한 Waveguide tee Junction의 최적설계 인터페이스 개발)

  • Park, Hyun-Soo;Byun, Jin-Kyu;Lee, Dal-Ho;Lee, Hyang-Beom
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.36-39
    • /
    • 2009
  • We developed an optimal design interface based on VBA(Visual Basic Application) that takes advantage of API(Application Program Interface) function of commonly used EM analysis software. The developed interface is adopted for an optimal design of a septum in a waveguide tee junction using PSO(Particle Swarm Optimization) algorithm. The objective function of the optimal design is defined by $S_{11}$-parameter of the waveguide tee junction Design variables are established as position of the septum, that are changed to satisfy the design goal Using the developed design interface and PSO algorithm, the objective function converged to the smallest value, showing the validity of the proposed method. The design interface was developed using Microsoft Excel software, enabling easy control of design parameters for user. Also, various analysis parameters can be set in the Excel interface, including waveguide input mode and frequency. After completion of the design, field solutions at user-specified positrons can be extracted to the output files in complex number form.

  • PDF

A CLB based CPLD Low-power Technology Mapping Algorithm consider Area and Delay time (면적과 지연 시간을 고려한 CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;조남경;전종식;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1169-1172
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

  • PDF

Derivation of a Confidence Matrix for Orientation Components in the ICP Algorithm (ICP 알고리즘의 회전 성분 신뢰도 행렬 유도)

  • Lee, Byung-Uk;Kim, Chul-Min;Park, Rae-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.69-76
    • /
    • 1998
  • This paper proposes a matrix which represents the confidence in the rotation components of the Iterative Closest Point (ICP) algorithm is image registratiion, The reliability of the ICP algorithm depends on the shape of the object. For example, an object with more complex features shows higher reliablility than the one with rotation symmetry such as a cylinder. We show that the reliablity of the ICP algorithm can be estimated when the input range data has additive noise. Finally, we demonstrate that the proposed reliability formula is in good agreement with the computer simulation.

  • PDF