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

Conference on Applications of Digital Image Processing XLVII

作者： Ajami, Hanieh Nigjeh, Mahdi Kargar Nigjeh, Mahsa Kargar Umbaugh, Scott E. Southern Illinois Univ Edwardsville Comp Vis & Image Proc Lab Dept Elect & Comp Engn Edwardsville IL 62026 USA

ISBN: (纸本)9781510679344;9781510679351

The effectiveness of autonomous vehicles relies on clear visual input, which rain can significantly obstruct. Rain streaks degrade the quality of captured images and videos, affecting both user perception and the functionality of outdoor vision systems, such as those in autonomous vehicles. This visual degradation impacts the vehicle's ability to interpret its environment, increasing the risk of driving in rainy conditions. Researchers have responded to this challenge by developing various rain removal algorithms, ranging from single-image to video-based approaches, each with its own strengths and weaknesses. This research aims to develop two novel, efficient single-image rain removal algorithms that strike a balance between high performance and quick execution. The proposed algorithms will address the need for an effective de-raining technique suitable for real-time use in autonomous vehicles. By improving visibility in rainy conditions, this innovation will enhance the performance and safety of autonomous vehicles, contributing to advancements in the field. A survey involving ten image processing experts and professionals, who evaluated the results of both algorithms based on perceived quality and improvement, revealed that Algorithm 1 received a higher average rating (0.58) compared to Algorithm 2 (0.43). Although Algorithm 1 is slightly preferred based on average participant ratings, Algorithm 2's superior edge preservation and image sharpness make it more favorable for applications demanding high accuracy and detailed image retention. Overall, the project meets the demand for real-time rain removal in autonomous vehicles and provides valuable insights into the effectiveness of Algorithm 1 in de-raining images compared to Algorithm

关键词： Autonomous vehicle vision Rain streaks removal Computer vision enhancement CVIPtools Python algorithmic methods Image segmentation

来源：评论

学校读者我要写书评

暂无评论

algorithmic methods of reference-line construction for estimating long-term strength of plastic pipe system

引用

POLYMER TESTING 2016年 56卷 58-64页

作者： Moon, Jongsub Sae, Hyunmin Song, Jaewoong Choi, Sunwoong Hannam Univ Dept Polymer Sci & Engn Daejeon 30454 South Korea Korea Univ Dept Elect Informat Engn Sejong 30019 South Korea

Two simple and error free methods (direct and interpolation) for obtaining mathematical models for constructing reference lines were developed and successfully applied to the hydrostatic stress-rupture data of polyethylene pipes. Both methods employed an algorithmic process that analyzed the observed stress-rupture data along with its mathematical model of the 50% regression (LTHS) line. For each method, a shift value Delta c was determined and was used to obtain the mathematical model for constructing reference lines that satisfied the requirement of ISO TS 26873. That is, the reference lines so constructed accommodated at least 97.5% of all stress-rupture data points on or above this line, in addition to being parallel to and vertically shifted below the 50% regression lines by an amount Delta c. In the direct method, the reference line was made to pass directly over the data point that is equal to or the first data point greater than the 97.5% data position among all data points. On the other hand, the interpolation method extracted a shift value that corresponded to the 97.5% data position by interpolating between the first data points over and below 97.5%. In this case, the reference lines were made to pass through the interpolated position of 97.5% at every temperature. The advantage of the proposed algorithmic methods is that the determination of mathematical models for reference lines only involves finding the data position(s) with a vertical shift value of Delta c that satisfies the <= 97.5% requirement. With these methods, uncertainties and errors associated with the current trial and error approach for constructing reference lines can be eliminated. In this paper, the details of the algorithmic process for obtaining a proper shift value and using it to develop the mathematical model are described for each method. Also, examples of constructing reference lines using these models are illustrated for polyethylene pipes. (C) 2016 Elsevier Ltd. All rights rese

关键词： Stress-rupture data Long-term hydrostatic strength Reference line construction algorithmic methods Miner's rule

来源：评论

学校读者我要写书评

暂无评论

Navigating Random Forests and related advances in algorithmic modeling

引用

STATISTICS SURVEYS 2009年第none期3卷 147-163页

作者： Siroky, David S. Yale Univ MacMillan Ctr Box 208206 New Haven CT 06511 USA

This article addresses current methodological research on non-parametric Random Forests. It provides a brief intellectual history of Random Forests that covers CART, boosting and bagging methods. It then introduces the primary methods by which researchers can visualize results, the relationships between covariates and responses, and the out-of-bag test set error. In addition, the article considers current research on universal consistency and importance tests in Random Forests. Finally, several uses for Random Forests are discussed, and available software is identified.

关键词： CART bagging boosting Random Forests algorithmic methods non-parametrics ensemble and committee methods

来源：评论

学校读者我要写书评

暂无评论

Smoothing of Multivariate Data 1

引用

丛书名： Wiley Series in Probability and Statistics

2009年

作者： Klemelä Jussi Sakari

ISBN: (数字)9780470425664

ISBN: (纸本)9780470290880

