• Title/Summary/Keyword: Time Weighted Algorithm

Search Result 311, Processing Time 0.028 seconds

Color image quantization using color activity weighted distortion measure of human vision (인간 시각의 칼라 활성 가중 왜곡 척도를 이용한 칼라 영상 양자화)

  • 김경만;이응주;박양우;이채수;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.4
    • /
    • pp.101-110
    • /
    • 1996
  • Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. the basic problem is how to display 224 colors with 256 or less colors, called color palette. In this paper, we propose an algorithm to design the 256 or less size color palette by using spatial maskin geffect of HVS and subjective distortion measure weighted by color palette by using spatial masking effect of HVS and subjective distortion measure weighted by color activity in 4*4 local region in any color image. The proposed algorithm consists of octal prequantization and subdivision quantization processing step using the distortion measure and modified Otsu's between class variance maximization method. The experimental results show that the proposed algorithm has higher visual quality and needs less consuming time than conventional algorithms.

  • PDF

Model order reduction with pass band error reduction in frequency domain (주파수 영역에서 통과대역 오차 감소를 갖는 모델 저차수화)

  • 김정화;정찬수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.1219-1219
    • /
    • 1991
  • This paper proposes the model order reduction with pass band error reduction in the frequency domain of discrete time linear systems. The algorithm is the new method of reduced order model which reduces passband error by changing controllability and observability gramian used with weighted functions. A numerical example shows that this algorithm has lower passband error than balanced w&l and weighted function characteristics in frequency domain.

  • PDF

A Genetic Algorithm for the Parallel-Machine Total Weighted Tardiness Problem (병렬기계에서 납기지연 가중 합을 최소화하기 위한 유전 알고리듬)

  • Park, Moon-Won
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.2
    • /
    • pp.183-192
    • /
    • 2000
  • This paper considers the problem of scheduling a set of n jobs on m parallel machines to minimize total weighted tardiness. For the problem a genetic algorithm is proposed, in which solutions are encoded using the random key method suggested by Bean and new crossover operators are employed to increase performance of the algorithm. The algorithm is compared with the Modified Due-Date (MDD) algorithm after series of tests to find appropriate values for genetic parameters. Results of computational tests on randomly generated test problems show that the suggested algorithm performs better than the MDD algorithm and gives good solutions in a reasonable amount of computation time.

  • PDF

Design of Fuzzy-Neural Networks Structure using Optimization Algorithm and an Aggregate Weighted Performance Index (최적 알고리즘과 합성 성능지수에 의한 퍼지-뉴럴네트워크구조의 설계)

  • Yoon, Ki-Chan;Oh, Sung-Kwun;Park, Jong-Jin
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2911-2913
    • /
    • 1999
  • This paper suggest an optimal identification method to complex and nonlinear system modeling that is based on Fuzzy-Neural Network(FNN). The FNN modeling implements parameter identification using HCM algorithm and optimal identification algorithm structure combined with two types of optimization theories for nonlinear systems, we use a HCM Clustering Algorithm to find initial parameters of membership function. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using optimal identification algorithm. The proposed optimal identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregate objective function(performance index) with weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

  • PDF

Robust Singular Value Decomposition BaLsed on Weighted Least Absolute Deviation Regression

  • Jung, Kang-Mo
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.6
    • /
    • pp.803-810
    • /
    • 2010
  • The singular value decomposition of a rectangular matrix is a basic tool to understand the structure of the data and particularly the relationship between row and column factors. However, conventional singular value decomposition used the least squares method and is not robust to outliers. We propose a simple robust singular value decomposition algorithm based on the weighted least absolute deviation which is not sensitive to leverage points. Its implementation is easy and the computation time is reasonably low. Numerical results give the data structure and the outlying information.

