作者:
Hai ZhugeKnowledge Grid Research Group
Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China
Natural physical space provides material basis for the birth and evolution of human beings and *** progress of human society has created the cyber space. With the rapid development of informationtechnology, the cyber...
详细信息
Natural physical space provides material basis for the birth and evolution of human beings and *** progress of human society has created the cyber space. With the rapid development of informationtechnology, the cyber space is connecting physical space, social space and mental space to form a new world - Cyber Physical Society. The way to explore the cyber physical society is different from the way to explore the natural physical space and society. This paper describes the ideal of the Cyber Physical Society, and presents its distinguished characteristics and scientific issues. Research on the Cyber Physical Society could lead to the revolution of society, science and technology.
The measurement of semantic similarity between words is very important in many applicaitons. In this paper, we propose a method based on Laplacian eigenmaps to measure semantic similarity between words. First, we atta...
详细信息
Today's camera sensors usually have a high gray-scale resolution, e.g. 256, however, due to the dramatic lighting variations, the gray-scales distributed to the face region might be far less than 256. Therefore, b...
详细信息
Today's camera sensors usually have a high gray-scale resolution, e.g. 256, however, due to the dramatic lighting variations, the gray-scales distributed to the face region might be far less than 256. Therefore, besides low spatial resolution, a practical face recognition system must also handle degraded face images of low gray-scale resolution (LGR). In the last decade, low spatial resolution problem has been studied prevalently, but LGR problem was rarely studied. Aiming at robust face recognition, this paper makes a first primary attempt to investigate explicitly the LGR problem and empirically reveals that LGR indeed degrades face recognition method significantly. Possible solutions to the problem are discussed and grouped into three categories: gray-scale resolution invariant features, gray-scale degradation modeling and Gray-scale Super-Resolution (GSR). Then, we propose a Coupled Subspace Analysis (CSA) based GSR method to recover the high gray-scale resolution image from a single input LGR image. Extensive experiments on FERET and CMU-PIE face databases show that the proposed method can not only dramatically increase the gray-scale resolution and visualization quality, but also impressively improve the accuracy of face recognition.
In our previous work, the rate-distortion optimized transform (RDOT) is introduced for Intra coding, which is featured by the usage of multiple offline-trained transform matrix candidates. The proposed RDOT achieves r...
详细信息
In our previous work, the rate-distortion optimized transform (RDOT) is introduced for Intra coding, which is featured by the usage of multiple offline-trained transform matrix candidates. The proposed RDOT achieves remarkable coding gain for KTA Intra coding, while maintaining almost the same computational complexity at the decoder. However, at the encoder, the computational complexity is increased drastically by the expensive ratedistortion (R-D) optimized selection of transform matrix. To resolve this problem, in this paper, we propose a fast RDOT scheme using macroblock- and block-level R-D cost thresholding. With the proposed method, unnecessary mode trials and R-D evaluations of transform matrices can be efficiently skipped from the mode decision process. Extensive experimental results show that, with negligible coding performance degradation, about 88.9% of the total encoding time is saved by the proposed method.
We study what we call semi-defined classification, which deals with the categorization tasks where the taxonomy of the data is not well defined in advance. It is motivated by the real-world applications, where the unl...
详细信息
We study what we call semi-defined classification, which deals with the categorization tasks where the taxonomy of the data is not well defined in advance. It is motivated by the real-world applications, where the unlabeled data may also come from some other unknown classes besides the known classes for the labeled data. Given the unlabeled data, our goal is to not only identify the instances belonging to the known classes, but also cluster the remaining data into other meaningful groups. It differs from traditional semi-supervised clustering in the sense that in semi-supervised clustering the supervision knowledge is too far from being representative of a target classification, while in semi-defined classification the labeled data may be enough to supervise the learning on the known classes. In this paper we propose the model of Double-latent-layered LDA (D-LDA for short) for this problem. Compared with LDA with only one latent variable y for word topics, D-LDA contains another latent variable z for (known and unknown) document classes. With this double latent layers consisting of y and z and the dependency between them, D-LDA directly injects the class labels into z to supervise the exploiting of word topics in y. Thus, the semi-supervised learning in D-LDA does not need the generation of pair wise constraints, which is required in most of the previous semi-supervised clustering approaches. We present the experimental results on ten different data sets for semi-defined classification. Our results are either comparable to (on one data sets), or significantly better (on the other nine data set) than the six compared methods, including the state-of-the-art semi-supervised clustering methods.
Illumination variation has been one of the most intractable problems in face recognition and many approaches have been proposed to handle illumination problem in the last decades of years. The key problem is how to ge...
详细信息
Illumination variation has been one of the most intractable problems in face recognition and many approaches have been proposed to handle illumination problem in the last decades of years. The key problem is how to get stable similarity measurements between two face images of the same individual but captured under dramatically different lighting conditions. We propose a framework to optimize the illumination normalization for a pair of gallery and probe face images by maximizing a correlation (MAC) between them. The illumination normalization in the proposed framework tends to maximize the intra-individual correlations instead of both the inter- and intra-individual correlations. Experiments on Extended YaleB and CMU-PIE face databases show the effectiveness of our proposed approach in face recognition across varying lighting conditions.
This paper proposed a method for entity answer extraction, which examined three levels of relevance, including document, passage and entity. The entity answer extraction system and homepage recognition are also descri...
详细信息
Taking the features of data in low and high frequency texts and the frequencies which such features emerge in a single text into consideration, the paper sets up a vector space model for part of texts of field. Then t...
详细信息
Taking the features of data in low and high frequency texts and the frequencies which such features emerge in a single text into consideration, the paper sets up a vector space model for part of texts of field. Then the paper also establishes a classifying and clustering method with features of classification and clustering by designing and constructing the two-dimensional analytic indexes of similarities and differences between field texts. This method is designed for field texts because it is quite suitable for effective machine learning and can extend the text data and textual categories dynamically in real-time. Meantime, it solves the single-label classification and multi-label classification issues at one time, overcoming the defects of previous text classifying methods which can only expand data instead of capacity. The general text clustering methods have many defects: they are not suitable for high-dimensional data sets or large data sets; they don't have the text data and category expanding function and they can not handle the outlier data problem well. On the contrary, this new method can offer solutions to these defects. According to this method, the corresponding algorithm has been established and the effectiveness of the method has been proven by the experiment on the data sets of laws and regulations of construction industry in Shaanxi Province in China.
The content and structure of linked information such as sets of web pages or research paper archives are dynamic and keep on changing. Even though different methods are proposed to exploit both the link structure and ...
详细信息
The content and structure of linked information such as sets of web pages or research paper archives are dynamic and keep on changing. Even though different methods are proposed to exploit both the link structure and the content information, no existing approach can effectively deal with this evolution. We propose a novel joint model, called Link-IPLSI, to combine texts and links in a topic modeling framework incrementally. The model takes advantage of a novel link updating technique that can cope with dynamic changes of online document streams in a faster and scalable way. Furthermore, an adaptive asymmetric learning method is adopted to freely control the assignment of weights to terms and citations. Experimental results on two different sources of online information demonstrate the time saving strength of our method and indicate that our model leads to systematic improvements in the quality of classification and link prediction.
暂无评论