Search

This paper presents an enabling comprehensive vehicle stability assessment system covering vehicle longitudinal, yaw and roll stability. First, the longitudinal, lateral and vertical tire forces are separately estimated using the strong tracking unscented Kalman filter and the conventional Kalman filter based on low-cost on-board sensors. Then, a comprehensive vehicle longitudinal, yaw and roll stability space is established by utilizing the normalized tire friction ellipse and the Load Transfer Ratio value. Finally, the vehicle stability is determined and predicted based on current driver's inputs. The hardware-in-loop experimental results show that the proposed vehicle stability assessment system can accurately estimate the longitudinal, lateral and vertical tire forces with the normalized root mean square errors of 1.87 $\%$ , 1.07 $\%$ and 1.43 $\%$ , and exhibits satisfying performance for vehicle longitudinal, yaw and roll stability evaluation and prediction. This bears significance for the efficient functioning of active control systems to improve vehicle safety under critical driving conditions. [ABSTRACT FROM AUTHOR]

Channel estimation is a challenging issue for millimeter wave (mmWave) and massive multiple-input multiple-output (MIMO) in the future sixth generation (6G) wireless systems, where the conventional estimation schemes may fail to track the fast varying channels, especially in high-speed mobile scenarios. In this paper, a novel tensor-based uplink channel estimation scheme is proposed for multi-user MIMO (MU-MIMO) systems over time-varying channels. In the proposed scheme, a low-overhead pilot transmission scheme is designed to track the varying channel. The received uplink signal at the base station (BS) is formulated as a third-order tensor which admits a CANDECOMP/PARAFAC (CP) model. The CP decomposition issue is then solved using blind matrix decomposition, in which the special structures of signals in the time dimension and the matrix subspace are utilized. By exploiting low-rank structure of the signal tensor, the channel parameters (angles of arrival/departure, path gains, and Doppler shifts) are estimated from the factor matrices. Moreover, the proposed scheme is theoretically analyzed and it is guaranteed with low pilot overhead. Simulation results verify that the proposed scheme can outperform the compressed sensing (CS) based scheme and the iteration-based scheme in terms of accuracy and stability. The uniqueness of the proposed scheme is also verified in our simulation. [ABSTRACT FROM AUTHOR]

Direction-of-arrival (DOA) information is vital for multiple-input-multiple-output (MIMO) systems to complete localization and beamforming tasks. Switched antenna arrays have recently emerged as an effective solution to reduce the cost and power consumption of MIMO systems. Switch-based array architectures connect a limited number of radio frequency chains to a subset of the antenna elements forming a subarray. This paper addresses the problem of antenna selection to optimize DOA estimation performance. We first perform a subarray layout alignment process to remove subarrays with identical beampatterns and create a unique subarray set. By using this set, and based on a DOA threshold region performance approximation, we propose two antenna selection algorithms; a greedy algorithm and a deep-learning-based algorithm. The performance of the proposed algorithms is evaluated numerically. The results show a significant performance improvement over selected benchmark approaches in terms of DOA estimation in the threshold region and computational complexity. [ABSTRACT FROM AUTHOR]

Combining a global navigation satellite system (GNSS) and microelectromechanical technology-based inertial system (MINS) has become essential in land vehicle navigation systems. In an urban environment, the error of position output by GNSS receiver increases because of the blocking and reflection of the signal by buildings, which affects the positioning accuracy of the integrated system. In order to improve the positioning accuracy under these scenarios, this paper proposed a new robust method based on the estimation of the standard deviation of GNSS positioning error. In our study, a method for estimating the standard deviation ${\boldsymbol{\sigma}}^p$ (or variance) of the position error of GNSS receiver is firstly proposed. Then a robust filtering method combined multi-factor scaling and bias estimation is proposed based on the estimation of ${\boldsymbol{\sigma}}^p$. The simulations and vehicle navigation test show that the proposed method has a robust positioning effect. When ${\boldsymbol{\sigma}}^p$ increases, the position accuracy is closed to the Sage-Husa filtering method with boundary constraint (SH-KF). Simulations also indicate that the proposed method has better robust effect than the traditional Kalman filter and SH-KF when a large bias error of position exists. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel state-space model to represent the behavior of sum-product algorithm (SPA) in the vicinity of a trapping set (TS) of a low-density parity-check (LDPC) code over the additive white Gaussian noise (AWGN) channel in the error floor region. The proposed model takes into account the non-linear behavior of SPA in the initial iterations using a quadratic approximation, and dynamically adjusts the operating point of the model in accordance to the statistical properties of TS messages. This is in contrast to the existing linear state-space models which linearly approximate the non-linear behavior of SPA at around the operating point of zero in all iterations. Simulation results are provided to demonstrate the higher accuracy of the proposed model in estimating the error floor of LDPC codes compared to the linear state-space model. We also make connections to the semi-analytical code-dependent technique proposed by Richardson for the error floor estimation of LDPC codes, and demonstrate that the proposed state-space model not only is a fully-analytical code-independent counterpart to that method, but also has less complexity and, in some cases, more accuracy. [ABSTRACT FROM AUTHOR]

The clustering of incomplete patterns is a very challenging task because the estimations may negatively affect the distribution of real centers and thus cause uncertainty and imprecision in the results. To address this problem, a new belief-based incomplete pattern unsupervised classification method (BPC) is proposed in this paper. First, the complete patterns are grouped into a few clusters by a classical soft method like fuzzy $c$ c -means to obtain the corresponding reliable centers and thereby are partitioned into reliable patterns and unreliable ones by an optimization method. Second, a basic classifier trained by reliable patterns is employed to classifies unreliable patterns and the incomplete patterns edited by the neighbors. In this way, most of the edited incomplete patterns can be submitted to specific clusters. Finally, some ambiguous patterns will be carefully repartitioned again by a new distance-based rule depending on the obtained reliable centers and belief functions theory. By doing this, a few patterns that are very difficult to classify between different specific clusters will be reasonably submitted to meta-cluster which can characterize the uncertainty and imprecision of the clusters due to missing values. The simulation results show that the BPC has the potential to deal with real datasets. [ABSTRACT FROM AUTHOR]

