• Title/Summary/Keyword: Noisy Model

Search Result 346, Processing Time 0.03 seconds

A novel multi-feature model predictive control framework for seismically excited high-rise buildings

  • Katebi, Javad;Rad, Afshin Bahrami;Zand, Javad Palizvan
    • Structural Engineering and Mechanics
    • /
    • v.83 no.4
    • /
    • pp.537-549
    • /
    • 2022
  • In this paper, a novel multi-feature model predictive control (MPC) framework with real-time and adaptive performances is proposed for intelligent structural control in which some drawbacks of the algorithm including, complex control rule and non-optimality, are alleviated. Hence, Linear Programming (LP) is utilized to simplify the resulted control rule. Afterward, the Whale Optimization Algorithm (WOA) is applied to the optimal and adaptive tuning of the LP weights independently at each time step. The stochastic control rule is also achieved using Kalman Filter (KF) to handle noisy measurements. The Extreme Learning Machine (ELM) is then adopted to develop a data-driven and real-time control algorithm. The efficiency of the developed algorithm is then demonstrated by numerical simulation of a twenty-story high-rise benchmark building subjected to earthquake excitations. The competency of the proposed method is proven from the aspects of optimality, stochasticity, and adaptivity compared to the KF-based MPC (KMPC) and constrained MPC (CMPC) algorithms in vibration suppression of building structures. The average value for performance indices in the near-field and far-field (El earthquakes demonstrates a reduction up to 38.3% and 32.5% compared with KMPC and CMPC, respectively.

Acoustic Model Transformation Method for Speech Recognition Employing Gaussian Mixture Model Adaptation Using Untranscribed Speech Database (미전사 음성 데이터베이스를 이용한 가우시안 혼합 모델 적응 기반의 음성 인식용 음향 모델 변환 기법)

  • Kim, Wooil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1047-1054
    • /
    • 2015
  • This paper presents an acoustic model transform method using untranscribed speech database for improved speech recognition. In the presented model transform method, an adapted GMM is obtained by employing the conventional adaptation method, and the most similar Gaussian component is selected from the adapted GMM. The bias vector between the mean vectors of the clean GMM and the adapted GMM is used for updating the mean vector of HMM. The presented GAMT combined with MAP or MLLR brings improved speech recognition performance in car noise and speech babble conditions, compared to singly-used MAP or MLLR respectively. The experimental results show that the presented model transform method effectively utilizes untranscribed speech database for acoustic model adaptation in order to increase speech recognition accuracy.

Illumination Robust Face Recognition using Ridge Regressive Bilinear Models (Ridge Regressive Bilinear Model을 이용한 조명 변화에 강인한 얼굴 인식)

  • Shin, Dong-Su;Kim, Dai-Jin;Bang, Sung-Yang
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.1
    • /
    • pp.70-78
    • /
    • 2007
  • The performance of face recognition is greatly affected by the illumination effect because intra-person variation under different lighting conditions can be much bigger than the inter-person variation. In this paper, we propose an illumination robust face recognition by separating identity factor and illumination factor using the symmetric bilinear models. The translation procedure in the bilinear model requires a repetitive computation of matrix inverse operation to reach the identity and illumination factors. Sometimes, this computation may result in a nonconvergent case when the observation has an noisy information. To alleviate this situation, we suggest a ridge regressive bilinear model that combines the ridge regression into the bilinear model. This combination provides some advantages: it makes the bilinear model more stable by shrinking the range of identity and illumination factors appropriately, and it improves the recognition performance by reducing the insignificant factors effectively. Experiment results show that the ridge regressive bilinear model outperforms significantly other existing methods such as the eigenface, quotient image, and the bilinear model in terms of the recognition rate under a variety of illuminations.

Enhancing Recommender Systems by Fusing Diverse Information Sources through Data Transformation and Feature Selection

  • Thi-Linh Ho;Anh-Cuong Le;Dinh-Hong Vu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.5
    • /
    • pp.1413-1432
    • /
    • 2023
  • Recommender systems aim to recommend items to users by taking into account their probable interests. This study focuses on creating a model that utilizes multiple sources of information about users and items by employing a multimodality approach. The study addresses the task of how to gather information from different sources (modalities) and transform them into a uniform format, resulting in a multi-modal feature description for users and items. This work also aims to transform and represent the features extracted from different modalities so that the information is in a compatible format for integration and contains important, useful information for the prediction model. To achieve this goal, we propose a novel multi-modal recommendation model, which involves extracting latent features of users and items from a utility matrix using matrix factorization techniques. Various transformation techniques are utilized to extract features from other sources of information such as user reviews, item descriptions, and item categories. We also proposed the use of Principal Component Analysis (PCA) and Feature Selection techniques to reduce the data dimension and extract important features as well as remove noisy features to increase the accuracy of the model. We conducted several different experimental models based on different subsets of modalities on the MovieLens and Amazon sub-category datasets. According to the experimental results, the proposed model significantly enhances the accuracy of recommendations when compared to SVD, which is acknowledged as one of the most effective models for recommender systems. Specifically, the proposed model reduces the RMSE by a range of 4.8% to 21.43% and increases the Precision by a range of 2.07% to 26.49% for the Amazon datasets. Similarly, for the MovieLens dataset, the proposed model reduces the RMSE by 45.61% and increases the Precision by 14.06%. Additionally, the experimental results on both datasets demonstrate that combining information from multiple modalities in the proposed model leads to superior outcomes compared to relying on a single type of information.

PCMM-Based Feature Compensation Method Using Multiple Model to Cope with Time-Varying Noise (시변 잡음에 대처하기 위한 다중 모델을 이용한 PCMM 기반 특징 보상 기법)

  • 김우일;고한석
    • The Journal of the Acoustical Society of Korea
    • /
    • v.23 no.6
    • /
    • pp.473-480
    • /
    • 2004
  • In this paper we propose an effective feature compensation scheme based on the speech model in order to achieve robust speech recognition. The proposed feature compensation method is based on parallel combined mixture model (PCMM). The previous PCMM works require a highly sophisticated procedure for estimation of the combined mixture model in order to reflect the time-varying noisy conditions at every utterance. The proposed schemes can cope with the time-varying background noise by employing the interpolation method of the multiple mixture models. We apply the‘data-driven’method to PCMM tot move reliable model combination and introduce a frame-synched version for estimation of environments posteriori. In order to reduce the computational complexity due to multiple models, we propose a technique for mixture sharing. The statistically similar Gaussian components are selected and the smoothed versions are generated for sharing. The performance is examined over Aurora 2.0 and speech corpus recorded while car-driving. The experimental results indicate that the proposed schemes are effective in realizing robust speech recognition and reducing the computational complexities under both simulated environments and real-life conditions.

A Study on Improvement in Digital Image Restoration by a Recursive Vector Processing (순환벡터처리에 의한 디지털 영상복원에 관한 연구)

  • 이대영;이윤현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.3
    • /
    • pp.105-112
    • /
    • 1983
  • This paper discribes technique of the recursive restoration for the images degraded by linear space invariant blur and additive white Gaussian noise. The image is characterized statistically by tis mean and correlation function. An exponential autocorrelation function has been used to model neighborhood model. The vector model was used because of analytical simplicitly and capability to implement brightness correlation function. Base on the vector model, a two-dimensional discrete stochastic a 12 point neighborhood model for represeting images was developme and used the technique of moving window processing to restore blurred and noisy images without dimensionality increesing, It has been shown a 12 point neighborhood model was found to be more adequate than a 8 point pixel model to obtain optimum pixel estimated. If the image is highly correlated, it is necessary to use a large number of points in the neighborhood in order to have improvements in restoring image. It is believed that these result could be applied to a wide range of image processing problem. Because image processing thchniques normally required a 2-D linear filtering.

  • PDF

A GMDH-based estimation model for axial load capacity of GFRP-RC circular columns

  • Mohammed Berradia;El Hadj Meziane;Ali Raza;Mohamed Hechmi El Ouni;Faisal Shabbir
    • Steel and Composite Structures
    • /
    • v.49 no.2
    • /
    • pp.161-180
    • /
    • 2023
  • In the previous research, the axial compressive capacity models for the glass fiber-reinforced polymer (GFRP)-reinforced circular concrete compression elements restrained with GFRP helix were put forward based on small and noisy datasets by considering a limited number of parameters portraying less accuracy. Consequently, it is important to recommend an accurate model based on a refined and large testing dataset that considers various parameters of such components. The core objective and novelty of the current research is to suggest a deep learning model for the axial compressive capacity of GFRP-reinforced circular concrete columns restrained with a GFRP helix utilizing various parameters of a large experimental dataset to give the maximum precision of the estimates. To achieve this aim, a test dataset of 61 GFRP-reinforced circular concrete columns restrained with a GFRP helix has been created from prior studies. An assessment of 15 diverse theoretical models is carried out utilizing different statistical coefficients over the created dataset. A novel model utilizing the group method of data handling (GMDH) has been put forward. The recommended model depicted good effectiveness over the created dataset by assuming the axial involvement of GFRP main bars and the confining effectiveness of transverse GFRP helix and depicted the maximum precision with MAE = 195.67, RMSE = 255.41, and R2 = 0.94 as associated with the previously recommended equations. The GMDH model also depicted good effectiveness for the normal distribution of estimates with only a 2.5% discrepancy from unity. The recommended model can accurately calculate the axial compressive capacity of FRP-reinforced concrete compression elements that can be considered for further analysis and design of such components in the field of structural engineering.

Game-theoretic Duel : A State-of-the-Art (게임 이론적 결투)

  • Kim, Yuh-Keun;Park, Soon-Dal
    • Journal of the military operations research society of Korea
    • /
    • v.5 no.1
    • /
    • pp.137-153
    • /
    • 1979
  • The duel is an extreme case of game situations. The duel is of zero-sum type, but a infinite game. This duel situation appears not only in extreme competitive situations such as war, but also in economic situations such as bidding. The study on duel situations started from late 1940's, but considerable contributions have been made in 1960's by Ancker, Restrepo, Yanovskaya, Kimeldorf among others. Specially Kimeldorf recently has made big contribution in developing the theory of the game-theoretic duel. The purpose of this paper is to summarize and systemize the theory of the game-theoretic duel. In the first part, noisy duel situations shall be dealt with, and in the second part, silent duel shall follow. Finally these two situations shall be generalized in the form of continuous firing model.

  • PDF

Terrain Geometry from Monocular Image Sequences

  • McKenzie, Alexander;Vendrovsky, Eugene;Noh, Jun-Yong
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.1
    • /
    • pp.98-108
    • /
    • 2008
  • Terrain reconstruction from images is an ill-posed, yet commonly desired Structure from Motion task when compositing visual effects into live-action photography. These surfaces are required for choreography of a scene, casting physically accurate shadows of CG elements, and occlusions. We present a novel framework for generating the geometry of landscapes from extremely noisy point cloud datasets obtained via limited resolution techniques, particularly optical flow based vision algorithms applied to live-action video plates. Our contribution is a new statistical approach to remove erroneous tracks ('outliers') by employing a unique combination of well established techniques-including Gaussian Mixture Models (GMMs) for robust parameter estimation and Radial Basis Functions (REFs) for scattered data interpolation-to exploit the natural constraints of this problem. Our algorithm offsets the tremendously laborious task of modeling these landscapes by hand, automatically generating a visually consistent, camera position dependent, thin-shell surface mesh within seconds for a typical tracking shot.

Two-Stage Fast Block Matching Algorithm Using Integral Projections (가산 투영을 이용한 2단계 고속 블록정합 알고리즘)

  • 김준식;박래홍;이병욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.1
    • /
    • pp.45-55
    • /
    • 1993
  • In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.

  • PDF