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

Text detection and recognition in natural scene with edge analysis

IET computer VISION 2015年第4期9卷 603-613页

作者： Yu, Chong Song, Yonghong Meng, Quan Zhang, Yuanlin Liu, Yang Xi An Jiao Tong Univ Inst Artificial Intelligence & Robot Xian 710049 Peoples R China

Text plays an important role in daily life because of its rich information, thus automatic text detection in natural scenes has many attractive applications. However, detecting and recognising such text is always a challenging problem. In this study, the authors propose a method which extends the widely-used stroke width transform by two steps of edge analysis, namely candidate edge recombination and edge classification. A new method that recognises text through candidate edge recombination and candidate edge recognition is also proposed. In the step of candidate edge recombination, they use the idea of over-segmentation and region merging. To separate text edge from background, the edge of the input image is first divided into small segments. Then, neighbour edge segments are merged, if they have similar stroke width and colour. Through this step, each character is described by one candidate boundary. In the step of boundary classification, candidate boundaries are aggregated into text chains, followed by chain classification using character-based and chain-based features. To recognise text, the grey image is extracted based on the location of each candidate edge after the step of candidate edge recombination. Then, histogram of gradient features and a classifier are used to recognise each character. To evaluate the effectiveness of their method, the algorithm is run on the ICDAR competition dataset and Street View Text database. The experimental results show that the proposed method provides promising performance in comparison with the existing methods.

关键词： SEGMENTATION (Image processing) IMAGE analysis computer algorithms PERFORMANCE evaluation computer science COMPARATIVE studies

来源：评论

学校读者我要写书评

暂无评论

A criterion for atomicity revisited

引用

ACTA INFORMATICA 2007年第2期44卷 123-151页

作者： Hesselink, Wim H. Univ Groningen Dept Math & Comp Sci NL-9700 AV Groningen Netherlands

Concurrent and reactive programs are specified by their behaviours in the presence of a nondeterministic environment. In a natural way, this gives a specification (ARW) of an atomic variable in the style of Abadi and Lamport. Several implementations of atomic variables by lower level primitives are known. A few years ago, we formulated a criterion to prove the correctness of such implementations. The proof of correctness of the criterion itself was based on Lynch's definition of atomicity by serialization points. Here, this criterion is reformulated as a specification HRW in the formal sense. Simulations from HRW to ARW and vice versa are constructed. These now serve as a constructive proof of correctness of the criterion. Eternity variables are used in the simulation from HRW to ARW. We propose so-called gliding simulations to deal with the problems that appear when occasionally the concrete implementation needs fewer steps than the abstract specification.

关键词： PROGRAMMING languages (Electronic computers) VARIABLES (Mathematics) MATHEMATICAL programming algorithms computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Atomistic protein folding simulations on the submillisecond time scale using worldwide distributed computing

引用

BIOPOLYMERS 2003年第1期68卷 91-109页

作者： Pande, VS Baker, I Chapman, J Elmer, SP Khaliq, S Larson, SM Rhee, YM Shirts, MR Snow, CD Sorin, EJ Zagrovic, B Stanford Univ Dept Chem Stanford CA 94305 USA Stanford Univ Stanford Synchrotron Radiat Lab Stanford CA 94305 USA Stanford Univ Biophys Program Stanford CA 94305 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA Stanford Univ Dept Biol Struct Stanford CA 94305 USA

Atomistic simulations of protein folding have the potential to be a great complement to experimental studies, but have been severely limited by the time scales accessible with current computer hardware and algorithms. By employing a worldwide distributed computing network of tens of thousands of PCs and algorithms designed to efficiently utilize this new many-processor, highly heterogeneous, loosely coupled distributed computing paradigm, we have been able to simulate hundreds of microseconds of atomistic molecular dynamics. This has allowed us to directly simulate the folding mechanism and to accurately predict the folding rate of several fast-folding proteins and polymers, including a nonbiological helix, polypeptide alpha-helices, a beta-hairpin, and a three-helix bundle protein from the villin headpiece. Our results demonstrate that one can reach the time scales needed to simulate fast folding using distributed computing, and that potential sets used to describe interatomic interactions are sufficiently accurate to reach the folded state with experimentally validated rates, at least for small proteins. (C) 2002 Wiley Periodicals, Inc.

关键词： atomistic protein folding microsecond time scale computer hardware computer algorithms molecular dynamics distributed computing villin beta hairpin

来源：评论

学校读者我要写书评

暂无评论

A Comparison of algorithms for Handheld Wand Tracking