Many real-world datasets are given in the stream of entity-identifier pairs, and measuring data distribution on these datasets is fundamental for applications such as privacy protection. In this paper, we study the problem of computing the cumulative distribution for different cardinalities (i.e., the number of distinct entities owning the same identifier). However, previous sketch-based methods cost large memory space especially when there are a large number of identifiers, and sampling-based methods require much time for cardinality estimation. A recent work KHyperLogLog combines both sketch and sampling methods but it is wasteful to separately build a HyperLogLog sketch of large size for identifiers with small cardinalities. To address these challenges, we propose a memory-efficient method EV-HLL, which designs a shared structure to store all sampled identifiers and their entities and utilizes additional sketches to track value updates during the sampling procedure. Meanwhile, EV-HLL provides real-time unbiased estimations according to value changes whenever a new entity-identifier pair arrives. We evaluate the performance of EV-HLL and other state-of-the-arts on real-world available datasets. Experimental results demonstrate that comparing to other methods, EV-HLL effectively reduces their memory usage with the same estimation accuracy and has higher accuracy with the same memory usage. [ABSTRACT FROM AUTHOR]

In sparse linear regression, the SLOPE estimator generalizes LASSO by penalizing different coordinates of the estimate according to their magnitudes. In this paper, we present a precise performance characterization of SLOPE under the i.i.d. Gaussian design. We focus on the asymptotic regime where the number of unknown parameters grows in proportion to the number of observations. Our asymptotic characterization enables us to derive the fundamental limits of SLOPE in both estimation and variable selection settings. We also provide a computationally feasible way to optimally design the regularizing sequences to reach the aforementioned fundamental limits. In both settings, we show that the optimal design problem can be formulated as certain infinite-dimensional convex optimization problems that have efficient and accurate finite-dimensional approximations. Numerical simulations verify all our asymptotic predictions. They demonstrate the superiority of our optimal regularizing sequences over other designs used in the existing literature. [ABSTRACT FROM AUTHOR]

This paper describes one of the non-linear (and non-stationary) stochastic models, the GSB (Gaussian, or Generalized, Split-BREAK) process, which is used in the analysis of time series with pronounced and accentuated fluctuations. In the beginning, the stochastic structure of the GSB process and its important distributional and asymptotic properties are given. To that end, a method based on characteristic functions (CFs) was used. Various procedures for the estimation of model parameters, asymptotic properties, and numerical simulations of the obtained estimators are also investigated. Finally, as an illustration of the practical application of the GSB process, an analysis is presented of the dynamics and stochastic distribution of the infected and immunized population in relation to the disease COVID-19 in the territory of the Republic of Serbia. [ABSTRACT FROM AUTHOR]

Recently, deep semi-supervised hashing methods have attracted increasing attention, which can significantly improve retrieval performance by leveraging abundant unlabeled data. These methods usually generate surrogate supervision signals to learn with unlabeled data, such as neighborhood information and augmentation invariant requirements. However, an essential issue of these methods is that the supervised signals are not always reliable, which may damage the performance. In this paper, we propose a novel Uncertainty-Aware and Multi-Granularity Consistent Constrained Semi-Supervised Hashing (UMCSH) method to alleviate the negative effects of noisy supervised signals and enlarge the inter-class distance. Specifically, our UMCSH mainly consists of an Uncertainty-Aware Instance-Level Consistency (UAILC) model and a Cluster-Based Class-Level Consistency (CBCLC) model. UAILC introduces an uncertainty estimation method to select reliable supervised signals to extract discriminative features for each unlabeled data. CBCLC establishes connections between labeled data and unlabeled data by encouraging each unlabeled sample to be close to the hash center (calculated with the labeled data) according to its pseudo-label. Extensive experimental results demonstrate the superior performance of our proposed approach compared with several state-of-the-art semi-supervised hashing methods. [ABSTRACT FROM AUTHOR]

Cross-modal hashing that leverages hash functions to project high-dimensional data from different modalities into the compact common hamming space, has shown immeasurable potential in cross-modal retrieval. To ease labor costs, unsupervised cross-modal hashing methods are proposed. However, existing unsupervised methods still suffer from two factors in the optimization of hash functions: 1) similarity guidance, they barely give a clear definition of whether is similar or not between data points, leading to the residual of the redundant information; 2) optimization strategy, they ignore the fact that the similarity learning abilities of different hash functions are different, which makes the hash function of one modality weaker than the hash function of the other modality. To alleviate such limitations, this paper proposes an unsupervised cross-modal hashing method to train hash functions with discriminative similarity guidance and adaptively-enhanced optimization strategy, termed Deep Adaptively-Enhanced Hashing (DAEH). Specifically, to estimate the similarity relations with discriminability, Information Mixed Similarity Estimation (IMSE) is designed by integrating information from distance distributions and the similarity ratio. Moreover, Adaptive Teacher Guided Enhancement (ATGE) optimization strategy is also designed, which employs information theory to discover the weaker hash function and utilizes an extra teacher network to enhance it. Extensive experiments on three benchmark datasets demonstrate the superiority of the proposed DAEH against the state-of-the-arts. [ABSTRACT FROM AUTHOR]

