Industry-Oriented Method for Dynamic Force Identification in Peripheral Milling Based on FSC-LSQR Using Acceleration Signals

Online measurement of milling force play a vital role in enabling machining process monitoring and control. In practice, the milling force is difficult to be measured directly with the dynamometer. This paper develops a novel method for milling force identification called least square QR-factorization with fast stopping criterion (FSC-LSQR) method, and the queue buffer structure (QBS) is employed for the online identification of milling force using acceleration signals. The convolution integral of milling force and acceleration signals is discretized, which turns the problem of milling force identification into a linear discrete ill-posed problem. The FSC-LSQR algorithm is adopted for milling force identification because of its high efficiency and accuracy, which handles the linear discrete ill-posed problem effectively. The online identification of milling force can be realized using the acceleration signal enqueue and the milling force dequeue operations of the QBS. Finally, the effectiveness of the method is verified by experiments. The experimental results show that the FSC-LSQR algorithm running time is within \((0.05s)\) and the calculation error is less than \((10\%)\). The proposed method can make the sampling frequency of the milling force reach 10240Hz by employing QBS, which satisfy the industry requirements of milling force measurement.

Greedy sensor selection based on QR factorization

We address the problem of selecting a given number of sensor nodes in wireless sensor networks where noise-corrupted linear measurements are collected at the selected nodes to estimate the unknown parameter. Noting that this problem is combinatorial in nature and selection of sensor nodes from a large number of nodes would require unfeasible computational cost, we propose a greedy sensor selection method that seeks to choose one node at each iteration until the desired number of sensor nodes are selected. We first apply the QR factorization to make the mean squared error (MSE) of estimation a simplified metric which is iteratively minimized. We present a simple criterion which enables selection of the next sensor node minimizing the MSE at iterations. We discuss that a near-optimality of the proposed method is guaranteed by using the approximate supermodularity and also make a complexity analysis for the proposed algorithm in comparison with different greedy selection methods, showing a reasonable complexity of the proposed method. We finally run extensive experiments to investigate the estimation performance of the different selection methods in various situations and demonstrate that the proposed algorithm provides a good estimation accuracy with a competitive complexity when compared with the other novel greedy methods.

The Eigenspace Spectral Regularization Method for Solving Discrete Ill-Posed Systems

This paper shows that discrete linear equations with Hilbert matrix operator, circulant matrix operator, conference matrix operator, banded matrix operator, TST matrix operator, and sparse matrix operator are ill-posed in the sense of Hadamard. Gauss least square method (GLSM), QR factorization method (QRFM), Cholesky decomposition method (CDM), and singular value decomposition (SVDM) failed to regularize these ill-posed problems. This paper introduces the eigenspace spectral regularization method (ESRM), which solves ill-posed discrete equations with Hilbert matrix operator, circulant matrix operator, conference matrix operator, and banded and sparse matrix operator. Unlike GLSM, QRFM, CDM, and SVDM, the ESRM regularizes such a system. In addition, the ESRM has a unique property, the norm of the eigenspace spectral matrix operator κ K = K − 1 K = 1 . Thus, the condition number of ESRM is bounded by unity, unlike the other regularization methods such as SVDM, GLSM, CDM, and QRFM.

Image Hiding Using QR Factorization And Discrete Wavelet Transform Techniques

Steganography is one of the most important tools in the data security field as there is a huge amount of data transferred each moment over the internet. Hiding secret messages in an image has been widely used because the images are mostly used in social media applications. The proposed algorithm is a simple algorithm for hiding an image in another image. The proposed technique uses QR factorization to conceal the secret image. The technique successfully hid a gray and color image in another one and the performance of the algorithm was measured by PSNR, SSIM and NCC. The PSNR for the cover image was in the range of 41 to 51 dB. DWT was added to increase the security of the method and this enhanced technique increased the cover PSNR to 48 t0 56 dB. The SSIM is 100% and the NCC is 1 for both implementations. Which improves that the imperceptibility of the algorithm is very high. The comparative analysis showed that the performance of the algorithm is better than other state-of-the-art algorithms

A Fast Tomographic Reconstruction Method for Flame Temperature Distribution Measurement Based on Direct Solution Algorithm