引用

APPLIED ARTIFICIAL INTELLIGENCE 2014年第9期28卷 888-915页

作者： Wolfe, Britton Gloudemans, Monica Indiana Univ Purdue Univ Ft Wayne IPFW Dept Comp Sci Ft Wayne IN 46805 USA

We examine several algorithms for tracking a handheld wand in a 3D virtual reality system: extended Kalman filters (EKFs), interacting multiple models (IMMs), and support vector machines (SVMs). The IMMs consist of several EKF models, each of which is tuned for one particular type of user motion. For determining the types of motion, we compare hand-created rules with an automatic clustering algorithm, with mixed results. The mode-specific EKFs within the IMM are more accurate than one overall EKF. However, the IMM is comparable to a single EKF, because of the overhead of predicting the current component EKF. SVMs with a one-frame lookahead perform the best, cutting the error in half. Aside from those SVMs, different model types were best for the different dimensions of tracking (x, y, z, and rotation).

关键词： computer algorithms Cluster analysis (Statistics) Artificial intelligence Kalman filtering Virtual reality Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Experimental study on dominant sets clustering

引用

IET computer VISION 2015年第2期9卷 208-215页

作者： Hou, Jian Xia, Qi Qi, Nai-Ming Bohai Univ Sch Informat Sci & Technol Jinzhou 121013 Peoples R China Harbin Inst Technol Sch Astronaut Harbin 150001 Peoples R China

Based on a graph-theoretic concept of a cluster, dominant sets clustering has been shown to be an attractive clustering algorithm with many useful properties. In this study, the authors conduct a comprehensive study of related issues in dominant sets clustering, in an endeavour to explore the potential of this algorithm and obtain the best clustering results. Specifically, they empirically investigate how similarity parameters, similarity measures and game dynamics influence the dominant sets clustering results. From experiments on eight datasets, they conclude that distance-based similarity measures perform evidently better than cosine and histogram intersection similarity measures potentially, and they need to find the best-performing similarity parameter to make use of this advantage. They then study the effect of similarity parameter on dominant sets clustering results and induce the range of the best-performing similarity parameters. Furthermore, they find that the recently proposed infection and immunisation dynamics performs better than the replicator dynamics in most cases while being much more efficient than the latter. These observations are helpful in applying dominant sets clustering to practical problems, and also indicate directions for further improvement of this algorithm.

关键词： GRAPH theory CLUSTER analysis (Statistics) computer algorithms SET theory GAME theory

来源：评论

学校读者我要写书评

暂无评论

Common problems in delay-based congestion control algorithms: a gallery of solutions

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 2011年第4期22卷 168-178页

作者： Rodriguez-Perez, M. Herreria-Alonso, S. Fernandez-Veiga, M. Lopez-Garcia, C. EI Telecomunicac Dept Telemat Engn Vigo 36310 Spain

Although delay-based congestion control protocols such as FAST Transmission Control Protocol (TCP) promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP Reno derivatives that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper, we report, analyse and discuss some recent proposals in the literature to improve the dynamic behaviour of delay-based congestion control algorithms, FAST in particular. The coexistence of sources reacting differently to congestion, the identification of congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： Packet loss Solutions Error measure control protocol Transmission control protocol Tritolyl Phosphates computer algorithms tactical command post

来源：评论

学校读者我要写书评

暂无评论

BASIC ARRAY THEORY

引用

PROCEEDINGS OF THE IEEE 1992年第1期80卷 127-140页

作者： KUMMER, WH W.H. Kummer Inc. Santa Monica CA

This paper outlines basic antenna array theory with major emphasis on pattern analysis and synthesis for periodic linear and planar arrays, phased arrays, and conformal arrays. Extension is made to synthesis techniques which use computer algorithms. These include arbitrary side lobe control, shaped beams, and phase-only null steering. The subjects of random errors and phased array quantization errors are outlined.

关键词： antenna array theory antenna arrays antenna radiation patterns antenna theory arbitrary sidelobe control computer algorithms conformal arrays errors pattern analysis phase-only null steering phased array quantization errors phased arrays planar arrays random errors shaped beams synthesis techniques

来源：评论

学校读者我要写书评

暂无评论

New automatic forward and backward blind sources separation algorithms for noise reduction and speech enhancement

引用

computerS & ELECTRICAL ENGINEERING 2014年第7期40卷 2072-2088页

作者： Djendi, Mohamed Zoulikha, Meriem Univ Blida 1 Signal Proc & Image Lab LATSI Blida 09000 Algeria