Digital and smart sensors are commonly implemented using multi-bit Σ Δ Modulators. Undesired signals can be present at the ADC input, such as low-frequency signals with medium or high amplitude, as a consequence of mechanical artifacts in the MEMS and/or temporary signal overload. Simulations and measurements of those sensors with such signals show temporary increments of in-band noise power. This paper investigates the factors that produce this transient performance loss. Interestingly, noise increments happen when the modulator is forced to toggle between three adjacent levels and is not correlated with the typical tonal behavior of Σ Δ Modulators. Hence, the sensor performance is sensitive to some specific input patterns even if tonal behavior is decreased by dithering the input of the ADC. Different error sources, such as the mismatch between DAC cells, loop filter linearity error, and quantization error, contribute to the observed noise increments. Our aim is to analyze each of these error sources to understand and quantify in-band noise power increments, and to desensitize the ADC from the undesired input patterns. Some estimation equations are proposed and verified through extensive simulations, by means of deterministic and stochastic methods. These equations are influenced by some modulator parameters and can be used to optimize them in order to reduce such in-band noise power increments. [ABSTRACT FROM AUTHOR]

Generating non-existing frames from a consecutive video sequence has been an interesting and challenging problem in the video processing field. Typical kernel-based interpolation methods predict pixels with a single convolution process that convolves source frames with spatially adaptive local kernels, which circumvents the time-consuming, explicit motion estimation in the form of optical flow. However, when scene motion is larger than the pre-defined kernel size, these methods are prone to yield less plausible results. In addition, they cannot directly generate a frame at an arbitrary temporal position because the learned kernels are tied to the midpoint in time between the input frames. In this paper, we try to solve these problems and propose a novel non-flow kernel-based approach that we refer to as enhanced deformable separable convolution (EDSC) to estimate not only adaptive kernels, but also offsets, masks and biases to make the network obtain information from non-local neighborhood. During the learning process, different intermediate time step can be involved as a control variable by means of an extension of coord-conv trick, allowing the estimated components to vary with different input temporal information. This makes our method capable to produce multiple in-between frames. Furthermore, we investigate the relationships between our method and other typical kernel- and flow-based methods. Experimental results show that our method performs favorably against the state-of-the-art methods across a broad range of datasets. Code will be publicly available on URL: https://github.com/Xianhang/EDSC-pytorch. [ABSTRACT FROM AUTHOR]

Measuring contact friction in soft-bodies usually requires a specialised physics bench and a tedious acquisition protocol. This makes the prospect of a purely non-invasive, video-based measurement technique particularly attractive. Previous works have shown that such a video-based estimation is feasible for material parameters using deep learning, but this has never been applied to the friction estimation problem which results in even more subtle visual variations. Because acquiring a large dataset for this problem is impractical, generating it from simulation is the obvious alternative. However, this requires the use of a frictional contact simulator whose results are not only visually plausible, but physically-correct enough to match observations made at the macroscopic scale. In this paper, which is an extended version of our former work A. H. Rasheed, V. Romero, F. Bertails-Descoubes, S. Wuhrer, J.-S. Franco, and A Lazarus, “Learning to measure the static friction coefficient in cloth contact,” in Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit., 2020, pp. 9909–9918, we propose to our knowledge the first non-invasive measurement network and adjoining synthetic training dataset for estimating cloth friction at contact, for both cloth-hard body and cloth-cloth contacts. To this end we build a protocol for validating and calibrating a state-of-the-art frictional contact simulator, in order to produce a reliable dataset. We furthermore show that without our careful calibration procedure, the training fails to provide accurate estimation results on real data. We present extensive results on a large acquired test set of several hundred real video sequences of cloth in friction, which validates the proposed protocol and its accuracy. [ABSTRACT FROM AUTHOR]

Off-policy reinforcement learning (RL) holds the promise of better data efficiency as it allows sample reuse and potentially enables safe interaction with the environment. Current off-policy policy gradient methods either suffer from high bias or high variance, delivering often unreliable estimates. The price of inefficiency becomes evident in real-world scenarios such as interaction-driven robot learning, where the success of RL has been rather limited, and a very high sample cost hinders straightforward application. In this paper, we propose a nonparametric Bellman equation, which can be solved in closed form. The solution is differentiable w.r.t the policy parameters and gives access to an estimation of the policy gradient. In this way, we avoid the high variance of importance sampling approaches, and the high bias of semi-gradient methods. We empirically analyze the quality of our gradient estimate against state-of-the-art methods, and show that it outperforms the baselines in terms of sample efficiency on classical control tasks. [ABSTRACT FROM AUTHOR]

Reliably quantifying the confidence of deep neural classifiers is a challenging yet fundamental requirement for deploying such models in safety-critical applications. In this paper, we introduce a novel target criterion for model confidence, namely the true class probability (TCP). We show that TCP offers better properties for confidence estimation than standard maximum class probability (MCP). Since the true class is by essence unknown at test time, we propose to learn TCP criterion from data with an auxiliary model, introducing a specific learning scheme adapted to this context. We evaluate our approach on the task of failure prediction and of self-training with pseudo-labels for domain adaptation, which both necessitate effective confidence estimates. Extensive experiments are conducted for validating the relevance of the proposed approach in each task. We study various network architectures and experiment with small and large datasets for image classification and semantic segmentation. In every tested benchmark, our approach outperforms strong baselines. [ABSTRACT FROM AUTHOR]

Registration of brain MRI images requires to solve a deformation field, which is extremely difficult in aligning intricate brain tissues, e.g., subcortical nuclei, etc. Existing efforts resort to decomposing the target deformation field into intermediate sub-fields with either tiny motions, i.e., progressive registration stage by stage, or lower resolutions, i.e., coarse-to-fine estimation of the full-size deformation field. In this paper, we argue that those efforts are not mutually exclusive, and propose a unified framework for robust brain MRI registration in both progressive and coarse-to-fine manners simultaneously. Specifically, building on a dual-encoder U-Net, the fixed-moving MRI pair is encoded and decoded into multi-scale sub-fields from coarse to fine. Each decoding block contains two proposed novel modules: i) in Deformation Field Integration (DFI), a single integrated deformation sub-field is calculated, warping by which is equivalent to warping progressively by sub-fields from all previous decoding blocks, and ii) in Non-rigid Feature Fusion (NFF), features of the fixed-moving pair are aligned by DFI-integrated deformation field, and then fused to predict a finer sub-field. Leveraging both DFI and NFF, the target deformation field is factorized into multi-scale sub-fields, where the coarser fields alleviate the estimate of a finer one and the finer field learns to make up those misalignments insolvable by previous coarser ones. The extensive and comprehensive experimental results on both private and two public datasets demonstrate a superior registration performance of brain MRI images over progressive registration only and coarse-to-fine estimation only, with an increase by at most 8% in the average Dice. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem involved when designing the interval observer for the system described by a linear discrete-time model under external disturbances and measurement noises. To solve this problem, we used the reduced order model of the initial system, which is insensitive or has minimal sensitivity to the disturbances. The relations involved in designing the interval observer, which has minimal dimensions and estimates the prescribed linear function of the original system state vector, were obtained. The theoretical results were illustrated by a practical example. [ABSTRACT FROM AUTHOR]

