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

Texture classification in extreme scale variations using GANet

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Li Chen, Jie Zhao, Guoying Fieguth, Paul Chen, Xilin Pietikäinen, Matti Center for Machine Vision and Signal Analysis University of Oulu Oulu90014 Finland Department of Systems Design Engineering University of Waterloo WaterlooONN2L 3G1 Canada Key Lab of Intelligent Information Processing of CAS Institute of Computing Technology CAS Beijing100190 China

Research in texture recognition often concentrates on recognizing textures with intraclass variations such as illumination, rotation, viewpoint and small scale changes. In contrast, in real-world applications a change in scale can have a dramatic impact on texture appearance, to the point of changing completely from one texture category to another. As a result, texture variations due to changes in scale are amongst the hardest to handle. In this work we conduct the first study of classifying textures with extreme variations in scale. To address this issue, we first propose and then reduce scale proposals on the basis of dominant texture patterns. Motivated by the challenges posed by this problem, we propose a new GANet network where we use a Genetic Algorithm to change the units in the hidden layers during network training, in order to promote the learning of more informative semantic texture patterns. Finally, we adopt a FV-CNN (Fisher Vector pooling of a Convolutional Neural Network filter bank) feature encoder for global texture representation. Because extreme scale variations are not necessarily present in most standard texture databases, to support the proposed extreme-scale aspects of texture understanding we are developing a new dataset, the Extreme Scale Variation Textures (ESVaT), to test the performance of our framework. It is demonstrated that the proposed framework significantly outperforms gold-standard texture features by more than 10% on ESVaT. We also test the performance of our proposed approach on the KTHTIPS2b and OS datasets and a further dataset synthetically derived from Forrest, showing superior performance compared to the state of the art. Copyright © 2018, The Authors. All rights reserved.

关键词： Textures

Mathematical model of brain tumour growth with drug resistance

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Trobia, José Tian, Kun Batista, Antonio M. Grebogi, Celso Ren, Hai-Peng Santos, Moises S. Protachevicz, Paulo R. Borges, Fernando S. Szezech, José D. Viana, Ricardo L. Caldas, Iberê L. Iarosz, Kelly C. Department of Mathematics and Statistics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Graduate in Science Program - Physics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Shaanxi Key Lab of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’anPR710048 China Institute of Physics University of São Paulo São PauloSP05508-900 Brazil Institute for Complex Systems and Mathematical Biology University of Aberdeen AberdeenAB24 3UE United Kingdom Xi’an Technological University Xi’anPR710021 China Center for Mathematics Computation and Cognition Federal University of ABC São Bernardo do CampoSP09606-045 Brazil Department of Physics Federal University of Paraná CuritibaPR80060-000 Brazil Faculdade de Telêmaco Borba FATEB Telêmaco BorbaPR84266-010 Brazil

Brain tumours are masses of abnormal cells that can grow in an uncontrolled way in the brain. There are different types of malignant brain tumours. Gliomas are malignant brain tumours that grow from glial cells and are identified as astrocytoma, oligodendroglioma, and ependymoma. We study a mathematical model that describes glia-neuron interaction, glioma, and chemotherapeutic agent. In this work, we consider drug sensitive and resistant glioma cells. We show that continuous and pulsed chemotherapy can kill glioma cells with a minimal loss of neurons. © 2020, CC BY.

关键词： Tumors

Predicting protein inter-residue contacts using composite likelihood maximization and deep learning

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhang, Haicang Zhang, Qi Ju, Fusong Zhu, Jianwei Sun, Shiwei Gao, Yujuan Xie, Ziwei Deng, Minghua Sun, Shiwei Zheng, Wei-Mou Bu, Dongbo Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Center for Quantitative Biology School of Mathematical Sciences Center for Statistical Sciences Peking University Beijing China Institute of Theoretical Physics Chinese Academy of Sciences Beijing China College of Life Science and Technology Huazhong University of Science and Technology Wuhan China

