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

IEEE International Conference on Multimedia and Expo Workshops (ICMEW)

作者： Yuan Gao Chengu Wang Edward Y. Chang Department of Computer Science and Technology Tsinghua University Beijing China IIIS Tsinghua University Beijing China Google Research Beijing China

Feature-based image stitching, which aligns images with overlapping fields of view and then stitches them together, is a widely used panorama-construction technology. However, the current scale-, view- and illumination-invariant features can still result in misalignment because of occurrences of congruent or near-congruent features. We propose an INS (inertial navigation system) aided image-alignment method, named INSPORAMA, to reduce such misalignment. INSPORAMA improves image alignment accuracy by reducing both image area and the number of candidate feature-pairs to compare. Based on INSPORAMA, we have built an Android application, which is able to construct panoramic images in near real-time.

关键词： Cameras Gyroscopes Feature extraction Mobile handsets Angular velocity Accuracy Androids

来源：评论

学校读者我要写书评

暂无评论

Moving shadow detection by nonlinear Tone-Mapping

Moving shadow detection by nonlinear Tone-Mapping

引用

International Conference on Systems, Signals and Image Processing, IWSSIP

作者： Elad Bullkich Idan Ilan Yair Moshe Yacov Hel-Or Hagit Hel-Or Signal and Image Processing Laboratory (SIPL) Department of Electrical Engineering Technion-Israel Institute of Technology Haifa Israel Google Inc. Mountain View USA Department of Computer Science University of Haifa Haifa Israel

Shadow detection is a well-known problem in image and video processing. Detecting moving shadows is useful in numerous applications such as object detection and tracking. Most works in this area are not suitable for shadow detection using a low-cost outdoor surveillance camera. In this work we suggest a fast shadow detection approach for video surveillance, by comparing each video frame to a continuously updated background image. We differentiate shadow areas from foreground areas by assuming the shadow pixels are associated with background pixels through a nonlinear tone mapping. This assumption is general and applies to various systems and scene conditions. A distance measure between patch images that account for nonlinear tone mapping is calculated by adapting a recently suggested approach for pattern matching termed Matching by Tone Mapping (MTM). We show that the proposed technique is computationally efficient and outperforms state-of-the-art shadow detection techniques in typical surveillance scenarios.

关键词： Surveillance Measurement Image color analysis Cameras Robustness Lighting

来源：评论

学校读者我要写书评

暂无评论

Mobile music modeling, analysis and recognition

Mobile music modeling, analysis and recognition

引用

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

作者： Pavel Golik Boulos Harb Ananya Misra Michael Riley Alex Rudnick Eugene Weinstein Human Language Technology and Pattern Recognition Computer Science Department RWTH Aachen University Aachen Germany Google Inc. New York NY USA School of Informatics and Computing Indiana University Bloomington IN USA

We present an analysis of music modeling and recognition techniques in the context of mobile music matching, substantially improving on the techniques presented in [1]. We accomplish this by adapting the features specifically to this task, and by introducing new modeling techniques that enable using a corpus of noisy and channel-distorted data to improve mobile music recognition quality. We report the results of an extensive empirical investigation of the system's robustness under realistic channel effects and distortions. We show an improvement of recognition accuracy by explicit duration modeling of music phonemes and by integrating the expected noise environment into the training process. Finally, we propose the use of frame-to-phoneme alignment for high-level structure analysis of polyphonic music.

关键词： Training Accuracy Hidden Markov models Music Speech recognition USA Councils

来源：评论

学校读者我要写书评

暂无评论

Inertial sensors aided image alignment and stitching for panorama on mobile phones

Inertial sensors aided image alignment and stitching for pan...

引用

1st International Workshop on Mobile Location-Based Service, MLBS'11, Co-located with UbiComp 2011

作者： Yang, Qingxuan Wang, Chengu Gao, Yuan Qu, Hang Chang, Edward Y. Google Research Beijing China IIIS Tsinghua University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781450309288

