Inverse identification of constitutive parameters from heat source fields: A local approach applied to hyperelasticity

In this paper, a new inverse identification method of constitutive parameters is developed from full kinematic and thermal field measurements. It consists in reconstructing the heat source field from two different approaches by using the heat diffusion equation. The first one requires the temperature field measurement and the value of the thermophysical parameters. The second one is based on the kinematic field measurement and the choice of a thermo-hyperelastic model that contains the parameters to be identified. The identification is carried out at the local scale, ie, at any point of the heat source field, without using the boundary conditions. In the present work, the method is applied to the challenging case of hyperelasticity from a heterogeneous test. Due to large deformations undergone by the rubber specimen tested, a motion compensation technique is developed to plot the kinematic and the thermal fields at the same points before reconstructing the heterogeneous heat source field. In the present case, the constitutive parameter of the Neo-Hookean model has been identified, and its distribution has been characterized with respect to the strain state at the surface of a cross-shaped specimen.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.     

Anti‐Sway Crane Control Considering Wind Disturbance and Container Mass

A method for estimating the sway angle using an observer has already been proposed. The state observer estimates the sway angle accurately and must use the detected sway angle value. However, the estimated sway angle has an error owing to rope length error, friction force, and wind. Moreover, the container mass cannot be determined, and therefore the observer parameter is not suitable. We already proposed robust antisway control for overcoming rope length error without adding a new sensor. Further, we designed a friction disturbance observer to cancel out the influence of the friction force. In this paper, we first propose a container mass estimation method when a crane system performs rolling up control. The observer parameter can be selected using the estimated mass value. Second, in crane parallel shift control, we propose a robust antisway control even when there is a wind disturbance. We design a wind disturbance observer and propose a wind disturbance estimator to separate the friction observer output from the wind disturbance observer output. We confirm through experiments that the proposed method can reduce vibration.     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

M-estimator based Chinese Remainder Theorem with few remainders using a Kroenecker product based mapping vector

The Chinese Remainder Theorem (CRT) explains how to estimate an integer-valued number from the knowledge of the remainders obtained by dividing such unknown integer by co-prime integers. As an algebraic theorem, CRT is the basis for several techniques concerning data processing. For instance, considering a single-tone signal whose frequency value is above the sampling rate, the respective peak in the DFT informs the impinging frequency value modulo the sampling rate. CRT is nevertheless sensitive to errors in the remainders, and many efforts have been developed in order to improve its robustness. In this paper, we propose a technique to estimate real-valued numbers by means of CRT, employing for this goal a Kroenecker based M-Estimation (ME), specially suitable for CRT systems with low number of remainders. Since ME schemes are in general computationally expensive, we propose a mapping vector obtained via Kroenecker products which considerably reduces the computational complexity. Furthermore, our proposed technique enhances the probability of estimating an unknown number accurately even when the errors in the remainders surpass 1/4 of the greatest common divisor of all moduli. We also provide a version of the mapping vectors based on tensorial n-mode products, delivering in the end the same information of the original method. Our approach outperforms the state-of-the-art CRT methods not only in terms of percentage of successful estimations but also in terms of smaller average error.     

Super-Resolution Reconstruction of Images Based on Microarray Camera

In the field of images and imaging, super-resolution (SR) reconstruction of images is a technique that converts one or more low-resolution (LR) images into a highresolution (HR) image. The classical two types of SR methods are mainly based on applying a single image or multiple images captured by a single camera. Microarray camera has the characteristics of small size, multi views, and the possibility of applying to portable devices. It has become a research hotspot in image processing. In this paper, we propose a SR reconstruction of images based on a microarray camera for sharpening and registration processing of array images. The array images are interpolated to obtain a HR image initially followed by a convolution neural network (CNN) procedure for enhancement. The convolution layers of our convolution neural network are 3×3 or 1×1 layers, of which the 1×1 layers are used to improve the network performance particularly. A bottleneck structure is applied to reduce the parameter numbers of the nonlinear mapping and to improve the nonlinear capability of the whole network. Finally, we use a 3×3 deconvolution layer to significantly reduce the number of parameters compared to the deconvolution layer of FSRCNN-s. The experiments show that the proposed method can not only ameliorate effectively the texture quality of the target image based on the array images information, but also further enhance the quality of the initial high resolution image by the improved CNN.     

Sparsity-inspired image reconstruction for electrical capacitance tomography

We present a new image reconstruction method for Electrical Capacitance Tomography (ECT). ECT image reconstruction is generally ill-posed because the number of measurements is small whereas the image dimensions are large. Here, we present a sparsity-inspired approach to achieve better ECT image reconstruction from the small number of measurements. Our approach for ECT image reconstruction is based on Total Variation (TV) regularization. We apply an efficient Split-Bregman Iteration (SBI) approach to solve the problem. We also propose three metrics to evaluate image reconstruction performance, i.e., a joint metric of positive reconstruction rate (PRR) and false reconstruction rate (FRR), correlation coefficient, and a shape and location metric. The results on both synthetic and real data show that the proposed TV-SBI method can better preserve the edges of images and better resolve different objects within reconstructed images, as compared to a representative state-of-the-art ECT image reconstruction algorithm, Projected Landweber Iteration with Linear Back Projection initialization (LBP-PLI).     

Estimation of the Stress-Strength Reliability for Exponentiated Pareto Distribution Using Median and Ranked Set Sampling Methods

In reliability analysis, the stress-strength model is often used to describe the life of a component which has a random strength (X) and is subjected to a random stress (Y). In this paper, we considered the problem of estimating the reliability R=P [Y<X] when the distributions of both stress and strength are independent and follow exponentiated Pareto distribution. The maximum likelihood estimator of the stress strength reliability is calculated under simple random sample, ranked set sampling and median ranked set sampling methods. Four different reliability estimators under median ranked set sampling are derived. Two estimators are obtained when both strength and stress have an odd or an even set size. The two other estimators are obtained when the strength has an odd size and the stress has an even set size and vice versa. The performances of the suggested estimators are compared with their competitors under simple random sample via a simulation study. The simulation study revealed that the stress strength reliability estimates based on ranked set sampling and median ranked set sampling are more efficient than their competitors via simple random sample. In general, the stress strength reliability estimates based on median ranked set sampling are smaller than the corresponding estimates under ranked set sampling and simple random sample methods.