A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering use...A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering used in the segmental K-means algorithm to determineoptimal state and branch sequences. Based on the optimal sequence, parameters are estimated withmaximum-likelihood as objective functions. Comparisons with the traditional Baum-Welch and segmentalK-means algorithms on various aspects, such as optimal objectives and fundamentals, are made. Allthree algorithms are applied to face recognition. Results indicate that the proposed algorithm canreduce training time with comparable recognition rate and it is least sensitive to the training set.So its average performance exceeds the other two.展开更多
An organocatalytic asymmetric branching sequence was realized in the presence of 10 mol% of （DHQD）2AQN, affording the sequential products with three stereocentres, including two quaternary carbon centres, in 47%-79%...An organocatalytic asymmetric branching sequence was realized in the presence of 10 mol% of （DHQD）2AQN, affording the sequential products with three stereocentres, including two quaternary carbon centres, in 47%-79% yields with 85%-99% ee.展开更多
文摘A parameter estimation algorithm of the continuous hidden Markov model isintroduced and the rigorous proof of its convergence is also included. The algorithm uses theViterbi algorithm instead of K-means clustering used in the segmental K-means algorithm to determineoptimal state and branch sequences. Based on the optimal sequence, parameters are estimated withmaximum-likelihood as objective functions. Comparisons with the traditional Baum-Welch and segmentalK-means algorithms on various aspects, such as optimal objectives and fundamentals, are made. Allthree algorithms are applied to face recognition. Results indicate that the proposed algorithm canreduce training time with comparable recognition rate and it is least sensitive to the training set.So its average performance exceeds the other two.
基金Acknowledgement This work was supported financially by the National Natural Science Foundation of China （Nos. 20972110 and 20902067）.
文摘An organocatalytic asymmetric branching sequence was realized in the presence of 10 mol% of （DHQD）2AQN, affording the sequential products with three stereocentres, including two quaternary carbon centres, in 47%-79% yields with 85%-99% ee.