In this paper, we propose using signals collected from in-ertial sensors on cameras to speed up image alignment for panorama construction. Inertial sensors including accelerom-eters and gyroscopes are first calibrated to improve sensing accuracy. These sensors are then used to estimate the position and orientation of each captured image frame. By knowing the relative displacement of image frames, alignment can be performed with good accuracy and computational efficiency. Through examples we illustrate the effectiveness of inertial-sensor assisted panorama. © 2011 ACM.

关键词： Inertial navigation systems

来源：评论

学校读者我要写书评

暂无评论

Active clustering of biological sequences

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2012年第1期13卷

作者： Konstantin Voevodski Maria-Florina Balcan Heiko Röglin Shang-Hua Teng Yu Xia Google New York NY College of Computing Georgia Institute of Technology Atlanta GA Department of Computer Science University of Bonn Bonn Germany Computer Science Department University of Southern California Los Angeles CA Bioinformatics Program and Department of Chemistry Boston University Boston MA

Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that given a point s ∈ S return the distances between s and all other points. We show that given a natural assumption about the structure of the instance, we can efficiently find an accurate clustering using only O(k) distance queries. Our algorithm uses an active selection strategy to choose a small set of points that we call landmarks, and considers only the distances between landmarks and other points to produce a clustering. We use our procedure to cluster proteins by sequence similarity. This setting nicely fits our model because we can use a fast sequence database search program to query a sequence against an entire data set. We conduct an empirical study that shows that even though we query a small fraction of the distances between the points, we produce clusterings that are close to a desired clustering given by manual classification.

关键词： active clustering approximation algorithms approximation stability clustering clustering accuracy k-median protein sequences

来源：评论

学校读者我要写书评

暂无评论

Mobility support in Multi-Path TCP

Mobility support in Multi-Path TCP

引用

IEEE International Conference on Communication Software and Networks

作者： Sun, Yonghao Cui, Yong Wang, Wendong Ma, Tianze Ismailov, Yuri Zheng, Xin State Key Laboratory of Networking and Switching Technology BUPT Beijing China Department of Computer Science Tsinghua University Beijing China Networks and Systems Ericsson Research Kista Sweden Google Inc. Beijing China

ISBN: (纸本)9781612844855

Mobile devices are emerging with multiple interfaces with diverse access technologies. Simultaneously use multiple interfaces can bring lots of benefits to users. However, current TCP fails to support to simultaneously use multiple interfaces. Thus Multi-Path TCP is proposed to overcome the limitation. But MPTCP itself cannot provide mobility support, which may impose mobility restriction on mobile devices. We thus propose a mobility management scheme inside MPTCP protocol. We first propose several requirements for Multi-Path TCP mobility management and then present our solution. Our solution is based on the concept of ID/Locator separation. We use a permanent address and several temporary addresses to separate host identity and locations. By the cooperation of dynamic DNS and MPTCP, our solution has a good support in MPTCP mobility. Finally, we implement a real-world system of MPTCP with mobility support as a proof of feasibility of our approach. © 2011 IEEE.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

Maximizing a monotone submodular function subject to a matroid constraint

Maximizing a monotone submodular function subject to a matro...

引用

作者： Calinescu, Gruia Chekuri, Chandra Pál, Martin Vondrák, Jan Computer Science Department Illinois Institute of Technology Chicago IL 60616 United States Department of Computer Science University of Illinois Urbana IL 61801 United States Google Inc. 1440 Broadway New York NY 10018 United States IBM Almaden Research Center San Jose CA 95120 United States

