An algorithm and observability research of autonomous navigation and joint attitude determination in asteroid exploration descent stage

In this paper, an autonomous relative navigation and joint attitude determination algorithm in asteroid exploration descent stage is researched based on feature point information of perpendicular asteroid surface image observed by optical navigation camera, distance vectors from spacecraft to asteroid measured by three angled installed lidars and relative velocity increment measured by accelerometer when the relative distance vector to the centroid of asteroid can not be obtained. The inertial attitude of spacecraft is determined by sun vector, star vectors and inertial angular velocity respectively measured by sun sensor, star trackers and inertial reference unit. Also, in order to obtain measurement error model transferred from sensor noise, a covariance matrix solver considering error correlation is presented via the error model of normalized vector to first order. Numerical simulation and improved observability evaluation of filtering are undertaken to discuss the results of complete sensor observation and weak observation of lidars, and verify the effectiveness of the presented relative navigation and attitude determination algorithm.     

Local adaptive segmentation algorithm for 3-D medical image based on robust feature statistics

Medical image segmentation is of pivotal importance in computer-aided clinical diagnosis. Many factors, including noises, bias field effect, local volume effect, as well as tissue movement may affect the med- ical image, thus causing blurring or uneven characteristics when forming a picture. Such quality defects will inevitably impair the gray-scale difference between adjacent tissues and lead to insufficient segmentation or even leakage during tissue or organ segmentation. In the present investigation, a local adaptive segmentation algorithm for 3-D medical image based on robust feature statistics （LARFS） was proposed. By combining segmentation algorithm principles for traditional region growing （RG） and robust feature statistics （RFS）, the location and neighborhood image information of input seed point can be comprehensively analyzed by LARFS. Results show that, for different segmentation objects, under controlling the input parameter of growing factor within certain range, LARFS segmentation algorithm can adapt well to the regional geometric shape. And be- cause the robust feature statistics is applied in the contour evolution process, LARFS algorithm is not sensitive to noises and not easily influenced by image contrast and object topology. Hence, the leakage and excessive segmentation effects are ameliorated with a smooth edge, and the accuracy can be controlled within the effective error range.     

The design and analysis of unequal error protection fountain coding for multiple source networks over binary erasure channels

A novel network model of multiple source fountain coding is developed and a novel class of generic multiple source fountain codes with unequal error protection(UEP)property is proposed.The And–Or tree analysis technique is generalized to analyze the asymptotic performance of the proposed codes and a joint optimization method employing both linear and nonlinear programs is developed to optimize the degree distributions.Furthermore,we propose three basic methods to achieve UEP property and the performance of each method is discussed.We employ these analytical results and optimization method to design and discuss several UEP codes with two and four sources for different application scenarios.Simulation results verify that the proposed codes can be applied to the networks with any number of sources and can provide strong UEP property in various ways based on the proposed three basic methods.     

A new parallel lattice reduction algorithm for BKZ reduced bases

In order to implement the original BKZ algorithm in parallel,we describe it in terms of parallelism and give its parallel implementation scheme.Then we analyze the efficiency of algorithm’s parallel implementation and show that the speedup factor of BKZ algorithm in parallel is extremely low.Therefore we present a new parallel lattice reduction algorithm suitable for multiprocessor computer architecture.The new algorithm can obtain a BKZ reduced basis and the parallel speedup is effective.Also with the practical results,although the computational complexity increases compared with the original BKZ algorithm,we still indicate that the new algorithm performs well in parallel and the time cost in parallel is less.At the same time,we show that the length of the shortest vector is smaller.     

Biologically adaptive robust mean shift algorithm with Cauchy predator-prey BBO and space variant resolution for unmanned helicopter formation

