In this paper, a novel motion texture approach is presented for synthesizing long character motion (e.g., kungfu) that is similar to the original short input motion. First, a new motion with repeated frames is generat...In this paper, a novel motion texture approach is presented for synthesizing long character motion (e.g., kungfu) that is similar to the original short input motion. First, a new motion with repeated frames is generated by exploiting the symmetric properties of the frames and reversing the motion sequence playback in a given motion sequence. Then, the order of the above motion sequence is rearranged by putting the start and the end frames together. The graphcut algorithm is used to seamlessly synthesize the transition between the start and the end frames, which is noted as graphcut-based motion-texton. Finally, we utilize the motion-textons to synthesize long motion texture, which can be patched together like the image texture synthesis method using graphcut algorithm, and automatically form a long motion texture endlessly. Our approach is demonstrated by synthesizing the long kungfu motion texture without visual artifacts, together with post-processing including our new developed graphcut-based motion blending and Poisson-based motion smoothing techniques.展开更多
This letter proposes an efficient wavelet-based Fine Granularity Scalable (FGS)coding scheme, where the base layer is encoded with a newly designed wavelet-based coder, and the enhancement layer is encoded with Progre...This letter proposes an efficient wavelet-based Fine Granularity Scalable (FGS)coding scheme, where the base layer is encoded with a newly designed wavelet-based coder, and the enhancement layer is encoded with Progressive Fine Granularity Scalable (PFGS) coding.This algorithm involves multi-frame motion compensation, rate-distortion optimizing strategy with Lagrangian cost function and context-based adaptive arithmetic coding. In order to improve efficiency of the enhancement layer coding, an improved motion estimation scheme that uses both information from the base layer and the enhancement layer is also proposed in this letter. The wavelet-based coder significantly improves the coding efficiency of the base layer compared with MPEG-4 ASP (Advanced Simple Profile) and H.26L TML9. The PFGS coding is a significant improvement over MPEG-4 FGS coding at the enhancement layer. Experiments show that single layer coding efficiency gain of the proposed scheme is about 2.0-3.0dB and 0.3-1.0dB higher than that of MPEG-4 ASP and H.26L TML9, respectively. The overall coding efficiency gain of the proposed scheme is about 4.0-5.0dB higher than that of MPEG-4 FGS.展开更多
Accuracy and fastness of iris localization are very important in automatic iris recognition. A new fast iris localization algorithm based on improved generalized symmetry transform (GST) was proposed by utilizing (iri...Accuracy and fastness of iris localization are very important in automatic iris recognition. A new fast iris localization algorithm based on improved generalized symmetry transform (GST) was proposed by utilizing (iris) symmetry. GST was improved in three aspects:1) A new distance weight function is defined. The new weight function, which is effective in iris localization, utilized the characteristic of irises that the iris is a circular object and it has one inner boundary and one outer boundary. 2) Each calculation of the symmetry measurement of a pair of symmetry points was performed by taking one point of a pair as the starting point of the transformation. This is the most important reason for fast iris localization,due to which, repetitious computation was largely excluded. 3) A new phase weight function was proposed to adjust GST to locate circle target much better because the inner part of iris is darker than the outer part. The edge map of iris image was acquired and GST was only implemented on the edge point, which decreased computation without loss of accuracy. The modification of distance weight function and phase weight function leads to the accuracy of localization, and other ideas speed up the localization. Experiments show that the average speed of new algorithm is about 7.0—8.5 times as high as traditional ones including integro-differential operator and Hough transform method.展开更多
In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the clas...In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.展开更多
基金Project supported by the National Natural Science Foundation of China (Nos. 60573153 and 60533080), and Program for New Century Excellent Talents in University (No. NCET-05-0519), China
文摘In this paper, a novel motion texture approach is presented for synthesizing long character motion (e.g., kungfu) that is similar to the original short input motion. First, a new motion with repeated frames is generated by exploiting the symmetric properties of the frames and reversing the motion sequence playback in a given motion sequence. Then, the order of the above motion sequence is rearranged by putting the start and the end frames together. The graphcut algorithm is used to seamlessly synthesize the transition between the start and the end frames, which is noted as graphcut-based motion-texton. Finally, we utilize the motion-textons to synthesize long motion texture, which can be patched together like the image texture synthesis method using graphcut algorithm, and automatically form a long motion texture endlessly. Our approach is demonstrated by synthesizing the long kungfu motion texture without visual artifacts, together with post-processing including our new developed graphcut-based motion blending and Poisson-based motion smoothing techniques.
基金Supported partially by the National Natural Science Foundation of China(No.69973018)and Natural Science Foundation of Hubei Province(No.99J009)
文摘This letter proposes an efficient wavelet-based Fine Granularity Scalable (FGS)coding scheme, where the base layer is encoded with a newly designed wavelet-based coder, and the enhancement layer is encoded with Progressive Fine Granularity Scalable (PFGS) coding.This algorithm involves multi-frame motion compensation, rate-distortion optimizing strategy with Lagrangian cost function and context-based adaptive arithmetic coding. In order to improve efficiency of the enhancement layer coding, an improved motion estimation scheme that uses both information from the base layer and the enhancement layer is also proposed in this letter. The wavelet-based coder significantly improves the coding efficiency of the base layer compared with MPEG-4 ASP (Advanced Simple Profile) and H.26L TML9. The PFGS coding is a significant improvement over MPEG-4 FGS coding at the enhancement layer. Experiments show that single layer coding efficiency gain of the proposed scheme is about 2.0-3.0dB and 0.3-1.0dB higher than that of MPEG-4 ASP and H.26L TML9, respectively. The overall coding efficiency gain of the proposed scheme is about 4.0-5.0dB higher than that of MPEG-4 FGS.
文摘Accuracy and fastness of iris localization are very important in automatic iris recognition. A new fast iris localization algorithm based on improved generalized symmetry transform (GST) was proposed by utilizing (iris) symmetry. GST was improved in three aspects:1) A new distance weight function is defined. The new weight function, which is effective in iris localization, utilized the characteristic of irises that the iris is a circular object and it has one inner boundary and one outer boundary. 2) Each calculation of the symmetry measurement of a pair of symmetry points was performed by taking one point of a pair as the starting point of the transformation. This is the most important reason for fast iris localization,due to which, repetitious computation was largely excluded. 3) A new phase weight function was proposed to adjust GST to locate circle target much better because the inner part of iris is darker than the outer part. The edge map of iris image was acquired and GST was only implemented on the edge point, which decreased computation without loss of accuracy. The modification of distance weight function and phase weight function leads to the accuracy of localization, and other ideas speed up the localization. Experiments show that the average speed of new algorithm is about 7.0—8.5 times as high as traditional ones including integro-differential operator and Hough transform method.
文摘In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.