In this paper, we consider the speech enhancement problem in a moving car through a blind source separation (BSS) scheme involving two spaced microphones. The forward and backward blind source separation structures often use manual voice activity detector (MVAD) systems to control the adaptation of the separating adaptive filters. In this paper, we propose two new automatic voice activity detector (AVAD) systems that allow adapting the original forward and backward BSS structures automatically. The proposed AVAD systems are based on the use of the forward BSS structure to estimate the optimal values of the separating adaptive filters step-sizes. Moreover, the new proposed algorithms are stable and could be used even in very noisy conditions. Intensive experiments are carried out with these two new proposed algorithms to validate their good performances in speech enhancement and noise reduction applications. The presented experiments are based on the system mismatch, the cepstral distance and the output signal-to-noise ratio criteria evaluations. The obtained results show the good performances of the proposed algorithms in comparison with their original versions, where manual VAD systems are used. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： SIGNAL denoising BLIND source separation ADAPTIVE filters computer algorithms SIGNAL-to-noise ratio

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithms for real-time computing systems admitting simulation models

引用

PROGRAMMING AND computer SOFTWARE 2013年第5期39卷 255-267页

作者： Kostenko, V. A. Moscow MV Lomonosov State Univ Fac Computat Math & Cybernet Moscow 119992 Russia

A major requirement imposed on the operation of a real-time computing (RTC) system is that the deadlines for the operation of application programs must be met. The violation of an operational deadline leads to a failure of an RTC system. In this context, the problem arises of ensuring the required accuracy of estimating the execution time of application programs. An approach is developed for the design of iterative scheduling algorithms in which the execution times of application programs are estimated using simulation models with a different degree of detail, which ensures the required accuracy of estimating the execution time of programs. The approach can be used to design iterative algorithms of the following classes: genetic, evolutionary, simulated annealing, random-search, and locally optimal algorithms.

关键词： computer scheduling computer algorithms REAL-time computing computer simulation APPLICATION software ITERATIVE methods (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

Observer Evaluation of a Metal Artifact Reduction Algorithm Applied to Head and Neck Cone Beam Computed Tomographic Images

引用

INTERNATIONAL JOURNAL OF RADIATION ONCOLOGY BIOLOGY PHYSICS 2016年第4期96卷 897-904页

作者： Korpics, Mark Surucu, Murat Mescioglu, Ibrahim Alite, Fiori Block, Alec M. Choi, Mehee Emami, Bahman Harkenrider, Matthew M. Solanki, Abhishek A. Roeske, John C. Loyola Univ Med Ctr Dept Radiat Oncol 2160 S First Ave Maywood IL 60153 USA

Purpose and Objectives: To quantify, through an observer study, the reduction in metal artifacts on cone beam computed tomographic (CBCT) images using a projection-interpolation algorithm, on images containing metal artifacts from dental fillings and implants in patients treated for head and neck (H&N) cancer. Methods and Materials: An interpolation-substitution algorithm was applied to H&N CBCT images containing metal artifacts from dental fillings and implants. Image quality with respect to metal artifacts was evaluated subjectively and objectively. First, 6 independent radiation oncologists were asked to rank randomly sorted blinded images (before and after metal artifact reduction) using a 5-point rating scale (1 = severe artifacts;5 = no artifacts). Second, the standard deviation of different regions of interest (ROI) within each image was calculated and compared with the mean rating scores. Results: The interpolation-substitution technique successfully reduced metal artifacts in 70% of the cases. From a total of 60 images from 15 H&N cancer patients undergoing image guided radiation therapy, the mean rating score on the uncorrected images was 2.3 +/- 1.1, versus 3.3 +/- 1.0 for the corrected images. The mean difference in ranking score between uncorrected and corrected images was 1.0 (95% confidence interval: 0.9-1.2, P<.05). The standard deviation of each ROI significantly decreased after artifact reduction (P<.01). Moreover, a negative correlation between the mean rating score for each image and the standard deviation of the oral cavity and bilateral cheeks was observed. Conclusion: The interpolation-substitution algorithm is efficient and effective for reducing metal artifacts caused by dental fillings and implants on CBCT images, as demonstrated by the statistically significant increase in observer image quality ranking and by the decrease in ROI standard deviation between uncorrected and corrected images. (C) 2016 Elsevier Inc. All rights reserved.

关键词： HEAD & neck cancer diagnosis COMPUTED tomography computer algorithms THREE-dimensional imaging IMAGE quality analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：