Accurate prediction of inter-residue contacts of a protein is important to calculating its tertiary structure. Analysis of co-evolutionary events among residues has been proved effective to inferring inter-residue contacts. The Markov random field (MRF) technique, although being widely used for contact prediction, suffers from the following dilemma: the actual likelihood function of MRF is accurate but time-consuming to calculate;in contrast, approximations to the actual likelihood, say pseudo-likelihood, are efficient to calculate but inaccurate. Thus, how to achieve both accuracy and efficiency simultaneously remains a challenge. In this study, we present such an approach (called clmDCA) for contact prediction. Unlike plmDCA using pseudo-likelihood, i.e., the product of conditional probability of individual residues, our approach uses composite-likelihood, i.e., the product of conditional probability of all residue pairs. Composite likelihood has been theoretically proved as a better approximation to the actual likelihood function than pseudo-likelihood. Meanwhile, composite likelihood is still efficient to maximize, thus ensuring the efficiency of clmDCA. We present comprehensive experiments on popular benchmark datasets, including PSICOV dataset and CASP-11 dataset, to show that: i) clmDCA alone outperforms the existing MRF-based approaches in prediction accuracy. ii) When equipped with deep learning technique for refinement, the prediction accuracy of clmDCA was further significantly improved, suggesting the suitability of clmDCA for subsequent refinement procedure. We further present successful application of the predicted contacts to accurately build tertiary structures for proteins in the PSICOV dataset. Accessibility: The software clmDCA and a server are publicly accessible through http://***/clmDCA/. Copyright © 2018, The Authors. All rights reserved.

关键词： Proteins

A kind of affine weighted moment invariants

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Mo, Hanlin Li, Shirui Hao, You Li, Hua Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

A new kind of geometric invariants is proposed in this paper, which is called affine weighted moment invariant (AWMI). By combination of local affine differential invariants and a framework of global integral, they can more effectively extract features of images and help to increase the number of low-order invariants and to decrease the calculating cost. The experimental results show that AWMIs have good stability and distinguishability and achieve better results in image retrieval than traditional moment invariants. An extension to 3D is straightforward. Copyright © 2017, The Authors. All rights reserved.

关键词： Affine transforms

From social to individuals: A parsimonious path of multi-level models for crowdsourced preference aggregation

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Xu, Qianqian Xiong, Jiechao Cao, Xiaochun Huang, Qingming Yao, Yuan Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing1000190 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Tencent AI Lab Shenzhen518057 BICMR-LMAM-LMEQF-LMP School of Mathematical Sciences Peking University Beijing100871 China University of Chinese Academy of Sciences Institute of Computing Technology of Chinese Academy of Sciences Beijing100190 China Department of Mathematics and by courtesy Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

In crowdsourced preference aggregation, it is often assumed that all the annotators are subject to a common preference or social utility function which generates their comparison behaviors in experiments. However, in reality annotators are subject to variations due to multi-criteria, abnormal, or a mixture of such behaviors. In this paper, we propose a parsimonious mixed-effects model, which takes into account both the fixed effect that the majority of annotators follows a common linear utility model, and the random effect that some annotators might deviate from the common significantly and exhibit strongly personalized preferences. The key algorithm in this paper establishes a dynamic path from the social utility to individual variations, with different levels of sparsity on personalization. The algorithm is based on the Linearized Bregman Iterations, which leads to easy parallel implementations to meet the need of large-scale data analysis. In this unified framework, three kinds of random utility models are presented, including the basic linear model with L2 loss, Bradley-Terry model, and Thurstone-Mosteller model. The validity of these multi-level models are supported by experiments with both simulated and real-world datasets, which shows that the parsimonious multi-level models exhibit improvements in both interpretability and predictive precision compared with traditional HodgeRank. Copyright © 2018, The Authors. All rights reserved.

关键词： Crowdsourcing

Shape-color differential moment invariants under affine transformations

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Mo, Hanlin Li, Shirui Hao, You Li, Hua Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