Cancer formation is one of the pathologies whose frequency has increased in the recent years. In the literature, the compartment models, which are non-linear, are used for such problems. In nonlinear compartment models, nonlinear state space models and the extended Kalman filter (EKF) are used to estimate the parameter and the state vector. This paper presents a discrete-time Gompertz model (DTGM) for the transfer of optical contrast agent, namely indocyanine green (ICG), in the presence of tumors between the plasma and extracellular extravascular space (EES) compartments. The DTGM, which is proposed for ICG and the estimation of ICG densities used in the vascular invasion of tumor cells of the compartments and in the measurement of migration from the intravascular area to the tissues, is obtained from the experimental data of the study. The ICG values are estimated online (recursive) using the DTGM and the adaptive Kalman filter (AKF) based on the experimental data. By employing the data, the results show that the DTGM in conjunction with the AKF provides a good analysis tool for modeling the ICG in terms of mean square error (MSE), mean absolute percentage error (MAPE) and R². When the results obtained from the compartment model used in the reference 9 are compared with the results obtained with the DTGM, the DTGM gives better results in terms of MSE, MAPE and R² criteria. The DTGM and the AKF compartment model require less numerical processing when compared to the EKF, which indicates that DTGM is a less complicated model. In the literature, EKF is used for such problems. [ABSTRACT FROM AUTHOR]

The full-cycle discrete Fourier transform (FCDFT) is commonly used to estimate phasors in numerical relays because of its immunity to harmonics and accurate identification of a decaying dc component (DDC) in a fault current. For fast protection of power systems, it is necessary to speed up the phasor estimation by using a data window below one cycle. The conventional least squares (LS) methods below one cycle approximate the DDC as the first several terms of the Taylor series expansion, which degrades the phasor-estimation accuracy. This paper proposes an LS method that uses Fourier analysis for approximation of the DDC to speed up phasor estimation without accuracy degradation. The phasor-estimation accuracy of the proposed method is investigated for the data-window length in simulations using synthetic data of fault currents containing DDC, harmonics, and measurement noise. The phasor-estimation speed is also investigated with respect to the delay of the antialiasing filter in the numerical relay. The proposed method is compared with the conventional LS and FCDFT methods in simulations using synthetic fault-current data. The feasibility of the proposed method is demonstrated through the phasor estimation of simulated transmission-line faults. [ABSTRACT FROM AUTHOR]

Local differential privacy (LDP) is an emerging technique for privacy-preserving data collection without a trusted collector. Despite its strong privacy guarantee, LDP cannot be easily applied to real-world graph analysis tasks such as community detection and centrality analysis due to its high implementation complexity and low data utility. In this paper, we address these two issues by presenting LF-GDPR, the first LDP-enabled graph metric estimation framework for graph analysis. It collects two atomic graph metrics—the adjacency bit vector and node degree—from each node locally. LF-GDPR simplifies the job of implementing LDP-related steps (e.g., local perturbation, aggregation and calibration) for a graph metric estimation task by providing either a complete or a parameterized algorithm for each step. To address low data utility of LDP, it optimally allocates privacy budget between the two atomic metrics during data collection. To demonstrate the usage of LF-GDPR, we show use cases on two common graph analysis tasks, namely, clustering coefficient estimation and community detection. The privacy and utility achieved by LF-GDPR are verified through theoretical analysis and extensive experimental results. [ABSTRACT FROM AUTHOR]

Faced with massive data, subsampling is a commonly used technique to improve computational efficiency, and using nonuniform subsampling probabilities is an effective approach to improve estimation efficiency. For computational efficiency, subsampling is often implemented with replacement or through Poisson subsampling. However, no rigorous investigation has been performed to study the difference between the two subsampling procedures such as their estimation efficiency and computational convenience. This paper performs a comparative study on these two different sampling procedures. In the context of maximizing a general target function, we first derive asymptotic distributions for estimators obtained from the two sampling procedures. The results show that the Poisson subsampling may have a higher estimation efficiency. Based on the asymptotic distributions for both subsampling with replacement and Poisson subsampling, we derive optimal subsampling probabilities that minimize the variance functions of the subsampling estimators. These subsampling probabilities further reveal the similarities and differences between subsampling with replacement and Poisson subsampling. The theoretical characterizations and comparisons on the two subsampling procedures provide guidance to select a more appropriate subsampling approach in practice. Furthermore, practically implementable algorithms are proposed based on the optimal structural results, which are evaluated through both theoretical and empirical analyses. [ABSTRACT FROM AUTHOR]

Pooled (or group) testing has been widely used for the surveillance of infectious diseases of low prevalence. The potential benefits of pooled testing include savings in testing time and costs, reducing false positive tests, and estimating models or making predictions from limited observed data information (e.g., only initial pooled responses). However, realizing these benefits often critically depends on the pool size used. Statistical methods introduced in the literature for optimal pool size determination have been developed mainly to accommodate simpler pooling protocols or perfect diagnostic assays. In this article, we study these issues with the goal of presenting a general optimization technique. We evaluate the efficiency of the estimators of disease prevalence (i.e., the proportion of diseased individuals in a population) while accounting for testing costs. Then, we determine the optimal pool size by minimizing the measures of optimality, such as screening efficiency and estimation efficiency. Our findings are illustrated using data from an ongoing screening application at the Louisiana Department of Health. We show that when a pooling application is properly designed, substantial advantages can be realized. We provide an R package and a software application to facilitate the implementation of our optimization techniques. Supplementary materials accompanying this paper appear online. [ABSTRACT FROM AUTHOR]

