Search

In most large field of view (FOV) observations, the distortion problem is inevitably and significantly more serious than in small FOV ones. In the circumstances, many traditional star identification approaches are not able to efficiently identify stars any more. In order to deal with this problem, we put forward a star identification method that is less sensitive to distortion. The method first processes stars in the central area of the image, using traditional identification logic, and then applies the region growing strategy to enlarge the identified regions iteratively until the entire image is covered. The performance of the new scheme is analysed in the presence of both simulated data and real data. The results show that the proposed algorithm has the advantage of speed, and the strategy of regional extension can efficiently identify stars in large FOV images compared with other existing algorithms. [ABSTRACT FROM PUBLISHER]

This study proposes a feed-forward controller based on a control system model that can precisely track a reference trajectory by canceling out the effects of parameter uncertainties on a surface-mounted (magnets glued to the shaft surface) permanent magnet synchronous motor. Furthermore, the speed tracking control algorithm demands rapid and accurateq-axis current command, so the feed-forward system based on the control model is used to estimate it. The stability of the proposed controller is mathematically studied. The proposed control scheme is executed on a permanent magnet synchronous motor drive using a Renesas micro-control unit (RX62TADFFM, Japan). Finally, simulation and experimental results are presented to verify that the proposed controller achieves less steady-state error, better robust performance, and faster dynamic response than the proportional–integral controllers in the presence of permanent magnet synchronous motor parameter uncertainties and external load torque disturbance. [ABSTRACT FROM PUBLISHER]

In this paper, a new image fusion algorithm based on non-subsampled contourlet transform (NSCT) is proposed for the fusion of multi-focus images. The selection of different subband coefficients obtained by the NSCT decomposition is critical to image fusion. So, in this paper, firstly, original images are decomposed into different frequency subband coefficients by NSCT. Secondly, the selection of the low-frequency subband coefficients and the bandpass directional subband coefficients is discussed in detail. For the selection of the low-frequency subband coefficients, the non-negative matrix factorization (NMF) method is adopted. For the selection of bandpass directional subband coefficients, a regional cross-gradient method that selects the coefficients according to the minimum of the regional cross-gradient is proposed. Finally, the fused image is obtained by performing the inverse NSCT on the combined coefficients. The experimental results show that the proposed fusion algorithm can achieve significant results in getting a new image where all parts are sharp. [ABSTRACT FROM PUBLISHER]

In this paper we present an algorithm for the application of simultaneous localization and mapping in complex environments. Instead of building a grid map or building a feature map with a small number of the obstacles' geometric parameters, the proposed algorithm builds a sampled environment map (SEM) to represent a complex environment with a set of environment samples. To overcome the lack of one-toone correspondence between environment samples and raw observations, the signed orthogonal distance function is proposed to be used as the observation model. A method considering geometric constraints is presented to remove redundant environment samples from the SEM. We also present a method to improve the SEM's topological consistency by using corner constraints. The proposed algorithm has been verified in a simulation and an indoor experiment. The results show that the algorithm can localize the robot and build a complex map effectively. [ABSTRACT FROM AUTHOR]

In this article, we propose an iterative algorithm to compute the minimum norm least-squares solution of AXB+CYD=E, based on a matrix form of the algorithm LSQR for solving the least squares problem. We then apply this algorithm to compute the minimum norm least-squares centrosymmetric solution of min X|AXB-E|F. Numerical results are provided to verify the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]