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

3rd ACM International Conference on Multimedia Retrieval, ICMR 2013

作者： Zheng, Shuai Herranz, Luis Jiang, Shuqiang Key Lab. of Intelligent Information Processing Chinese Academy of Sciences Beijing 100190 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Software Engineering Beijing Jiaotong University Beijing 100044 China

ISBN: (纸本)9781450320337

In this demo paper we present a multiscale browsing interface for handheld devices, in which the user can interactively change the scale of the storyboard to easily adjust the amount of information desired. Conventional and hierarchical storyboards provide one or very few possible lengths. In contrast, scalable storyboards allow the number of images and the storyboard itself to be adapted to the device constraints (e.g. aspect ratio, resolution) and navigation state with much finer granularity. Several levels and modes, including segment of interest, are provided for more intuitive and convenient navigation. © 2013 Authors.

关键词： Aspect ratio

来源：评论

学校读者我要写书评

暂无评论

Cascaded Shape Space Pruning for Robust Facial Landmark Detection

Cascaded Shape Space Pruning for Robust Facial Landmark Dete...

引用

International Conference on Computer Vision (ICCV)

作者： Xiaowei Zhao Shiguang Shan Xiujuan Chai Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing China

ISBN: (纸本)9781479928415

In this paper, we propose a novel cascaded face shape space pruning algorithm for robust facial landmark detection. Through progressively excluding the incorrect candidate shapes, our algorithm can accurately and efficiently achieve the globally optimal shape configuration. Specifically, individual landmark detectors are firstly applied to eliminate wrong candidates for each landmark. Then, the candidate shape space is further pruned by jointly removing incorrect shape configurations. To achieve this purpose, a discriminative structure classifier is designed to assess the candidate shape configurations. Based on the learned discriminative structure classifier, an efficient shape space pruning strategy is proposed to quickly reject most incorrect candidate shapes while preserve the true shape. The proposed algorithm is carefully evaluated on a large set of real world face images. In addition, comparison results on the publicly available BioID and LFW face databases demonstrate that our algorithm outperforms some state-of-the-art algorithms.

关键词： Shape Face Detectors Optimization Databases Robustness Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Cross-view graph embedding

Cross-view graph embedding

引用

11th Asian Conference on Computer Vision, ACCV 2012

作者： Huang, Zhiwu Shan, Shiguang Zhang, Haihong Lao, Shihong Chen, Xilin Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China OMRON Social Solutions Co. Ltd. Kyoto Japan

ISBN: (纸本)9783642374432

Recently, more and more approaches are emerging to solve the cross-view matching problem where reference samples and query samples are from different views. In this paper, inspired by Graph Embedding, we propose a unified framework for these cross-view methods called Cross-view Graph Embedding. The proposed framework can not only reformulate most traditional cross-view methods (e.g., CCA, PLS and CDFE), but also extend the typical single-view algorithms (e.g., PCA, LDA and LPP) to cross-view editions. Furthermore, our general framework also facilitates the development of new cross-view methods. In this paper, we present a new algorithm named Cross-view Local Discriminant Analysis (CLODA) under the proposed framework. Different from previous cross-view methods only preserving inter-view discriminant information or the intra-view local structure, CLODA preserves the local structure and the discriminant information of both intra-view and inter-view. Extensive experiments are conducted to evaluate our algorithms on two cross-view face recognition problems: face recognition across poses and face recognition across resolutions. These real-world face recognition experiments demonstrate that our framework achieves impressive performance in the cross-view problems. © 2013 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

TEMPORALLY MULTIPLE DYNAMIC TEXTURES SYNTHESIS USING PIECEWISE LINEAR DYNAMIC SYSTEMS

TEMPORALLY MULTIPLE DYNAMIC TEXTURES SYNTHESIS USING PIECEWI...

引用

IEEE International Conference on Image processing

作者： Xing Yan Hong Chang Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing 100190 China

ISBN: (纸本)9781479923427

