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

Cross-media analysis and reasoning: advances and directions

Frontiers of information Technology & Electronic Engineering 2017年第1期18卷 44-57页

作者： Yu-xin PENG Wen-wu ZHU Yao ZHAO Chang-sheng XU Qing-ming HUANG Han-qing LU Qing-hua ZHENG Tie-jun HUANG Wen GAO Institute of Computer Science and Technology Peking University Department of Computer Science and Technology Tsinghua University Institute of Information Science Beijing Jiaotong University National Laboratory of Pattern Recognition Institute of AutomationChinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences Department of Computer Science and Technology Xi'an Jiaotong University School of Electronics Engineering and Computer Science Peking University

Cross-media analysis and reasoning is an active research area in computer science, and a promising direction for artificial intelligence. However, to the best of our knowledge, no existing work has summarized the state-of-the-art methods for cross-media analysis and reasoning or presented advances, challenges, and future directions for the field. To address these issues, we provide an overview as follows：（1） theory and model for cross-media uniform representation; （2） cross-media correlation understanding and deep mining; （3） cross-media knowledge graph construction and learning methodologies; （4） cross-media knowledge evolution and reasoning; （5） cross-media description and generation; （6） cross-media intelligent engines; and （7） cross-media intelligent applications. By presenting approaches, advances, and future directions in cross-media analysis and reasoning, our goal is not only to draw more attention to the state-of-the-art advances in the field, but also to provide technical insights by discussing the challenges and research directions in these areas.

关键词： Cross-media analysis Cross-media reasoning Cross-media applications

来源：评论

学校读者我要写书评

暂无评论

Dynamic round robin scheduling algorithm for μc/OS-III

Boletin Tecnico/Technical Bulletin

引用

Boletin Tecnico/Technical Bulletin 2017年第7期55卷 8-15页

作者： Zhang, Chunhong Ren, Jianqiang Luo, Ping College of Mathematics and Information Langfang Teachers University Langfang Hebei065000 China Institute of Pattern Recognition and Intelligent System Langfang Teachers University Langfang Hebei065000 China Langfang Key Laboratory of Intelligent Transportation System Langfang Hebei065000 China

In μC/OS-III, the traditional round robin algorithm is inefficient for tasks with the same priority. To solve this problem, this paper proposes a dynamic round robin scheduling algorithm based on the shortest remaining time first, called SRTFDRR. The algorithm determines the scheduling order according to the submission time and the remaining execution time of each task;For tasks with the same priority, set up multiple ready queues, each queue calculates the time slice independently based on the average value of the remaining execution time of the task;The ready task is inserted into the ready queue RQ1 of the corresponding priority in the order of burst time increments;If the priority of the queue task is the current highest priority, the SRTFDRR algorithm runs the task in the queue RQ1;If the time slice expires, there is a task in RQ1 that has not yet finished, and the remaining execution part moves into queue RQ2 waiting for scheduling again, and so on until all tasks are finished. A multi-level queue is formed during the scheduling process. Simulation results show that, compared with the traditional RR algorithm, the SRTFDRR algorithm reduces the average turnaround time, average waiting time, average response time and switching times. It performs well in performance, overhead, and fairness of scheduling.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Fast KNN search for big data with set compression tree and best bin first 2

Fast KNN search for big data with set compression tree and b...

引用

2nd International Conference on Cloud Computing and Internet of Things, CCIOT 2016

作者： Chen, Zhenjie Yan, Jingqi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of Ministry of Education for System Control and Information Processing China Shanghai China

ISBN: (纸本)9781467398213

This paper proposes k nearest neighbors (kNN) search based on set compression tree (SCT) and best bin first (BBF) to deal with the problem for big data. The large compression rate by set compression tree is achieved by compressing the set of descriptors jointly instead of compressing on a per-descript or basis. So set compression tree has a good performance in kNN search at a low bit rate. At the same time, the best bin first (BBF) is a very efficient algorithm to find the approximately kNN from a large number of high dimensional feature descriptors. SCT-BBF is a novel exploration and it improves search performance in three aspects: First, SCT-BBF requires less memory footprint, which is important in big data age. Second, it increases accuracy compared traditional method like KD-Tree and original SCT. SCT-BBF can be used with other data processing methods like PCA and SIFT to perform better. Third, this paper adopts finer search to increase accuracy at a slight loss of speed. And it can extend to big data easily. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Correction to: Internet gaming disorder: deficits in functional and structural connectivity in the ventral tegmental area-Accumbens pathway