An applied treatment of the key methods and state-of-the-art tools for visualizing and understanding statistical data Smoothing of Multivariate Data provides an illustrative and hands-on approach to the multivariate aspects of density estimation, emphasizing the use of visualization tools. Rather than outlining the theoretical concepts of classification and regression, this book focuses on the procedures for estimating a multivariate distribution via smoothing. The author first provides an introduction to various visualization tools that can be used to construct representations of multivariate functions, sets, data, and scales of multivariate density estimates. Next, readers are presented with an extensive review of the basic mathematical tools that are needed to asymptotically analyze the behavior of multivariate density estimators, with coverage of density classes, lower bounds, empirical processes, and manipulation of density estimates. The book concludes with an extensive toolbox of multivariate density estimators, including anisotropic kernel estimators, minimization estimators, multivariate adaptive histograms, and wavelet estimators. A completely interactive experience is encouraged, as all examples and figurescan be easily replicated using the R software package, and every chapter concludes with numerous exercises that allow readers to test their understanding of the presented techniques. The R software is freely available on the book's related Web site along with "Code" sections for each chapter that provide short instructions for working in the R environment. Combining mathematical analysis with practical implementations, Smoothing of Multivariate Data is an excellent book for courses in multivariate analysis, data analysis, and nonparametric statistics at the upper-undergraduate and graduatelevels. It also serves as a valuable reference for practitioners and researchers in the fields of statistics, computer science, economics, and engineering.

关键词： R software algorithmic methods visualizing statistics statistical visualization multivariate density estimators anisotropic kernel estimators minimization estimators multivariate adaptive histograms wavelet estimators smoothing and analysis of data nonparametric statistics

来源：评论

学校读者我要写书评

暂无评论

Computational geometry education for computer graphics students

引用

COMPUTER GRAPHICS FORUM 2008年第6期27卷 1531-1538页

作者： Kolingerova, I. Univ W Bohemia Dept Comp Sci & Engn Ctr Comp Graph & Data Visualizat Plzen Czech Republic

The paper surveys main features of computational geometry and presents the argument that a course oriented to applied computational geometry should be a part of the computer graphics curriculum, as it teaches effective algorithmic methods and helps to develop abstract thinking. Possible contents of the course and forms suitable and interesting for computer graphics students are discussed. The students' feedback on such a course has been mostly positive.

关键词： computational geometry computer graphics curriculum algorithmic methods

来源：评论

学校读者我要写书评

暂无评论

Detecting infinitely many semisimple representations in a fixed finite dimension

引用

JOURNAL OF ALGEBRA 2008年第11期320卷 3926-3934页

作者： Letzner, E. S. Temple Univ Dept Math Philadelphia PA 19122 USA

Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented k-algebra R has infinitely many equivalence classes of semisimple representations R -> M(n)(k'), where k' is the algebraic closure of k. The test reduces the problem to computational commutative algebra over k, via famous results of Artin, Procesi, and Shirshov. The test is illustrated by explicit examples. with n = 3. (C) 2008 Elsevier Inc. All rights reserved.

关键词： algorithmic methods Semisimple representations Finitely presented algebras Trace rings Computational commutative algebra

来源：评论

学校读者我要写书评

暂无评论

An introduction to ensemble methods for data analysis

引用

SOCIOLOGICAL methods & RESEARCH 2006年第3期34卷 263-295页

作者： Berk, Richard A. Univ Calif Los Angeles Los Angeles CA 90024 USA

This article provides an introduction to ensemble statistical procedures as a special case of algorithmic methods. The discussion begins with classification and regression trees (CART) as a didactic device to introduce many of the key issues. Following the material on CART is a consideration of cross-validation, bagging, random forests, and boosting. Major points are illustrated with analyses of real data.

关键词： CART data analysis algorithmic methods ensemble methods

来源：评论

学校读者我要写书评

暂无评论

Fluid queues to solve jump processes

引用

PERFORMANCE EVALUATION 2005年第1-4期62卷 132-146页

作者： Dzial, T Breuer, L Soares, ADS Latouche, G Remiche, MA Univ Libre Bruxelles Dept Informat B-1050 Brussels Belgium Univ Libre Bruxelles Fac Sci Appl Serv Math Gest B-1050 Brussels Belgium Univ Trier Dept Comp Sci 4 D-54286 Trier Germany

We consider systems which exhibit a mixture of smooth behavior and occasional jumps, controlled by continuous-time Markovian processes on a finite state space, and we call these fluid queues with jumps, thereby emphasizing the fact that they constitute a generalization of fluid queues. We characterize their stationary distribution in an algorithmically tractable way by constructing an auxiliary fluid queue without jumps. We give a few examples to illustrate the procedure and we analyze in detail a buffer model where bursts of high priority traffic interrupt the transmission of low priority files. (c) 2005 Elsevier B.V. All rights reserved.

关键词： fluid queues jump processes matrix-analytic methods algorithmic methods priority buffer system

来源：评论

学校读者我要写书评

暂无评论

Fluid queues to solve jump processes

Fluid queues to solve jump processes

引用

International Symposium on Computer Performance Modelling, Measurement and Evalution

关键词： fluid queues jump processes matrix-analytic methods algorithmic methods priority buffer system

来源：评论

学校读者我要写书评

暂无评论

Computing the automorphism group of a solvable Lie algebra

引用

LINEAR ALGEBRA AND ITS APPLICATIONS 2004年第0期382卷 195-209页

作者： Eick, B TU Braunschweig Inst Geometrie Dept Math D-38106 Braunschweig Germany

We describe an effective algorithm for computing the automorphism group of a finite-dimensional solvable Lie algebra over a finite field. We show that a similar approach can be Used to determine a canonical table for such a Lie algebra;that is, a description for the Lie algebra which is invariant under isomorphisms. Hence we also obtain an effective isomorphism test for finite-dimensional solvable Lie algebras over finite fields. (C) 2004 Elsevier Inc. All rights reserved.

关键词： Lie algebra automorphism group representation theory cohomology theory algorithmic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：