5G Wideband Bandpass Filtering Power Amplifiers Based on a Bandwidth-Extended Bandpass Matching Network

In this paper,a 5G wideband power amplifier(PA)with bandpass filtering response is synthesized using a bandwidth-extended bandpass filter as the matching network(MN).In this structure,the bandwidth(θ_(C))is defined as a variable in the closedform equations provided by the microstrip bandpass filter.It can be extended over a wide range only by changing the characteristic impedances of the structure.Different from the other wideband MNs,the extension of bandwidth does not increase the complexity of the structure(order n is fixed).In addition,based on the bandwidth-extended structure,the wideband design of bandpass filtering PA is not limited to the fixed bandwidth of the specific filter structure.The theoretical analysis of the MN and the design flow of the PA are provided in this design.The fabricated bandpass filtering PA can support almost one-octave bandwidth(2-3.8 GHz),covering the two 5G bands(n41 and n78).The drain efficiency of 47%-60%and output power higher than 40 dBm are measured.Good frequency selectivity in S-parameter measurements can be observed.

一种基于Filter Faster R-CNN的数字PCR液滴检测技术

目的研究液滴数字聚合酶链式反应(ddPCR)液滴检测技术,去除图像中灰尘、气泡、芯片表面的划痕以及微小凹陷等因素产生的异常点对结果的影响,实现高通量、稳定和准确的ddPCR液滴的自动检测。方法提出Filter Faster R-CNN ddPCR液滴检测模型。使用Faster R-CNN生成液滴预测框,之后使用异常点过滤模块(Filter)去除阳性液滴预测框中的异常点。以诺如病毒片段的质粒为模板进行ddPCR实验,建立一个ddPCR数据集,用于模型的训练(2462例,约占78.56%)和测试(672例,约占21.44%)。对异常点过滤模块的3个过滤支路在验证集上进行消融实验,通过与其他ddPCR液滴检测模型进行比较的对比实验以及进行ddPCR的绝对定量实验。结果在少尘和多尘的环境中,Filter Faster R-CNN阳性液滴准确率为98.23%和88.35%,综合指标F1分数分别达到了99.15%和99.14%,高于其他相比较的模型。独立样本T检验的结果证明,相比未添加过滤模块的网络,添加过滤模块后能够显著提示模型在多尘环境中的阳性准确率。在ddPCR绝对定量实验中,将商业化流式检测设备的结果作为标准浓度,绘制了回归线。结果显示,回归线斜率为1.0005,截距为-0.025,决定系数达到了0.9997,二者结果高度一致。结论本文提出了一种基于Filter Faster R-CNN的ddPCR液滴检测技术,为在多种环境条件下的ddPCR实验提供了鲁棒的液滴检测方法。

An Improved Particle Filter Map Matching Algorithm for Personal Inertial Positioning

The current particle filtering map matching algorithm has problems such as low map utilization and poor accuracy of turnoff positioning, etc. This paper proposed an improved particle filtering-based map-matching algorithm for the inertial positioning of personnel. The historical moment position constraint and feasible region constraint of particles were introduced in this paper. A resampling method based on multi-stage backtracking of particles was proposed. Therefore, the effectiveness of newly generated particles could be guaranteed. The utilization rate of map information could be improved, thus enhancing the accuracy of personnel localization. The walking experiment results showed that, compared with the traditional PDR algorithm, the proposed method had higher localization accuracy and better repeatability of the localization trajectory for multi-turn paths. Under the total travel of 480 meters, the deviation of the starting end point was less than 2 meters, which was about 0.4% of the total travel.

Improved HardNet and Stricter Outlier Filtering to Guide Reliable Matching