In this paper, classification of mental task-root brain–computer interfaces (BCIs) is being investigated. The mental tasks are dominant area of investigations in BCI, which utmost interest as these system can be augmented life of people having severe disabilities. The performance of BCI model primarily depends on the construction of features from brain, electroencephalography (EEG), signal, and the size of feature vector, which are obtained through multiple channels. The availability of training samples to features are minimal for mental task classification. The feature selection is used to increase the ratio for the mental task classification by getting rid of irrelevant and superfluous features. This paper suggests an approach to augment the performance of a learning algorithm for the mental task classification on the utility of power spectral density (PSD) using feature selection. This paper also deals a comparative analysis of multivariate and univariate feature selection for mental task classification. After applying the above stated method, the findings demonstrate substantial improvements in the performance of learning model for mental task classification. Moreover, the efficacy of the proposed approach is endorsed by carrying out a robust ranking algorithm and Friedman’s statistical test for finding the best combinations and compare various combinations of PSD and feature selection methods. [ABSTRACT FROM AUTHOR]

Purpose: Current industry practices illustrate there is no standard method to estimate the number of hours worked on maintenance activities; instead, industry experts use experience to guess maintenance work hours. There is also a gap in the research literature on maintenance work hour estimation. This paper investigates the use of machine-learning algorithms to predict maintenance work hours and proposes a method that utilizes historical preventive maintenance order data to predict maintenance work hours. Design/methodology/approach: The paper uses the design research methodology utilizing a case study to validate the proposed method. Findings: The case study analysis confirms that the proposed method is applicable and has the potential to significantly improve work hour prediction accuracy, especially for medium- and long-term work orders. Moreover, the study finds that this method is more accurate and more efficient than conducting estimations based on experience. Practical implications: The study has major implications for industrial applications. Maintenance-intensive industries such as oil and gas and chemical industries spend a huge portion of their operational expenditures (OPEX) on maintenance. This research will enable them to accurately predict work hour requirements that will help them to avoid unwanted downtime and costs and improve production planning and scheduling. Originality/value: The proposed method provides new insights into maintenance theory and possesses a huge potential to improve the current maintenance planning practices in the industry. [ABSTRACT FROM AUTHOR]

The sunflower crop is one of the most important crops from an economic point of view for Romania, being cultivated on large areas. The pedoclimatic conditions in our country allow the cultivation of sunflower in different areas, and the drought resistance of this crop helps farmers to obtain high yields. In this study, the main technical indicators were compared, such as: area, total production and average production for two distinct periods 1994-2006, respectively 2007-2019, thus delimiting the period before accession and after accession to the European Union. Based on these indicators were the comparisons of the averages of the two periods using the Student Test method, as well as the estimation of the main technical indicators until 2030. The aim of the paper was to determine statistically the dependence of the averages of the two periods the evolution of the main technical indicators. [ABSTRACT FROM AUTHOR]

This paper addresses current needs of the Multi-Unit Probabilistic Safety Assessment (MUPSA) methodology, which consists of a series of eight essential steps for conducting Probabilistic Safety Assessment (PSA) in the context of a multi-unit Nuclear Power Plant (NPP), co-located on a single site. The focus of this study revolves around one of the steps of the MUPSA methodology, which includes the examination of the importance factors and uncertainty analysis. Emphasizing the role of this step within MUPSA, the paper highlights the hypothesis and estimations made, along with the determination of system importance factors and failure frequency. To illustrate the practical application of these concepts, the paper presents three illustrative examples. The first example involves a 3-terminal reliability network, while the second example features an illustrative calculation applied to a system designed for potential use in a real NPP, compared to a Monte-Carlo simulation. Moreover, the second example involves the evaluation of a medium voltage distribution system (MVDS) designed to meet the auxiliary supply requirements of a nuclear power plant. This analysis is performed using a binary decision diagram (BDD), and the results derived from the BDD evaluation are then verified with those obtained through a Monte Carlo simulation for a comprehensive comparative analysis. Finally, an uncertainty analysis is achieved using a BDD reliability model, using the results of fault trees developed by National Company SN Nuclearelectrica S.A. (SNN), Department of Nuclear Safety, in the context of the Coordinated Research Project (CRP- I31031). • A meaningful method for probabilistic estimation of uncertainty is proposed. • Plug-in estimator allows for calculating system unavailability and estimating corresponding variance. • Presented method is applicable in the uncertainty analysis for importance factors computation in Level 1 multi-unit PSA. • Adaptation of state merging scheme on large-scale systems can be further studied. [ABSTRACT FROM AUTHOR]

As a specific data hiding technique, reversible data hiding (RDH) has recently received extensive attention. By this technique, both the embedded data and the original cover image can be exactly extracted from the marked image. In our previous work, a general expansion-shifting model for RDH is proposed by introducing the so-called reversible embedding function (REF). With REF, RDH can be designed and the corresponding rate-distortion formulations can be established, providing an approach to optimize the reversible embedding performance. In this paper, by extending our previous work, optimal REF for one-dimensional histogram is investigated, and all optimal REF are derived in this case when the maximum modification to the cover pixel is limited as a small value. Moreover, based on the derived optimal REF for one-dimensional histogram and multiple histograms modification, a practical RDH scheme is presented and it is experimental verified better than some state-of-the-art algorithms in terms of capacity-distortion performance. [ABSTRACT FROM AUTHOR]