We propose the general construction formula of shape-color primitives by using partial differentials of each color channel in this paper. By using all kinds of shape-color primitives, shape-color differential moment invariants can be constructed very easily, which are invariant to the shape affine and color affine transforms. 50 instances of SCDMIs are obtained finally. In experiments, several commonly used color descriptors and SCDMIs are used in image classification and retrieval of color images, respectively. By comparing the experimental results, we find that SCDMIs get better results. Copyright © 2017, The Authors. All rights reserved.

关键词： Color

Isometrically subdivisible tetrahedra

学校读者我要写书评

暂无评论

Computer Aided Drafting,Design and Manufacturing 2017年第2期27卷 24-31页

作者： Li Erbo Li Zhi Li Hua EON Reality Inc Liaoning Center for Disease Prevention and Control Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

It is well known that a triangle can be divided by mid-point refinement into four sub-triangles with the same shape. Similarly, a tetrahedron can be parted into eight subtetrahedra, which are generally not uniform in shape. This paper proves that there exist a set of tetrahedra, which is called isometrically subdivisible tetrahedra(IST) and can be divided into eight isometric subtetrahedra, including identical and reflection ones. And a new classification of tetrahedra is put forward, based on which all tetrahedra can be categorized into 26 classes according to both the number of maximum equal edges and topological relations. The IST belongs only to three of the classes. That result provides a new viewpoint of spatial structure and may be used to tile or subdivide space uniformly or isometrically.

关键词： regular subdivision isometric identical tetrahedra classification tetrahedra direction

Research on high-accuracy gait recognition technique based on parallel genetic algorithm

学校读者我要写书评

暂无评论

Journal of information Hiding and Multimedia Signal processing 2018年第1期9卷 244-255页

作者： Lin, Xiao Jia Zhang, Fu Quan Xu, Lin Department of Computing and Information Technology Fujian Business University No. 19 Huang Pu Road Gulou District Fuzhou350012 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University School of Software Beijing Institute of Technology Room A9. 301 Juyuan Jinshan Jiyuan Fuzhou350008 China Innovative Information Industry Research Institute Fujian Normal University Fuqing Brunch of Fujian Normal University Campus County 1. Longjiang Road Fuqing Fuzhou350300 China

In the field of sports science, gait recognition has a wide range of applications. However, compared to other biometric technologies, it has the problem of low recognition accuracy. Therefore, a technique combining the parallel genetic algorithm based on hierarchical fair competition with neural network ensemble is proposed to be applied in gait recognition. First, parallel genetic algorithm is adopted to increase individual diversity, and only appropriate features are selected to train each neural network candidate. Then, a set of individual neural networks are selected to complete the neural network ensemble so as to minimize the generalization error and maximize the negative correlation. Experiments on the CASIA gait database demonstrate the effectiveness of the proposed gait recognition method. The results show that the proposed method has a higher recognition rate than the existing methods. © 2018, Ubiquitous International. All rights reserved.

关键词： Genetic algorithms

Collaborative model in brain-computer integration 1

学校读者我要写书评

暂无评论

2nd IFIP TC 12 International Conference on Intelligence Science, ICIS 2017

作者： Shi, Zhongzhi Ma, Gang Li, Jianqing Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Shandong University No. 27 Shan Da Nan Road JinanShandong China

ISBN: (数字)9783319681214

ISBN: (纸本)9783319681207

Brain-computer integration is a new intelligent system based on brain-computer interface technology, which is integrated with biological intelligence and artificial intelligence. In order to make this integration effective and co-adaptive biological brain and machine should work collaboratively. ABGP-CNN based environment awareness and motivation driven collaboration will be presented in the paper. Motivation is the cause of action and plays important roles in collaboration. The motivation leaning method and algorithm will be explored in terms of event curiosity, which is useful for sharing common interest situations. © IFIP International Federation for information processing 2017.

关键词： Motivation