• Title/Summary/Keyword: parameter smoothing

Search Result 120, Processing Time 0.026 seconds

Refinement of damage identification capability of neural network techniques in application to a suspension bridge

  • Wang, J.Y.;Ni, Y.Q.
    • Structural Monitoring and Maintenance
    • /
    • v.2 no.1
    • /
    • pp.77-93
    • /
    • 2015
  • The idea of using measured dynamic characteristics for damage detection is attractive because it allows for a global evaluation of the structural health and condition. However, vibration-based damage detection for complex structures such as long-span cable-supported bridges still remains a challenge. As a suspension or cable-stayed bridge involves in general thousands of structural components, the conventional damage detection methods based on model updating and/or parameter identification might result in ill-conditioning and non-uniqueness in the solution of inverse problems. Alternatively, methods that utilize, to the utmost extent, information from forward problems and avoid direct solution to inverse problems would be more suitable for vibration-based damage detection of long-span cable-supported bridges. The auto-associative neural network (ANN) technique and the probabilistic neural network (PNN) technique, that both eschew inverse problems, have been proposed for identifying and locating damage in suspension and cable-stayed bridges. Without the help of a structural model, ANNs with appropriate configuration can be trained using only the measured modal frequencies from healthy structure under varying environmental conditions, and a new set of modal frequency data acquired from an unknown state of the structure is then fed into the trained ANNs for damage presence identification. With the help of a structural model, PNNs can be configured using the relative changes of modal frequencies before and after damage by assuming damage at different locations, and then the measured modal frequencies from the structure can be presented to locate the damage. However, such formulated ANNs and PNNs may still be incompetent to identify damage occurring at the deck members of a cable-supported bridge because of very low modal sensitivity to the damage. The present study endeavors to enhance the damage identification capability of ANNs and PNNs when being applied for identification of damage incurred at deck members. Effort is first made to construct combined modal parameters which are synthesized from measured modal frequencies and modal shape components to train ANNs for damage alarming. With the purpose of improving identification accuracy, effort is then made to configure PNNs for damage localization by adapting the smoothing parameter in the Bayesian classifier to different values for different pattern classes. The performance of the ANNs with their input being modal frequencies and the combined modal parameters respectively and the PNNs with constant and adaptive smoothing parameters respectively is evaluated through simulation studies of identifying damage inflicted on different deck members of the double-deck suspension Tsing Ma Bridge.

Block-based Motion Vector Smoothing for Nonrigid Moving Objects (비정형성 등속운동 객체의 움직임 추정을 위한 블록기반 움직임 평활화)

  • Sohn, Young-Wook;Kang, Moon-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.47-53
    • /
    • 2007
  • True motion estimation is necessary for deinterlacing, frame-rate conversion, and film judder compensation. There have been several block-based approaches to find true motion vectors by tracing minimum sum-of-absolute-difference (SAD) values by considering spatial and temporal consistency. However, the algorithms cannot find robust motion vectors when the texture of objects is changed. To find the robust motion vectors in the region, a recursive vector selection scheme and an adaptive weighting parameter are proposed. Previous frame vectors are recursively averaged to be utilized for motion error region. The weighting parameter controls fidelity to input vectors and the recursively averaged ones, where the input vectors come from the conventional estimators. If the input vectors are not reliable, then the mean vectors of the previous frame are used for temporal consistency. Experimental results show more robust motion vectors than those of the conventional methods in time-varying texture objects.

The Evaluation of Evenness of Nonwovens Using Image Analysis Method

  • Jeong, Sung-Hoon;Kim, Si-Hwan;Hong, Cheol-Jae
    • Fibers and Polymers
    • /
    • v.2 no.3
    • /
    • pp.164-170
    • /
    • 2001
  • Authors studied on the applicability of image analysis technique using a scanner with a CCD (charged coupled deviced) to the evaluation of evenness of nonwovens because it has distinctive features to considerably save time and labor in the analysis compared with other classical methods. As specimens fur the experiment, two different types that are unpatterned and patterned ones were prepared. For the unpatterned specimen, webs were chemically bonded, while for the patterned specimen, webs being thermally calendered with engraved roller. Several webs having various areal densities were prepared and bonded. Coefficient of variation (CV%) was used as a parameter to evaluate the evenness. Scanning conditions could be suitably set up through comparing the total variance to the between-group variance and to the within-group variance, respectively, on the images scanned at the different conditions. The 2D convolution method with smoothing filter kernel was introduced to further filter the noises on the scanned images. After the filtering process, the increase of web areal densities gave an uniform decrease of the CV%. This showed that the scanned image analysis with proper filtering process could be successfully applicable to the evaluation of evenness in nonwovens.

  • PDF

