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

Communication via eye blinks and eyebrow raises: Video-based human-computer interfaces

Universal Access in the Information Society 2003年第4期2卷 359-373页

作者： Grauman, K. Betke, M. Lombardi, J. Gips, J. Bradski, G.R. Vision Interface Group AI Laboratory Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States Computer Science Department Boston University 111 Cummington St BostonMA02215 United States EagleEyes Computer Science Department Boston College Fulton Hall Chestnut HillMA02467 United States Vision Graphics and Pattern Recognition Microcomputer Research Laboratory Intel Corporation SC12-303 2200 Mission College Blvd Santa ClaraCA95054-1537 United States

Two video-based human-computer interaction tools are introduced that can activate a binary switch and issue a selection command. "BlinkLink," as the first tool is called, automatically detects a user's eye blinks and accurately measures their durations. The system is intended to provide an alternate input modality to allow people with severe disabilities to access a computer. Voluntary long blinks trigger mouse clicks, while involuntary short blinks are ignored. The system enables communication using "blink patterns:" sequences of long and short blinks which are interpreted as semiotic messages. The second tool, "EyebrowClicker," automatically detects when a user raises his or her eyebrows and then triggers a mouse click. Both systems can initialize themselves, track the eyes at frame rate, and recover in the event of errors. No special lighting is required. The systems have been tested with interactive games and a spelling program. Results demonstrate overall detection accuracy of 95.6% for BlinkLink and 89.0% for EyebrowClicker. © Springer-Verlag 2003.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Classifiability based omnivariate decision trees

Classifiability based omnivariate decision trees

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Y. Li M. Dong Machine Vision and Pattern Recognition Laboratory Department of Computer Science Wayne State University Detroit MI USA

Decision trees represent a simple and powerful method of induction from labeled examples. Univariate decision trees consider the value of a single attribute at each node, leading to the splits that are parallel to the axes. In linear multivariate decision trees, all the attributes are used and the partition at each node is based on a linear discriminate (a hyperplane). Nonlinear multivariate decision trees are able to divide the input space arbitrarily based on higher order parameterizations of the discriminate, though one should be aware of the increase of the complexity and the decrease in the number of examples available as moves further down the tree. In omnivariate decision trees, the decision node may be univariate, linear, or nonlinear. Such architecture frees the designer from choosing the appropriate tree type for a given problem. In this paper, we propose to do the model selection at each decision node based on a novel classifiability measure when building omnivariate decision trees. The classifiability measure captures the possible sources of misclassification with relative ease and is able to accurately reflect the complexity of subproblems at each node. The proposed approach does not require the time consuming statistic tests at each node and therefore does not suffer from as high computational burden as typical model selection algorithm. Our simulation results over several data sets indicate that our approach can achieve at least as good classification accuracy as statistical tests based model select algorithms, but in much faster speed.

关键词： Classification tree analysis Decision trees Testing Shape Machine vision pattern recognition Laboratories computer science Buildings Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

Analyzing dividend events with neural network rule extraction

Analyzing dividend events with neural network rule extractio...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： M. Dong Xu-Shen Zhou Machine Vision and Pattern Recognition Laboratory Department of Computer Science Wayne State University Detroit MI USA Department of Finance and Legal Studies College of Business Bloomsburg University Bloomsburg PA USA

Over the last two decades, artificial neural networks (ANN) have been applied to solve a variety of problems such as pattern classification and function approximation. In many applications, it is desirable to extract knowledge from trained neural networks for the users to gain a better understanding of the network's solution. In this paper, we apply REFANN (rule extraction from function approximating neural networks) in dividend events study. Based on our study of 1530 dividend initiations and 692 resumptions events from April 1965 to December 2000, we find that the positive relation between the short-term price reaction and the ratio of annualized dividend amount to stock price is primarily limited to 96 firms that have high dividend ratio and small firm size. The results suggest that the degree of short-term stock price underreaction to dividend events may not be as dramatic as previously believed. The results also show that the relations between the stock price response and firm size is also different across different types of firms. It is suggested that drawing the conclusions from the whole dividend events data may leave some important information unexamined. Our rule extraction method may shed some lights on further empirical research in corporate events studies because more information can be drawn from the data.

关键词： Neural networks Artificial neural networks Function approximation Data mining Biological neural networks Machine vision pattern recognition Laboratories computer science Finance

