An improved outdoor camera calibration method based on Extended Kalman Filter(EKF) is proposed in this paper. GPS coordinate system is introduced to establish world coordinate system in the calibration procedure. Acco...
详细信息
ISBN:
(纸本)9781629939865
An improved outdoor camera calibration method based on Extended Kalman Filter(EKF) is proposed in this paper. GPS coordinate system is introduced to establish world coordinate system in the calibration procedure. According to the characteristics of GPS coordinate converted to plane coordinate and the camera calibration model, we establish the mapping relations of reference points between image plane coordinate and the world coordinate. Further, we consider the world coordinate error, set the world coordinates as the measure quantities, use the method of EKF to get the optimal estimation of intrinsic and extrinsic camera parameters, in EKF the camera's intrinsic and extrinsic parameters are set as state variables, the transformation equations of image coordinate to the world coordinate are set as the measurement equations, and we let the observed feature points' image coordinates and corresponding world coordinates as the input of the filter. Experimental results confirmed that the proposed method with high precision.
The Lorentzian hard thresholding pursuit algorithm is proposed in this paper to achieve efficient reconstruction for compressed sensing in the presence of impulsive noise. In the Lorentzian hard thresholding pursuit a...
The Lorentzian hard thresholding pursuit algorithm is proposed in this paper to achieve efficient reconstruction for compressed sensing in the presence of impulsive noise. In the Lorentzian hard thresholding pursuit algorithm, the minimum norm problem is solved with respect to a support which is obtained through the hard thresholding operator. The convergence and reconstruction performance of the Lorentzian hard thresholding pursuit algorithm is proved in theory in this paper. Experimental results show that the reconstruction performance of the Lorentizian hard thresholding pursuit algorithm is superior to the Lorentzian iterative hard thresholding algorithm which is also an effective algorithm for sparse reconstruction of compressed sensing in the impulsive noise environment.
In DTN (Delay Tolerant networks), bundle and block shred data to cope with frequent interruption. However, it remains a problem of what impact will be generated on transmission efficiency by the size of bundle and blo...
详细信息
In this paper, a new fast encoding scheme using CU depth information for quality scalable HEVC was proposed. The proposed scheme based on the correlation between the base layer and enhancement layer, as well as the co...
详细信息
In this paper, a new fast encoding scheme using CU depth information for quality scalable HEVC was proposed. The proposed scheme based on the correlation between the base layer and enhancement layer, as well as the correlation between current frame and reference frame, which obtained by experiment. The main idea of the algorithm is that when each LCU is encoded in enhancement layer, it's corresponding encoded LCU's best coding depth in base layer is used as the new maximum encoding depth in enhancement layer, thereby, it can reduce the unnecessary CU division process then reduce the computational complexity. On the other hand, for base layer, when each LCU encoding in current frame, the corresponding LCU's depth in already coded reference frame is utilized to skip parts process of mode selection before reach this reference depth, so that the computational complexity can be reduced again. Experimental results show that compared with the original SHM5.1, our proposed method saves about 59.45% and 67.71% encoding time in whole encoding layers and enhancement layer respectively, with a negligible decrease in PSNR of 0.014 dB and bitrate increase of 0.46% in EL, as well as PSNR of 0.05 dB and bitrate increase of 1.15% in BL averagely.
To alleviate the encoder computation load in inter-frame coding of the High Efficiency Video Coding (HEVC), a new fast inter-frame prediction mode decision method is proposed by reducing the number of execution of the...
详细信息
To alleviate the encoder computation load in inter-frame coding of the High Efficiency Video Coding (HEVC), a new fast inter-frame prediction mode decision method is proposed by reducing the number of execution of the advanced motion vector prediction (AMVP) mode. Based on the correlation analysis between the corresponding located CU (Coding Unit) in the previous frame and the current CU, we first select the best one inter prediction mode by just performing merge mode decision process and then only perform the AMVP process on the selected one. Experimental results show that the proposed scheme provides 33.04% encoder time savings in Random Access (RA) configuration and 38.05% time savings in Low Delay (LD) configuration on average, and its increment in bit rate is 0.87% in RA and 1.29% in LD compared to the default encoding scheme in HM10.0.
When existing spectrum sensing algorithm detects low SNR signal,detection performance is not *** paper proposes a spectrum sensing algorithm based on the best stochastic *** algorithm introduces the stochastic resonan...
详细信息
When existing spectrum sensing algorithm detects low SNR signal,detection performance is not *** paper proposes a spectrum sensing algorithm based on the best stochastic *** algorithm introduces the stochastic resonance theory and changes system parameters adaptively through sensing environment *** analysis and simulation results show the algorithm has a good detection performance while sensing low SNR signal.
B+ Tree is a special balanced multiway tree with flexible structure and node pages linking to each *** supports not only rapid random query,but also range *** B+ Tree index cannot be directly migrated since data stora...
详细信息
B+ Tree is a special balanced multiway tree with flexible structure and node pages linking to each *** supports not only rapid random query,but also range *** B+ Tree index cannot be directly migrated since data storage architecture is different in cloud *** on the characteristics of cloud computing master-slave architecture and combined with the characteristics of the columnar storage in the cloud environment,this paper proposes an improved secondary index of B+ *** this index,primary key still uses key-Value style hash index,which can not only get high search efficiency,but also maintain load balance;other property columns will apply improved B+ Tree index,which can solve the problem of high time complexity when querying non-primary key and also support range query of non-primary key property.
There exist a number of heterogeneous net units in network in cloud *** problem faced by current network management is how to collect and store data generated by net *** solve this problem,this paper proposes an acqui...
详细信息
There exist a number of heterogeneous net units in network in cloud *** problem faced by current network management is how to collect and store data generated by net *** solve this problem,this paper proposes an acquisition and storage solution of huge network management data based on *** the characteristics of heterogeneous network management data and advantages of HBase storage into consideration,an integrated and event-driven solution is made to realize huge network management data acquisition and *** has been proven by practice that by distributed computing of Hadoop and distributed columnar storage of HBase,the solution has secured efficient parallelization of acquisition and storage of the *** performance can be linearly increased when the number of acquisition servers is *** theory,over 13 acquisition servers can run a poll to tens of thousands of net unit device in heterogeneous network within 3 minutes.
Vehicle Ad hoc networks (VANETs) is an emerging wirelessnetworktechnology whereby information is generally shared among vehicles through multi-hopping In literature, a number of routing approaches has been proposed ...
详细信息
Vehicle Ad hoc networks (VANETs) is an emerging wirelessnetworktechnology whereby information is generally shared among vehicles through multi-hopping In literature, a number of routing approaches has been proposed for reducing the end-to-end delay. However, the routing approaches applied to support multicast service will be inefficient since none of them considered the share path in VANETs. This paper considers the delay-bound guaranteed multicast service where a vehicle aims to send a message to a group of vehicles using minimal bandwidth within a guaranteed delay bound. The source and multicast destinations are location-aware and trip-aware. Therefore the multicast approach developed for VANETs is totally different to the one in ad hoc networks. The proposed approach forwards the multicast message to the vehicles in the multicast group along the road segment with the least time cost, reserving as much as possible the remaining time for carry-and-forward transmissions which helps reduce the bandwidth consumption for packet transmissions.
Due to the explosive increment of data in big data era, it is a challenging task to analyze and extract meaningful data for users. Data needs to be timely operated because of the time sensitivity, so it faces enormous...
详细信息
Due to the explosive increment of data in big data era, it is a challenging task to analyze and extract meaningful data for users. Data needs to be timely operated because of the time sensitivity, so it faces enormous pressure in storage and computing. To deal with the problem that it is hard to achieve valuable information from out-of-order streams over big data in short time, a model-matching algorithm based on improved BP (Back Propagation) is proposed. In the algorithm, the matching model is set dynamically. Information is extracted for users according to the order of data's arriving time. Furthermore, the algorithm parameters are automatically adjusted in the process of learning and matching. Accordingly, the responding speed of learning is accelerated and the time of matching reduces. In the simulation, a group of optimum parameters of improved BP are achieved by using self-adapting adjusting mechanism. The threshold (TH), connecting weight (CW) and learning rate (LR) are equal to 1.5, 3 and 1, respectively. We implement our model-matching algorithm on 10000 sets of out-of-order streams with these parameters. Results indicate that the proposed algorithm can obviously improve the accuracy and speed of matching and achieve better stability.
暂无评论