With the widespread use of deep learning in single object tracking task, mainstream tracking algorithms treat tracking as a combined classification and regression problem. Classification aims at locating an arbitrary target, and regression aims at estimating the corresponding bounding box. In this paper, we focus on regression and propose a novel box estimation network, which consists of a transformer encoder target pyramid guide (TPG) and transformer decoder target pyramid spread (TPS). Specifically, the transformer encoder TPG is designed to generate fine-grained prior knowledge with explicit representation for template targets. In contrast to the raw transformer encoder, we capture the visual dependence through local-global self-attention and deem the multi-scale target regions as the “local” region. Using this fine-grained prior knowledge, we design the transformer decoder TPS to spread it to the subsequent search regions with high affinity to accurately estimate the bounding boxes. Considering that self-attention fails to model information interaction across channels between the template target and search regions, we develop a channel-wise cross-attention block within the TPS as compensation. Extensive experiments on the OTB100, UAV123, NFS, VOT2020, VOT2021, LaSOT, LaSOT_ext, TrackingNet and GOT-10k benchmarks show that the proposed box estimation network outperforms most existing box estimation methods. Furthermore, our trackers based on this estimation network exhibit a competitive performance against state-of-the-art trackers. [ABSTRACT FROM AUTHOR]

Event cameras such as the Dynamic Vision Sensor (DVS) are useful because of their low latency, sparse output, and high dynamic range. In this paper, we propose a DVS+FPGA camera platform and use it to demonstrate the hardware implementation of event-based corner keypoint detection and adaptive block-matching optical flow. To adapt sample rate dynamically, events are accumulated in event slices using the area event count slice exposure method. The area event count is feedback controlled by the average optical flow matching distance. Corners are detected by streaks of accumulated events on event slice rings of radius 3 and 4 pixels. Corner detection takes about 6 clock cycles (16 MHz event rate at the 100MHz clock frequency) At the corners, flow vectors are computed in 100 clock cycles (1 MHz event rate). The multiscale block match size is $25\times 25$ pixels and the flow vectors span up to 30-pixel match distance. The FPGA processes the sum-of-absolute distance block matching at 123 GOp/s, the equivalent of 1230 Op/clock cycle. EDFLOW is several times more accurate on MVSEC drone and driving optical flow benchmarking sequences than the previous best DVS FPGA optical flow implementation, and achieves similar accuracy to the CNN-based EV-Flownet, although it burns about 100 times less power. The EDFLOW design and benchmarking videos are available at https://sites.google.com/view/edflow21/home. [ABSTRACT FROM AUTHOR]

Discriminative correlation filter (DCF)-based methods have demonstrated superior performance in UAV tracking via fusing multiple types of features and updating models online. However, most DCF-based trackers simply cascade different features, failing to fully take advantage of their complementary strength. In addition, online update strategies are limited to using a single and fixed learning rate, which often leads to model degradation when suffering tracking challenges. In this paper, we present an Auto-Perceiving Correlation Filter (APCF) which explicitly models the target and context with a novel Target State and Background Perception (TSBP) feature. Concretely, we first propose a simple yet effective State Evaluation Metric (SEM) to estimate target states by analyzing the spatial distribution of responses. Based on SEM, we extract TSBP features by adaptively selecting effective features depending on the current target state. Accordingly, a new online model update strategy is also introduced to avoid model degradation. Moreover, we further introduce a perception regularization term to make the extracted feature emphasis more on the target rather than background. Extensive experiments on four widely-used UAV benchmarks have well demonstrated the superiority of the proposed method compared with both DCF and deep learning based trackers while running at a high speed of 76.7 FPS on a single CPU. In addition, APCF with deep features also performs favorably against state-of-the-art trackers. [ABSTRACT FROM AUTHOR]

Continuous and accurate depth information of blast furnace burden surface is important for optimizing charging operations, thereby reducing its energy consumption and CO2 emissions. However, depth estimation for a single image is challenging, especially when estimating the depth of burden surface images in the harsh internal environment of the blast furnace. In this paper, a novel method that is based on edge defocus tracking is proposed to estimate the depth of burden surface images with different morphological characteristics. First, an endoscopic video acquisition system is designed, key frames of burden surface video in stable state are extracted based on feature point optical flow method, and the sparse depth is estimated by using the defocus-based method. Next, the burden surface image is divided into four subregions according to the distribution characteristics of the burden surface, the edge line trajectories and an eight-direction depth gradient template are designed to develop depth propagation rules. Finally, the depth is propagated from edge to the entire image based on edge line tracking method. The experimental results show that the proposed method can accurately and efficiently estimate the depth of the burden surface and provide key data support for optimizing the operation of blast furnace. [ABSTRACT FROM AUTHOR]

The inertia information of both synchronous generators (SGs)/equivalent SGs and converter interfaced generators (CIGs) are crucial to maintain the frequency stability of modern power grids. This paper proposes a novel data-driven method using ambient measurements, which seems to be the first method that can estimate the inertia constants of SGs/equivalent SGs and the virtual inertia constants of CIGs simultaneously without disturbing the system’s normal operating condition. Numerical studies in the IEEE 68-bus system demonstrate that the developed estimation method can estimate the inertia constants of different generation units accurately and is robust to measurement noises, missing measurements and the variation of operating conditions. [ABSTRACT FROM AUTHOR]