引用

Brain imaging and behavior 2019年第4期13卷 1182页

作者： Ruonan Wang Min Li Meng Zhao Dahua Yu Yu Hu Corinde E Wiers Gene-Jack Wang Nora D Volkow Kai Yuan School of Life Science and Technology Xidian University Xi'an Shaanxi 710071 People's Republic of China. Engineering Research Center of Molecular and Neuro Imaging Ministry of Education Xi'an People's Republic of China. Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia 014010 People's Republic of China. National Institute on Alcoholism and Alcohol Abuse National Institutes of Health Bethesda MD 20892 USA. National Institute on Drug Abuse National Institutes of Health Bethesda MD 20892 USA. School of Life Science and Technology Xidian University Xi'an Shaanxi 710071 People's Republic of China. kyuan@***. Engineering Research Center of Molecular and Neuro Imaging Ministry of Education Xi'an People's Republic of China. kyuan@***. Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia 014010 People's Republic of China. kyuan@***. National Institute on Alcoholism and Alcohol Abuse National Institutes of Health Bethesda MD 20892 USA. kyuan@***. Guangxi Key Laboratory of Multi-Source Information Mining and Security Guangxi Normal University Guilin People's Republic of China. kyuan@***.

The original version of this article contained mistakes, and the authors would like to correct them. The correct details are given below.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Nonconvex penalties with analytical solutions for one-bit compressive sensing

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai200240 China Department of Computational Mathematics Science and Engineering Department of Mathematics Michigan State University East LansingMI48824 United States

One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a solution is globally optimal or not. For positive homogeneous penalties, a globally optimal solution can be obtained in two steps: a proximal operator and a normalization step. For other penalties, we solve the dual problem, and it needs to evaluate the proximal operators for many times. Then we provide fast algorithms for finding analytical solutions for three penalties: minimax concave penalty (MCP), 0norm, and sorted 1penalty. Specifically, our algorithm is more than 200 times faster than the existing algorithm for MCP. Its efficiency is comparable to the algorithm for the 1penalty in time, while its performance is much better than 1. Among these penalties, sorted 1is most robust to noise in different settings. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

MRI denoising using randomized version of nonlocal means method

MRI denoising using randomized version of nonlocal means met...

引用

2016 International Conference on Image processing, Computer Vision, and pattern recognition, IPCV 2016

作者： Hu, Jinrong He, Jia Fu, Ying Wu, Xi Zhou, Jiliu School of Computer and Soft Engineering Xihua University Chengdu610039 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Chengdu University Chengdu610106 China School of Computer Science Chengdu University of Information Technology Chengdu610225 China

ISBN: (纸本)1601324421

- Non-local mean (NLM) algorithm has been implemented effectively in MRI denoising and is always limited by its computational complexity. To reduce the computational burden of NLM in 3D MRI dataset, in this paper, we used a randomized version of NLM algorithm to remove the noise in MRI data. The random NLM algorithm seeds up the classical NLM by computing a small subset of image patch distances, which are randomly select according to the uniform sampling pattern. Numerical experiments demonstrate that the random NLM can achieve a competitive denoising result at a low sampling rate (0.05) in 3D MRI dataset while reducing the runtime dramatically. © CSREA Press.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Multi-level thresholding for pupil location in eye-gaze tracking systerm

Multi-level thresholding for pupil location in eye-gaze trac...

引用

2016 International Conference on Machine Learning and Cybernetics, ICMLC 2016

作者： Chen, Mo-Han Wen, Jing Zhu, Yu Xing, Hao-Yang Wang, Yi College of Computer Science Chongqing University Chongqing China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University China Magnetic Resonance Imaging Research Centre Huaxi Hospital Sichuan Chengdu China

ISBN: (纸本)9781509003891

A new pupil location methodis proposed in eye-gaze tracking system. Firstly, input images are enhanced in order to reduce the influence of illumination. Secondly, multiple candidate thresholds are obtained in terms of the valleys in histogram, and then different segmentation results are available. Further, a fusion method based on the overlaps of segmentation results is proposed which acquired candidate regions and the eye region is obtained according to the entropy information of candidate regions. Thirdly, a simple and effective threshold segmentation method based on eye characteristic is employed and pupil area is obtained. Finally, the center of pupil is acquired by ellipse fitting. Experimental results demonstrated that the proposed methods were effective to improve pupil location accuracy. © 2016 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

