An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift ...An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.展开更多
In order to overcome defects of the classical hidden Markov model (HMM), Markov family model (MFM), a new statistical model was proposed. Markov family model was applied to speech recognition and natural language proc...In order to overcome defects of the classical hidden Markov model (HMM), Markov family model (MFM), a new statistical model was proposed. Markov family model was applied to speech recognition and natural language processing. The speaker independently continuous speech recognition experiments and the part-of-speech tagging experiments show that Markov family model has higher performance than hidden Markov model. The precision is enhanced from 94.642% to 96.214% in the part-of-speech tagging experiments, and the work rate is reduced by 11.9% in the speech recognition experiments with respect to HMM baseline system.展开更多
Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is ...Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.展开更多
An efficient approach was proposed for discriminating shadows from moving objects. In the background subtraction stage, moving objects were extracted. Then, the initial classification for moving shadow pixels and fore...An efficient approach was proposed for discriminating shadows from moving objects. In the background subtraction stage, moving objects were extracted. Then, the initial classification for moving shadow pixels and foreground object pixels was performed by using color invariant features. In the shadow model learning stage, instead of a single Gaussian distribution, it was assumed that the density function computed on the values of chromaticity difference or bright difference, can be modeled as a mixture of Gaussian consisting of two density functions. Meanwhile, the Gaussian parameter estimation was performed by using EM algorithm. The estimates were used to obtain shadow mask according to two constraints. Finally, experiments were carried out. The visual experiment results confirm the effectiveness of proposed method. Quantitative results in terms of the shadow detection rate and the shadow discrimination rate(the maximum values are 85.79% and 97.56%, respectively) show that the proposed approach achieves a satisfying result with post-processing step.展开更多
The key problem of the adaptive mixture background model is that the parameters can adaptively change according to the input data. To address the problem, a new method is proposed. Firstly, the recursive equations are...The key problem of the adaptive mixture background model is that the parameters can adaptively change according to the input data. To address the problem, a new method is proposed. Firstly, the recursive equations are inferred based on the maximum likelihood rule. Secondly, the forgetting factor and learning rate factor are redefined, and their still more general formulations are obtained by analyzing their practical functions. Lastly, the convergence of the proposed algorithm is proved to enable the estimation converge to a local maximum of the data likelihood function according to the stochastic approximation theory. The experiments show that the proposed learning algorithm excels the formers both in converging rate and accuracy.展开更多
In the forward channel of a networked control system （NCS）, by defining the network states as a hidden Markov chain and quantizing the network-induced delays to a discrete sequence distributing over a finite time in...In the forward channel of a networked control system （NCS）, by defining the network states as a hidden Markov chain and quantizing the network-induced delays to a discrete sequence distributing over a finite time interval, the relation between the network states and the network-induced delays is modelled as a discrete-time hidden Markov model （DTHMM）. The expectation maximization （EM） algorithm is introduced to derive the maximumlikelihood estimation （MLE） of the parameters of the DTHMM. Based on the derived DTHMM, the Viterbi algorithm is introduced to predict the controller-to-actuator （C-A） delay during the current sampling period. The simulation experiments demonstrate the effectiveness of the modelling and predicting methods proposed.展开更多
A novel moving object detection method was proposed in order to adapt the difficulties caused by intermittent object motion,thermal and dynamic background sequences.Two groups of complementary Gaussian mixture models ...A novel moving object detection method was proposed in order to adapt the difficulties caused by intermittent object motion,thermal and dynamic background sequences.Two groups of complementary Gaussian mixture models were used.The ghost and real static object could be classified by comparing the similarity of the edge images further.In each group,the multi resolution Gaussian mixture models were used and dual thresholds were applied in every resolution in order to get a complete object mask without much noise.The computational color model was also used to depress illustration variations and light shadows.The proposed method was verified by the public test sequences provided by the IEEE Change Detection Workshop and compared with three state-of-the-art methods.Experimental results demonstrate that the proposed method is better than others for all of the evaluation parameters in intermittent object motion sequences.Four and two in the seven evaluation parameters are better than the others in thermal and dynamic background sequences,respectively.The proposed method shows a relatively good performance,especially for the intermittent object motion sequences.展开更多
为了解决联邦学习在车联网中终端设备数据的异质性导致模型训练准确率不稳定和性能下降,以及车辆分布广泛,通信和计算资源有限的问题,提出一种数据类型和数据规模并行优化的群联邦迁移学习数据共享方法(swarm federated transfer learni...为了解决联邦学习在车联网中终端设备数据的异质性导致模型训练准确率不稳定和性能下降,以及车辆分布广泛,通信和计算资源有限的问题,提出一种数据类型和数据规模并行优化的群联邦迁移学习数据共享方法(swarm federated transfer learning,SFTL)。提出基于高斯混合模型的共识设备组划分机制,通过对数据分布建模构建共识设备组,实现对异质性数据的有效管理和分析;面向划分的共识设备组,设计蜂群学习训练机制,加强相似设备组之间的协同学习过程;提出组间迁移学习机制,通过模型预训练法增量迁移不同共识设备组信息最小化模型差异,提高联邦模型聚合准确率。在公共数据集上的实验表明:与基线方法相比,SFTL模型训练准确率平均提高7%,通信时间平均降低10%。展开更多
文摘An improved approach for J-value segmentation （JSEG） is presented for unsupervised color image segmentation. Instead of color quantization algorithm, an automatic classification method based on adaptive mean shift （AMS） based clustering is used for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling （GMM） of image data for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the synergism of JSEG and the soft classification based on AMS based clustering and GMM overcomes the limitations of JSEG successfully and is more robust.
基金Project(60763001)supported by the National Natural Science Foundation of ChinaProjects(2009GZS0027,2010GZS0072)supported by the Natural Science Foundation of Jiangxi Province,China
文摘In order to overcome defects of the classical hidden Markov model (HMM), Markov family model (MFM), a new statistical model was proposed. Markov family model was applied to speech recognition and natural language processing. The speaker independently continuous speech recognition experiments and the part-of-speech tagging experiments show that Markov family model has higher performance than hidden Markov model. The precision is enhanced from 94.642% to 96.214% in the part-of-speech tagging experiments, and the work rate is reduced by 11.9% in the speech recognition experiments with respect to HMM baseline system.
基金the National Natural Science Foundation of China(61771367)the Science and Technology on Communication Networks Laboratory(HHS19641X003).
文摘Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.
基金Project(50805023)supported by the National Natural Science Foundation of ChinaProject(BA2010093)supported by the Special Fund of Jiangsu Province for the Transformation of Scientific and Technological Achievements,ChinaProject(2008144)supported by the Hexa-type Elites Peak Program of Jiangsu Province,China
文摘An efficient approach was proposed for discriminating shadows from moving objects. In the background subtraction stage, moving objects were extracted. Then, the initial classification for moving shadow pixels and foreground object pixels was performed by using color invariant features. In the shadow model learning stage, instead of a single Gaussian distribution, it was assumed that the density function computed on the values of chromaticity difference or bright difference, can be modeled as a mixture of Gaussian consisting of two density functions. Meanwhile, the Gaussian parameter estimation was performed by using EM algorithm. The estimates were used to obtain shadow mask according to two constraints. Finally, experiments were carried out. The visual experiment results confirm the effectiveness of proposed method. Quantitative results in terms of the shadow detection rate and the shadow discrimination rate(the maximum values are 85.79% and 97.56%, respectively) show that the proposed approach achieves a satisfying result with post-processing step.
基金the Doctorate Foundation of the Engineering College, Air Force Engineering University.
文摘The key problem of the adaptive mixture background model is that the parameters can adaptively change according to the input data. To address the problem, a new method is proposed. Firstly, the recursive equations are inferred based on the maximum likelihood rule. Secondly, the forgetting factor and learning rate factor are redefined, and their still more general formulations are obtained by analyzing their practical functions. Lastly, the convergence of the proposed algorithm is proved to enable the estimation converge to a local maximum of the data likelihood function according to the stochastic approximation theory. The experiments show that the proposed learning algorithm excels the formers both in converging rate and accuracy.
基金supported in part by the National Natural Science Foundation of China (60774098 60843003+3 种基金 50905172)the Science Foundation of Anhui Province (090412071 090412040)the University of Science and Technology of China Initiative Foundation
文摘In the forward channel of a networked control system （NCS）, by defining the network states as a hidden Markov chain and quantizing the network-induced delays to a discrete sequence distributing over a finite time interval, the relation between the network states and the network-induced delays is modelled as a discrete-time hidden Markov model （DTHMM）. The expectation maximization （EM） algorithm is introduced to derive the maximumlikelihood estimation （MLE） of the parameters of the DTHMM. Based on the derived DTHMM, the Viterbi algorithm is introduced to predict the controller-to-actuator （C-A） delay during the current sampling period. The simulation experiments demonstrate the effectiveness of the modelling and predicting methods proposed.
基金Project(T201221207)supported by the Fundamental Research Fund for the Central Universities,ChinaProject(2012CB725301)supported by National Basic Research and Development Program,China
文摘A novel moving object detection method was proposed in order to adapt the difficulties caused by intermittent object motion,thermal and dynamic background sequences.Two groups of complementary Gaussian mixture models were used.The ghost and real static object could be classified by comparing the similarity of the edge images further.In each group,the multi resolution Gaussian mixture models were used and dual thresholds were applied in every resolution in order to get a complete object mask without much noise.The computational color model was also used to depress illustration variations and light shadows.The proposed method was verified by the public test sequences provided by the IEEE Change Detection Workshop and compared with three state-of-the-art methods.Experimental results demonstrate that the proposed method is better than others for all of the evaluation parameters in intermittent object motion sequences.Four and two in the seven evaluation parameters are better than the others in thermal and dynamic background sequences,respectively.The proposed method shows a relatively good performance,especially for the intermittent object motion sequences.
文摘为了解决联邦学习在车联网中终端设备数据的异质性导致模型训练准确率不稳定和性能下降,以及车辆分布广泛,通信和计算资源有限的问题,提出一种数据类型和数据规模并行优化的群联邦迁移学习数据共享方法(swarm federated transfer learning,SFTL)。提出基于高斯混合模型的共识设备组划分机制,通过对数据分布建模构建共识设备组,实现对异质性数据的有效管理和分析;面向划分的共识设备组,设计蜂群学习训练机制,加强相似设备组之间的协同学习过程;提出组间迁移学习机制,通过模型预训练法增量迁移不同共识设备组信息最小化模型差异,提高联邦模型聚合准确率。在公共数据集上的实验表明:与基线方法相比,SFTL模型训练准确率平均提高7%,通信时间平均降低10%。
