• Title/Summary/Keyword: Computation reduction

Search Result 445, Processing Time 0.023 seconds

A Novel Approach for Object Detection in Illuminated and Occluded Video Sequences Using Visual Information with Object Feature Estimation

  • Sharma, Kajal
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.110-114
    • /
    • 2015
  • This paper reports a novel object-detection technique in video sequences. The proposed algorithm consists of detection of objects in illuminated and occluded videos by using object features and a neural network technique. It consists of two functional modules: region-based object feature extraction and continuous detection of objects in video sequences with region features. This scheme is proposed as an enhancement of the Lowe's scale-invariant feature transform (SIFT) object detection method. This technique solved the high computation time problem of feature generation in the SIFT method. The improvement is achieved by region-based feature classification in the objects to be detected; optimal neural network-based feature reduction is presented in order to reduce the object region feature dataset with winner pixel estimation between the video frames of the video sequence. Simulation results show that the proposed scheme achieves better overall performance than other object detection techniques, and region-based feature detection is faster in comparison to other recent techniques.

Low-Complexity Non-Iterative Soft-Decision BCH Decoder Architecture for WBAN Applications

  • Jung, Boseok;Kim, Taesung;Lee, Hanho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.488-496
    • /
    • 2016
  • This paper presents a low-complexity non-iterative soft-decision Bose-Chaudhuri-Hocquenghem (SD-BCH) decoder architecture and design technique for wireless body area networks (WBANs). A SD-BCH decoder with test syndrome computation, a syndrome calculator, Chien search and metric check, and error location decision is proposed. The proposed SD-BCH decoder not only uses test syndromes, but also does not have an iteration process. The proposed SD-BCH decoder provides a 0.75~1 dB coding gain compared to a hard-decision BCH (HD-BCH) decoder, and almost similar coding gain compared to a conventional SD-BCH decoder. The proposed SD-BCH (63, 51) decoder was designed and implemented using 90-nm CMOS standard cell technology. Synthesis results show that the proposed non-iterative SD-BCH decoder using a serial structure can lead to a 75% reduction in hardware complexity and a clock speed 3.8 times faster than a conventional SD-BCH decoder.

Motion Blur reduction based on Motion Compensation

  • Park, Jae-Hyeung;Kim, Yun-Jae;Park, Min-Kyu;Amino, Tadashi;Oh, Jae-Ho;Kim, Nam-Deog;Kim, Sang-Soo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.413-416
    • /
    • 2007
  • Motion-estimation/motion-compensation (ME/MC) provides superior motion picture quality but its huge computation load results in high cost. Impulsive driving is a cost-effective solution but it suffers from large flicker and brightness loss. Motion compensated impulsive driving technology has been developed to achieve high motion picture quality in a cost-effective implementation by combining ME/MC and impulsive driving. The key idea is to apply ME/MC or impulsive driving selectively according to the motion vector distribution of the incoming image sequence. In this paper, the description of the algorithm and the experimental results are provided.

  • PDF

A Study on the Reduction of Computation Time in Finite Element Analysis of Electric Machines Driven by PWM Inverters (PWM 인버터로 구동되는 전기기기의 유한요소 해석시 계산시간 저감방법에 관한 연구)

  • Jung, In-Soung;Hyun, Dong-Sack
    • Proceedings of the KIEE Conference
    • /
    • 1999.07a
    • /
    • pp.226-228
    • /
    • 1999
  • This paper presents an efficient analysis method using time-stepping finite element method for electric machines driven by pulse width modulation (PWM) inverter. In the method, the value of time-step is changed according to the PWM logic of inverter, and the calculation time can be reduced while maintaining analysis accuracy. Using the method, the dynamic characteristics of a permanent magnet linear synchronous motor (PMLSM) driven by PWM inverter are analyzed.

  • PDF

