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

A survey on food computing

学校读者我要写书评

暂无评论

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

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

学校读者我要写书评

暂无评论

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

Online Midgress-Sensitive Traffic Allocation for Percentile Charging in Pracitcal CDNs

学校读者我要写书评

暂无评论

Online Midgress-Sensitive Traffic Allocation for Percentile ...

International Workshop on Quality of Service

作者： Huiyou Zhan Haisheng Tan Huang Xu Chi Zhang Hongqiu Ni Pengfei Zhang Weihua Shan Xiang-Yang Li CAS Key Lab of Wireless-Optical Communications University of Science and Technology of China China USTC-Deqing Alpha Innovation Research Institute Zhejiang China Algorithm Innovation Lab Huawei Cloud Computing Technologies Co. Ltd. Xi'an China

The traffic bandwidth costs comprise a significant amount of operating expenditure in CDNs, induced by the traffic from the end-users to edge servers (edge cost) and from the edge to the center servers (midgress cost). Traffic allocation is the main approach to minimizing the total bandwidth cost. The joint optimization of the total costs is challenging, specifically when the percentile charging mechanism as well as some other practical issues are considered, such as the dynamicity of midgress traffic and the granularity of traffic allocation. In this work, based on our novel miss ratio prediction mechanism, we propose the first online framework, named Iris, jointly optimizing the edge and midgress costs under the 95th percentile charging in commercial CDNs. Iris can theoretically achieve a competitive ratio of $1+\frac{p_{e}}{\beta\cdot p_{c}}$ , when the miss ratio of all domains is set as $\beta$ . Here $p_{e}$ and $p_{c}$ are the unit bandwidth price of the edge and midgress cost, respectively. Iris is tolerant to prediction errors which can be deployed in practical CDN systems. Extensive experiments based on real data indicate that Iris can dramatically reduce bandwidth costs by about 8.149% compared with the SOTA schemes, potentially saving millions of dollars per month for our large-scale commercial CDN collaborator.

关键词：

Model inconsistent but correlated noise: Multi-view subspace learning with regularized Mixture of Gaussians

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Yong, Hongwei Meng, Deyu Li, Jinxing Zuo, Wangmeng Zhang, Lei Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xian Jiaotong University School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China

Multi-view subspace learning (MSL) aims to find a low-dimensional subspace of the data obtained from multiple views. Different from single view case, MSL should take both common and specific knowledge among different views into consideration. To enhance the robustness of model, the complexity, non-consistency and similarity of noise in multi-view data should be fully taken into consideration. Most current MSL methods only assume a simple Gaussian or Laplacian distribution for the noise while neglect the complex noise configurations in each view and noise correlations among different views of practical data. To this issue, this work initiates a MSL method by encoding the multi-view-shared and single-view-specific noise knowledge in data. Specifically, we model data noise in each view as a separated Mixture of Gaussians (MoG), which can fit a wider range of complex noise types than conventional Gaussian/Laplacian. Furthermore, we link all single-view-noise as a whole by regularizing them by a common MoG component, encoding the shared noise knowledge among them. Such regularization component can be formulated as a concise KL-divergence regularization term under a MAP framework, leading to good interpretation of our model and simple EM-based solving strategy to the problem. Experimental results substantiate the superiority of our method. Copyright © 2018, The Authors. All rights reserved.

关键词： Signal encoding

MMCGAN: Generative Adversarial network with explicit manifold prior

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zheng, Guanhua Sang, Jitao Xu, Changsheng University of Science and Technology of China School of Computer and Information Technology Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China National Lab of Pattern Recognition Institute of Automation CAS University of Chinese Academy of Sciences Beijing100190 China

Generative Adversarial network(GAN) provides a good generative framework to produce realistic samples, but suffers from two recognized issues as mode collapse and unstable training. In this work, we propose to employ explicit manifold learning as prior to alleviate mode collapse and stabilize training of GAN. Since the basic assumption of conventional manifold learning fails in case of sparse and uneven data distribution, we introduce a new target, Minimum Manifold Coding (MMC), for manifold learning to encourage simple and unfolded manifold. In essence, MMC is the general case of the shortest Hamiltonian Path problem and pursues manifold with minimum Riemann volume. Using the standardized code from MMC as prior, GAN is guaranteed to recover a simple and unfolded manifold covering all the training data. Our experiments on both the toy data and real datasets show the effectiveness of MMCGAN in alleviating mode collapse, stabilizing training, and improving the quality of generated samples. Copyright © 2020, The Authors. All rights reserved.

关键词： Generative adversarial networks

MutexMatch: Semi-Supervised Learning with Mutex-Based Consistency Regularization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Duan, Yue Zhao, Zhen Qi, Lei Wang, Lei Zhou, Luping Shi, Yinghuan Gao, Yang The National Key Laboratory for Novel Software Technology The National Institute of Healthcare Data Science Nanjing University Nanjing210023 China The School of Electrical and Information Engineering The University of Sydney SydneyNSW2006 Australia The School of Computer Science and Engineering The Key Lab of Computer Network and Information Integration Ministry of Education Southeast University Nanjing211189 China The School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia

The core issue in semi-supervised learning (SSL) lies in how to effectively leverage unlabeled data, whereas most existing methods tend to put a great emphasis on the utilization of high-confidence samples yet seldom fully explore the usage of low-confidence samples. In this paper, we aim to utilize low-confidence samples in a novel way with our proposed mutex-based consistency regularization, namely MutexMatch. Specifically, the high-confidence samples are required to exactly predict "what it is" by conventional True-Positive Classifier, while low-confidence samples are employed to achieve a simpler goal — to predict with ease "what it is not" by True-Negative Classifier. In this sense, we not only mitigate the pseudo-labeling errors but also make full use of the low-confidence unlabeled data by consistency of dissimilarity degree. MutexMatch achieves superior performance on multiple benchmark datasets, i.e., CIFAR-10, CIFAR-100, SVHN, STL-10, mini-ImageNet and Tiny-ImageNet. More importantly, our method further shows superiority when the amount of labeled data is scarce, e.g., 92.23% accuracy with only 20 labeled data on CIFAR-10. Our code and model weights have been released at https://***/NJUyued/MutexMatch4SSL. Copyright © 2022, The Authors. All rights reserved.

关键词： Benchmarking

Fair and autonomous sharing of federate learning models in mobile Internet of Things

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hao, Xiaohan Ren, Wei Xiong, Ruoting Zheng, Xianghan Zhu, Tianqing Xiong, Neal N. School of Computer Science China University of Geoscience Wuhan China Guangxi Key Laboratory of Cryptography and Information Security Guilin541004 China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Mingbyte Technology QingDao China School of Software University of Technology Sydney UltimoNSW2007 Australia Dept. of Mathematics and Computer Science Northeastern State University United States

Federate learning can conduct machine learning as well as protect the privacy of self-owned training data on corresponding ends, instead of having to upload to a central trusted data aggregation server. In mobile scenarios, a centralized trusted server may not be existing, and even though it exists, the delay will not be manageable, e.g., smart driving cars. Thus, mobile federate learning at the edge with privacy-awareness is attracted more and more attentions. It then imposes a problem - after data are trained on a mobile terminal to obtain a learned model, how to share the model parameters among others to create more accurate and robust accumulative final model. This kind of model sharing confronts several challenges, e.g., the sharing must be conducted without a third trusted party (autonomously), and the sharing must be fair as model training (by training data)is valuable. To tackle the above challenges, we propose a smart contract and IPFS (Inter-Planetary File System) based model sharing protocol and algorithms to address the challenges. The proposed protocol does not rely on a trusted third party, where individual-learned models are shared/stored in corresponding ends. Conducted through extensive experiments, three main steps of the proposed protocol are evaluated. The average executive time of the three steps are 0.059s, 0.060s and 0.032s, demonstrating its efficiency. Copyright © 2020, The Authors. All rights reserved.

关键词： Smart contract

Biased decoy-state reference-frame-independent quantum key distribution

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Zhu, Jian-Rong Zhang, Chun-Mei Guo, Guang-Can Wang, Qin Institute of Signal Processing Transmission Nanjing University of Posts and Telecommunications Nanjing210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing210003 China Key Laboratory of Quantum Information CAS University of Science and Technology of China Hefei230026 China

Without actively aligning the reference frames, the reference-frame-independent quantum key distribution (RFI-QKD) can generate secure keys even when the reference frames drift slowly. Here, we propose a new scheme on the decoy-state RFI-QKD, where the basis assignments of two legitimate parties are biased, reducing the fraction of mismatched-basis data. When accounting for statistical fluctuations under different misalignments of reference frames, we investigate the performance of biased decoy-state RFI-QKD with full parameter optimization. We also make a clear comparison between the new scheme with other practical schemes, e.g., unbiased decoy-state RFI-QKD and biased decoy-state BB84-QKD. Simulation results demonstrate that the new proposed biased decoy-state RFI-QKD can significantly improve the performance (secret key rate and secure transmission distance) of practical QKD systems. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum cryptography

Large-scale person re-identification as retrieval

学校读者我要写书评

暂无评论

Large-scale person re-identification as retrieval

IEEE International Conference on Multimedia and Expo (ICME)

作者： Hantao Yao Shiliang Zhang Dongming Zhang Yongdong Zhang Jintao Li Yu Wang Qi Tian University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China School of Electronic Engineering and Computer Science Peking University Beijing China National Computer Network Emergency Response Technical Team/Coordination Center of China Department of Computer Science University of Texas at San Antonio San Antonio USA

ISBN: (纸本)9781509060689

This paper targets to bring together the research efforts on two fields that are growing actively in the past few years: multicamera person Re-Identification (ReID) and large-scale image retrieval. We demonstrate that the essentials of image retrieval and person ReID are the same, i.e., measuring the similarity between images. However, person ReID requires more discriminative and robust features to identify the subtle differences of different persons and overcome the large variance among images of the same person. Specifically, we propose a coarse-to-fine (C2F) framework and a Convolutional Neural network structure named as Conv-Net to tackle the large-scale person ReID as an image retrieval task. Given a query person image, the C2F firstly employ Conv-Net to extract a compact descriptor and perform the coarse-level search. A robust descriptor conveying more spatial cues is hence extracted to perform the fine-level search. Extensive experimental results show that the proposed method outperforms existing methods on two public datasets. Further, the evaluation on a large-scale Person-520K dataset demonstrates that our work is significantly more efficient than existing works, e.g., only needs 180ms to identify a query person from 520K images.

关键词： Training Feature extraction Cameras Robustness Image retrieval Linear programming