A Self-calibration Bundle Adjustment Algorithm Based on Block Matrix Cholesky Decomposition Technology

In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innovation points are reflected in the following aspects:①The proposed algorithm is not dependent on the Schur complement,and the calculation process is simple and clear;②The complexities of time and space tend to O(n)in the context of world point number is far greater than that of images and cameras,so the calculation magnitude and memory consumption can be reduced significantly;③The proposed algorithm can carry out self-calibration bundle adjustment in single-camera,multi-camera,and variable-camera modes;④Some measures are employed to improve the optimization effects.Experimental tests showed that the proposed algorithm has the ability to achieve state-of-the-art performance in accuracy and robustness,and it has a strong adaptability as well,because the optimized results are accurate and robust even if the initial values have large deviations from the truth.This study could provide theoretical guidance and technical support for the image-based positioning and 3D reconstruction in the fields of photogrammetry,computer vision and robotics.

Carbon matrix/SiNWs heterogeneous block as improved reversible anodes material for lithium ion batteries

A novel carbon matrix/silicon nanowires(SiNWs) heterogeneous block was successfully produced by dispersing SiNWs into templated carbon matrix via a modified evaporation induced self-assembly method. The heterogeneous block was determined by X-ray diffraction, Raman spectra and scanning electron microscopy. As an anode material for lithium batteries, the block was investigated by cyclic voltammograms(CV), charge/discharge tests, galvanostatic cycling performance and A. C. impedance spectroscopy. We show that the SiNWs disperse into the framework, and are nicely wrapped by the carbon matrix. The heterogeneous block exhibits superior electrochemical reversibility with a high specific capacity of 529.3 mAh/g in comparison with bare SiNWs anode with merely about 52.6 mAh/g capacity retention. The block presents excellent cycle stability and capacity retention which can be attributed to the improvement of conductivity by the existence of carbon matrix and the enhancement of ability to relieve the large volume expansion of SiNWs during the lithium insertion/extraction cycle. The results indicate that the as-prepared carbon matrix/SiNWs heterogeneous block can be an attractive and potential anode material for lithium-ion battery applications.

Expression for the Group Inverse of the 2×2 Block Matrix

In this paper, we present a method how to get the expression for the group inverse of 2×2 block matrix and get the explicit expressions of the block matrix (A C B D) under some conditions.

RUAP:Random Rearrangement Block Matrix-Based Ultra-Lightweight RFID Authentication Protocol for End-Edge-Cloud Collaborative Environment

Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing model.The edge server is closer to the data source.The end-edge-cloud collaboration offloads the cloud computing tasks to the edge environment,which solves the shortcomings of the cloud in resource storage,computing performance,and energy consumption.IoT terminals and sensors have caused security and privacy challenges due to resource constraints and exponential growth.As the key technology of IoT,Radio-Frequency Identification(RFID)authentication protocol tremendously strengthens privacy protection and improves IoT security.However,it inevitably increases system overhead while improving security,which is a major blow to low-cost RFID tags.The existing RFID authentication protocols are difficult to balance overhead and security.This paper designs an ultra-lightweight encryption function and proposes an RFID authentication scheme based on this function for the end-edge-cloud collaborative environment.The BAN logic proof and protocol verification tools AVISPA formally verify the protocol’s security.We use VIVADO to implement the encryption function and tag’s overhead on the FPGA platform.Performance evaluation indicates that the proposed protocol balances low computing costs and high-security requirements.

AN IMPROVED FAST BLIND DECONVOLUTION ALGORITHM BASED ON DECORRELATION AND BLOCK MATRIX

In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.

ON OPTIMAL BACKWARD PERTURBATION ANALYSIS FOR THE LINEAR SYSTEM WITH BLOCK CYCLIC COEFFICIENT MATRIX

Based on the block style spectral decomposition,this paper deals with the optimal backward perturbation analysis for the linear system with block cyclic coefficient matrix.

Strictly non-blocking 4×4 silicon electro–optic switch matrix

The first path-independent insertion-loss（PILOSS） strictly non-blocking 4×4 silicon electro–optic switch matrix is reported. The footprint of this switch matrix is only 4.6 mm×1.0 mm. Using single-arm modulation, the crosstalk measured in this test is-13 dB --27 dB. And a maximum crosstalk deterioration of 6d B caused by two-path interference is also found.

A Novel Approach to Practical Matrix Converter Motor Drive System With Reverse Blocking IGBT

a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)

A Novel Approach to Practical Matrix Converter Motor Drive System With Reverse Blocking IGBT (To continue)

a Pole voltage waveforms (VA20 and VA40) for modulation index 0.4 (middle trace is A-phase voltage waveform) x-axis: 1 div.=10ms, y-axis: 1 div.= 100V b Normalized harmonic spectrum for pole voltage of Fig. 9a c A-phase current and phase voltage for modulation index 0.4 (reference space vector is in inner layer)

求解瞬态相干作用的Maxwell Block方程的一种矩阵方法