As the fundamental problem in the computer vision area,image matching has wide applications in pose estimation,3D reconstruction,image retrieval,etc.Suffering from the influence of external factors,the process of image matching using classical local detectors,e.g.,scale-invariant feature transform(SIFT),and the outlier filtering approaches,e.g.,Random sample consensus(RANSAC),show high computation speed and pool robustness under changing illumination and viewpoints conditions,while image matching approaches with deep learning strategy(such as HardNet,OANet)display reliable achievements in large-scale datasets with challenging scenes.However,the past learning-based approaches are limited to the distinction and quality of the dataset and the training strategy in the image-matching approaches.As an extension of the previous conference paper,this paper proposes an accurate and robust image matching approach using fewer training data in an end-to-end manner,which could be used to estimate the pose error This research first proposes a novel dataset cleaning and construction strategy to eliminate the noise and improve the training efficiency;Secondly,a novel loss named quadratic hinge triplet loss(QHT)is proposed to gather more effective and stable feature matching;Thirdly,in the outlier filtering process,the stricter OANet and bundle adjustment are applied for judging samples by adding the epipolar distance constraint and triangulation constraint to generate more outstanding matches;Finally,to recall the matching pairs,dynamic guided matching is used and then submit the inliers after the PyRANSAC process.Multiple evaluation metrics are used and reported in the 1st place in the Track1 of CVPR Image-Matching Challenge Workshop.The results show that the proposed method has advanced performance in large-scale and challenging Phototourism benchmark.

Estimating the subsolar magnetopause position from soft X-ray images using a low-pass image filter

The Lunar Environment heliospheric X-ray Imager(LEXI)and Solar wind Magnetosphere Ionosphere Link Explorer(SMILE)missions will image the Earth’s dayside magneto pause and cusps in soft X-rays after their respective launches in the near future,to specify glo bal magnetic reconnection modes for varying solar wind conditions.To suppo rt the success of these scientific missions,it is critical to develop techniques that extract the magnetopause locations from the observed soft X-ray images.In this research,we introduce a new geometric equation that calculates the subsolar magnetopause position(RS)from a satellite position,the look direction of the instrument,and the angle at which the X-ray emission is maximized.Two assumptions are used in this method:(1)The look direction where soft X-ray emissions are maximized lies tangent to the magnetopause,and(2)the magnetopause surface near the subsolar point is almost spherical and thus RSis nea rly equal to the radius of the magneto pause curvature.We create synthetic soft X-ray images by using the Open Geospace General Circulation Model(OpenGGCM)global magnetohydrodynamic model,the galactic background,the instrument point spread function,and Poisson noise.We then apply the fast Fourier transform and Gaussian low-pass filte rs to the synthetic images to re move noise and obtain accurate look angles for the soft X-ray pea ks.From the filte red images,we calculate RS and its accuracy for different LEXI locations,look directions,and solar wind densities by using the OpenGGCM subsolar magnetopause location as ground truth.Our method estimates RS with an accuracy of<0.3 RE when the solar wind density exceeds>10 cm-3.The accuracy improves for greater solar wind densities and during southward interplanetary magnetic fields.The method ca ptures the magnetopause motion during southwa rd interplaneta ry magnetic field turnings.Consequently,the technique will enable quantitative analysis of the magnetopause motion and help reveal the dayside reconnection modes for dynamic solar wind conditions.This technique will suppo rt the LEXI and SMILE missions in achieving their scientific o bjectives.

Feature Matching via Topology-Aware Graph Interaction Model

Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers.This paper attempts to tackle the outlier filtering problem from two aspects. First, a robust and efficient graph interaction model,is proposed, with the assumption that matches are correlated with each other rather than independently distributed. To this end, we construct a graph based on the local relationships of matches and formulate the outlier filtering task as a binary labeling energy minimization problem, where the pairwise term encodes the interaction between matches. We further show that this formulation can be solved globally by graph cut algorithm. Our new formulation always improves the performance of previous localitybased method without noticeable deterioration in processing time,adding a few milliseconds. Second, to construct a better graph structure, a robust and geometrically meaningful topology-aware relationship is developed to capture the topology relationship between matches. The two components in sum lead to topology interaction matching(TIM), an effective and efficient method for outlier filtering. Extensive experiments on several large and diverse datasets for multiple vision tasks including general feature matching, as well as relative pose estimation, homography and fundamental matrix estimation, loop-closure detection, and multi-modal image matching, demonstrate that our TIM is more competitive than current state-of-the-art methods, in terms of generality, efficiency, and effectiveness. The source code is publicly available at http://github.com/YifanLu2000/TIM.

