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

arXiv 2018年

作者： Min, Weiqing Jiang, Shuqiang Liu, Linhu Rui, Yong Jain, Ramesh Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China Lenovo Group No. 6 Shangdi West Road Beijing China Department of Computer Science University of California IrvineCA United States

Food is very essential for human life and it is fundamental to the human experience. Food-related study may support multifarious applications and services, such as guiding the human behavior, improving the human health and understanding the culinary culture. With the rapid development of social networks, mobile networks, and Internet of Things (IoT), people commonly upload, share, and record food images, recipes, cooking videos, and food diaries, leading to large-scale food data. Large-scale food data offers rich knowledge about food and can help tackle many central issues of human society. Therefore, it is time to group several disparate issues related to food computing. Food computing acquires and analyzes heterogenous food data from disparate sources for perception, recognition, retrieval, recommendation, and monitoring of food. In food computing, computational approaches are applied to address food related issues in medicine, biology, gastronomy and agronomy. Both large-scale food data and recent breakthroughs in computer science are transforming the way we analyze food data. Therefore, vast amounts of work has been conducted in the food area, targeting different food-oriented tasks and applications. However, there are very few systematic reviews, which shape this area well and provide a comprehensive and in-depth summary of current efforts or detail open problems in this area. In this paper, we formalize food computing and present such a comprehensive overview of various emerging concepts, methods, and tasks. We summarize key challenges and future directions ahead for food computing. This is the first comprehensive survey that targets the study of computing technology for the food area and also offers a collection of research studies and technologies to benefit researchers and practitioners working in different food-related fields. Copyright © 2018, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

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

引用

BMC bioinformatics 2019年第1期20卷 616页

作者： Haicang Zhang Qi Zhang Fusong Ju Jianwei Zhu Yujuan Gao Ziwei Xie Minghua Deng Shiwei Sun Wei-Mou Zheng Dongbo Bu 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. College of Life Science and Technology Huazhong University of Science and Technology Wuhan China. Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China. dwsun@***. Institute of Theoretical Physics Chinese Academy of Sciences Beijing China. zheng@***. Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China. dbu@***. University of Chinese Academy of Sciences Beijing China. dbu@***.

Following publication of the original article [1], the author explained that there are several errors in the original article.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Shape DNA: Basic generating functions for geometric moment invariants

arXiv

引用

arXiv 2017年

作者： Erbo Li Yazhou Huang Dong Xu Li, Hua Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences

Geometric moment invariants (GMIs) have been widely used as basic tool in shape analysis and information retrieval. Their structure and characteristics determine efficiency and effectiveness. Two fundamental building blocks or generating functions (GFs) for invariants are discovered, which are dot product and vector product of point vectors in Euclidean space. The primitive invariants (PIs) can be derived by carefully selecting different products of GFs and calculating the corresponding multiple integrals, which translates polynomials of coordinates of point vectors into geometric moments. Then the invariants themselves are expressed in the form of product of moments. This procedure is just like DNA encoding proteins. All GMIs available in the literature can be decomposed into linear combinations of PIs. This paper shows that Hu's seven well known GMIs in computer vision have a more deep structure, which can be further divided into combination of simpler PIs. In practical uses, low order independent GMIs are of particular interest. In this paper, a set of PIs for similarity transformation and affine transformation in 2D are presented, which are simpler to use, and some of which are newly reported. The discovery of the two generating functions provides a new perspective of better understanding shapes in 2D and 3D Euclidean spaces, and the method proposed can be further extended to higher dimensional spaces and different manifolds, such as curves, surfaces and so on. Copyright © 2017, The Authors. All rights reserved.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Harmonized-Multinational qEEG norms (HarMNqEEG)

引用

NEUROIMAGE 2022年 256卷 119190-119190页