在一定的条件下我们可用矩阵的方法求解ＭａｘｗｅｌｌＢｌｏｃｋ 方程，这种矩阵的方法具有物理思路清晰、方法新颖的特点，并且所得到的结果与传统方法完全一致。

Construction and Analysis of Structured Preconditioners for Block Two-by-Two Matrices

For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.

EIGENVALUES OF A SPECIAL KIND OF SYMMETRIC BLOCK CIRCULANT MATRICES

In this paper, the spectrum and characteristic polynomial for a special kind of symmetric block circulant matrices are given.

基于稀疏表示的Data Matrix码图像修复算法

稀疏表示理论凭借其建模简单、鲁棒性高与抗干扰能力强等优势成为研究热点,将稀疏理论应用于图像修复已成为图像处理领域新的研究方向。针对工业现场中常出现的被遮挡而不能识别的二维码图像,提出一种基于稀疏表示模型的块聚类图像修复算法。依据待修复图像内的有效信息,以固定重叠像素的方式将图像分块,分别对图像块使用欧几里得距离进行训练匹配,将得到的具有相似结构的图像块聚类为结构组作为图像稀疏表示的基本单位,利用每个结构组的估计来快速学习字典。通过使用分离迭代与优化梯度算法对组稀疏表示模型的L1范数最小化问题进行求解,提高了修复算法的鲁棒性。实验结果表明,该算法能够很好地修复被遮挡、划痕或像素丢失等受损的Data Matrix码图像,较大地提高了条码的识别率。

COMPRESSED SPEECH SIGNAL SENSING BASED ON THE STRUCTURED BLOCK SPARSITY WITH PARTIAL KNOWLEDGE OF SUPPORT

Structural and statistical characteristics of signals can improve the performance of Compressed Sensing (CS). Two kinds of features of Discrete Cosine Transform (DCT) coefficients of voiced speech signals are discussed in this paper. The first one is the block sparsity of DCT coefficients of voiced speech formulated from two different aspects which are the distribution of the DCT coefficients of voiced speech and the comparison of reconstruction performance between the mixed program and Basis Pursuit (BP). The block sparsity of DCT coefficients of voiced speech means that some algorithms of block-sparse CS can be used to improve the recovery performance of speech signals. It is proved by the simulation results of the mixed program which is an improved version of the mixed program. The second one is the well known large DCT coefficients of voiced speech focus on low frequency. In line with this feature, a special Gaussian and Partial Identity Joint (GPIJ) matrix is constructed as the sensing matrix for voiced speech signals. Simulation results show that the GPIJ matrix outperforms the classical Gaussian matrix for speech signals of male and female adults.

Estimation of Maximal Dimensions of Commutable Matrix Spaces

In this paper, a lower bound of maximal dimensions of commutable matrix spaces (CMS) is given. It is found that the linear dependence of a group of one to one commutable matrices is related to whether some equations in system can be eliminated. The corresponding relation is given. By introducing conceptions of eliminating set and eliminating index, we give an estimation of upper bound of maximal dimensions of CMS. For special cases n=5,6, the further estimation of maximal dimensions of CMS is presented.

Furi-Martelli-Vignoli spectrum and Feng spectrum of nonlinear block operator matrices

We investigate the Furi-Martelli-Vignoli spectrum and the Feng spectrum of continuous nonlinear block operator matrices,and mainly describe the relationship between the Furi-Martelli-Vignoli spectrum(compared to the Feng spectrum)of the whole operator matrix and that of its entries.In addition,the connection between the Furi-Martelli-Vignoli spectrum of the whole operator matrix and that of its Schur complement is presented by means of Schur decomposition.

Moore-Penrose Inverses and Group Inverses of Block k-Circulant Matrices

The Moore-Penrose inverse of a block k-circulant matrix whose blocks are arbitrary matrices are obtained when k has unit modulus. In the meantime. explicit formulae for finding group inverses of certain specified k-circulant matrices are also given.

Numerical Solution of Two-Dimensional Nonlinear Stochastic Ito-Volterra Integral Equations by Applying Block Pulse Functions

This paper investigates the numerical solution of two-dimensional nonlinear stochastic Itô-Volterra integral equations based on block pulse functions. The nonlinear stochastic integral equation is transformed into a set of algebraic equations by operational matrix of block pulse functions. Then, we give error analysis and prove that the rate of convergence of this method is efficient. Lastly, a numerical example is given to confirm the method.

一种基于改进的Block-FFT算法的联合检测矩阵求逆算法

联合检测是TD-SCDMA系统的关键技术之一。而影响该技术复杂度的主要因素是矩阵求逆算法的设计。文章结合TD-SCDMA系统的特性,并灵活应用块循环矩阵的性质,给出了一种基于改进的Block-FFT算法的联合检测矩阵求逆算法。仿真结果表明,该算法与常用的Cholesky算法、近似Cholesky算法相比,时间复杂度和空间复杂度较后两者明显降低,从而提高了该算法的工程实现性。

Algorithms for Finding the Inverses of Factor Block Circulant Matrices

In this paper,algorithms for finding the inverse of a factor block circulant matrix, a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively.In addition,two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.