A new generation algorithm of two-dimensional triple-codeweight asymmetric optical orthogonal codes for optical code division multiple access (OCDMA) networks is proposed. The code cardinality is obtained and the er...A new generation algorithm of two-dimensional triple-codeweight asymmetric optical orthogonal codes for optical code division multiple access (OCDMA) networks is proposed. The code cardinality is obtained and the error-probability performance for corresponding OCDMA system is analyzed. The codes with two constraints (i.e., auto- and cross-correlation properties) being unequal are taken into account. On the premise of fixed system resources, the code of the error-probability performance, it is shown cardinality can be significantly improved. By analysis that the codes with different parameters have different performances. Therefore, this type of codes can be applied to support diverse quality of service (QoS) and satisfy the quality requirement of different multimedia or distinct users, and simultaneously make the better use of bandwidth resources in oDtical networks.展开更多
We construct a collaborative model of the sparse representation and the subspace representation. First, we represent the tracking target in the principle component analysis(PCA) subspace, and then we employ an L_1 reg...We construct a collaborative model of the sparse representation and the subspace representation. First, we represent the tracking target in the principle component analysis(PCA) subspace, and then we employ an L_1 regularization to restrict the sparsity of the residual term, an L_2 regularization term to restrict the sparsity of the representation coefficients, and an L_2 norm to restrict the distance between the reconstruction and the target. Then we implement the algorithm in the particle filter framework. Furthermore, an iterative method is presented to get the global minimum of the residual and the coefficients. Finally, an alternative template update scheme is adopted to avoid the tracking drift which is caused by the inaccurate update. In the experiment, we test the algorithm on 9 sequences, and compare the results with 5 state-of-art methods. According to the results, we can conclude that our algorithm is more robust than the other methods.展开更多
基金supported by National Basic Research Program of China(973Program)(2012CB720000)National Natural Science Foundation of China(61225015,61273128)+2 种基金Foundation for Innovative Research Groups of the National Natural Science Foundation of China(61321002)the Ph.D.Programs Foundation of Ministry of Education of China(20111101110012)CAST Foundation(CAST201210)
基金supported in part by the National Natural Science Foundation of China under GrantsNo. 60472035 and 60772001
文摘A new generation algorithm of two-dimensional triple-codeweight asymmetric optical orthogonal codes for optical code division multiple access (OCDMA) networks is proposed. The code cardinality is obtained and the error-probability performance for corresponding OCDMA system is analyzed. The codes with two constraints (i.e., auto- and cross-correlation properties) being unequal are taken into account. On the premise of fixed system resources, the code of the error-probability performance, it is shown cardinality can be significantly improved. By analysis that the codes with different parameters have different performances. Therefore, this type of codes can be applied to support diverse quality of service (QoS) and satisfy the quality requirement of different multimedia or distinct users, and simultaneously make the better use of bandwidth resources in oDtical networks.
基金the National Natural Science Foundation of China(No.61303094)the Program of Science and Technology Commission of Shanghai Municipality(No.16511102400)the Innovation Program of Shanghai Municipal Education Commission(No.14YZ024)
基金supported by the National Natural Science Foundation of China(No.61401425)
文摘We construct a collaborative model of the sparse representation and the subspace representation. First, we represent the tracking target in the principle component analysis(PCA) subspace, and then we employ an L_1 regularization to restrict the sparsity of the residual term, an L_2 regularization term to restrict the sparsity of the representation coefficients, and an L_2 norm to restrict the distance between the reconstruction and the target. Then we implement the algorithm in the particle filter framework. Furthermore, an iterative method is presented to get the global minimum of the residual and the coefficients. Finally, an alternative template update scheme is adopted to avoid the tracking drift which is caused by the inaccurate update. In the experiment, we test the algorithm on 9 sequences, and compare the results with 5 state-of-art methods. According to the results, we can conclude that our algorithm is more robust than the other methods.