Reference Model Updating of Considering Disturbance Characteristics for Fault Diagnosis of Large-scale DC Bus Capacitors (대용량 직류버스 커패시터의 고장진단을 위한 외란특성 반영의 레퍼런스 모델 개선)

  • Lee, Tae-Bong
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.4
    • /
    • pp.213-218
    • /
    • 2017
  • The DC electrolytic capacitor for DC-link of power converter is widely used in various power electronic circuits and system application. Its functions include, DC Bus voltage stabilization, conduction of ripple current due to switching events, voltage smoothing, etc. Unfortunately, DC electrolytic capacitors are some of the weakest components in power electronics converters. Many papers have proposed different algorithms or diagnosis method to determinate the ESR and tan ${\delta}$ capacitance C for fault alarm system of the electrolytic capacitor. However, both ESR vary with frequency and temperature. Accurate knowledge of both parameters at the capacitors operating conditions is essential to achieve the best reference data of fault alarm. According to parameter analysis, the capacitance increases with temperature and the initial ESR decreases. Higher frequencies make the reference ESR with the initial ESRo value to decrease. Analysis results show that the proposed DC Bus electrolytic capacitor reference ESR model setting technique can be applied to advanced reference signal of capacitor diagnosis systems successfully.

Adaptive MAP High-Resolution Image Reconstruction Algorithm Using Local Statistics (국부 통계 특성을 이용한 적응 MAP 방식의 고해상도 영상 복원 방식)

  • Kim, Kyung-Ho;Song, Won-Seon;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1194-1200
    • /
    • 2006
  • In this paper, we propose an adaptive MAP (Maximum A Posteriori) high-resolution image reconstruction algorithm using local statistics. In order to preserve the edge information of an original high-resolution image, a visibility function defined by local statistics of the low-resolution image is incorporated into MAP estimation process, so that the local smoothness is adaptively controlled. The weighted non-quadratic convex functional is defined to obtain the optimal solution that is as close as possible to the original high-resolution image. An iterative algorithm is utilized for obtaining the solution, and the smoothing parameter is updated at each iteration step from the partially reconstructed high-resolution image is required. Experimental results demonstrate the capability of the proposed algorithm.

Implementation of Image Enhancement Filter System Using Genetic Algorithm (유전자 알고리즘을 이용한 영상개선 필터 시스템 구현)

  • Gu, Ji-Hun;Dong, Seong-Su;Lee, Jong-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.8
    • /
    • pp.360-367
    • /
    • 2002
  • In this paper, genetic algorithm based adaptive image enhancement filtering scheme is proposed and Implemented on FPGA board. Conventional filtering methods require a priori noise information for image enhancement. In general, if a priori information of noise is not available, heuristic intuition or time consuming recursive calculations are required for image enhancement. Contrary to the conventional filtering methods, the proposed filter system can find optimal combination of filters as well as their sequent order and parameter values adaptively to unknown noise types using structured genetic algorithms. The proposed image enhancement filter system is mainly composed of two blocks. The first block consists of genetic algorithm part and fitness evaluation part. And the second block consists of four types of filters. The first block (genetic algorithms and fitness evaluation blocks) is implemented on host computer using C code, and the second block is implemented on re-configurabe FPGA board. For gray scale control, smoothing and deblurring, four types of filters(median filter, histogram equalization filter, local enhancement filter, and 2D FIR filter) are implemented on FPGA. For evaluation, three types of noises are used and experimental results show that the Proposed scheme can generate optimal set of filters adaptively without a pioi noise information.

