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

24th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2016

作者： He, Jingwu Zhou, Wenzhe Wang, Linbo Zhang, Hongjie Guo, Yanwen National Key Lab for Novel Software Technology Nanjing University NanJing210023 China MOE Key Laboratory of Intelligent Computing and Signal Processing Institute of Media Computing Anhui University HeFei230039 China

ISBN: (纸本)9783038680246

This paper studies the problem of how to choose the viewpoint for taking good photographs for architecture. We achieve this by learning from professional photographs of world famous landmarks that are available in the Internet. Unlike the previous efforts devoted to photo quality assessment which mainly rely on visual features, we show in this paper combining visual features with geometric features computed on the 3D models can result in a more reliable evaluation of viewpoint quality. Specifically, we collect a set of photographs for each of 6 world famous architectures as well as their 3D models from Internet. Viewpoint recovery for images is carried out by an image-model registration process, after which a newly proposed viewpoint clustering strategy is exploited to validate users' viewpoint preference when photographing landmarks. Finally, we extract a number of 2D and 3D features for each image based on multiple visual and geometric cues, and perform viewpoint recommendation by learning from both 2D and 3D features, achieving superior performance over using solely 2D or 3D features. We show the effectiveness of the proposed approach through extensive experiments. © 2016 The Author(s) Eurographics Proceedings © 2016 The Eurographics Association.

关键词： Architecture

来源：评论

学校读者我要写书评

暂无评论

Author Correction: BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

引用

Nature methods 2024年第10期21卷 1959页

作者： Linus Manubens-Gil Zhi Zhou Hanbo Chen Arvind Ramanathan Xiaoxiao Liu Yufeng Liu Alessandro Bria Todd Gillette Zongcai Ruan Jian Yang Miroslav Radojević Ting Zhao Li Cheng Lei Qu Siqi Liu Kristofer E Bouchard Lin Gu Weidong Cai Shuiwang Ji Badrinath Roysam Ching-Wei Wang Hongchuan Yu Amos Sironi Daniel Maxim Iascone Jie Zhou Erhan Bas Eduardo Conde-Sousa Paulo Aguiar Xiang Li Yujie Li Sumit Nanda Yuan Wang Leila Muresan Pascal Fua Bing Ye Hai-Yan He Jochen F Staiger Manuel Peter Daniel N Cox Michel Simonneau Marcel Oberlaender Gregory Jefferis Kei Ito Paloma Gonzalez-Bellido Jinhyun Kim Edwin Rubel Hollis T Cline Hongkui Zeng Aljoscha Nern Ann-Shyn Chiang Jianhua Yao Jane Roskams Rick Livesey Janine Stevens Tianming Liu Chinh Dang Yike Guo Ning Zhong Georgia Tourassi Sean Hill Michael Hawrylycz Christof Koch Erik Meijering Giorgio A Ascoli Hanchuan Peng Institute for Brain and Intelligence Southeast University Nanjing China. Microsoft Corporation Redmond WA USA. Tencent AI Lab Bellevue WA USA. Computing Environment and Life Sciences Directorate Argonne National Laboratory Lemont IL USA. Kaya Medical Seattle WA USA. University of Cassino and Southern Lazio Cassino Italy. Center for Neural Informatics Structures and Plasticity Krasnow Institute for Advanced Study George Mason University Fairfax VA USA. Faculty of Information Technology Beijing University of Technology Beijing China. Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing China. Nuctech Netherlands Rotterdam the Netherlands. Janelia Research Campus Howard Hughes Medical Institute Ashburn VA USA. Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada. Ministry of Education Key Laboratory of Intelligent Computation and Signal Processing Anhui University Hefei China. Paige AI New York NY USA. Scientific Data Division and Biological Systems and Engineering Division Lawrence Berkeley National Lab Berkeley CA USA. Helen Wills Neuroscience Institute and Redwood Center for Theoretical Neuroscience UC Berkeley Berkeley CA USA. RIKEN AIP Tokyo Japan. Research Center for Advanced Science and Technology (RCAST) The University of Tokyo Tokyo Japan. School of Computer Science University of Sydney Sydney New South Wales Australia. Texas A&M University College Station TX USA. Cullen College of Engineering University of Houston Houston TX USA. Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taipei Taiwan. National Centre for Computer Animation Bournemouth University Poole UK. PROPHESEE Paris France. Department of Neuroscience Columbia University New York NY USA. Mortimer B. Zuckerman Mind Brain Behavior Institute Columbia University New York NY USA. Department of Computer Science Northern Illinois Universit

