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

ProxiTalk: Activate speech input by bringing smartphone to the mouth

Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 2019年第3期3卷 1-25页

作者： Yang, Zhican Yu, Chun Zheng, Fengshi Shi, Yuanchun Key Laboratory of Pervasive Computing Ministry of Education Beijing Key Lab. of Networked Multimedia Beijing National Research Center for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing100084 China

Speech input, such as voice assistant and voice message, is an attractive interaction option for mobile users today. However, despite its popularity, there is a use limitation for smartphone speech input: users need to press a button or say a wake word to activate it before use, which is not very convenient. To address it, we match the motion that brings the phone to mouth with the user's intention to use voice input. In this paper, we present ProxiTalk, an interaction technique that allows users to enable smartphone speech input by simply moving it close to their mouths. We study how users use ProxiTalk and systematically investigate the recognition abilities of various data sources (e.g., using a front camera to detect facial features, using two microphones to estimate the distance between phone and mouth). Results show that it is feasible to utilize the smartphone's built-in sensors and instruments to detect ProxiTalk use and classify gestures. An evaluation study shows that users can quickly acquire ProxiTalk and are willing to use it. In conclusion, our work provides the empirical support that ProxiTalk is a practical and promising option to enable smartphone speech input, which coexists with current trigger mechanisms. © 2019 Association for computing Machinery.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Revoler: Visual analysis of relation evolutions in temporal data

引用

Journal of Computational Information Systems 2015年第18期11卷 6555-6569页

作者： He, Qinglai Zhu, Min Xie, Zhaoyang Liu, Hanqing Gan, Wei Vision-Computing Lab. College of Computer Science Sichuan University Chengdu China

Temporal relations are ubiquitous. The emergence, strength and other features of these relations continue to evolve in the course of time, which is complex but valuable to identify the characteristics of related entities and the evolving behavior of relations. However, the existing work focuses more attention on visualizing temporal relations and temporal event evolutions while neglecting to reveal the hidden relation evolutions in temporal data. In this paper, we propose Revoler, an interactive visualization technique for relation evolutions. Both the representation of single-type relations and multi-type relations are supported by this technique. Through the integration of timeline and RelaRiver, an extended river metaphor, relation evolutions can be explored from multiple perspectives. Additionally, a sequence of scale adaption methods and interactions are applied to Revoler to handle temporal data exibly. Finally, we evaluate Revoler with market basket records and publication dataset, which demonstrates the usefulness and effectiveness of the proposed approach. © 2015 by Binary Information Press.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A clustering algorithm use SOM and K-Means in Intrusion Detection

A clustering algorithm use SOM and K-Means in Intrusion Dete...

引用

International Conference on E-Business and E-Government (ICEE)

作者： Wang, Huai-Bin Yang, Hong-Liang Xu, Zhi-Jian Yuan, Zheng Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin University of Technology 300191 Tianjin China Key Laboratory of Computer Vision and System Ministry of Education 300191 Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China

ISBN: (纸本)9780769539973

Improving detection definition is a pivotal problem for intrusion detection. Many intelligent algorithms were used to improve the detection rate and reduce the false rate. Traditional SOM cannot provide the precise clustering results to us, while traditional K-Means depends on the initial value serious and it is difficult to find the center of cluster easily. Therefore, in this paper we introduce a new algorithm, first, we use SOM gained roughly clusters and center of clusters, then, using K-Means refine the clustering in the SOM stage. At last of this paper we take KDD CUP-99 dataset to test the performance of the new algorithm. The new algorithm overcomes the defects of traditional algorithms effectively. Experimental results show that the new algorithm has a good stability of efficiency and clustering accuracy. © 2010 IEEE.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

A design to visualize cellphone communication log in an interesting way

引用

Journal of Computational Information Systems 2013年第22期9卷 9165-9176页