作者： Li, Min Wang, Ying Lopez-Naranjo, Carlos Hu, Shiang Reyes, Ronaldo Cesar Garcia Paz-Linares, Deirel Areces-Gonzalez, Ariosky Hamid, Aini Ismafairus Abd Evans, Alan C. Savostyanov, Alexander N. Calzada-Reyes, Ana Villringer, Arno Tobon-Quintero, Carlos A. Garcia-Agustin, Daysi Yao, Dezhong Dong, Li Aubert-Vazquez, Eduardo Reza, Faruque Razzaq, Fuleah Abdul Omar, Hazim Abdullah, Jafri Malin Galler, Janina R. Ochoa-Gomez, John F. Prichep, Leslie S. Galan-Garcia, Lidice Morales-Chacon, Lilia Valdes-Sosa, Mitchell J. Trondle, Marius Zulkifly, Mohd Faizal Mohd Rahman, Muhammad Riddha Bin Abdul Milakhina, Natalya S. Langer, Nicolas Rudych, Pavel Koenig, Thomas Virues-Alba, Trinidad A. Lei, Xu Bringas-Vega, Maria L. Bosch-Bayard, Jorge F. Valdes-Sosa, Pedro Antonio [a]The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for Neuroinformation School of Life Science and Technology University of Electronic Science and Technology of China Chengdu China [b]Cuban Center for Neurocience La Habana Cuba [c]McGill Centre for Integrative Neuroscience Ludmer Centre for Neuroinformatics and Mental Health Montreal Neurological Institute Canada [d]Department of Neurosciences School of Medical Sciences Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [e]Brain and Behaviour Cluster School of Medical Sciences Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [f]Hospital Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [g]Humanitarian Institute Novosibirsk State University Novosibirsk 630090 Russia [h]Laboratory of Psychophysiology of Individual Differences Federal State Budgetary Scientific Institution Scientific Research Institute of Neurosciences and Medicine Novosibirsk 630117 Russia [i]Laboratory of Psychological Genetics at the Institute of Cytology and Genetics Siberian Branch of the Russian Academy of Sciences Novosibirsk 630090 Russia [j]University of Pinar del Río “Hermanos Saiz Montes de Oca” Pinar del Río Cuba [k]Department of Neurology Max Planck Institute for Human Cognitive and Brain Sciences Leipzig Germany [l]Department of Cognitive Neurology University Hospital Leipzig Leipzig Germany [m]Center for Stroke Research Charité-Universitätsmedizin Berlin Berlin Germany [n]Grupo Neuropsicología y Conducta - GRUNECO Faculty of Medicine Universidad de Antioquia Colombia [o]Research Department Institución Prestadora de Servicios de Salud IPS Universitaria Colombia [p]The Cuban center aging longevity and health Havana Cuba [q]Research Unit of NeuroInformation Chinese Academy of Medical Sciences Chengdu 2019RU035 China [r]School of Electrical Engineering Zhengzhou University Zhengzhou 4500

This paper extends frequency domain quantitative electroencephalography (qEEG) methods pursuing higher sensitivity to detect Brain Developmental Disorders. Prior qEEG work lacked integration of cross-spectral information omitting important functional connectivity descriptors. Lack of geographical diversity precluded accounting for site-specific variance, increasing qEEG nuisance variance. We ameliorate these weaknesses. (i) Create lifespan Riemannian multinational qEEG norms for cross-spectral tensors. These norms result from the HarMNqEEG project fostered by the Global Brain Consortium. We calculate the norms with data from 9 countries, 12 devices, and 14 studies, including 1564 subjects. Instead of raw data, only anonymized metadata and EEG cross spectral tensors were shared. After visual and automatic quality control, developmental equations for the mean and standard deviation of qEEG traditional and Riemannian DPs were calculated using additive mixed-effects models. We demonstrate qEEG "batch effects " and provide methods to calculate harmonized z-scores. (ii) We also show that harmonized Riemannian norms produce z-scores with increased diagnostic accuracy predicting brain dysfunction produced by malnutrition in the first year of life and detecting COVID induced brain dysfunction. (iii) We offer open code and data to calculate different individual z-scores from the HarMNqEEG dataset. These results contribute to developing bias-free, low-cost neuroimaging technologies applicable in various health settings.

关键词： Quantitative EEG EEG cross-spectrum Riemannian geometry Batch effects Z-score Harmonization Malnutrition Covid induced brain dysfunction Developmental Brain Chart

来源：评论

学校读者我要写书评

暂无评论

A survey on context-aware mobile visual recognition

A survey on context-aware mobile visual recognition

引用

作者： Min, Weiqing Jiang, Shuqiang Wang, Shuhui Xu, Ruihan Cao, Yushan Herranz, Luis He, Zhiqiang Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing100190 China Higher Education Institution Teacher Online Training Center Beijing China Lenovo Corporate Research Beijing100085 China