来源：评论

学校读者我要写书评

暂无评论

Active self-paced learning for cost-effective and progressive face identification

arXiv

引用

arXiv 2017年

作者： Lin, Liang Wang, Keze Meng, Deyu Zuo, Wangmeng Zhang, Lei School of Data and Computer Science Sun Yat-sen University Guangzhou China Engineering Research Center Advanced Computing Engineering Software of Ministry of Education China School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xi'an Jiaotong University China School of Computer Science and Technology Harbin Institute of Technology Harbin China Dept. of Computing Hong Kong Polytechnic University Hong Kong

This paper aims to develop a novel cost-effective framework for face identification, which progressively maintains a batch of classifiers with the increasing face images of different individuals. By naturally combining two recently rising techniques: active learning (AL) and self-paced learning (SPL), our framework is capable of automatically annotating new instances and incorporating them into training under weak expert recertification. We first initialize the classifier using a few annotated samples for each individual, and extract image features using the convolutional neural nets. Then, a number of candidates are selected from the unannotated samples for classifier updating, in which we apply the current classifiers ranking the samples by the prediction confidence. In particular, our approach utilizes the high-confidence and low-confidence samples in the self-paced and the active user-query way, respectively. The neural nets are later fine-tuned based on the updated classifiers. Such heuristic implementation is formulated as solving a concise active SPL optimization problem, which also advances the SPL development by supplementing a rational dynamic curriculum constraint. The new model finely accords with the "instructor-student-collaborative" learning mode in human education. The advantages of this proposed framework are two-folds: i) The required number of annotated samples is significantly decreased while the comparable performance is guaranteed. A dramatic reduction of user effort is also achieved over other state-of-the-art active learning techniques. ii) The mixture of SPL and AL effectively improves not only the classifier accuracy compared to existing AL/SPL methods but also the robustness against noisy data. We evaluate our framework on two challenging datasets, which include hundreds of persons under diverse conditions, and demonstrate very promising results. Please find the code of this project at: http://***/projects/aspl/ Copyright © 201

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Extremal Graphic Model in Optimizing Fractional Repetition Codes for Efficient Storage Repair

Extremal Graphic Model in Optimizing Fractional Repetition C...

引用

Ad-Hoc and Sensor Networks Symposium

作者： Guangping Xu Qunfang Mao Sheng Lin Kai Shi Hua Zhang Tianjin Key Lab. of Intelligence Computing and New Software Technology Tianjin University of Technology

ISBN: (纸本)9781479966653

Consider that a set of balls of n different colors are thrown into m bins with the assumption that the ball number of each color is constant and the number of balls in each bin is also constant. Our optimal goal is to find a feasible placement such that the distinct colors of remaining balls should be at least c after removing any k bins (k ≤ m) with the minimum number of balls. We present that the optimal colored bins in bins is equivalent to the optimization of Fractional Repetition (FR) codes in distributed storage systems. Here balls correspond to coded packets and bins correspond to storage nodes. This problem can be represented as biregualr graph and then deduced to the Zarankiewicz problem, which is a well-known extremal graph theoretic problem. We present the problem with the relation to combinatorial design theory, especially t-designs and propose the explicit construction algorithm for the optimization problem from t-designs. Some constructions of the optimized FR codes by 2-designs are analyzed to tolerate the desired k fault-tolerance with c=n- 1.

关键词： Ball Device Component Bins Graphical models Color extremum values Codes design theory Cache Memory System Repetition

来源：评论

学校读者我要写书评

暂无评论

An Improved Genetic Algorithm for Degree Constrained Minimum Spanning Trees

An Improved Genetic Algorithm for Degree Constrained Minimum...

引用

第28届中国控制与决策会议