来源：评论

学校读者我要写书评

暂无评论

Fast recovery of piled deformable objects using superquadrics

Fast recovery of piled deformable objects using superquadric...

引用

24th German Association for pattern recognition Symposium, DAGM 2002

作者： Katsoulas, Dimitrios Jaklič, Aleš Institute for Pattern Recognition and Image Processing University of Freiburg Georges-Koehler-Allee 52 FreiburgD-79110 Germany Computer Vision Laboratory University of Ljubljana Tržaška cesta 25 LjubljanaSI-1000 Slovenia

ISBN: (纸本)354044209X

Fast robotic unloading of piled deformable box-like objects (e.g. box-like sacks), is undoubtedly of great importance to the industry. Existing systems although fast, can only deal with layered, neatly placed configurations of such objects. In this paper we discuss an approach which deals with both neatly placed and jumbled configurations of objects. We use a time of flight laser sensor mounted on the hand of a robot for data acquisition. Target objects are modeled with globally deformed superquadrics. Object vertices are detected and superquadric seeds are placed at these vertices. Seed refinement via region growing results in accurate object recovery. Our system exhibits a plethora of advantages the most important of which its speed. Experiments demonstrate that our system can be used for object unloading in real time, when a multi-processor computer is employed. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Multiple objects segmentation based on maximum-likelihood estimation and optimum entropy-distribution (MLE-OED)

Multiple objects segmentation based on maximum-likelihood es...

引用

International Conference on pattern recognition

作者： Xie Jun H.T. Tsui Xia Deshen Image Processing and Computer Vision Laboratory Department of Electronic Engineering Chinese University of Hong Kong Hong Kong China Pattern Recognition Laboratory Department of Computer Science Nanjing University of Science and Technology China

ISBN: (纸本)076951695X

A new method based on MLE-OED is proposed for unsupervised image segmentation of multiple objects which have fuzzy edges. It adjusts the parameters of a mixture of Gaussian distributions via minimizing a new loss function proposed to implement image segmentation based on the image's local spatial information and global intensity distribution properties. The loss function consists of two terms: a local content fitting term, which optimizes the entropy distribution, and a global statistical fitting term, which maximizes the likelihood of the parameters for the given data. The proposed segmentation method was validated by simulated and real examples. The performance in the experiments is better than those of two popular methods.

关键词： Object segmentation Maximum likelihood estimation Image segmentation Layout Uncertainty Image edge detection Shape measurement Image processing pattern recognition Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Application of a genetic algorithm in triangulation of a 3-D object surface

引用

International Journal of computers and Applications 2000年第2期22卷 73-77页

作者： Zhenyu, Chen Mbede, J.B. Yan, Zhou Dehua, Li Hanping, Hu State Commn. Res. Open Lab. Image P. Inst. Pattern Recog. Artif. Intell. Huazhong Univ. of Sci. and Technol. 430074 Wuhan China Intelligent Contr. and Robotics Lab. Dept. of Contr. Sci. and Engineering Huazhong Univ. of Sci. and Technol. 430074 Wuhan China Second Artillery Institute Huazhong Univ. of Sci. and Technol. Inst. Pattern Recog. Artif. Intell. Huazhong Univ. of Sci. and Technol. Second Artillery Institute China Wuhan University China Artificial Intelligence Department University of Edinburgh Inst. of AI and Pattern Recognition Huazhong Univ. of Sci. and Technol. China Cogn. Sci. Natl. Key Found. Res. P. Douala University Cameroon Tübingen University Germany Automatic Control Laboratory Darmstadt University Department of Service Cameroon Min. of National Education Robotics Laboratory Huazhong Univ. of Sci. and Technol. Wuhan China Assoc. Connectionnistes These-ACTH Rennes France IEEE Soc. of Robotics and Automation IEEE Society of Control Systems IASTED Assoc. Jeunes Chercheurs Robotique France Navy University of Engineering China Huazhong Univ. of Sci. and Technol. China Department of Computer Science Airforce Radar Acad. of Engineering China Inst. of P.R and AI Huazhong Univ. of Sci. and Technol.

This paper proposes a genetic-based algorithm for surface reconstruction of three-dimension (3-D) objects from a group of contours representing its section plane lines. The algorithm can optimize the triangulation of the surface of 3-D objects with a multi-objective optimization function to meet the needs of a wide range of applications. Further, a new crossover operator for triangulation and a new 3-D quadrilateral mutation operator are also introduced.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Minimizing the topological structure of line images 7th