作者： Li, Mingzhao Zhu, Min Gan, Qihong Liang, Ting Vision-Computing Lab. College of Computer Science Sichuan University Chengdu 610064 China

Cellphone communication log contains plenty of temporal information which can highly reect a person's daily routine and social relationships. This paper proposes a novel visualization design to help discover and visually understand the information in an interesting way. Otherwise from prior time-oriented visualizations, our design visualizes detailed temporal information of each call item with a Hollow Spiral Model, simultaneously presents the overview information based on each contact in center of the hollow spiral;retinal variables like color, shape, location and size are artfully utilized to present some additional information. We implement a tool named TelogViz, which enriches our design with a series of interactions including _ltering, highlighting, connecting and searching. Case studies demonstrate the e_ectiveness of our scheme that can discover several useful and surprising patterns hidden in the original dataset. © 2013 Binary Information Press.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Watershed-based weighted graph partitioning active contours

Watershed-based weighted graph partitioning active contours

引用

2010 3rd International Congress on Image and Signal Processing, CISP 2010

作者： Wang, Shaorong Chen, Yisong Li, Sheng Wang, Guoping Li, Hua Key Lab. of Machine Perception and Intelligent MOE Beijing 100871 China HCI and Multimedia Lab. Dept. of Computer Science Peking University Beijing 100871 China National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

A novel Weighted Graph Partitioning Active Contours method based on weighted dissimilarity is introduced. This method is easy to be extended by defining different types of similarities. And it has been greatly acceler... 详细信息

ISBN: (纸本)9781424465149

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Deriving semantics for image clustering from accumulated user feedbacks

Deriving semantics for image clustering from accumulated use...

引用

15th ACM International Conference on multimedia, MM'07

作者： Chen, Yanhua Rege, Manjeet Dong, Ming Fotouhi, Farshad Machine Vision Pattern Recognition Lab. Department of Computer Science Wayne State University Detroit MI 48202 United States Database and Multimedia Systems Group Department of Computer Science Wayne State University Detroit MI 48202 United States

ISBN: (纸本)9781595937025

Image clustering solely based on visual features without any knowledge or background information suffers from the problem of semantic gap. In this paper, we propose SS-NMF: a semi-supervised non-negative matrix factorization framework for image clustering. Accumulated relevance feedback in a CBIR system is treated as user provided supervision for guiding the image clustering. We consider the set of positive images in the feedback as constraints on the clustering specifying that the images "must" be clustered together. Similarly, negative images provide constraints specifying that they "cannot" be clustered along with the positive images. Through an iterative algorithm, we perform symmetric tri-factorization of the image-image similarity matrix to infer the clustering. Theoretically, we prove the correctness of SS-NMF by showing that the algorithm is guaranteed to converge. Through experiments conducted on general purpose image datasets, we demonstrate the superior performance of SS-NMF for clustering images effectively. Copyright 2007 ACM.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

A new method of image data fusion based on FNN

A new method of image data fusion based on FNN

引用

2010 6th International Conference on Natural Computation, ICNC'10

作者： Zhang, De-Gan Li, Chao Wang, Dong Zhang, Xiao-Li Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin University of Technology 300191 China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300191 China

ISBN: (纸本)9781424459612

The image data are obtained by a variety of multimedia, information equipment, which include amount of information, extensive coverage, and redundancy in ubiquitous computing paradigm. In order to make use of these information reasonably and efficiently, it is necessary to fuse such massive data, therefore the multi-sensor image information fusion become a key technology to ubiquitous computing. A new approach of image data fusion based on fuzzy neural network (FNN) is presented in this paper. Here, neural network is a parallel information processing model, there are more adaptive and self-organization, and can accomplish the complexity of real-time computing and mass data retrieval, it demonstrate its unique superiority of image understanding, pattern recognition and the handling of incomplete information. In the new approach, fuzzy theory has the advantages such as: easy-to-understand, flexible and inclusive of non-precise data, as well as using expert knowledge and based on the natural language. The fuzzy neural network system developed by us has used in multi-sensor image fusion, proved that the fusion is fast, effective, good, and can meet the real-time requirements of ubiquitous computing. ©2010 IEEE.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