The rapid and accurate measurement of the flame temperature distribution is of great significance to the structural design and health diagnosis of the engine. Aiming at the low reconstruction efficiency of traditional flame temperature distribution reconstruction algorithms, a Direct Solution algorithm for flame temperature distribution reconstruction is proposed in this paper based on the structural characteristics of the reconstruction equations. By setting several numerical cases, the performance of the Direct Solution algorithm and some commonly used traditional algorithms, such as Simultaneous Algebraic Reconstruction Technique (SART), Least Squares QR-factorization (LSQR) algorithm, Non-Negative Least Squares QR-factorization (NNLS) algorithm, is compared in the reconstruction of the flame temperature distribution. The results show that the efficiency of the Direct Solution method is 169.4, 7.4, and 3483.3 times higher than that of the SART, LSQR, and NNLS algorithms under the condition of 40 × 40 grids. In addition, with the increase of the number of grids, the growth rate of the reconstruction time of the Direct Solution algorithm is much lower than that of other algorithms. The overall reconstruction accuracy of the Direct Solution algorithm is better than that of SART and LSQR algorithms. This shows that it has an excellent comprehensive performance and has a great application prospect in the rapid reconstruction of the temperature distribution.

Robust face recognition based on a new Kernel-PCA using RRQR factorization

In the last ten years, many variants of the principal component analysis were suggested to fight against the curse of dimensionality. Recently, A. Sharma et al. have proposed a stable numerical algorithm based on Householder QR decomposition (HQR) called QR PCA. This approach improves the performance of the PCA algorithm via a singular value decomposition (SVD) in terms of computation complexity. In this paper, we propose a new algorithm called RRQR PCA in order to enhance the QR PCA performance by exploiting the Rank-Revealing QR Factorization (RRQR). We have also improved the recognition rate of RRQR PCA by developing a nonlinear extension of RRQR PCA. In addition, a new robust RBF Lp-norm kernel is proposed in order to reduce the effect of outliers and noises. Extensive experiments on two well-known standard face databases which are ORL and FERET prove that the proposed algorithm is more robust than conventional PCA, 2DPCA, PCA-L1, WTPCA-L1, LDA, and 2DLDA in terms of face recognition accuracy.

Comparing full-field data from structural components with complicated geometries

A new decomposition algorithm based on QR factorization is introduced for processing and comparing irregularly shaped stress and deformation datasets found in structural analysis. The algorithm improves the comparison of two-dimensional data fields from the surface of components where data is missing from the field of view due to obstructed measurement systems or component geometry that results in areas where no data is present. The technique enables the comparison of these irregularly shaped datasets without the need for interpolation or warping of the data necessary in some other decomposition techniques, for example, Chebyshev or Zernike decomposition. This ensures comparisons are only made between the available data in each dataset and thus similarity metrics are not biased by missing data. The decomposition and comparison technique has been applied during an impact experiment, a modal analysis, and a fatigue study, with the stress and displacement data obtained from finite-element analysis, digital image correlation and thermoelastic stress analysis. The results demonstrate that the technique can be used to process data from a range of sources and suggests the technique has the potential for use in a wide variety of applications.

Iterative Algorithms for Deblurring of Images in Case of Electrical Capacitance Tomography

Electrical capacitance tomography (ECT) has been used to measure flow by applying gas-solid flow in coal gasification, pharmaceutical, and other industries. ECT is also used for creating images of physically confined objects. The data collected by the acquisition system to produce images undergo blurring because of ambient conditions and the electronic circuitry used. This research includes the principle of ECT techniques for deblurring images that were created during measurement. The data recorded by the said acquisition system ascends a large number of linear equations. This system of equations is sparse and ill-conditioned and hence is ill-posed in nature. A variety of reconstruction algorithms with many pros and cons are available to deal with ill-posed problems. Large-scale systems of linear equations resulting during image deblurring problems are solved using iterative regularization algorithms. The conjugate gradient algorithm for least-squares problems (CGLS), least-squares QR factorization (LSQR), and the modified residual norm steepest descent (MRNSD) algorithm are the famous variations of iterative algorithms. These algorithms exhibit a semiconvergence behavior; that is, the computed solution quality first improves and then reduces as the error norm decreases and later increases with each iteration. In this work, soft thresholding has been used for image deblurring problems to tackle the semiconvergence issues. Numerical test problems were executed to indicate the efficacy of the suggested algorithms with criteria for optimal stopping iterations. Results show marginal improvement compared to the traditional iterative algorithms (CGLS, LSQR, and MRNSD) for resolving semiconvergence behavior and image restoration.