作者： Kai Shi Qingfeng Song Sheng Lin Guangping Xu Zhanxu Cao Key Lab of Intelligent Computing and Novel Software Technology Key Laboratory of Computer Vision and System Ministry of Education School of Science Tianjin Chengjian University

ISBN: (纸本)9781467397155

The Minimum Spanning Tree(MST) is of crucial importance for Communication Networks(CNs),which can solve problems of unconstrained CNs ***,in practical CNs,the degree of the spanning tree is *** such a case,the problem is very difficult,which has been proved to be *** this paper,an improved genetic algorithm(I-GA) is proposed for solving the problem of Degree Constrained Minimum Spanning Tree(DCMST).We use Prufer number as the chromosome,and improve the crossover and mutation processes of the existing genetic algorithm for obtaining high locality,heritability,and *** results show that our mechanism of I-GA can get relatively better results.

关键词： Minimum Spanning Tree Genetic Algorithm Degree constrained Prufer Number

来源：评论

学校读者我要写书评

暂无评论

A local-optimization refinement algorithm in single particle analysis for macromolecular complex with multiple rigid modules

引用

Protein & Cell 2016年第1期7卷 46-62页

作者： Hong Shan Zihao wang Fa Zhang Yong Xiong Chang-Cheng Yin Fei Sun Department of Biophysics College of Basic Medical Sciences Peking University Health Science Center Beijing 100191China National Laboratory of Biomacromolecules Institute of Biophysics Chinese Academy of Sciences Beijing 100101 China Key Lab of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China Department of Molecular Biophysics and Biochemistry Yale University New Haven CT 06511 USA Center for Biological Imaging Institute of Biophysics Chinese Academy of Sciences Beijing 100101 China

Single particle analysis, which can be regarded as an average of signals from thousands or even millions of particle projections, is an efficient method to study the three-dimensional structures of biological macro- molecules. An intrinsic assumption in single particle analysis is that all the analyzed particles must have identical composition and conformation. Thus specimen heterogeneity in either composition or conformation has raised great challenges for high-resolution analysis. For particles with multiple conformations, inaccurate align- ments and orientation parameters will yield an averaged map with diminished resolution and smeared density. Besides extensive classification approaches, here based on the assumption that the macromolecular complex is made up of multiple rigid modules whose relative orien- tations and positions are in slight fluctuation around equilibriums, we propose a new method called as local optimization refinement to address this conformational heterogeneity for an improved resolution. The key idea is to optimize the orientation and shift parameters of each rigid module and then reconstruct their three-dimen- sional structures individually. Using simulated data of 80S/70S ribosomes with relative fluctuations between the large （60S/50S） and the small （40S/30S） subunits, we tested this algorithm and found that the resolutions of both subunits are significantly improved. Our method provides a proof-of-principle solution for high-resolutionsingle particle analysis of macromolecular complexes with dynamic conformations.

关键词： cryo-electron microscopy single particleanalysis conformational heterogeneity rigid module Iocaoptimization refinement

来源：评论

学校读者我要写书评

暂无评论

Novel Detection Service Method for Moving Object in IOT

Novel Detection Service Method for Moving Object in IOT

引用

2016 3rd International Conference on Materials Engineering,Manufacturing technology and Control(ICMEMTC 2016)

作者： Jie Chen Degan Zhang School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin Key Lab of Intelligent Computing & Novel software Technology Tianjin University of Technology Key Laboratory of Computer Vision and System (Tianjin University of Technology) Ministry of Education

In embedded Internet of Things(IOT) environment, there are the troubles such as complex background, illumination changes, shadows and other factors for detecting moving object, so we put forward a new detection service method through mixing Gaussian Mixture Model(GMM), edge detection service method and continuous frame difference method in this paper. In time domain, the new method uses GMM to model and updates the background. In spatial domain, it uses the hybrid detection service method which mixes edge detection service method, continuous frame difference method and GMM to get initial contour of moving object, and gets ultimate moving object. This method not only can well adapt to the illumination gradients and background disturbance occurred on scene, but also can well solve some problems such as inaccurate target detection, incomplete edge detection, cavitation and ghost which usually appears in traditional method. As experimental result showing, this method holds better real-time and robustness. It is not only easily implemented, but also can accurately detect moving object.