A Hybrid ON/OFF Method for Fast Solution of Electromagnetic Inverse Problems Based on Topological Sensitivity

  • Kim, Dong-Hun;Byun, Jin-Kyu
    • Journal of Magnetics
    • /
    • v.16 no.3
    • /
    • pp.240-245
    • /
    • 2011
  • A new hybrid ON/OFF method is presented for the fast solution of electromagnetic inverse problems in high frequency domains. The proposed method utilizes both topological sensitivity (TS) and material sensitivity (MS) to update material properties in unit design cells. MS provides smooth design space and stable convergence, while TS enables sudden changes of material distribution when MS slows down. This combination of two sensitivities enables a reduction in total computation time. The TS and MS analyses are based on a variational approach and an adjoint variable method (AVM), which permits direct calculation of both sensitivity values from field solutions of the primary and adjoint systems. Investigation of the formulations of TS and MS reveals that they have similar forms, and implementation of the hybrid ON/OFF method that uses both sensitivities can be achieved by one optimization module. The proposed method is applied to dielectric material reconstruction problems, and the results show the feasibility and effectiveness of the method.

Design of A Controller Using Successive Approximation for Weakly Coupled Bilinear Systems

  • Chang, Jae-Won;Kim, Young-Joong;Kim, Beom-Soo;Lim, Myo-Taeg
    • KIEE International Transaction on Systems and Control
    • /
    • v.12D no.1
    • /
    • pp.33-38
    • /
    • 2002
  • In this paper, the infinite time optimal regulation problem for weakly coupled bilinear systems with quadratic performance criteria is obtained by a sequence of algebraic Lyapunov equations. This is the new approach is based on the successive approximation. In particular, the order reduction is achieved by using suitable state transformation so that the original Lyapunov equations are decomposed into the reduced-order local Lyapunov equations. The proposed algorithms not only solve optimal control problems in the weakly coupled bilinear system but also reduce the computation time. This paper also includes an example to demonstrate the procedures.

  • PDF

Implementation of Simulated Annealing for Distribution System Loss Minimum Reconfiguration (배전 계토의 손실 최소 재구성을 위한 시뮬레이티드 어닐링의 구현)

  • Jeon, Young-Jae;Choi, Seung-Kyo;Kim, Jae-Chul
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.4
    • /
    • pp.371-378
    • /
    • 1999
  • This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

  • PDF

Design of a Controller Using Successive Approximation for Weakly Copled Bilinear Systems (연속적 근사화 방법을 이용한 쌍일차 정규섭동 시스템의 최적제어기 설계)

  • Chang, Jae-Won;Lee, Sang-Yup;Kim, Beom-Soo;Lim, Myo-Taeg
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.1999-2001
    • /
    • 2001
  • The infinite time optimum to regulate the problem of weakly coupled bilinear systems with a quadratic performance criterion is obtained by a sequence of algebraic Lyapunov equations. The new approach is based on the successive approximations. In particular, the order reduction is achieved by using suitable state transformation so that the original Lyapunov equations are decomposed into the reduced-order local Lyapunov equations. The proposed algorithms not only solve optimal control problems in the weakly coupled bilinear system but also reduce the computation time. This paper also includes an example to demonstrate the procedures.

  • PDF

Classification of High Dimensionality Data through Feature Selection Using Markov Blanket

  • Lee, Junghye;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.2
    • /
    • pp.210-219
    • /
    • 2015
  • A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.

Rapid Prototyping System을 위한 형상정보 변환절차

  • Lee, U-Jong;Lee, Yong-Han;Hong, Yu-Seok
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.18 no.1
    • /
    • pp.63-80
    • /
    • 1992
  • The concept of rapid prototyping intended for a significant reduction in cost and lead time becomes even more practical with the recent development of various equipments to make the concept concrete. For the purpose of real application of commercially available SLA(stereolithography apparatus), this paper is intended to develop the standard conversion procedure from CAD data to the input data for SLA. While the procedure presented in this paper is based on CAD system "CATIA" and SLA of 3D systems, Inc., which are being used in authors' company DAEWOO Motor Co., Ltd., the basic concept of this paper can be applied to any other CAD systems and machines of using stereolithography process. The algorithm presented in this paper is classified into two stages-node sampling and triangulation. First of all, point data are sampled through the node sampling procedure, and then these are triangulated so that the input data for SLA operation is finally generated. The suggested method is devised in a way to meet the input requirements of SLA and more importantly consume less computation time and generate less number of input data for SLA.

  • PDF