Substructural parameters and dynamic loading identification with limited observations

  • Xu, Bin;He, Jia
    • Smart Structures and Systems
    • /
    • v.15 no.1
    • /
    • pp.169-189
    • /
    • 2015
  • Convergence difficulty and available complete measurement information have been considered as two primary challenges for the identification of large-scale engineering structures. In this paper, a time domain substructural identification approach by combining a weighted adaptive iteration (WAI) algorithm and an extended Kalman filter method with a weighted global iteration (EFK-WGI) algorithm was proposed for simultaneous identification of physical parameters of concerned substructures and unknown external excitations applied on it with limited response measurements. In the proposed approach, according to the location of the unknown dynamic loadings and the partially available structural response measurements, part of structural parameters of the concerned substructure and the unknown loadings were first identified with the WAI approach. The remaining physical parameters of the concerned substructure were then determined by EFK-WGI basing on the previously identified loadings and substructural parameters. The efficiency and accuracy of the proposed approach was demonstrated via a 20-story shear building structure and 23 degrees of freedom (DOFs) planar truss model with unknown external excitation and limited observations. Results show that the proposed approach is capable of satisfactorily identifying both the substructural parameters and unknown loading within limited iterations when both the excitation and dynamic response are partially unknown.

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

The Design of Optimal Fuzzy-Neural networks Structure by Means of GA and an Aggregate Weighted Performance Index (유전자 알고리즘과 합성 성능지수에 의한 최적 퍼지-뉴럴 네트워크 구조의 설계)

  • Oh, Sung-Kwun;Yoon, Ki-Chan;Kim, Hyun-Ki
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.3
    • /
    • pp.273-283
    • /
    • 2000
  • In this paper we suggest an optimal design method of Fuzzy-Neural Networks(FNN) model for complex and nonlinear systems. The FNNs use the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM(Hard C-Means) Clustering Algorithm to find initial parameters of the membership function. The parameters such as parameters of membership functions learning rates and momentum weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. According to selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity (distribution of I/O data we show that it is available and effective to design and optimal FNN model structure with a mutual balance and dependency between approximation and generalization abilities. This methodology sheds light on the role and impact of different parameters of the model on its performance (especially the mapping and predicting capabilities of the rule based computing). To evaluate the performance of the proposed model we use the time series data for gas furnace the data of sewage treatment process and traffic route choice process.

  • PDF

Minimization of Total Weighted Earliness and Tardiness on a Single Burn-In Oven U sing a Genetic Algorithm (단일 Burn-In Oven에서 Total Weighted Earliness와 Tardiness를 최소화하기 위한 유전자 알고리즘의 활용)

  • Park, You-Jin
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.4
    • /
    • pp.21-28
    • /
    • 2008
  • 본 연구는 반도체 제조공정에서 사용되는 단일 Burn-In oven에서의 Total weighted earliness와 Tardiness를 최소화하기 위한 생산 스케줄링을 결정하는 문제를 다룬다. 본 연구에서는 모든 작업은 상시에 시작가능하고 각각은 서로 다른 가중치를 가지고 있다고 가정하였다. 일반적으로 단일 Burn-In oven은 다양한 작업들이 동시에 가능한 Batch processing 기계이다. 따라서 다양한 작업들로 구성된 하나의 Batch의 Processing time은 그 Batch 내에 있는 가장 긴 Processing time을 가지는 작업에 의해 결정된다. 본 연구에서 Batch size는 미리 결정되지 않은 상황이라고 가정한 후, 최적의 Batch 개수와 작업의 순서를 결정하기 위해 유전자 알고리즘을 적용하였다. 수리적 예제를 통해서 다양한 접근방법의 성능들을 비교한 결과, 유전자 알고리즘이 Total weighted earliness와 Tardiness를 최소화하는데 가장 뛰어난 성능을 가지고 있음을 알 수 있다.

A study of the load distributing algorithm on the heterogeneously clustered web system (이기종 웹 클러스터 시스템에 대한 부하분산 알고리즘의 연구)

  • Rhee, Young
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.225-230
    • /
    • 2003
  • In this paper, we develope algorithms that distribute the load on the heterogeneously clustered web system, The response time based on the concurrent user is examined for the suggested algorithms. Simulation experience shows that the response time using the dynamically weighted methods seems to have a good results compare to that with the fixed weighted methods. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases.