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

Facial features extraction based on active shape model

Journal of Multimedia 2013年第6期8卷 747-754页

作者： Wang, Qihui Xie, Lijun Zhu, Bo Yang, Tingjun Zheng, Yao School of Aeronautics and Astronautics Zhejiang University Hangzhou China Qianjiang College Hangzhou Normal University Hangzhou China Center for Engineering and Scientific Computation Zhejiang University Hangzhou China School of Computer Science and Technology Zhejiang University Hangzhou China

Active shape model (ASM) is an image searching method based on statistical model, which is widely used to extract features. The classical ASM model includes the shape model and the local profile model. The main merit of ASM model is using statistics to contribute model of specific target image, by introducing prior knowledge on awaiting extraction target object, limiting the searching result in the variable range. These characteristics make it suitable for any similar object's feature. Experimental results show that the algorithm can extract facial features rapidly and have higher accuracy. © 2013 Academy Publisher.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Optimizing pyramid visibiliy coverage for autonomous robots in 3D environment

Optimizing pyramid visibiliy coverage for autonomous robots ...

引用

8th International Conference on computer science and Education, ICCSE 2013

作者： Yu, Wuyi Li, Maoqing Li, Xin School of Electrical Engineering and Computer Science Center for Computation and Technology Louisiana State University United States Department of Automation Xiamen University Xiamen China

ISBN: (纸本)9781467344623

This paper studies the optimal visibility coverage for autonomous robots in complex 3D environments. The perception sensor equipped on an inspection robot usually has a pyramid-shaped visible range with limited distance and angle. Finding the optimal pyramid visibility coverage for a given 3D region is NP hard;this paper presents an effective progressive integer linear programming algorithm to compute an approximate solution. Our framework allows the user to specify a coverage rate parameter to balance the percentage of visibility and the required guarding points for the given region. The algorithm is assessed in a simulated 3D pipeline environment and demonstrated promising for detecting leaks, clogs, and deformation of the pipes. © 2013 IEEE.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

AFCD: An approximated-fair and controlled-delay queuing for high speed networks

AFCD: An approximated-fair and controlled-delay queuing for ...

引用

2013 IEEE 2013 22nd International Conference on computer Communication and Networks, ICCCN 2013

作者： Xue, Lin Kumar, Suman Cui, Cheng Kondikoppa, Praveenkumar Chiu, Chui-Hui Park, Seung-Jong School of Electrical Engineering and Computer Science Center for Computation and Technology Louisiana State University Baton Rouge LA United States Department of Computer Science Troy University Troy AL United States

ISBN: (纸本)9781467357746

High speed networks have characteristics of high bandwidth, long queuing delay, and high burstiness which make it difficult to address issues such as fairness, low queuing delay and high link utilization. Current high speed networks carry heterogeneous TCP flows which makes it even more challenging to address these issues. Since sender centric approaches do not meet these challenges, there have been several proposals to address them at router level via queue management (QM) schemes. These QM schemes have been fairly successful in addressing either fairness issues or large queuing delay but not both at the same time. We propose a new QM scheme called Approximated-Fair and Controlled-Delay (AFCD) queuing for high speed networks that aims to meet following design goals: approximated fairness, controlled low queuing delay, high link utilization and simple implementation. The design of AFCD utilizes a novel synergistic approach by forming an alliance between approximated fair queuing and controlled delay queuing. It uses very small amount of state information in sending rate estimation of flows and makes drop decision based on a target delay of individual flow. Through experimental evaluation in a 10Gbps high speed networking environment, we show AFCD meets our design goals by maintaining approximated fair share of bandwidth among flows and ensuring a controlled very low queuing delay with a comparable link utilization. © 2013 IEEE.

关键词： HIgh speed networks

来源：评论

学校读者我要写书评

暂无评论

Perceptual objective quality evaluation method for high-quality multichannel audio codecs

引用

AES: Journal of the Audio engineering Society 2013年第7-8期61卷 535-545页

作者： Seo, Jeong-Hun Chon, Sang Bae Sung, Koeng-Mo Choi, Inyong Institute of New Media and Communications School of Electrical Engineering and Computer Science Seoul National University Korea Republic of Multimedia RandD Team DMC RandD Center Samsung Electronics Suwon Korea Republic of Center for Computational Neuroscience and Neural Technology Boston University Boston United States

This paper introduces an objective method for the perceptual evaluation of high-quality, multichannel audio codecs. In the proposed method, the five monaural Model Output Variables (MOVs) of ITU-RBS.1387-1 are combined with four novelMOVs that predict quality degrades in spatial attributes. The proposed method was trained and verified on a listening-test database created by ITU-R WP6C using high-quality audio codecs. The proposed method shows an encouraging performance in the prediction of perceived audio quality.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Spectroscopic monitoring of diesel fuels using Supervised Distance Preserving Projections

Spectroscopic monitoring of diesel fuels using Supervised Di...

引用

10th IFAC Symposium on Dynamics and Control of Process Systems, DYCOPS 2013

作者： Corona, Francesco Zhu, Zhanxing Souza Jr., Amauri H. Mulas, Michela Baratti, Roberto Department of Information and Computer Science Aalto University School of Science Espoo Finland Institute for Neural and Adaptive Computation School of Informatics University of Edinburgh Edinburgh United Kingdom Department of Teleinformatics Engineering Federal University of Ceará Fortaleza Brazil Department of Civil and Environmental Engineering Aalto University School of Engineering Espoo Finland Department of Mechanical Chemical and Material Engineering University of Cagliari Cagliari Italy

ISBN: (纸本)9783902823595

In this work, we discuss a recently proposed approach for supervised dimensionality reduction, the Supervised Distance Preserving Projection and, we investigate its applicability to monitoring material's properties from spectroscopic observations. Motivated by continuity preservation, the SDPP is a linear projection method where the local geometry of the points in the low-dimensional subspace mimics the geometry of the points in the response space. Such a mapping facilitates an efficient regressor design and it may also uncover useful information for visualisation. An experimental evaluation is conducted to show the performance of the SDPP and compare it with a number of state-of-the-art approaches for unsupervised and supervised dimensionality reduction. For the task, the results obtained on a benchmark problem consisting of a set of NIR spectra of diesel fuels and six different chemico-physical properties of those fuels is discussed. Based on the experimental results, the SDPP leads to accurate and parsimonious projections that can be used in the design of efficient regression models. © IFAC.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Publicly verifiable proofs of sequential work 13

Publicly verifiable proofs of sequential work

引用

2013 4th ACM Conference on Innovations in Theoretical computer science, ITCS 2013

作者： Mahmoody, Mohammad Moran, Tal Vadhan, Salil Computer Science Department Cornell University Ithaca NY United States Herzliya Israel School of Engineering and Applied Sciences Center for Research on Computation and Society Harvard University Cambridge MA United States

ISBN: (纸本)9781450318594