Visual tracking technology can provide measurement information for unmanned helicopter formation and thus, more attention is being paid to this research area. We propose a novel mean shift （MS） algorithm that is both adaptive and robust for unmanned helicopter formation and apply it to the leading unmanned helicopter tracking. The movement of an unmanned helicopter is very flexible and changeable, which makes the tracking there of more difficulty than for common targets. In creating an algorithm that can adapt to the acceleration of the unmanned helicopter and estimates both the scale and orientation of the movement changes, we combine the traditional MS with the bio-inspired Cauchy predator-prey biogeography-based optimization （CPPBBO） evolutionary algorithm, and also the space variant resolution （SVR） mechanism of the human visual system （MS-CPPBBO-SVR）. To demonstrate the effectiveness and robustness of the proposed method and justify the importance of the CPPBBO algorithm and SVR mechanism at the same time, a series of comparative exper- iments were carried out. The experimental results of the proposed MS-CPPBBO-SVR method are compared with other competitive tracking methods, such as MS, MS with SVR （MS-SVR）, MS-SVR with several other optimization algorithms, and the robust particle filter algorithm. The experimental results demonstrate that our proposed tracking approach, MS-CPPBBO-SVR, is more adaptive, robust and efficient in target tracking than the other methods.     

Multipath effects on vector tracking algorithm for GNSS signal

The vector tracking algorithm uses a single extended Kalman filter （EKF） to predict the time-delays and the Doppler deviations of the GNSS signal, while also estimating the user＇s position, velocity, and clock state. In this paper, the effects of multipath on the tracking performance of the vector delay / frequency lock loop （VDFLL） is studied for better application in the multipath environment. The error expressions of the measurements are given in theory. The tracking error caused by multipath is reduced by VDFLL, which is proved by the tracking error of VDFLL through a new iterating method. The theoretical analysis is verified by the Monte Carlo simulation.     

A novel initial ranging algorithm for OFDMA systems using smart antenna

To improve the capacity of initial ranging （IR） users simultaneously accessing into network and enhance the performance of the IR, a novel IR algorithm is presented for the orthogonal frequency division multiple access systems with the smart antenna. The beamforming weight vectors provided by the antenna array are introduced for the IR users, and the procedures of the multiuser parameter estimation and the interference cancellation are designed. The proposed method can improve the accuracy of the channel estimation of active paths and efficiently reduce the residual multiple access interference. Simulation results show that the proposed method has a much better performance than the available successive multiuser detection and interference cancellation algorithm and accommodates more active ranging users simultaneously accessing into a cell.     

Variable partial-update NLMS algorithms with data-selective updating

We note that some existing algorithms are based on the normalized least-mean square （NLMS） algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization problem, but with different constraints. A new constraint is analyzed to substitute an extra searching technique in the set-membership partial-update NLMS algorithm （SM-PU-NLMS） which aims to get a variable number of updating coefficients for a further reduction of computational complexity. We get a closed form expression of the new constraint without extra searching technique to generate a novel set-membership variable-partial-update NLMS （SM-VPU-NLMS） algorithm. Note that tile SM-VPU-NLMS algorithm obtains a faster convergence and a smaller mean-squared error （MSE） than the existing SM-PU-NLMS. It is pointed out that the closed form expression can also be applied to the conventional variable-step-size partial-update NLMS （VSS-PU-NLMS） algorithm. The novel variable-step-size variable-partial-update NLMS （VSS-VPU-NLMS） algorithm is also verified to get a further computational complexity reduction. Simulation results verify that our analysis is reasonable and effective.     

Joint optimal sensing time and power allocation for multi-channel cognitive radio networks considering sensing-channel selection

In this paper,we consider a multi-channel cognitive radio network(CRN)where each secondary user(SU)can only choose to sense a subset of channels.We formulate a joint optimization problem of sensingchannel selection,sensing time and power allocation under the constraints of average transmit power budget and average interference power budget,which maximizes the CRN’s total throughput.We propose a greedy algorithm to solve the joint optimization problem,which has much less computational complexity.Moreover,it is shown that the search space of the greedy algorithm can be further pruned.Finally,numerical results demonstrate that the greedy algorithm has comparable performance to the exhaustive search algorithm.     

交流电量采集技术在LF炉的应用

介绍交流电量采集系统的设计,及其在LF精炼炉中的应用.