In this paper we present methods for estimating shape from polarisation and shading information, i.e. photo-polarimetric shape estimation, under varying, but unknown, illumination, i.e. in an uncalibrated scenario. We propose several alternative photo-polarimetric constraints that depend upon the partial derivatives of the surface and show how to express them in a unified system of partial differential equations of which previous work is a special case. By careful combination and manipulation of the constraints, we show how to eliminate non-linearities such that a discrete version of the problem can be solved using linear least squares. We derive a minimal, combinatorial approach for two source illumination estimation which we use with RANSAC for robust light direction and intensity estimation. We also introduce a new method for estimating a polarisation image from multichannel data and provide methods for estimating albedo and refractive index. We evaluate lighting, shape, albedo and refractive index estimation methods on both synthetic and real-world data showing improvements over existing state-of-the-art. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel system named Disp R-CNN for 3D object detection from stereo images. Many recent works solve this problem by first recovering point clouds with disparity estimation and then apply a 3D detector. The disparity map is computed for the entire image, which is costly and fails to leverage category-specific prior. In contrast, we design an instance disparity estimation network (iDispNet) that predicts disparity only for pixels on objects of interest and learns a category-specific shape prior for more accurate disparity estimation. To address the challenge from scarcity of disparity annotation in training, we propose to use a statistical shape model to generate dense disparity pseudo-ground-truth without the need of LiDAR point clouds, which makes our system more widely applicable. Experiments on the KITTI dataset show that, when LiDAR ground-truth is not used at training time, Disp R-CNN outperforms previous state-of-the-art methods based on stereo input by 20 percent in terms of average precision for all categories. The code and pseudo-ground-truth data are available at the project page: https://github.com/zju3dv/disprcnn. [ABSTRACT FROM AUTHOR]

This paper generalizes the Attention in Attention (AiA) mechanism, in P. Fang et al., 2019 by employing explicit mapping in reproducing kernel Hilbert spaces to generate attention values of the input feature map. The AiA mechanism models the capacity of building inter-dependencies among the local and global features by the interaction of inner and outer attention modules. Besides a vanilla AiA module, termed linear attention with AiA, two non-linear counterparts, namely, second-order polynomial attention and Gaussian attention, are also proposed to utilize the non-linear properties of the input features explicitly, via the second-order polynomial kernel and Gaussian kernel approximation. The deep convolutional neural network, equipped with the proposed AiA blocks, is referred to as Attention in Attention Network (AiA-Net). The AiA-Net learns to extract a discriminative pedestrian representation, which combines complementary person appearance and corresponding part features. Extensive ablation studies verify the effectiveness of the AiA mechanism and the use of non-linear features hidden in the feature map for attention design. Furthermore, our approach outperforms current state-of-the-art by a considerable margin across a number of benchmarks. In addition, state-of-the-art performance is also achieved in the video person retrieval task with the assistance of the proposed AiA blocks. [ABSTRACT FROM AUTHOR]

The light field (LF) reconstruction is mainly confronted with two challenges, large disparity and the non-Lambertian effect. Typical approaches either address the large disparity challenge using depth estimation followed by view synthesis or eschew explicit depth information to enable non-Lambertian rendering, but rarely solve both challenges in a unified framework. In this paper, we revisit the classic LF rendering framework to address both challenges by incorporating it with advanced deep learning techniques. First, we analytically show that the essential issue behind the large disparity and non-Lambertian challenges is the aliasing problem. Classic LF rendering approaches typically mitigate the aliasing with a reconstruction filter in the Fourier domain, which is, however, intractable to implement within a deep learning pipeline. Instead, we introduce an alternative framework to perform anti-aliasing reconstruction in the image domain and analytically show comparable efficacy on the aliasing issue. To explore the full potential, we then embed the anti-aliasing framework into a deep neural network through the design of an integrated architecture and trainable parameters. The network is trained through end-to-end optimization using a peculiar training set, including regular LFs and unstructured LFs. The proposed deep learning pipeline shows a substantial superiority in solving both the large disparity and the non-Lambertian challenges compared with other state-of-the-art approaches. In addition to the view interpolation for an LF, we also show that the proposed pipeline also benefits light field view extrapolation. [ABSTRACT FROM AUTHOR]

This paper explores the non-convex composition optimization consisting of inner and outer finite-sum functions with a large number of component functions. This problem arises in important applications such as nonlinear embedding and reinforcement learning. Although existing approaches such as stochastic gradient descent (SGD) and stochastic variance reduced gradient (SVRG) descent can be applied to solve this problem, their query complexities tend to be high, especially when the number of inner component functions is large. Therefore, to significantly improve the query complexity of current approaches, we have devised the stochastic composition via variance reduction (SCVR). What's more, we analyze the query complexity under different numbers of inner function and outer function. Based on different kinds of estimation of inner component function, we also present the SCVRII algorithm, though the order of query complexities are the same with SCVR. Additionally, we propose an extension to handle the mini-batch cases, which improve the query complexity under the optimal mini-batch size. The experimental results validate our proposed algorithms and theoretical analyses. [ABSTRACT FROM AUTHOR]

Stereo matching is one of the longest-standing problems in computer vision with close to 40 years of studies and research. Throughout the years the paradigm has shifted from local, pixel-level decision to various forms of discrete and continuous optimization to data-driven, learning-based methods. Recently, the rise of machine learning and the rapid proliferation of deep learning enhanced stereo matching with new exciting trends and applications unthinkable until a few years ago. Interestingly, the relationship between these two worlds is two-way. While machine, and especially deep, learning advanced the state-of-the-art in stereo matching, stereo itself enabled new ground-breaking methodologies such as self-supervised monocular depth estimation based on deep networks. In this paper, we review recent research in the field of learning-based depth estimation from single and binocular images highlighting the synergies, the successes achieved so far and the open challenges the community is going to face in the immediate future. [ABSTRACT FROM AUTHOR]

Stereo matching is one of the most popular techniques to estimate dense depth maps by finding the disparity between matching pixels on two, synchronized and rectified images. Alongside with the development of more accurate algorithms, the research community focused on finding good strategies to estimate the reliability, i.e., the confidence, of estimated disparity maps. This information proves to be a powerful cue to naively find wrong matches as well as to improve the overall effectiveness of a variety of stereo algorithms according to different strategies. In this paper, we review more than ten years of developments in the field of confidence estimation for stereo matching. We extensively discuss and evaluate existing confidence measures and their variants, from hand-crafted ones to the most recent, state-of-the-art learning based methods. We study the different behaviors of each measure when applied to a pool of different stereo algorithms and, for the first time in literature, when paired with a state-of-the-art deep stereo network. Our experiments, carried out on five different standard datasets, provide a comprehensive overview of the field, highlighting in particular both strengths and limitations of learning-based strategies. [ABSTRACT FROM AUTHOR]