We construct a publicly verifiable protocol for proving computational work based on collision-resistant hash functions and a new plausible complexity assumption regarding the existence of "inherently sequential" hash functions. Our protocol is based on a novel construction of time-lock puzzles. Given a sampled "puzzle" P →$ Dn, where n is the security parameter and Dn is the distribution of the puzzles, a corresponding "solution" can be generated using N evaluations of the sequential hash function, where N > n is another parameter, while any feasible adversarial strategy for generating valid solutions must take at least as much time as Ω(N) serial evaluations of the hash function after receiving P. Thus, valid solutions constitute a "proof" that Ω(N) parallel time elapsed since p was received. Solutions can be publicly and efficiently verified in time poly(n) · polylog(N). Applications of these "time-lock puzzles" include noninteractive timestamping of documents (where the distribution over the possible documents corresponds to the puzzle distribution Dn) and universally verifiable CPU benchmarks. Our construction is secure in the standard model under complexity assumptions (collision-resistant hash functions and inherently sequential hash functions), and makes black-box use of the underlying primitives. Consequently, the corresponding construction in the random oracle model is secure unconditionally. Moreover, as it is a public-coin protocol, it can be made non-interactive in the random oracle model using the Fiat-Shamir Heuristic. Our construction makes a novel use of "depth-robust" directed acyclic graphs - ones whose depth remains large even after removing a constant fraction of vertices - which were previously studied for the purpose of complexity lower-bounds. The construction bypasses a recent lower-bound of Mahmoody, Moran, and Vadhan (CRYPTO '11) for time-lock puzzles in the random oracle model, which showed that it is impossible to have time-lock puzzles l

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Efficient design of nanoscale metal-dielectric-metal plasmonic waveguide devices

Efficient design of nanoscale metal-dielectric-metal plasmon...

引用

Frontiers in Optics, FIO 2013

作者： Dastmalchi, Pouya Veronis, Georgios School of Electrical Engineering and Computer Science Louisiana State University Baton Rouge LA 70803 United States Center for Computation and Technology Louisiana State University Baton Rouge LA 70803 United States

We develop a method for the efficient design of nanoscale metal-dielectric-metal plasmonic waveguide devices, based on the space-mapping algorithm and transmission line theory models. The method requires full-wave sim... 详细信息

ISBN: (纸本)9781557529879

关键词： Plasmonics

来源：评论

学校读者我要写书评

暂无评论

Vanishing component analysis

Vanishing component analysis

引用

30th International Conference on Machine Learning, ICML 2013

作者： Livni, Roi Lehavi, David Schein, Sagi Nachlieli, Hila Shalev-Shwartz, Shai Globerson, Amir Interdiscplinary Center for Neural Computation Edmond and Lily Safra Center for Brain Sciences Hebrew University of Jerusalem Givat Ram Jerusalem 91904 Israel Hewlett-Packard Laboratories Israel Ltd. Technion City Haifa 32000 Israel Rachel and Selim Benin School of Computer Science and Engineering Hebrew University of Jerusalem Givat Ram Jerusalem 91904 Israel

ISBN: (纸本)9781629933061

The vanishing ideal of a set of points, S ⊂ n, is the set of all polynomials that attain the value of zero on all the points in S. Such ideals can be compactly represented using a small set of polynomials known as generators of the ideal. Here we describe and analyze an efficient procedure that constructs a set of generators of a vanishing ideal. Our procedure is numerically stable, and can be used to find approximately vanishing polynomials. The resulting polynomials capture nonlinear structure in data, and can for example be used within supervised learning. Empirical comparison with kernel methods show that our method constructs more compact classifiers with comparable accuracy. Copyright 2013 by the author(s).

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Tracking attention based on EEG spectrum

Tracking attention based on EEG spectrum

引用

15th International Conference on Human-computer Interaction, HCI International 2013

作者： Wang, Yu-Kai Jung, Tzyy-Ping Chen, Shi-An Huang, Chin-Sheng Lin, Chin-Teng Brain Research Center National Chioa Tung University Hsinchu Taiwan Department of Computer Science National Chiao Tung University Hsinchu Taiwan Department of Electrical Engineering National Chiao Tung University Hsinchu Taiwan Swartz Center for Computational Neruoscience Institute for Neural Computation University of Callifornia San Diego San Diego CA United States

ISBN: (纸本)9783642394720

Distraction while driving is a serious problem that can have many catastrophic consequences. Developing a countermeasure to detect the drivers' distraction is imperative. This study measured Electroencephalography (EEG) signals from six healthy participants while they were asked to pay their full attention to a lane-keeping driving task or a math problem-solving task. The time courses of six distinct brain networks (Frontal, Central, Parietal, Occipital, Left Motor, and Right Motor) separated by Independent Component Analysis were used to build the distraction-detection model. EEG data were segmented into 400-ms epochs. Across subjects, 80% of the EEG epochs were used to train various classifiers that were tested against the remaining 20% of the data. The classification performance based on support vector machines (SVM) with a radial basis function (RBF) kernel achieved accuracy of 84.7±2.7% or 85.8±1.3% for detecting subjects' focuses of attention to the math-solving or lane-deviation task, respectively. The high attention-detection accuracy demonstrated the feasibility of accurately detecting drivers' attention based on the brain activities. This demonstration may lead to a practical real-time distraction-detection system for improving road safety. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Efficiency improvements in constructing pseudorandom generators from one-way functions

Efficiency improvements in constructing pseudorandom generat...

引用

作者： Haitner, Iftach Reingold, Omer Vadhan, Salil School of Computer Science Tel Aviv University Tel Aviv 69978 Israel Microsoft Research Silicon Valley Campus Mountain View CA 94043 United States Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot 76100 Israel School of Engineering and Applied Sciences Center for Research on Computation and Society Harvard University Cambridge MA 02138 United States

We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SIAM J. Comput., 28 (1999), pp. 1364.1396]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of inaccessible entropy±;recently introduced in [I. Haitner, O. Reingold, S. Vadhan, and H. Wee, Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 2009, pp. 611. 620]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a nonadaptive manner. Using [B. Applebaum, Y. Ishai, and E. Kushilevitz, SIAM J. Comput., 36 (2006), pp. 845.888], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1. © 2013 Society for Industrial and Applied Mathematics.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：