The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduce...The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduced in coding system, which hinders practical application of MVC. An efficient fast mode decision method using mode complexity is proposed to reduce the computational complexity. In the proposed method, mode complexity is firstly computed by using the spatial, temporal and inter-view correlation between the current macroblock(MB) and its neighboring MBs. Based on the observation that direct mode is highly possible to be the optimal mode, mode complexity is always checked in advance whether it is below a predefined threshold for providing an efficient early termination opportunity. If this early termination condition is not met, three mode types for the MBs are classified according to the value of mode complexity, i.e., simple mode, medium mode and complex mode, to speed up the encoding process by reducing the number of the variable block modes required to be checked. Furthermore, for simple and medium mode region, the rate distortion(RD) cost of mode 16×16 in the temporal prediction direction is compared with that of the disparity prediction direction, to determine in advance whether the optimal prediction direction is in the temporal prediction direction or not, for skipping unnecessary disparity estimation. Experimental results show that the proposed method is able to significantly reduce the computational load by 78.79% and the total bit rate by 0.07% on average, while only incurring a negligible loss of PSNR(about 0.04 d B on average), compared with the full mode decision(FMD) in the reference software of MVC.展开更多
Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicabi...Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming(DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm.Based on the analysis of DP, this paper proposes a hierarchical directional DP(DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity.展开更多
The maximum likelihood （ML） estimator demonstrates remarkable performance in direction of arrival （DOA） estimation for the multiple input multiple output （MIMO） sonar. However, this advantage comes with prohibit...The maximum likelihood （ML） estimator demonstrates remarkable performance in direction of arrival （DOA） estimation for the multiple input multiple output （MIMO） sonar. However, this advantage comes with prohibitive computational complexity. In order to solve this problem, an ant colony optimization （ACO） is incorporated into the MIMO ML DOA estimator. Based on the ACO, a novel MIMO ML DOA estimator named the MIMO ACO ML （ML DOA estimator based on ACO for MIMO sonar） with even lower computational complexity is proposed. By extending the pheromone remaining process to the pheromone Gaussian kernel probability distribution function in the continuous space, the pro- posed algorithm achieves the global optimum value of the MIMO ML DOA estimator. Simulations and experimental results show that the computational cost of MIMO ACO ML is only 1/6 of the MIMO ML algorithm, while maintaining similar performance with the MIMO ML method.展开更多
This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering...This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.展开更多
The closed loop polynomial assignment problems of 2D systems Roesser model with multiple inputs were studied. The problems were transferred to a rational map and were assigned a sate feedback and output feedback. Suff...The closed loop polynomial assignment problems of 2D systems Roesser model with multiple inputs were studied. The problems were transferred to a rational map and were assigned a sate feedback and output feedback. Sufficient conditions for the system were derived using the algebraic geometric methods.展开更多
A nonlinear visual mapping model is presented to replace the image Jacobian relation for uncalibrated hand/eye coordination. A new visual tracking controller based on artificial neural network is designed. Simulation ...A nonlinear visual mapping model is presented to replace the image Jacobian relation for uncalibrated hand/eye coordination. A new visual tracking controller based on artificial neural network is designed. Simulation results show that this method can drive the static tracking error to zero quickly and keep good robustness and adaptability at the same time. In addition, the algorithm is very easy to be implemented with low computational complexity.展开更多
The computational cost of support vector regression in the training phase is O （N^3）, which is very expensive for a large scale problem. In addition, the solution of support vector regression is of parsimoniousness,...The computational cost of support vector regression in the training phase is O （N^3）, which is very expensive for a large scale problem. In addition, the solution of support vector regression is of parsimoniousness, which has relation to a part of the whole training data set. Hence, it is reasonable to reduce the training data set. Aiming at the scheme based on k-nearest neighbors to reduce the training data set with the computational complexity O （kMN^2）, an improved scheme is proposed to accelerate the reducing phase, which cuts down the computational complexity from O （kMN^2） to O （MN^2）. Finally, experimental results on benchmark data sets validate the effectiveness of the improved scheme.展开更多
The aim of this paper is to propose a novel technique for the detection of multicomponent chirp signal and the parameter estimation based on fractional Fourier transform (FRFT). The relationship between the FRFT and t...The aim of this paper is to propose a novel technique for the detection of multicomponent chirp signal and the parameter estimation based on fractional Fourier transform (FRFT). The relationship between the FRFT and the Wigner-Ville distribution (WVD) is investigated and the performance of the new approach is analyzed both in the computation complexity and the resolution in the fractional Fourier domain.展开更多
This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, ...This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTleSA, the proposed algorithm reduces the computational load to only 30% while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper.展开更多
In this paper, a real-time computation method for the control problems in differential-algebraic systems is presented. The errors of the method are estimated, and the relation between the sampling stepsize and the con...In this paper, a real-time computation method for the control problems in differential-algebraic systems is presented. The errors of the method are estimated, and the relation between the sampling stepsize and the controlled errors is analyzed. The stability analysis is done for a model problem, and the stability region is ploted which gives the range of the sampling stepsizes with which the stability of control process is guaranteed.展开更多
A new approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems was proposed.This approach is based on assigning powers to the different subcarriers of OFDM...A new approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems was proposed.This approach is based on assigning powers to the different subcarriers of OFDM using an unequal power distribution strategy.In addition,a reduced complexity selective mapping (RC-SLM) scheme was proposed.The proposed scheme is based on partitioning the frequency domain symbol sequence into several sub-blocks,and then each sub-block is multiplied by different phase sequences whose length is shorter than that used in the conventional SLM scheme.Then,a kind of low complexity conversions is used to replace the IFFT blocks.The performance of the proposed RC-SLM scheme along with the new approach was studied with computer simulation.The obtained results show that the proposed RC-SLM scheme is able to achieve the lowest computational complexity when compared with other low complexity schemes proposed in the literature while at the same time improves the PAPR reduction performance by about 0.3 dB.展开更多
基金Project(08Y29-7)supported by the Transportation Science and Research Program of Jiangsu Province,ChinaProject(201103051)supported by the Major Infrastructure Program of the Health Monitoring System Hardware Platform Based on Sensor Network Node,China+1 种基金Project(61100111)supported by the National Natural Science Foundation of ChinaProject(BE2011169)supported by the Scientific and Technical Supporting Program of Jiangsu Province,China
文摘The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduced in coding system, which hinders practical application of MVC. An efficient fast mode decision method using mode complexity is proposed to reduce the computational complexity. In the proposed method, mode complexity is firstly computed by using the spatial, temporal and inter-view correlation between the current macroblock(MB) and its neighboring MBs. Based on the observation that direct mode is highly possible to be the optimal mode, mode complexity is always checked in advance whether it is below a predefined threshold for providing an efficient early termination opportunity. If this early termination condition is not met, three mode types for the MBs are classified according to the value of mode complexity, i.e., simple mode, medium mode and complex mode, to speed up the encoding process by reducing the number of the variable block modes required to be checked. Furthermore, for simple and medium mode region, the rate distortion(RD) cost of mode 16×16 in the temporal prediction direction is compared with that of the disparity prediction direction, to determine in advance whether the optimal prediction direction is in the temporal prediction direction or not, for skipping unnecessary disparity estimation. Experimental results show that the proposed method is able to significantly reduce the computational load by 78.79% and the total bit rate by 0.07% on average, while only incurring a negligible loss of PSNR(about 0.04 d B on average), compared with the full mode decision(FMD) in the reference software of MVC.
基金supported by the National Natural Science Foundation of China(91648204 61601486)+1 种基金State Key Laboratory of High Performance Computing Project Fund(1502-02)Research Programs of National University of Defense Technology(ZDYYJCYJ140601)
文摘Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming(DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm.Based on the analysis of DP, this paper proposes a hierarchical directional DP(DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity.
基金supported by the National Natural Science Foundation of China (60972152)the National Laboratory Foundation of China (9140C2304080607)+1 种基金the Aviation Science Fund (2009ZC53031)the Doctoral Foundation of Northwestern Polytechnical University (CX201002)
文摘The maximum likelihood （ML） estimator demonstrates remarkable performance in direction of arrival （DOA） estimation for the multiple input multiple output （MIMO） sonar. However, this advantage comes with prohibitive computational complexity. In order to solve this problem, an ant colony optimization （ACO） is incorporated into the MIMO ML DOA estimator. Based on the ACO, a novel MIMO ML DOA estimator named the MIMO ACO ML （ML DOA estimator based on ACO for MIMO sonar） with even lower computational complexity is proposed. By extending the pheromone remaining process to the pheromone Gaussian kernel probability distribution function in the continuous space, the pro- posed algorithm achieves the global optimum value of the MIMO ML DOA estimator. Simulations and experimental results show that the computational cost of MIMO ACO ML is only 1/6 of the MIMO ML algorithm, while maintaining similar performance with the MIMO ML method.
文摘This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.
文摘The closed loop polynomial assignment problems of 2D systems Roesser model with multiple inputs were studied. The problems were transferred to a rational map and were assigned a sate feedback and output feedback. Sufficient conditions for the system were derived using the algebraic geometric methods.
基金This project was supported by the National Natural Science Foundation (No. 69875010).
文摘A nonlinear visual mapping model is presented to replace the image Jacobian relation for uncalibrated hand/eye coordination. A new visual tracking controller based on artificial neural network is designed. Simulation results show that this method can drive the static tracking error to zero quickly and keep good robustness and adaptability at the same time. In addition, the algorithm is very easy to be implemented with low computational complexity.
基金supported by the National Natural Science Foundation of China(50576033).
文摘The computational cost of support vector regression in the training phase is O （N^3）, which is very expensive for a large scale problem. In addition, the solution of support vector regression is of parsimoniousness, which has relation to a part of the whole training data set. Hence, it is reasonable to reduce the training data set. Aiming at the scheme based on k-nearest neighbors to reduce the training data set with the computational complexity O （kMN^2）, an improved scheme is proposed to accelerate the reducing phase, which cuts down the computational complexity from O （kMN^2） to O （MN^2）. Finally, experimental results on benchmark data sets validate the effectiveness of the improved scheme.
文摘The aim of this paper is to propose a novel technique for the detection of multicomponent chirp signal and the parameter estimation based on fractional Fourier transform (FRFT). The relationship between the FRFT and the Wigner-Ville distribution (WVD) is investigated and the performance of the new approach is analyzed both in the computation complexity and the resolution in the fractional Fourier domain.
文摘This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTleSA, the proposed algorithm reduces the computational load to only 30% while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper.
文摘In this paper, a real-time computation method for the control problems in differential-algebraic systems is presented. The errors of the method are estimated, and the relation between the sampling stepsize and the controlled errors is analyzed. The stability analysis is done for a model problem, and the stability region is ploted which gives the range of the sampling stepsizes with which the stability of control process is guaranteed.
文摘A new approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems was proposed.This approach is based on assigning powers to the different subcarriers of OFDM using an unequal power distribution strategy.In addition,a reduced complexity selective mapping (RC-SLM) scheme was proposed.The proposed scheme is based on partitioning the frequency domain symbol sequence into several sub-blocks,and then each sub-block is multiplied by different phase sequences whose length is shorter than that used in the conventional SLM scheme.Then,a kind of low complexity conversions is used to replace the IFFT blocks.The performance of the proposed RC-SLM scheme along with the new approach was studied with computer simulation.The obtained results show that the proposed RC-SLM scheme is able to achieve the lowest computational complexity when compared with other low complexity schemes proposed in the literature while at the same time improves the PAPR reduction performance by about 0.3 dB.