Real-world nonlinear dynamic textures (DTs) usually consist of temporally multiple linear DTs which cannot be correctly modeled by previous works. In this paper, we propose piecewise linear dynamic systems (PLDS) to model temporally multiple DTs. PLDS simultaneously decides the temporal segmentation, models each DT segment with an LDS and the whole DT by switching between the LDS'. Experimental results verify that PLDS can capture the stochastic and dynamic nature of temporally multiple DTs and it synthesizes nonlinear DTs without decay or divergence. An EM-like algorithm iterating between sequence division and LDS' fitting is adopted to learn the model parameters.

关键词： Temporally Multiple Dynamic Textures Piecewise Linear Dynamic Systems Temporal Segmentation Local Digital Switch model parameters Programmable logic devices textures Stochastic dynamic decay Decay biodeterioration synthesis

来源：评论

学校读者我要写书评

暂无评论

Benchmarking still-to-video face recognition via partial and local linear discriminant analysis on COX-S2V dataset

Benchmarking still-to-video face recognition via partial and...

引用

11th Asian Conference on Computer Vision, ACCV 2012

作者： Huang, Zhiwu Shan, Shiguang Zhang, Haihong Lao, Shihong Kuerban, Alifu Chen, Xilin Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China OMRON Social Solutions Co. Ltd. Kyoto Japan College of Information Science and Engineering Xinjiang University China

ISBN: (纸本)9783642374432

In this paper, we explore the real-world Still-to-Video (S2V) face recognition scenario, where only very few (single, in many cases) still images per person are enrolled into the gallery while it is usually possible to capture one or multiple video clips as probe. Typical application of S2V is mug-shot based watch list screening. Generally, in this scenario, the still image(s) were collected under controlled environment, thus of high quality and resolution, in frontal view, with normal lighting and neutral expression. On the contrary, the testing video frames are of low resolution and low quality, possibly with blur, and captured under poor lighting, in non-frontal view. We reveal that the S2V face recognition has been heavily overlooked in the past. Therefore, we provide a benchmarking in terms of both a large scale dataset and a new solution to the problem. Specifically, we collect (and release) a new dataset named COX-S2V, which contains 1,000 subjects, with each subject a high quality photo and four video clips captured simulating video surveillance scenario. Together with the database, a clear evaluation protocol is designed for benchmarking. In addition, in addressing this problem, we further propose a novel method named Partial and Local Linear Discriminant Analysis (PaLo-LDA). We then evaluated the method on COX-S2V and compared with several classic methods including LDA, LPP, ScSR. Evaluation results not only show the grand challenges of the COX-S2V, but also validate the effectiveness of the proposed PaLo-LDA method over the competitive methods. © 2013 Springer-Verlag.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Preface: WCSE 2013

Proceedings - 2013 4th World Congress on Software Engineerin...

引用

Proceedings - 2013 4th World Congress on Software Engineering, WCSE 2013 2013年 xi-xii页

作者： Xu, Li Da Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology China University of Mining and Technology China

来源：评论

学校读者我要写书评

暂无评论

Genome-wide identification of cancer-related polyadenylated and non-polyadenylated RNAs in human breast and lung cell lines

引用

Science China(Life Sciences) 2013年第5期56卷 503-512,1-4页

作者： ZHAO GuoGuang JIAO Fei LIAO Qi LUO HaiTao LI Hui SUN Liang BU DeChao YU KunTao ZHAO Yi CHEN RunSheng Bioinformatic Research Group Key Laboratory of Intelligent Information ProcessingAdvanced Computing Research LaboratoryInstitute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences Department of Biochemistry and Molecular Biology Binzhou Medical College Department of Preventive Medicine School of MedicineNingbo University College of Computer Science and Technology Jilin University Bioinformatics Laboratory and National Laboratory of Biomacromolecules Institute of BiophysicsChinese Academy of SciencesBeijing 100101China