Let f: 2X → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem max s∈If(S). It is known that the greedy algorithm yields a 1/2-approximation [M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey, Math. Programming Stud., no. 8(1978), pp. 73-87] for this problem. For certain special cases, e.g., max|S|≤kf (S), the greedy algorithm yields a (1-1/e)-approximation. It is known that this is optimal both in the value oracle model (where the only access to f is through a black box returning f(S) for a given set S) [G. L. Nemhauser and L. A. Wolsey, Math. Oper. Res., 3(1978), pp. 177-188] and for explicitly posed instances assuming P = NP [U. Feige, J. ACM, 45(1998), pp. 634-652]. In this paper, we provide a randomized (1-1/e)-approximation for any monotone submodular function and an arbitrary matroid. The algorithm works in the value oracle model. Our main tools are a variant of the pipage rounding technique of Ageev and Sviridenko [J. Combin. Optim., 8(2004), pp. 307-328], and a continuous greedy process that may be of independent interest. As a special case, our algorithm implies an optimal approximation for the submodular welfare problem in the value oracle model [J. Vondrák, Proceedings of the 38th ACM Symposium on Theory of Computing, 2008, pp. 67-74]. As a second application, we show that the generalized assignment problem (GAP) is also a special case;although the reduction requires |X| to be exponential in the original problem size, we are able to achieve a (1-1/e - o(1))-approximation for GAP, simplifying previously known algorithms. Additionally, the reduction enables us to obtain approximation algorithms for variants of GAP with more general constraints. © 2011 Society for Industrial and Applied Mathematics.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

DHC: Distributed, hierarchical clustering in sensor networks

DHC: Distributed, hierarchical clustering in sensor networks

引用

作者： Ma, Xiu-Li Hu, Hai-Feng Li, Shuang-Feng Xiao, Hong-Mei Luo, Qiong Yang, Dong-Qing Tang, Shi-Wei School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of Machine Perception Peking University Ministry of Education Beijing 100871 China Key Laboratory of High Confidence Software Technologies Peking University Ministry of Education Beijing 100871 China Department of Computer Science and Engineering Hong Kong University Science and Technology Clear Water Bay Kowloon Hong Kong Google China Beijing 100871 China

In many sensor network applications, it is essential to get the data distribution of the attribute value over the network. Such data distribution can be got through clustering, which partitions the network into contiguous regions, each of which contains sensor nodes of a range of similar readings. This paper proposes a method named Distributed, Hierarchical Clustering (DHC) for online data analysis and mining in senior networks. Different from the acquisition and aggregation of raw sensory data, DHC clusters sensor nodes based on their current data values as well as their geographical proximity, and computes a summary for each cluster. Furthermore, these clusters, together with their summaries, are produced in a distributed, bottom-up manner. The resulting hierarchy of clusters and their summaries facilitates interactive data exploration at multiple resolutions. It can also be used to improve the efficiency of data-centric routing and query processing in sensor networks. We also design and evaluate the maintenance mechanisms for DHC to make it be able to work on evolving data. Our simulation results on real world datasets as well as synthetic datasets show the effectiveness and efficiency of our approach. © 2011 Springer science+Business Media, LLC & science Press, China.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A Dot Net framework based physical testbed for ad hoc network routing protocols

A Dot Net framework based physical testbed for ad hoc networ...

引用

Canadian Conference on Electrical and computer Engineering (CCECE)

作者： Sanjay K. Dhurandher Isaac Woungang Ishan Uppal Hitesh Bhanushali Deepank Gupta CAITFS Division of Information Technology NIST University of Delhi Delhi India Department of Computer Science Ryerson University Toronto Ontario Canada Mobile Engineer Google Bangalore India

This paper proposes a novel physical implementation model for mobile ad hoc routing protocols, in the form of a Dot Net framework based testbed architecture, which follows the OSI model and is extensible enough to support different protocols at each layer. Our architecture can be used to deploy and test ad hoc routing protocols on real wireless devices such as Laptops, PDAs, or any other device supporting the Dot Net framework. An AODV-based implementation of this architecture is provided and validated through experiments using Laptops and Windows Mobile 5 devices.

关键词： Routing protocols Ad hoc networks Personal digital assistants Mobile communication XML

来源：评论

学校读者我要写书评

暂无评论

Mobility support in Multi-Path TCP

Mobility support in Multi-Path TCP

引用

International Conference on Communication Software and Networks, ICCSN

作者： Yonghao Sun Yong Cui Wendong Wang Tianze Ma Yuri Ismailov Xin Zheng LState Key Laboratory of Networking & Switching Technology BUPT Beijing China Department of Computer Science Tsinghua University Beijing China Networks and Systems Ericsson Research Limited Kista Sweden Google Inc. Beijing China

关键词： Internet Servers Information services Electronic publishing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：