An improved particle filter indoor fusion positioning approach based on Wi-Fi/PDR/geomagnetic field

The existing indoor fusion positioning methods based on Pedestrian Dead Reckoning(PDR)and geomagnetic technology have the problems of large initial position error,low sensor accuracy,and geomagnetic mismatch.In this study,a novel indoor fusion positioning approach based on the improved particle filter algorithm by geomagnetic iterative matching is proposed,where Wi-Fi,PDR,and geomagnetic signals are integrated to improve indoor positioning performances.One important contribution is that geomagnetic iterative matching is firstly proposed based on the particle filter algorithm.During the positioning process,an iterative window and a constraint window are introduced to limit the particle generation range and the geomagnetic matching range respectively.The position is corrected several times based on geomagnetic iterative matching in the location correction stage when the pedestrian movement is detected,which made up for the shortage of only one time of geomagnetic correction in the existing particle filter algorithm.In addition,this study also proposes a real-time step detection algorithm based on multi-threshold constraints to judge whether pedestrians are moving,which satisfies the real-time requirement of our fusion positioning approach.Through experimental verification,the average positioning accuracy of the proposed approach reaches 1.59 m,which improves 33.2%compared with the existing particle filter fusion positioning algorithms.

A dual adaptive unscented Kalman filter algorithm for SINS-based integrated navigation system

In this study, the problem of measuring noise pollution distribution by the intertial-based integrated navigation system is effectively suppressed. Based on nonlinear inertial navigation error modeling, a nested dual Kalman filter framework structure is developed. It consists of unscented Kalman filter (UKF)master filter and Kalman filter slave filter. This method uses nonlinear UKF for integrated navigation state estimation. At the same time, the exact noise measurement covariance is estimated by the Kalman filter dependency filter. The algorithm based on dual adaptive UKF (Dual-AUKF) has high accuracy and robustness, especially in the case of measurement information interference. Finally, vehicle-mounted and ship-mounted integrated navigation tests are conducted. Compared with traditional UKF and the Sage-Husa adaptive UKF (SH-AUKF), this method has comparable filtering accuracy and better filtering stability. The effectiveness of the proposed algorithm is verified.

Recursive Filtering for Stochastic Systems With Filter-and-Forward Successive Relays

In this paper,the recursive filtering problem is considered for stochastic systems over filter-and-forward successive relay(FFSR)networks.An FFSR is located between the sensor and the remote filter to forward the measurement.In the successive relay,two cooperative relay nodes are adopted to forward the signals alternatively,thereby existing switching characteristics and inter-relay interferences(IRI).Since the filter-and-forward scheme is employed,the signal received by the relay is retransmitted after it passes through a linear filter.The objective of the paper is to concurrently design optimal recursive filters for FFSR and stochastic systems against switching characteristics and IRI of relays.First,a uniform measurement model is proposed by analyzing the transmission mechanism of FFSR.Then,novel filter structures with switching parameters are constructed for both FFSR and stochastic systems.With the help of the inductive method,filtering error covariances are presented in the form of coupled difference equations.Next,the desired filter gain matrices are further obtained by minimizing the trace of filtering error covariances.Moreover,the stability performance of the filtering algorithm is analyzed where the uniform bound is guaranteed on the filtering error covariance.Finally,the effectiveness of the proposed filtering method over FFSR is verified by a three-order resistance-inductance-capacitance circuit system.