Eukaryotic mRNAs consist of two forms of transcripts:poly(A)+ and poly(A),based on the presence or absence of poly(A) tails at the 3 ***(A)+ mRNAs are mainly protein coding mRNAs,whereas the functions of poly(A) mRNA are largely *** studies have shown that a significant proportion of gene transcripts are poly(A) or bimorphic(containing both poly(A)+ and poly(A) transcripts).We compared the expression levels of poly(A) and poly(A)+ RNA mRNAs in normal and cancer cell *** also investigated the potential functions of these RNA transcripts using an integrative workflow to explore poly(A)+ and poly(A) transcriptome sequences between a normal human mammary gland cell line(HMEC) and a breast cancer cell line(MCF-7),as well as between a normal human lung cell line(NHLF) and a lung cancer cell line(A549).The data showed that normal and cancer cell lines differentially express these two forms of *** ontology(GO) annotation analyses hinted at the functions of these two groups of transcripts and grouped the differentially expressed genes according to the form of their *** data showed that cell cycle-,apoptosis-,and cell death-related functions corresponded to most of the differentially expressed genes in these two forms of transcripts,which were also associated with the ***,translational elongation and translation functions were also found for the poly(A) protein-coding genes in cancer cell *** demonstrate that poly(A) transcripts play an important role in cancer development.

关键词： polyadenylation non-polyadenylation function annotation high throughput sequencing cancer bioinformatics

来源：评论

学校读者我要写书评

暂无评论

SALIENT REGION DETECTION VIA TEXTURE-SUPPRESSED BACKGROUND CONTRAST

SALIENT REGION DETECTION VIA TEXTURE-SUPPRESSED BACKGROUND C...

引用

IEEE International Conference on Image processing

作者： Jiamei Shuai Laiyun Qing Jun Miao Zhiguo Ma Xilin Chen University of Chinese Academy of Sciences Beijing 100049 China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing 100190 China

ISBN: (纸本)9781479923427

We propose a novel salient region detection algorithm by texture-suppressed background contrast. We employ a structure extraction algorithm to suppress the small scale textures which are supposed to be not sensitive for human vision system. Then the texture-suppressed image is segmented into homogeneous superpixels. Motivated by the observation that the spatial distribution of the background has a high probability on the boundaries of images, we estimate the background as superpixels near the image boundaries. The saliency of each superpixel is then defined as the summation of its k minimum color distances to the estimated background super-pixels. Finally a post-processing process involving spatial and color adjacency is employed to generate a per-pixel saliency map. Experimental results demonstrate that the proposed method outperforms the state-of-the-art approaches.

关键词： Salient region detection Background contrast Texture suppression Superpixels BACKGROUND images Summation computer vision Boundary value problems Grain boundaries boundary layer Color Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

pNovo+: De Novo Peptide Sequencing and Assembly Using Complementary HCD and ETD Tandem Mass Spectra

pNovo+: De Novo Peptide Sequencing and Assembly Using Comple...

引用

第八届中国蛋白质组学大会

作者： Hao Chi Haifeng Chen Kun He Long Wu Bing Yang Rui-Xiang Sun Jianyun Liu Wen-Feng Zeng Chun-Qing Song Si-Min He Meng-Qiu Dong Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China National Institute of Biological SciencesBeijingBeijing 102206China Laboratory of Intelligent Recognition and Image ProcessingBeijing Key Laboratory of Digital MediaBeihang UniversityBeijing100191China

来源：评论

学校读者我要写书评

暂无评论

Evaluating structure of complex networks by navigation entropy

Evaluating structure of complex networks by navigation entro...

引用

2012 8th International Conference on Semantics, Knowledge and Grids, SKG 2012

作者： Sun, Xiaoping Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769547947

Complex networks are extensively studied in various areas such as social networks, biological networks, Internet and WWW. Those networks have many characters such as small-diameter, higher cluster and power-law degree distribution. Small-world is evolved for efficient information transformation and navigation. Thus, navigation is an important functional character of networks. Previous researches mostly focus on understanding the navigability of small-world networks by analyzing the diameter and the routing efficiency. In this paper, we use the navigability to model the basic structural complexity of a network. That is, given a network topology, we need a model to evaluate how complex the topology is. Some network complexity models have been proposed but none of them consider the navigability factor of the network systems. We believe that using the navigability factor to evaluate the network structural complexity is a feasible and reasonable way. We use the adjacent matrix to build a navigation transition matrix and evaluate the randomness of random walks on the transition matrix by defining navigation entropy on it. We use the iteration of the random walk matrix to evaluate the navigability of a network and the complexity of network. That is, the higher the navigation entropy, the higher the randomness of a network. The lower the navigation entropy, the higher the structure of a network. We apply the navigation entropy model on a set of structural and random network topologies to show how the model can show the different complexity of networks. © 2012 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：