引用

7th Joint IAPR International Workshop on Structural and Syntactic pattern recognition, SSPR 1998 and 2nd International Workshop on Statistical Techniques in pattern recognition, SPR 1998

作者： Kropatsch, Walter G. Burge, Mark Vienna University of Technology Institute of Automation 183/2 Pattern Recognition and Image Processing Group Treitlstr.3 WienA-1040 Austria Johannes Kepler University Institute of Systems Science Computer Vision Laboratory LinzA-4040 Austria

ISBN: (纸本)3540648585

We present a new algorithm based on Dual Graph Contraction (DGC) to transform the Run Graph into its Minimum Line Property Preserving (MLPP) form which, when implemented in parallel, requires O(log(longestcurve)) steps. A MLPP graph of a line image compliments the structural information in geometric graph representations like the run graph. Using such a graph and its dual, line image analysis systems can efficiently detect topological features like loops and holes and make use of relations like containment. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Recovering epipolar geometry by reactive tabu search

Recovering epipolar geometry by reactive tabu search

引用

International Conference on computer vision (ICCV)

作者： Qifa Ke Gang Xu Song De Ma National Laboratory of Pattern Recognition Institute of Automation Chinese Academy and Sciences Beijing China Computer Vision Laboratory Department of Computer Science Ritsumeikan University Kusatsu Shiga Japan

ISBN: (纸本)8173192219

In this paper we propose a new approach to recovering epipolar geometry from a pair of uncalibrated images. We first detect the feature points. By minimizing a proposed cost function, we match the feature points, discard the outliers and recover the epipolar geometry in one step. Experiments on real images show that this approach is effective and fast.

关键词： Equations Cost function computer vision Laboratories pattern recognition Automation computer science Computational geometry Image reconstruction Layout

来源：评论

学校读者我要写书评

暂无评论

Efficient Window Block Retrieval in Quadtree-Based Spatial Databases

引用

GeoInformatica 1997年第1期1.0卷 59-91页

作者： Aref, Walid G. Samet, Hanan Computer Science Department Center for Automation Research University of Maryland College Park MD 20742 United States University of Alexandria Egypt University of Maryland College Park United States Matsushita Info. Technol. Laboratory Princeton United States IBM Research Almaden CA United States University of Maryland Inst. for Advanced Computer Studies College Park MD United States ACM IEEE United States Department of Computer Science University of Maryland United States Computer Vision Laboratory Stanford University United States ACM IEEE Intl. Assoc. of Pattern Recognition

An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window partitions. These partitions are the quadtree blocks corresponding to the window. Although a block b in the underlying spatial database may cover several of the smaller window partitions, b is only retrieved once rather than multiple times. This is achieved by using an auxiliary main memory data structure called the active border which requires O(n) additional storage for a window query of size n × n. As a result, the algorithm generates an optimal number of disk I/O requests to answer a window query (i.e., one request per covering quadtree block). A proof of correctness and an analysis of the algorithm's execution time and space requirements are given, as are some experimental results.

关键词： Active border Clipping Data structures Databases Design of algorithms Quadtree space decomposition Range query Spatial databases Window block retrieval

来源：评论

学校读者我要写书评

暂无评论

Complexity optimization of adaptive RBF networks

Complexity optimization of adaptive RBF networks

引用

13th International Conference on pattern recognition, ICPR 1996

作者： Leonardis, Aleš Bischof, Horst Department for Pattern Recognition and Image Processing Technical University Vienna Treitlstraße 3/1832 A -1040 Vienna Austria University of Ljubljana Faculty of Computer and Information Science Computer Vision Laboratory Ljubljana Slovenia

ISBN: (纸本)081867282X

We propose an extension of RBF networks which includes a mechanism for optimizing the complexity of the network. The approach involves two procedures: adaptation (training) and selection. The first procedure adaptively changes the locations and the width of the centers of the basis functions and trains the linear weights. The selection procedure performs the elimination of some of the basis functions using an objective function. By iteratively combining these two procedures we achieve a controlled way of training and modifying RBF networks, which balances accuracy, learning time, and complexity of the resulting network. © 1996 IEEE.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：