A MIL-based interactive approach for hotspot segmentation from bone scintigraphy

A MIL-based interactive approach for hotspot segmentation fr...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Shijie Geng Jingyang Ma Xiaoguang Niu Shaoyong Jia Yu Qiao Jie Yang Institute of Image Processing and Pattern Recognition The Key Laboratory of System Control and Information Processing Ministry of Education China

ISBN: (纸本)9781479999897

Bone scintigraphy is widely used to diagnose bone diseases. Accurate hotspot segmentation is a critical task for tumor metastasis diagnosis. In this paper, we propose an interactive approach to detect and extract hotspots in thoracic region based on a new multiple instance learning (MIL) method called EM-MILBoost. We convert the segmentation problem to a multiple instance learning task by constructing positive and negative bags according to the input bounding box. In order to be robust against noisy input, we train a region-level hotspot classifier with EM-MILBoost and develop several segmentation strategies based on it. The experimental results demonstrate that our method outperforms other methods and is robust against various noisy input.

关键词： Image segmentation Noise measurement Bones Training Indexes Belts Standards

来源：评论

学校读者我要写书评

暂无评论

Brain MRI Segmentation with Patch-based CNN Approach

Brain MRI Segmentation with Patch-based CNN Approach

引用

第35届中国控制会议

作者： Zhipeng CUI Jie YANG Yu QIAO Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University The Key Laboratory of Ministry of Education for System Control and Information Processing

ISBN: (纸本)9781509009107

Brain Magnetic Resonance Image(MRI) plays a non-substitutive role in clinical *** symptom of many diseases corresponds to the structural variants of *** structure segmentation in brain MRI is of great importance in modern medical *** methods were developed for automatic segmenting of brain MRI but failed to achieve desired *** this paper,we proposed a new patch-based approach for automatic segmentation of brain MRI using convolutional neural network(CNN).Each brain MRI acquired from a small portion of public dataset is firstly divided into *** of these patches are then used for training CNN,which is used for automatic segmentation of brain *** results showed that our approach achieved better segmentation accuracy compared with other deep learning methods.

关键词： CNN Deep Learning Brain MRI Segmentation Patch-based

来源：评论

学校读者我要写书评

暂无评论

Oscillation resolution for massive cell phone traffic data 1

Oscillation resolution for massive cell phone traffic data

引用

1st Workshop on Mobile Data, MobiData 2016, co-located with MobiSys 2016

作者： Qi, Ling Qiao, Yuanyuan Abdesslem, Fehmi Ben Ma, Zhanyu Yang, Jie Center for Data Science Beijing Key Laboratory of Network System Architecture and Convergence Beijing Laboratory of Advanced Information Network BUPT Beijing China Decisions Networks and Analytics Laboratory SICS Stockholm Sweden Center for Data Science Pattern Recognition and Intelligent System Lab BUPT Beijing China

ISBN: (纸本)9781450343275

Cellular towers capture logs of mobile subscribers whenever their devices connect to the network. When the logs show data traffic at a cell tower generated by a device, it reveals that this device is close to the tower. The logs can then be used to trace the locations of mobile subscribers for different applications, such as studying customer behaviour, improving location-based services, or helping urban planning. However, the logs often suffer from an oscillation phenomenon. Oscillations may happen when a device, even when not moving, does not only connect to the nearest cell tower, but is instead unpredictably switching between multiple cell towers because of random noise, load balancing, or simply dynamic changes in signal strength. Detecting and removing oscillations are a challenge when analyzing location data collected from the cellular network. In this paper, we propose an algorithm called SOL (Stable, Oscillation, Leap periods) aimed at discovering and reducing oscillations in the collected logs. We apply our algorithm on real datasets which contain about 18.9 TB of traffic logs generated by more than 3 million mobile subscribers covering about 21000 cell towers and collected during 27 days from both GSM and UMTS networks in northern China. Experimental results demonstrate the ability and effectiveness of SOL to reduce oscillations in cellular network logs. © 2016 ACM.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：