http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Jifeng Huang (검색결과 4 건)
- 무료
- 기관 내 무료
- 유료
-
An Extended Generative Feature Learning Algorithm for Image Recognition
( Bin Wang ),( Chuanjiang Li ),( Qian Zhang ),( Jifeng Huang ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.8
Image recognition has become an increasingly important topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The recognition systems rely on a key component, i.e. the low-level feature or the learned mid-level feature. The recognition performance can be potentially improved if the data distribution information is exploited using a more sophisticated way, which usually a function over hidden variable, model parameter and observed data. These methods are called generative score space. In this paper, we propose a discriminative extension for the existing generative score space methods, which exploits class label when deriving score functions for image recognition task. Specifically, we first extend the regular generative models to class conditional models over both observed variable and class label. Then, we derive the mid-level feature mapping from the extended models. At last, the derived feature mapping is embedded into a discriminative classifier for image recognition. The advantages of our proposed approach are two folds. First, the resulted methods take simple and intuitive forms which are weighted versions of existing methods, benefitting from the Bayesian inference of class label. Second, the probabilistic generative modeling allows us to exploit hidden information and is well adapt to data distribution. To validate the effectiveness of the proposed method, we cooperate our discriminative extension with three generative models for image recognition task. The experimental results validate the effectiveness of our proposed approach.
-
Few Samples Face Recognition Based on Generative Score Space
( Bin Wang ),( Cungang Wang ),( Qian Zhang ),( Jifeng Huang ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12
Few samples face recognition has become a highly challenging task due to the limitation of available labeled samples. As two popular paradigms in face image representation, sparse component analysis is highly robust while parts-based paradigm is particularly flexible. In this paper, we propose a probabilistic generative model to incorporate the strengths of the two paradigms for face representation. This model finds a common spatial partition for given images and simultaneously learns a sparse component analysis model for each part of the partition. The two procedures are built into a probabilistic generative model. Then we derive the score function (i.e. feature mapping) from the generative score space. A similarity measure is defined over the derived score function for few samples face recognition. This model is driven by data and specifically good at representing face images. The derived generative score function and similarity measure encode information hidden in the data distribution. To validate the effectiveness of the proposed method, we perform few samples face recognition on two face datasets. The results show its advantages.
-
Few Samples Face Recognition Based on Generative Score Space
Wang, Bin,Wang, Cungang,Zhang, Qian,Huang, Jifeng Korean Society for Internet Information 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12
Few samples face recognition has become a highly challenging task due to the limitation of available labeled samples. As two popular paradigms in face image representation, sparse component analysis is highly robust while parts-based paradigm is particularly flexible. In this paper, we propose a probabilistic generative model to incorporate the strengths of the two paradigms for face representation. This model finds a common spatial partition for given images and simultaneously learns a sparse component analysis model for each part of the partition. The two procedures are built into a probabilistic generative model. Then we derive the score function (i.e. feature mapping) from the generative score space. A similarity measure is defined over the derived score function for few samples face recognition. This model is driven by data and specifically good at representing face images. The derived generative score function and similarity measure encode information hidden in the data distribution. To validate the effectiveness of the proposed method, we perform few samples face recognition on two face datasets. The results show its advantages.
-
Refinement of Kinect Sensor’s Depth Maps Based on GMM and CS Theory
Qian Zhang,ShaoMin Li,Wenfeng Guo,Pei Wang,Jifeng Huang 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.5
As the Microsoft’s Kinect sensor can generate a real-time dense depth map with relatively commercial available, it is widely used in depth map capturing. However, there are some artifacts like holes, instability of the raw input data, which seriously affect the application. To solve this problem, in this paper, we propose a novel depth map refinement method based on by GMM and CS theory which enable the kinect sensor generate a dense depth map, the background large holes are filled without blurring, and the edges of the objects are sharpened, median filter is used to remove noise. Experiments on captured indoor data demonstrate the effectiveness of the method especially in the edge area and occlusion area that our method can obtain better results.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
