检索结果-内蒙古大学图书馆

作者： Zhang, Xinfeng Xiong, Ruiqin Ma, Siwei Gao, Wen Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Institute of Digital Media Peking University Beijing100871 China

ISBN: (纸本)9781479957514

Block transform compressed videos usually suffer from annoying artifacts at low bit rates, caused by the coarse quantization of transform coefficients. The inter prediction utilized in video coding also induces block boundary artifacts when the neighboring blocks using different motion vectors from previous decoded frames. In this paper, a three-dimensional adaptive estimation method for video transform coefficients is proposed to reduce the artifact in compressed video. In the proposed method, transform coefficients of each block are estimated by adaptively fusing three prediction sources based on their reliabilities. One prediction source is the transform coefficients directly acquired from the decoded video, whose reliability is determined by the distribution of the quantization noise. The other prediction source is derived by a temporal autoregressive model of transform-blocks along motion trajectory among neighboring reference frames. Its reliability is estimated from prediction variance of local blocks. The last prediction source is derived from the nonlocal transform-blocks, whose reliability is estimated based on the distribution of the nonlocal coefficients and their similarity with the estimated block. Experimental results for compressed video sequences by HEVC show that, the proposed method can reduce the compression artifacts and improve both the objective and subjective quality. © 2014 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An improved correlation method based on rotation invariant feature for automatic particle selection

An improved correlation method based on rotation invariant f...

引用

10th International Symposium on Bioinformatics Research and Applications, ISBRA 2014

作者： Chen, Yu Ren, Fei Wan, Xiaohua Wang, Xuan Zhang, Fa Key Lab. of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing Beijing China Yanshan University Yanshan China

ISBN: (纸本)9783319081700

Particle selection from cryo-electron microscopy (cryo-EM) images is very important for high-resolution reconstruction of macromolecular structure. However, the accuracy of existing selection methods are normally restricted to noise and low contrast of cryo-EM images. In this paper, we presented an improved correlation method based on rotation invariant features for automatic, fast particle selection. We first selected a preliminary particle set applying rotation invariant features, then filtered the preliminary particle set using correlation to reduce the interference of high noise background and improve the precision of correlation method. We used Divide and Conquer technique and cascade strategy to improve the recognition ability of features and reduce processing time. Experimental results on the benchmark of cryo-EM images show that our method can improve the accuracy of particle selection significantly. © 2014 Springer International Publishing Switzerland.

关键词： Correlation methods

来源：评论

学校读者我要写书评

暂无评论

A representative local region detector based on color-contrast-MSER 14

A representative local region detector based on color-contra...

引用

2014 4th ACM International Conference on Multimedia Retrieval, ICMR 2014

作者： Cao, Yang Gao, Ke Tang, Sheng Zhang, Yongdong Key Lab of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)1595930361

In order to extract representative local invariant regions in textured natural images, we propose a Color-Contrast-MSER (CCM) detector with color-contrast pixel ranking, which can reduce the number of meaningless regions extracted from backgrounds. The main contributions are threefold: (1) In contrast with the original MSER[3] which adopts intensity pixel ranking, we develop a new pixel ranking mechanism based on color contrast analysis. (2) In this paper, the pixel ranking value of each pixel is defined as the color contrast between a kernel-sized window and the background. Therefore we propose an adaptive background scale selection mechanism that simulates the background color distribution as the benchmark for color contrast. (3) The experimental results demonstrate that compared with the original MSER detector[3], our Color-Contrast-MSER (CCM) detector can extract more representative local regions with competitive repeatability score at only 50% computational time and 10% memory cost. Copyright 2014 ACM.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Signal processing for the 5G Revolution

引用

IEEE SIGNAL processing MAGAZINE 2014年第6期31卷 12-13页

作者： Heath, Robert W., Jr. Leus, Geert Quek, Tony Q. S. Talwar, Shilpa Zhou, Peiying Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China Department of Computer Systems University of São Paulo - USP São Carlos Brazil IRISA Research Institute University of South Brittany - IRISA/UBS Vannes France

The articles in this special section provide an overview of recent advances in signal processing for communication with an emphasis on signal processing techniques that will be relevant for 5G cellular systems. It covers a wide range of topics including modulation, beamforming, cross-layer optimization based on different performance metrics, location-aware communication, cloud computing, and cloud radio access networks. The articles provide a diverse perspective on the potential challenges in 5G cellular systems.

关键词： Special issues and sections 5G mobile communication Next generation networking Wireless communication Cellular networks Wireless cellular networks

来源：评论

学校读者我要写书评

暂无评论

Collecting valuable information from fast text streams 8

Collecting valuable information from fast text streams

引用

8th IFIP International Conference on intelligent information processing, IIP 2014

作者： Qi, Baoyuan Ma, Gang Shi, Zhongzhi Wang, Wei Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing100190 China University of Chinese Academy of Sciences Beijing100190 China Beijing Lexo Technologies Co. Ltd Beijing100080 China

ISBN: (纸本)9783662449790

It has become a challenging work to collect valuable information from fast text streams. In this work, we propose a method which gains useful information effectively and efficiently. Firstly, we maintain an analyzer based on the Trie structure and the dynamic N-Gram tokenizer;secondly, unlike the traditional search engine principle, we consider the documents as a query by building the indexes for the whole query base. The experimental results show that it has the strong adaption ability, low latency and high quality support for the complex query combination compared with the conventional methods. © IFIP International Federation for information processing 2014.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Representative local features mining for large-scale near-duplicates retrieval

Representative local features mining for large-scale near-du...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoguang Gu Yongdong Zhang Dongming Zhang Jintao Li Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