Bayesian Filtering for High-Dimensional State-Space Models With State Partition and Error Compensation

In the era of exponential growth of data availability,the architecture of systems has a trend toward high dimensionality,and directly exploiting holistic information for state inference is not always computationally affordable.This paper proposes a novel Bayesian filtering algorithm that considers algorithmic computational cost and estimation accuracy for high-dimensional linear systems.The high-dimensional state vector is divided into several blocks to save computation resources by avoiding the calculation of error covariance with immense dimensions.After that,two sequential states are estimated simultaneously by introducing an auxiliary variable in the new probability space,mitigating the performance degradation caused by state segmentation.Moreover,the computational cost and error covariance of the proposed algorithm are analyzed analytically to show its distinct features compared with several existing methods.Simulation results illustrate that the proposed Bayesian filtering can maintain a higher estimation accuracy with reasonable computational cost when applied to high-dimensional linear systems.

Dynamic Event-Triggered Quadratic Nonfragile Filtering for Non-Gaussian Systems:Tackling Multiplicative Noises and Missing Measurements

This paper focuses on the quadratic nonfragile filtering problem for linear non-Gaussian systems under multiplicative noises,multiple missing measurements as well as the dynamic event-triggered transmission scheme.The multiple missing measurements are characterized through random variables that obey some given probability distributions,and thresholds of the dynamic event-triggered scheme can be adjusted dynamically via an auxiliary variable.Our attention is concentrated on designing a dynamic event-triggered quadratic nonfragile filter in the well-known minimum-variance sense.To this end,the original system is first augmented by stacking its state/measurement vectors together with second-order Kronecker powers,thus the original design issue is reformulated as that of the augmented system.Subsequently,we analyze statistical properties of augmented noises as well as high-order moments of certain random parameters.With the aid of two well-defined matrix difference equations,we not only obtain upper bounds on filtering error covariances,but also minimize those bounds via carefully designing gain parameters.Finally,an example is presented to explain the effectiveness of this newly established quadratic filtering algorithm.

State Estimation of Drive-by-Wire Chassis Vehicle Based on Dual Unscented Particle Filter Algorithm

Accurate vehicle dynamic information plays an important role in vehicle driving safety.However,due to the characteristics of high mobility and multiple controllable degrees of freedom of drive-by-wire chassis vehicles,the current mature application of traditional vehicle state estimation algorithms can not meet the requirements of drive-by-wire chassis vehicle state estimation.This paper proposes a state estimation method for drive-by-wire chassis vehicle based on the dual unscented particle filter algorithm,which make full use of the known advantages of the four-wheel drive torque and steer angle parameters of the drive-by-wire chassis vehicle.In the dual unscented particle filter algorithm,two unscented particle filter transfer information to each other,observe the vehicle state information and the tire force parameter information of the four wheels respectively,which reduce the influence of parameter uncertainty and model parameter changes on the estimation accuracy during driving.The performance with the dual unscented particle filter algorithm,which is analyzed in terms of the time-average square error,is superior of the unscented Kalman filter algorithm.The effectiveness of the algorithm is further verified by driving simulator test.In this paper,a vehicle state estimator based on dual unscented particle filter algorithm was proposed for the first time to improve the estimation accuracy of vehicle parameters and states.

A multi-scale second-order autoregressive recursive filter approach for the sea ice concentration analysis

To effectively extract multi-scale information from observation data and improve computational efficiency,a multi-scale second-order autoregressive recursive filter(MSRF)method is designed.The second-order autoregressive filter used in this study has been attempted to replace the traditional first-order recursive filter used in spatial multi-scale recursive filter(SMRF)method.The experimental results indicate that the MSRF scheme successfully extracts various scale information resolved by observations.Moreover,compared with the SMRF scheme,the MSRF scheme improves computational accuracy and efficiency to some extent.The MSRF scheme can not only propagate to a longer distance without the attenuation of innovation,but also reduce the mean absolute deviation between the reconstructed sea ice concentration results and observations reduced by about 3.2%compared to the SMRF scheme.On the other hand,compared with traditional first-order recursive filters using in the SMRF scheme that multiple filters are executed,the MSRF scheme only needs to perform two filter processes in one iteration,greatly improving filtering efficiency.In the two-dimensional experiment of sea ice concentration,the calculation time of the MSRF scheme is only 1/7 of that of SMRF scheme.This means that the MSRF scheme can achieve better performance with less computational cost,which is of great significance for further application in real-time ocean or sea ice data assimilation systems in the future.