关键词： GMM embedded IOT moving object detection service

来源：评论

学校读者我要写书评

暂无评论

An ant colony optimization algorithm for learning brain effective connectivity network from fMRI data

An ant colony optimization algorithm for learning brain effe...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jinduo Liu Junzhong Ji Aidong Zhang Peipeng Liang Beijing Municipal Key Laboratory of Multimedia and Intelligent Software the College of Computer Science and Technology Beijing University of Technology Beijing China Department of Computer Science and Engineering University at Buffalo The State University of New York Buffalo America Beijing Key Lab of MRI and Brain Informatics Department of Radiology Capital Medical University Beijing China

ISBN: (纸本)9781509016129

Identifying brain effective connectivity networks from functional magnetic resonance imaging (fMRI) data is an important advanced subject in neuroinformatics in recent years, where the learning method based on bayesian networks (BN) has become a new hot topic in the field. This paper proposes a new method to learn the brain effective connectivity network structure by combining ant colony optimization (ACO) with BN method, named as ACOEC. In the proposed algorithm, a brain effective connectivity network is first mapped onto an ant, and then the ant colony optimization by simulating real ants looking for food is employed to construct network structures and finally an ant with the highest score is obtained as the optimal solution. The experimental results on simulated and real fMRI data sets show that the new method can not only accurately identify the connections and directions of the brain networks, but also quantitatively describe the connection strength of the brain networks, which has a good clinical application prospects.

关键词： Ant colony optimization Bayes methods Measurement Mathematical model Brain modeling Optimization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

new Dv-distance Algorithm Based on Path for Wireless Sensor Network

New Dv-distance Algorithm Based on Path for Wireless Sensor ...

引用

IEEE International Conference on Mobile Ad Hoc and Sensor Systems

作者： De-gan Zhang Wen-bin Li Zhen Ma Si Liu Jin-jie Song Tianjin Key Lab of Intelligent Computing & Novel software Technology Tianjin University of Technology

ISBN: (纸本)9781467391023

Wireless location is one of the core technologies of Wireless Sensor Network. In many applications, the accuracy of the location is the precondition of the useful of data information the node collected. Under the premise of cost limits, improving the accuracy of wireless sensor node position has crucial significance. After analyzing reasons of the location weakness of Dv-Distance algorithm due to errors caused by different paths, we propose an estimation algorithm that is based on the distance of different paths between node and the anchor node, thereby balancing the error of different paths to locate the node. This is an improved algorithm which is based on circle focal point positioning.

关键词： Wireless sensor network Location Accuracy Path Distance Wireless sensor networks Byways Line of nodes key technology Paths

来源：评论

学校读者我要写书评

暂无评论

Quantum State Tomography via Reduced Density Matrices

引用

Physical Review Letters 2017年第2期118卷 020401-020401页

作者： Tao Xin Dawei Lu Joel Klassen Nengkun Yu Zhengfeng Ji Jianxin Chen Xian Ma Guilu Long Bei Zeng Raymond Laflamme State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Institute for Quantum Computing University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Physics University of Guelph Guelph N1G 2W1 Ontario Canada Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia Department of Mathematics and Statistics University of Guelph Guelph N1G 2W1 Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences 100190 Beijing China Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland USA Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Canadian Institute for Advanced Research Toronto M5G 1Z8 Ontario Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada

Quantum state tomography via local measurements is an efficient tool for characterizing quantum states. However, it requires that the original global state be uniquely determined (UD) by its local reduced density matrices (RDMs). In this work, we demonstrate for the first time a class of states that are UD by their RDMs under the assumption that the global state is pure, but fail to be UD in the absence of that assumption. This discovery allows us to classify quantum states according to their UD properties, with the requirement that each class be treated distinctly in the practice of simplifying quantum state tomography. Additionally, we experimentally test the feasibility and stability of performing quantum state tomography via the measurement of local RDMs for each class. These theoretical and experimental results demonstrate the advantages and possible pitfalls of quantum state tomography with local measurements.

关键词： Quantum entanglement Quantum information processing Quantum tomography Random matrix theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：