基于惩罚广义矩估计(generalized method of moments,GMM)的正交投影估计方法,文章针对一类部分线性可加空间自回归模型提出了一种变量选择方法。该方法既能在参数分量中选取重要的协变量,又能识别空间效应的显著性。在一定条件下,文章...基于惩罚广义矩估计(generalized method of moments,GMM)的正交投影估计方法,文章针对一类部分线性可加空间自回归模型提出了一种变量选择方法。该方法既能在参数分量中选取重要的协变量,又能识别空间效应的显著性。在一定条件下,文章亦证明了该方法的相合性,并得到了参数估计量的收敛速度,最后通过蒙特卡罗模拟研究证实了该方法在有限样本下的可行性。展开更多
Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk...Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.展开更多
In this paper, an efficient model of palmprint identification is presented based on subspace density estimation using Gaussian Mixture Model (GMM). While a few training samples are available for each person, we use in...In this paper, an efficient model of palmprint identification is presented based on subspace density estimation using Gaussian Mixture Model (GMM). While a few training samples are available for each person, we use intrapersonal palmprint deformations to train the global GMM instead of modeling GMMs for every class. To reduce the dimension of such variations while preserving density function of sample space, Principle Component Analysis (PCA) is used to find the principle differences and form the Intrapersonal Deformation Subspace (IDS). After training GMM using Expectation Maximization (EM) algorithm in IDS, a maximum likelihood strategy is carried out to identify a person. Experimental results demonstrate the advantage of our method compared with traditional PCA method and single Gaussian strategy.展开更多
文摘基于惩罚广义矩估计(generalized method of moments,GMM)的正交投影估计方法,文章针对一类部分线性可加空间自回归模型提出了一种变量选择方法。该方法既能在参数分量中选取重要的协变量,又能识别空间效应的显著性。在一定条件下,文章亦证明了该方法的相合性,并得到了参数估计量的收敛速度,最后通过蒙特卡罗模拟研究证实了该方法在有限样本下的可行性。
基金Supported by the National Basic Research Program of China(No.2013CB329502)the National Natural Science Foundation of China(No.61202212)+1 种基金the Special Research Project of the Educational Department of Shaanxi Province of China(No.15JK1038)the Key Research Project of Baoji University of Arts and Sciences(No.ZK16047)
文摘Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.
文摘In this paper, an efficient model of palmprint identification is presented based on subspace density estimation using Gaussian Mixture Model (GMM). While a few training samples are available for each person, we use intrapersonal palmprint deformations to train the global GMM instead of modeling GMMs for every class. To reduce the dimension of such variations while preserving density function of sample space, Principle Component Analysis (PCA) is used to find the principle differences and form the Intrapersonal Deformation Subspace (IDS). After training GMM using Expectation Maximization (EM) algorithm in IDS, a maximum likelihood strategy is carried out to identify a person. Experimental results demonstrate the advantage of our method compared with traditional PCA method and single Gaussian strategy.