An efficient image processing method based on web services for mobile devices

An efficient image processing method based on web services f...

引用

2009 2nd International Congress on Image and Signal Processing, CISP'09

作者： Yi, Liang Yingyuan, Xiao Jing, Huang Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin China

ISBN: (纸本)9781424441310

The resource limitation of mobile devices causes the problem that the existing image processing software based on the centralized computing mode had difficulty running in mobile devices. A solution is given in the paper by adopting web service-based image processing method. For one thing, image processing tasks were distributed to service providers' service registry and service requesters. For another, what the service providers should do was only to invocate the specific image processing services provided by service providers. Consequently, web service-based solution reduces the resource consumption of mobile devices by redistributing image processing tasks. Compared with traditional methods of image processing, Web service-based image processing method has the advantages of loose coupling and component oriented and can take full advantage of the computing resources in heterogeneous network. Thus web service-based image processing method can effectively solve the resource bottle-neck that traditional image processing software had. ©2009 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-efficient continuous media streaming through optimal multiplexing

Bandwidth-efficient continuous media streaming through optim...

引用

Proceedings of the 1999 International Conference on Measurement and Modeling of computer Systems, ACM SIGMETRICS '99

作者： Zhao, Wei Tripathi, Satish K. Mobile Computing and Multimedia Lab. Department of Computer Science University of Maryland College Park MD 20742 United States Bourns College of Engineering University of California Riverside CA 92521-0425 United States

Maximizing bandwidth efficiency in distributed continuous media streaming systems is the key in delivering cost-effective multimedia services to distributed and heterogeneous receivers. We introduce a technique based on stream multiplexing to achieve the highest possible bandwidth efficiency, while preserving stringent and deterministic quality of service guarantees. The technique accomplishes the optimal multiplexing (i.e. resulting in the lowest possible bandwidth allocation) by exploiting both the temporal and the spatial structures among a group of continuous media streams. We present a family of optimal multiplexing schedules. The adverse per-stream effects of optimal multiplexing are studied and a technique based on transmission rearrangement is proposed to mitigates these effects, without sacrificing the achieved multiplexing optimality. The results presented in the paper provide some fundamental criteria and limits in the design and evaluation of resource allocation, admission control and stream scheduling policies for bandwidth efficient continuous media streaming.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

On security threats for robust perceptual hashing

On security threats for robust perceptual hashing

引用

Media Forensics and Security

作者： Koval, O. Voloshynovskiy, S. Bas, P. Cayre, F. Computer Vision and Multimedia Laboratory University of Geneva 7 route de Drize 1227 Carouge 4 Switzerland Gipsa-lab. INPG/CNRS BP. 46 Saint Martin d'Hères 38402 France

ISBN: (纸本)9780819475046

Perceptual hashing has to deal with the constraints of robustness, accuracy and security. After modeling the process of hash extraction and the properties involved in this process, two different security threats are studied, namely the disclosure of the secret feature space and the tampering of the hash. Two different approaches for performing robust hashing are presented: Random-Based Hash (RBH) where the security is achieved using a random projection matrix and Content-Based Hash (CBH) were the security relies on the difficulty to tamper the hash. As for digital watermarking, different security setups are also devised: the Batch Hash Attack, the Group Hash Attack, the Unique Hash Attack and the Sensitivity Attack. A theoretical analysis of the information leakage in the context of Random-Based Hash is proposed. Finally, practical attacks are presented: (1) Minor Component Analysis is used to estimate the secret projection of Random-Based Hashes and (2) Salient point tampering is used to tamper the hash of Content-Based Hashes systems. © 2009 Copyright SPIE - The International Society for Optical Engineering.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：