3D human pose and shape estimation from monocular images has been an active research area in computer vision. Existing deep learning methods for this task rely on high-resolution input, which however, is not always available in many scenarios such as video surveillance and sports broadcasting. Two common approaches to deal with low-resolution images are applying super-resolution techniques to the input, which may result in unpleasant artifacts, or simply training one model for each resolution, which is impractical in many realistic applications. To address the above issues, this paper proposes a novel algorithm called RSC-Net, which consists of a Resolution-aware network, a Self-supervision loss, and a Contrastive learning scheme. The proposed method is able to learn 3D body pose and shape across different resolutions with one single model. The self-supervision loss enforces scale-consistency of the output, and the contrastive learning scheme enforces scale-consistency of the deep features. We show that both these new losses provide robustness when learning in a weakly-supervised manner. Moreover, we extend the RSC-Net to handle low-resolution videos and apply it to reconstruct textured 3D pedestrians from low-resolution input. Extensive experiments demonstrate that the RSC-Net can achieve consistently better results than the state-of-the-art methods for challenging low-resolution images. [ABSTRACT FROM AUTHOR]

In oncology clinical trials, response‐based endpoints (time to response, objective response, duration of response [DOR]) are commonly used to detect therapeutic effect to support proof‐of‐concept or submission decisions. The restricted mean DOR (RMDOR) was recently proposed as a composite nonparametric method to efficiently quantify the treatment effect related to tumor reductions, which offers an intuitive way to perform statistical inference in cross‐arm comparison and has since been applied in some Phase III studies. In this paper, we provide further technical details and asymptotic properties of the RMDOR method and discuss the selection of the truncation time. A simulation study is conducted comparing the performance of the proposed method with existing standard methods in hypothesis testing and quantification of treatment efficacy. We use two oncology Phase III examples to illustrate the method. An R package PBIR and a SAS macro are available to perform statistical inference based on the RMDOR. [ABSTRACT FROM AUTHOR]

Most deep learning models for temporal regression directly output the estimation based on single input images, ignoring the relationships between different images. In this paper, we propose deep relation learning for regression, aiming to learn different relations between a pair of input images. Four non-linear relations are considered: “cumulative relation,” “relative relation,” “maximal relation” and “minimal relation.” These four relations are learned simultaneously from one deep neural network which has two parts: feature extraction and relation regression. We use an efficient convolutional neural network to extract deep features from the pair of input images and apply a Transformer for relation learning. The proposed method is evaluated on a merged dataset with 6,049 subjects with ages of 0–97 years using 5-fold cross-validation for the task of brain age estimation. The experimental results have shown that the proposed method achieved a mean absolute error (MAE) of 2.38 years, which is lower than the MAEs of 8 other state-of-the-art algorithms with statistical significance (p<0.05) in paired T-test (two-side). [ABSTRACT FROM AUTHOR]

Power sharing amongst sources can be improved in an islanded microgrid by utilizing the information of the network’s impedance. In this paper, an impedance based model reference adaptive system (Z-MRAS) scheme is proposed to estimate the impedance angle for converter based distributed generators (DGs) in the islanded mode. The focus is to enhance the proportional apparent power sharing between the DGs operated using generalized droop control (GDC). The performance of GDC depends on the effective tie-line impedance between the DGs and the proposed MRAS scheme provides the feedback of the estimated impedance angle. The accuracy of the impedance angle estimation is established for various tie-line $X/R$ ratios, and this results in enhanced power sharing performance for balanced, harmonic, unbalanced, dynamic and constant power load cases as well as parallel line and underground cable cases. The proposed method is validated through off-line simulations in MATLAB and controller hardware in loop (CHIL) using real time simulator (Opal-RT) including cases of meshed networks and DG plug and play for a modified CIGRE network. [ABSTRACT FROM AUTHOR]

Objective: Sympathetic nervous system activity (SNSA) can rapidly modulate arterial stiffness, thus making it an important biomarker for SNSA evaluation. Pulse wave velocity (PWV) is a well-known quantitative indicator of arterial stiffness, but its functional responsivity to SNSA has not been elucidated. This paper reports a method to estimate rapid changes in peripheral arterial stiffness induced by SNSA using local PWV (LPWV) and to further quantify SNSA based on the estimated stiffness. Methods: LPWV was measured from the artery near the wrist to the artery near the forefinger using a biodegradable piezoelectric sensor and a photoplethysmography sensor in an electrocutaneous stimulus experiment in which pain evokes the SNSA. The relationship between LPWV, simultaneously measured peripheral arterial stiffness index, and self-reported pain intensity was quantified. Results: The stiffness estimated by LPWV alone and the stiffness estimated by LPWV and arterial pressure both approximate the peripheral arterial stiffness index (R2 = 0.9775 and 0.9719). Pain intensity can be quantitatively evaluated in a sigmoidal relationship by either the estimated stiffness based on LPWV alone (r = 0.8594) or the estimated stiffness based on LPWV and arterial pressure (r = 0.9738). Conclusion: Our results demonstrated the validity of LPWV in the quantitative evaluation of SNSA and the optionality of blood pressure correction depending on application scenarios. Significance: This study advances the understanding of sympathetic innervation of peripheral arteries through the sympathetic responsivity of LPWV and contributes a quantitative biomarker for SNSA evaluation. [ABSTRACT FROM AUTHOR]

In this paper, we exhibit a general family of distributions called alpha power odd generalized exponential family of distributions. The new family is very flexible with increasing, decreasing, J, reversed-J, bathtub shapes. Statistical properties of the family such as quantile, expansion of density function, moments, incomplete moments, mean deviation, Bonferroni and Lorenz curves are proposed. The method of maximum likelihood to estimate the model parameters is used. Three applications based on real data sets are the importance and flexibility of the three proposed models. [ABSTRACT FROM AUTHOR]