A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance

Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.

3D robust anisotropic diffusion filtering algorithm for sparse view neutron computed tomography 3D image reconstruction

The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can degrade the quality of the reconstructed images.Therefore,to improve the quality of the reconstructed images of NCT systems,efficient image processing algorithms must be used.The anisotropic diffusion filtering(ADF) algorithm can not only effectively suppress the noise in the projection data,but also preserve the image edge structure information by reducing the diffusion at the image edges.Therefore,we propose the application of the ADF algorithm for NCT image reconstruction.To compare the performance of different algorithms in NCT systems,we reconstructed images using the ordered subset simultaneous algebraic reconstruction technique(OS-SART) algorithm with different regular terms as image processing algorithms.In the iterative reconstruction,we selected two image processing algorithms,the Total Variation and split Bregman solved total variation algorithms,for comparison with the performance of the ADF algorithm.Additionally,the filtered back-projection algorithm was used for comparison with an iterative algorithm.By reconstructing the projection data of the numerical and clock models,we compared and analyzed the effects of each algorithm applied in the NCT system.Based on the reconstruction results,OS-SART-ADF outperformed the other algorithms in terms of denoising,preserving the edge structure,and suppressing artifacts.For example,when the 3D Shepp–Logan was reconstructed at 25 views,the root mean square error of OS-SART-ADF was the smallest among the four iterative algorithms,at only 0.0292.The universal quality index,mean structural similarity,and correlation coefficient of the reconstructed image were the largest among all algorithms,with values of 0.9877,0.9878,and 0.9887,respectively.

A Non-Parametric Scheme for Identifying Data Characteristic Based on Curve Similarity Matching

For accurately identifying the distribution charac-teristic of Gaussian-like noises in unmanned aerial vehicle(UAV)state estimation,this paper proposes a non-parametric scheme based on curve similarity matching.In the framework of the pro-posed scheme,a Parzen window(kernel density estimation,KDE)method on sliding window technology is applied for roughly esti-mating the sample probability density,a precise data probability density function(PDF)model is constructed with the least square method on K-fold cross validation,and the testing result based on evaluation method is obtained based on some data characteristic analyses of curve shape,abruptness and symmetry.Some com-parison simulations with classical methods and UAV flight exper-iment shows that the proposed scheme has higher recognition accuracy than classical methods for some kinds of Gaussian-like data,which provides better reference for the design of Kalman filter(KF)in complex water environment.

Distributed Matching Theory-Based Task Re-Allocating for Heterogeneous Multi-UAV Edge Computing

Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not been fully considered yet.Moreover,most existing works neglect the fact that a task can only be executed on the UAV equipped with its desired service function(SF).In this backdrop,this paper formulates the task scheduling problem as a multi-objective task scheduling problem,which aims at maximizing the task execution success ratio while minimizing the average weighted sum of all tasks’completion time and energy consumption.Optimizing three coupled goals in a realtime manner with the dynamic arrival of tasks hinders us from adopting existing methods,like machine learning-based solutions that require a long training time and tremendous pre-knowledge about the task arrival process,or heuristic-based ones that usually incur a long decision-making time.To tackle this problem in a distributed manner,we establish a matching theory framework,in which three conflicting goals are treated as the preferences of tasks,SFs and UAVs.Then,a Distributed Matching Theory-based Re-allocating(DiMaToRe)algorithm is put forward.We formally proved that a stable matching can be achieved by our proposal.Extensive simulation results show that Di Ma To Re algorithm outperforms benchmark algorithms under diverse parameter settings and has good robustness.