Local features have been widely used in many computer vision related researches, such as near-duplicate image and video retrieval. However, the storage and query cost of local features become prohibitive on large-scale database. In this paper, we propose a representative local features mining method to generate a compact but more effective feature subset. First, we do an unsupervised annotation for all similar images(or frames in video) in the database. Second, we compute a comprehensive score for every local feature. The score function combines the robustness and discrimination. Finally, we sort all the local features in an image by their scores and the low-score local features can be removed. The selected local features are robust and discriminative, which can guarantee the better retrieval quality than using full of the original feature set. By our method, the number of local features can be significantly reduced and a large amount of storage and computational cost can be saved. The experimental results show that we can use 30% of the features to get a better query performance than that of full feature set.

关键词： Databases Robustness Vectors Visualization Feature extraction Binary codes Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Generalized Unsupervised Manifold Alignment 14

Generalized Unsupervised Manifold Alignment

引用

Proceedings of the 28th International Conference on Neural information processing Systems - Volume 2

作者： Zhen Cui Hong Chang Shiguang Shan Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China and School of Computer Science and Technology Huaqiao University Xiamen China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

In this paper, we propose a Generalized Unsupervised Manifold Alignment (GU-MA) method to build the connections between different but correlated datasets without any known correspondences. Based on the assumption that datasets of the same theme usually have similar manifold structures, GUMA is formulated into an explicit integer optimization problem considering the structure matching and preserving criteria, as well as the feature comparability of the corresponding points in the mutual embedding space. The main benefits of this model include: (1) simultaneous discovery and alignment of manifold structures; (2) fully unsuper-vised matching without any pre-specified correspondences; (3) efficient iterative alignment without computations in all permutation cases. Experimental results on dataset matching and real-world applications demonstrate the effectiveness and the practicability of our manifold alignment method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High-through put Identification of Protein Disulfide Bonds from Complex Samples

High-through put Identification of Protein Disulfide Bonds f...

引用

中国化学会首届全国质谱分析学术研讨会

作者： Shan Lu Sheng-Bo Fan Bing Yang Jia-Ming Meng Long Wu Kun Zhang En-Zhi Shen Chun-Qing Song Rui-Xiang Sun Si-Min He Meng-Qiu Dong College of Life Science Beijing Normal University National Institute of Biological Sciences Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

Correct disulfide bond formation is essential for the activity and stability of numerous proteins of essential biological functions such as secreted signaling proteins and cell surface *** protein disulfide bonds typically requires a large amount of highly purified proteins,and much relies on arduous sample preparation and manual data *** we report a robust and sensitive method for identifying disulfide bonds in *** the new method,we successfully mapped all 74 disulfide bonds from a mixture often purified proteins and hundreds of disulfide bonds from an *** periplasmic fraction,a *** mitochondrial fraction,and human whole-cell *** biological experiments verified nine out of nine randomly selected,newly identified disulfide bonds in *** proteins.

关键词： High-through put Identification of Protein Disulfide Bonds from Complex Samples

来源：评论

学校读者我要写书评

暂无评论

HAMMING EMBEDDING WITH FRAGILE BITS FOR IMAGE SEARCH

HAMMING EMBEDDING WITH FRAGILE BITS FOR IMAGE SEARCH

引用

IEEE International Conference on Image processing

作者： Dongye Zhuang Dongming Zhang Jintao Li Ke Lv Qi Tian University of Chinese Academy of Sciences Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Department of Computer Science University of Texas at San Antonio

ISBN: (纸本)9781479957521

Recently, several binary descriptors are proposed, which represent interest points in image using binary codes. In these binary feature schemes, two descriptors are considered as a match, if the Hamming distance between them is below a threshold. Applying Hamming distance to measure the similarity between binary descriptors can extremely promote the computational efficiency. However, our experimental results presents that there exists a large number of bits in the binary feature vector cannot maintain the robustness while image conditions change. Rather than ignore the impacts of those unstable bits, we take into account the difference of robustness among the feature bits and propose a novel similarity measurement, which called the Fragile Bit Ratio (FBR). FBR is used in binary feature matching to measure how two features differ. High FBRs are associated with genuine matches between two binary features and low FBRs are associated with impostor ones. Based on this metric, we propose a new binary feature matching scheme to fuse the Hamming distance and Fragile Bit Ratio. In our approach, we match the descriptors using the Hamming distance threshold roughly, and then filtered by the Fragile Bits Ratio to refine the candidate set. In experiments, using Fragile Bits Radio can effectively remove the false matches and highly improve the accuracy of image search. Furthermore, our method can easily be integrated into the other well-established binary features schemes.

关键词： Image Search Hamming Embedding Binary Features

来源：评论

学校读者我要写书评

暂无评论

A Survey of Commonsense Knowledge Acquisition

引用

Journal of Computer Science & Technology 2013年第4期28卷 689-719页

作者：臧良俊曹聪曹亚男吴昱明曹存根 Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences University of the Chinese Academy of Sciences The Second Lab Institute of Information Engineering Chinese Academy of Sciences

Collecting massive commonsense knowledge （CSK） for commonsense reasoning has been a long time standing challenge within artificial intelligence research. Numerous methods and systems for acquiring CSK have been developed to overcome the knowledge acquisition bottleneck. Although some specific commonsense reasoning tasks have been presented to allow researchers to measure and compare the performance of their CSK systems, we compare them at a higher level from the following aspects： CSK acquisition task （what CSK is acquired from where）, technique used （how can CSK be acquired）, and CSK evaluation methods （how to evaluate the acquired CSK）. In this survey, we first present a categorization of CSK acquisition systems and the great challenges in the field. Then, we review and compare the CSK acquisition systems in detail. Finally, we conclude the current progress in this field and explore some promising future research issues.

关键词： commonsense knowledge knowledge acquisition knowledge representation and reasoning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：