The phenomenal growth of the usage of mobile devices (e.g., mobile phones and tablet PCs) opens up a new service, namely mobile visual recognition, which has been widely used in many areas, such as mobile shopping and augmented reality. The rich contextual information (e.g., location, time and direction information), easily acquired by the mobile devices, provides useful clues to facilitate mobile visual recognition, including speeding up the recognition time and improving the recognition performance. This survey focuses on recent advances in Context-Aware Mobile Visual Recognition (CAMVR) and reviews related work regarding to different contextual information, recognition methods, recognition types, and various application scenarios. Finally, we discuss future research directions in this field. © 2016, Springer-Verlag Berlin Heidelberg.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Fast stochastic ordinal embedding with variance reduction and adaptive step size

arXiv

引用

arXiv 2019年

作者： Ma, Ke Zeng, Jinshan Xiong, Jiechao Xu, Qianqian Cao, Xiaochun Liu, Wei Yao, Yuan School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China School of Computer Information Engineering Jiangxi Normal University NanchangJiangxi330022 China Tencent AI Lab Shenzhen Guangdong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen518055 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China Department of Mathematics and by courtesy Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

—Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi-definite programming (SDP), which is generally time-consuming and degrades the scalability, especially confronting large-scale data. To overcome this challenge, we propose a stochastic algorithm called SVRG-SBB, which has the following features: i) achieving good scalability via dropping positive semi-definite (PSD) constraints as serving a fast algorithm, i.e., stochastic variance reduced gradient (SVRG) method, and ii) adaptive learning via introducing a new, adaptive step size called the stabilized Barzilai-Borwein (SBB) step size. Theoretically, under some natural assumptions, we show the O(T1 ) rate of convergence to a stationary point of the proposed algorithm, where T is the number of total iterations. Under the further Polyak-Lojasiewicz assumption, we can show the global linear convergence (i.e., exponentially fast converging to a global optimum) of the proposed algorithm. Numerous simulations and real-world data experiments are conducted to show the effectiveness of the proposed algorithm by comparing with the state-of-the-art methods, notably, much lower computational cost with good prediction performance. Copyright © 2019, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Quantitative composite decision-theoretic rough set

Quantitative composite decision-theoretic rough set

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Linna Wang Ling Liu Xin Yang Pan Zhuo School of Electronic and Information Engineering Sichuan Technology and Business University Chengdu China Key Lab of Cloud Computing and Intelligent Information Processing Sichuan Technology and Business University Chengdu China

In practical decision-making, we prefer to characterize the uncertain problems with the hybrid data, which consists of various types of data, e.g., categorical, numerical, set-valued and interval-valued. The extended rough sets can deal with single types of data based on specific binary relation, including the equivalence relation, neighborhood relation, partial order relation, tolerance relation, etc. However, the fusion of these relations is a significant challenge task in such composite information table. To tackle this issue, this paper proposes the intersection and union composite relation, and further introduces a quantitative composite decision-theoretic rough set model. Moreover, we present a novel matrix-based approach to compute the upper and lower approximations in proposed model. Finally, an numerical example is conducted to illustrate the efficiency of proposed method.

关键词： Rough sets Numerical models Mathematical model Computational modeling Data models Probabilistic logic Business

来源：评论

学校读者我要写书评

暂无评论

A dynamic mining algorithm for multi-granularity user’s learning preference based on ant colony optimization 2nd

A dynamic mining algorithm for multi-granularity user’s lea...

引用

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

作者： Liu, Shengjun Chen, Shengbing Meng, Hu Anhui USTC-GZ Information Technology Co. Ltd. Hefei230031 China Key Lab of Network and Intelligent Information Processing Department of Computer Science and Technology Hefei University Hefei230601 China HEFEI City Cloud Data Center Co. Ltd. Hefei230094 China

ISBN: (纸本)9783319681207

Mining user’s learning preference is one of the key issues in the personalized online learning system, which is of great significance technology for modern educational. In this paper, using the hierarchical characteristics of the knowledge points in the course domain, we defined the equivalence relation and equivalence of knowledge points, and defined the structure of the knowledge points quotient space. Then, the functions of support, pheromone concentration and preference were defined on various levels, and an improved ant colony optimization was proposed to handle the multi granularity data structure of quotient space. An algorithm of multi-granularity Learning Preference Mining based on Ant Colony Optimization (ACO-LPM) was proposed to address the problems about too many learning knowledge points and too few user’s test data in the online personalized learning system. The pheromone has the characteristic of dynamic evaporation, so, the preference patterns mined by ACO-LPM can be changed with the change of user interest in real time. The experimental results show that the algorithm can mining the user’s learning preferences in online learning system effectively and efficiently. © IFIP International Federation for information processing 2017.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：