A Time Series Short-Term Prediction Method Based on Multi-Granularity Event Matching and Alignment

Accurate forecasting of time series is crucial across various domains.Many prediction tasks rely on effectively segmenting,matching,and time series data alignment.For instance,regardless of time series with the same granularity,segmenting them into different granularity events can effectively mitigate the impact of varying time scales on prediction accuracy.However,these events of varying granularity frequently intersect with each other,which may possess unequal durations.Even minor differences can result in significant errors when matching time series with future trends.Besides,directly using matched events but unaligned events as state vectors in machine learning-based prediction models can lead to insufficient prediction accuracy.Therefore,this paper proposes a short-term forecasting method for time series based on a multi-granularity event,MGE-SP(multi-granularity event-based short-termprediction).First,amethodological framework for MGE-SP established guides the implementation steps.The framework consists of three key steps,including multi-granularity event matching based on the LTF(latest time first)strategy,multi-granularity event alignment using a piecewise aggregate approximation based on the compression ratio,and a short-term prediction model based on XGBoost.The data from a nationwide online car-hailing service in China ensures the method’s reliability.The average RMSE(root mean square error)and MAE(mean absolute error)of the proposed method are 3.204 and 2.360,lower than the respective values of 4.056 and 3.101 obtained using theARIMA(autoregressive integratedmoving average)method,as well as the values of 4.278 and 2.994 obtained using k-means-SVR(support vector regression)method.The other experiment is conducted on stock data froma public data set.The proposed method achieved an average RMSE and MAE of 0.836 and 0.696,lower than the respective values of 1.019 and 0.844 obtained using the ARIMA method,as well as the values of 1.350 and 1.172 obtained using the k-means-SVR method.

Artificial Immune Detection for Network Intrusion Data Based on Quantitative Matching Method

Artificial immune detection can be used to detect network intrusions in an adaptive approach and proper matching methods can improve the accuracy of immune detection methods.This paper proposes an artificial immune detection model for network intrusion data based on a quantitative matching method.The proposed model defines the detection process by using network data and decimal values to express features and artificial immune mechanisms are simulated to define immune elements.Then,to improve the accuracy of similarity calculation,a quantitative matching method is proposed.The model uses mathematical methods to train and evolve immune elements,increasing the diversity of immune recognition and allowing for the successful detection of unknown intrusions.The proposed model’s objective is to accurately identify known intrusions and expand the identification of unknown intrusions through signature detection and immune detection,overcoming the disadvantages of traditional methods.The experiment results show that the proposed model can detect intrusions effectively.It has a detection rate of more than 99.6%on average and a false alarm rate of 0.0264%.It outperforms existing immune intrusion detection methods in terms of comprehensive detection performance.

Electrically controllable spin filtering in zigzag phosphorene nanoribbon based normal–antiferromagnet–normal junctions

We investigated the electric controllable spin-filtering effect in a zigzag phosphorene nanoribbon(ZPNR) based normal–antiferromagnet–normal junction. Two ferromagnets are closely coupled to the edges of the nanoribbon and form the edge-to-edge antiferromagnetism. Under an in-plane electric field, the two degenerate edge bands of the edge-to-edge antiferromagnet split into four spin-polarized sub-bands and a 100% spin-polarized current can be easily induced with the maximal conductance 2e~2/h. The spin polarization changes with the strength of the electric field and the exchange field,and changes sign at opposite electric fields. The spin-polarized current switches from one edge to the other by reversing the direction of the electric field. The edge current can also be controlled spatially by changing the electric potential of the scattering region. The manipulation of edge current is useful in spin-transfer-torque magnetic random-access memory and provides a practical way to develop controllable spintronic devices.