Modified Probabilistic Neural Network of Heterogeneous Probabilistic Density Functions for the Estimation of Concrete Strength

  • Kim, Doo-Kie;Kim, Hee-Joong;Chang, Sang-Kil;Chang, Seong-Kyu
    • International Journal of Concrete Structures and Materials
    • /
    • v.19 no.1E
    • /
    • pp.11-16
    • /
    • 2007
  • Recently, probabilistic neural network (PNN) has been proposed to predict the compressive strength of concrete for the known effect of improvement on PNN by the iteration method. However, an empirical method has been incorporated in the PNN technique to specify its smoothing parameter, which causes significant uncertainty in predicting the compressive strength of concrete. In this study, a modified probabilistic neural network (MPNN) approach is hence proposed. The global probability density function (PDF) of variables is reflected by summing the heterogeneous local PDFs which are automatically determined by the individual standard deviation of each variable. The proposed MPNN is applied to predict the compressive strength of concrete using actual test data from a concrete company. The estimated results of MPNN are compared with those of the conventional PNN. MPNN showed better results than the conventional PNN in predicting the compressive strength of concrete and provided promising results for the probabilistic approach to predict the concrete strength by using the individual standard deviation of a variable.

3D Reconstruction Algorithm using Stereo Matching and the Marching Cubes with Intermediate Iso-surface (스테레오 정합과 중간 등위면 마칭큐브를 이용한 3차원 재구성)

  • Cho In Je;Chai Young Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.173-180
    • /
    • 2005
  • This paper proposes an effective algorithm that combines both the stereo matching and the marching cube algorithm. By applying the stereo matching technique to an image obtained from various angles, 3D geometry data are acquired, and using the camera extrinsic parameter, the images are combined. After reconstructing the combined data into mesh using the image index, the normal vector equivalent to each point is obtained and the mesh smoothing is processed. This paper describes the successive processes and techniques on the 3D mesh reconstruction, and by proposing the intermediate iso- surface algorithm. Therefore it improves the 3D data instability problem caused when using the conventional marching cube algorithm.

Estimation of Concrete Strength Using Improved Probabilistic Neural Network Method

  • Kim Doo-Kie;Lee Jong-Jae;Chang Seong-Kyu
    • Journal of the Korea Concrete Institute
    • /
    • v.17 no.6 s.90
    • /
    • pp.1075-1084
    • /
    • 2005
  • The compressive strength of concrete is commonly used criterion in producing concrete. However, the tests on the compressive strength are complicated and time-consuming. More importantly, it is too late to make improvement even if the test result does not satisfy the required strength, since the test is usually performed at the 28th day after the placement of concrete at the construction site. Therefore, accurate and realistic strength estimation before the placement of concrete is being highly required. In this study, the estimation of the compressive strength of concrete was performed by probabilistic neural network(PNN) on the basis of concrete mix proportions. The estimation performance of PNN was improved by considering the correlation between input data and targeted output value. Improved probabilistic neural network was proposed to automatically calculate the smoothing parameter in the conventional PNN by using the scheme of dynamic decay adjustment (DDA) algorithm. The conventional PNN and the PNN with DDA algorithm(IPNN) were applied to predict the compressive strength of concrete using actual test data of two concrete companies. IPNN showed better results than the conventional PNN in predicting the compressive strength of concrete.

Bandwidth selection for discontinuity point estimation in density (확률밀도함수의 불연속점 추정을 위한 띠폭 선택)

  • Huh, Jib
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.1
    • /
    • pp.79-87
    • /
    • 2012
  • In the case that the probability density function has a discontinuity point, Huh (2002) estimated the location and jump size of the discontinuity point based on the difference between the right and left kernel density estimators using the one-sided kernel function. In this paper, we consider the cross-validation, made by the right and left maximum likelihood cross-validations, for the bandwidth selection in order to estimate the location and jump size of the discontinuity point. This method is motivated by the one-sided cross-validation of Hart and Yi (1998). The finite sample performance is illustrated by simulated example.