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

A hierarchical algorithm for vehicle license plate localization

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第2期77卷 2771-2790页

作者： Rashedi, Esmat Nezamabadi-pour, Hossein Grad Univ Adv technol Dept Elect Engn POB 76315-117 Kerman Iran Shahid Bahonar Univ Kerman Dept Elect Engn Kerman Iran

Traffic car images suffer immensely from various degrading factors that make it hard to localize license plates. Each license plate localization (LPL) method has its own advantages and disadvantages to extract plates in the images under different circumstances. To have the benefits of different methods, our proposed solution is to employ a combination of four methods including a method based on cascade classifiers and local binary pattern (LBP) features, an edge-based method, a color-based method, and a contrast-based method. Considering the computational complexity, the methods are ordered on the basis of their chances for success. The order of the methods and the parameters are set experimentally in different conditions: day, night, and twilight. Furthermore, to find the plates rapidly, an algorithm is proposed to refine regions of interest (ROIs) and remove unwanted regions. The algorithm is applied in a real automated transport system for plate identification/recognition and tested with 4000 vehicle images taken from a three-lane dual carriageway with a central barrier in the different illumination situations with six cameras. The results are promising in a large database of moving car images. The car license plates have been correctly extracted in 3938 input images (98.45%). The results show that the proposed system is robust for moving cars in outdoor and under different illumination conditions.

关键词： License plate localization Cascade classifiers hierarchical algorithm Texture features Integral image

来源：评论

学校读者我要写书评

暂无评论

Gossip-based distributed hierarchical algorithm for multi-cluster constrained optimisation

引用

IET CONTROL THEORY AND APPLICATIONS 2019年第15期13卷 2346-2355页

作者： Li, Da-Kuo Shi, Chong-Xiao Yang, Guang-Hong Northeastern Univ Coll Informat Sci & Engn Shenyang 110004 Liaoning Peoples R China Northeastern Univ Minist Educ Key Lab Integrated Automat Proc Ind Shenyang 110004 Peoples R China

This study develops a gossip-based distributed hierarchical algorithm to solve the constrained convex optimisation problem over a multi-cluster network. Different from the existing works with incremental communication approach, a gossip protocol is applied to achieve inter-cluster information exchange. At each iteration, only two neighbour clusters are randomly woken up to exchange their new updates while others keep their latest information, which relaxes the restrictions on the inter-cluster communication topology. Technically, to investigate the intra-cluster consensus, a new analysing approach is exploited and some different techniques including the non-expansiveness of projection operator and the supermartingale convergence results are employed, based on which it is proved that estimates of all agents in the multi-cluster network jointly converge to the optimal solution with probability one. A numerical example on constrained lasso regression is provided to validate the theoretical results.

关键词： protocols regression analysis convex programming optimisation graph theory distributed algorithms probability wireless sensor networks pattern clustering convergence gossip-based hierarchical algorithm multicluster constrained optimisation constrained convex optimisation problem multicluster network existing works incremental communication approach gossip protocol inter-cluster information exchange neighbour clusters latest information inter-cluster communication topology intra-cluster consensus analysing approach different techniques constrained lasso regression

来源：评论

学校读者我要写书评

暂无评论

Parameter extraction for on-chip interconnects by double-image Green's function method combined with hierarchical algorithm

引用

IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES 2005年第7期53卷 2416-2423页

作者： Dai, WL Li, ZF Mao, JF Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China

A novel double-image Green's function approach combined with the hierarchical algorithm is proposed to compute the frequency-dependent capacitance and conductance for the on-chip transmission lines and interconnects embedded in Multiple SiO2 layers of the general CMOS process. The effect of a protective layer and lossy silicon substrate layer of the CMOS process are considered in the four-layer structure deduced by the equivalent dielectric-constant approach whose adaptability is further proven in this paper. This double-image Green's function approach is fast convergent with the increasing order of reflections and transmissions, which is further accelerated by the hierarchical algorithm for computation of the Green's function rapidly. Moreover, the proposed method avoids the computation of bound charges on the dielectric interfaces. The frequency-dependent capacitance and conductance gained from the proposed method are shown to be in good agreement with the data obtained by other relevant methods.

关键词： CMOS process double-image Green's function method equivalent dielectric-constant approach frequency-dependent parameter extraction hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

hierarchical algorithm of composite element containing drainage holes

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING 2010年第12期26卷 1856-1867页

作者： Chen, Sheng-Hong Qin, Nan Xu, Gui-Sheng Shahrour, Isam Wuhan Univ State Key Lab Water Resources & Hydropower Engn S Wuhan 430072 Hubei Peoples R China N China Elect Power Univ Res Inst Water Resources & Hydroelect Engn Beijing 102206 Peoples R China Lille Univ Sci & Technol UMR 8107 Lab Mech Lille F-59656 Villeneuve Dascq France

The hierarchical composite element algorithm is developed for drainage holes in rock masses. The composite elements containing drainage hole segments have definite sets of hydraulic potentials defined at their nodes. By the variational principle the governing equation for the solution of the nodal hydraulic potentials can be formulated. To deal with the complicated seepage pattern in the composite elements containing drainage hole segments, hierarchical shape functions are introduced. The method and algorithm have been implemented in the program. A comparative study using the finite element (FE) method with fine mesh and the composite element method (CEM) with simple mesh for pressure well problem has been carried out. The results show that as the upgrade of the shape function order, the calculation accuracy of the CEM can be improved even with a coarse mesh. The restraints of the drainage holes on the composite element mesh generation are therefore further reduced by the algorithm proposed in this paper. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： composite element method rock drainage hole hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

A hierarchical algorithm for Clustering Extremist Web Pages

A Hierarchical Algorithm for Clustering Extremist Web Pages

引用

International Conference on Advances in Social Network Analysis and Mining (ASONAM)

作者： Qi, Xingqin Christensen, Kyle Duval, Robert Fuller, Edgar Spahiu, Arian Wu, Qin Zhang, Cun-Quan West Virginia Univ Dept Math Morgantown WV 26506 USA West Virginia Univ Dept Polit Sci Morgantown WV 26506 USA Columbus State Univ Dept Polit Sci Columbus GA USA

ISBN: (纸本)9780769541389

Extremist political movements have proliferated on the web in recent years due to the advent of minimal publication costs coupled with near universal access, resulting in what appears to be an abundance of groups that hover on the fringe of many socially divisive issues. Whether white-supremacist, neo-Nazi, anti-abortion, black separatist, radical Christian, animal rights, or violent environmentalists, all have found a home (and voice) on the Web. These groups form social networks whose ties are predicated primarily on shared political goals. Little is known about these groups, their interconnections, their animosities, and most importantly, their growth and development and studies such as the Dark Web Project, while considering domestic extremists, have focused primarily on international terrorist groups. Yet here in the US, there has been a complex social dynamic unfolding as well. While left-wing radicalism declined throughout the 80s and 90s, right wing hate groups began to flourish. Today, the web offers a place for any brand of extremism, but little is understood about their current growth and development. While there is much to gain from in-depth studies of the content provided by these sites, there is also a surprising amount of information contained in their online network structure as manifested in links between and among these web sites. Our research follows the idea that much can be known about you by the company you keep. In this paper, we propose an approach to measure the intrinsic relationships (i.e., similarities) of a set of extremist web pages. In this model, the web presence of a group is thought of as a node in a social network and the links between these pages are the ties between groups. This approach takes the bi-directional hyperlink structure of web pages and, based on similarity scores, applies an effective multi-membership clustering algorithm known as the quasi clique merger method to cluster these web pages using a derived hierarchical

关键词： Dark Web project Web pages Web services animosities bi-directional hyperlink structure extremist political movements hierarchical algorithm interconnections interconnections international terrorist groups left-wing radicalism multimembership clustering algorithm online network structure politics publication costs quasi clique merger method right wing hate groups shared political goals social networking (online) social networks socially divisive issues statistical analysis terrorism universal access web sites

来源：评论

学校读者我要写书评

暂无评论

A novel hierarchical algorithm for intra-ONU scheduling in an ethernet passive optical network - art. no. 60220W

A novel hierarchical algorithm for intra-ONU scheduling in a...

引用

Conference on Architectures, Management, and Applications III

作者： Chen, JJ Chen, B He, SL Zhejiang Univ Joint Lab Opt Commun Ctr Opt & Electromagnet Res Hangzhou 310027 Peoples R China

ISBN: (纸本)0819460532

The quality of service (QoS) requirements of end users and services are totally different, and thus the multi-oriented (user-oriented and service-oriented) scheduling for access networks based on a remote scheduling system especially for EPONs is desired to replace the single-oriented (user-oriented or service-oriented) scheduling. In this paper we introduce a novel hierarchical algorithm of intra-ONU scheduling for multi-oriented QoS, which can guarantee both the priority of the differentiated services and the fairness of the different users. Numerical results have shown that our overall scheduling algorithm can fulfill various requirements of delay and throughput for the transmission of multimedia traffic for each end user.

关键词： ethernet passive optical network (EPON) intra-ONU scheduling quality of service (QoS) hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Study and improvement on hierarchical algorithm of association rule

Study and improvement on hierarchical algorithm of associati...

引用

Conference on Data Mining and Knowledge Discovery - Theory, Tools, and Technology IV

作者： Zhong, L Xia, HX Yuan, JL Wuhan Univ Technol Dept Comp Wuhan 430070 Peoples R China

ISBN: (纸本)0819444804

This paper introduces the problem of data mining association rules. We adopt the iterative method to enlarge the size of the item set gradually and describe the hierarchical algorithm in detail. The hierarchical algorithm produces a larger provisional sets based on the obtained frequent item sets and make sure that those provisional sets which will never be frequent item set are ignored under the premise of the known information. Finally, an improving algorithm by decreasing the times of scanning databases is proposed. It's an improving algorithm which is to combine the last several procedures of iteration into a single scan of the database D. Mainly because that the more backwards the iterative processes approach the end, the less the provisional sets are there.

关键词： data mining association rule hierarchical algorithm frequency degree confidence degree

来源：评论

学校读者我要写书评

暂无评论

Using of a hierarchical algorithm Based on Chebyshev-Hermite Functions for Analytical Device Signals Processing 21

Using of a Hierarchical Algorithm Based on Chebyshev-Hermite...

引用

21st International Conference on Complex Systems - Control and Modeling Problems (CSCMP)

作者： Sayfullin, Raukhat Bochkarev, Andrew Samara State Tech Univ Samara Russia

ISBN: (纸本)9781728167008

The paper deals with a development of an analytical device's signal processing algorithms based on decomposition signals into the coefficients of the basis of orthogonal functions. The Chebyshev-Hermite functions are used as decomposition basis. Two different algorithms (traditional and hierarchical) for decomposition analytical device's signal are described. The traditional one is used to obtain coefficients of decomposition of the analytical device's signal in chosen basis with selected number of basis functions. The hierarchical one is used to obtain decomposition coefficient first with only zero-order basis function, then compute the difference between signal and its copy reconstructed by just obtained decomposition coefficient. Further, the described procedure is repeated for computed earlier difference with first-order basis function and so on, until the difference is below the selected value. The main goal of the current paper is to compare the hierarchical approach with the traditional one in terms of accuracy and computation time.

关键词： encoding analytical device signal processing Chebyshev-Hermite functions signal decomposition hierarchical algorithm residual dispersion computing time

来源：评论

学校读者我要写书评

暂无评论

A hierarchical selection algorithm for multiple attributes decision making with large-scale alternatives

引用

INFORMATION SCIENCES 2020年 521卷 195-208页

作者： Zhou, Shenghai Ji, Xun Xu, Xuanhua Jiangxi Univ Finance & Econ Sch Business Adm Nanchang 330032 Jiangxi Peoples R China Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200030 Peoples R China Cent South Univ Sch Business Changsha 410083 Hunan Peoples R China

We consider a multiple attributes decision making (MADM) problem in the presence of large-scale alternatives. Considering the large number of alternatives, we first try to identify if there exist some alternative sets with dominative patterns by determining a hyper-plane. If so, the superior alternatives can be easily selected. We then exploit the "divide and conquer" idea and develop a hierarchical MADM algorithm, which selects locally superior alternatives iteratively until the globally best alternative is reached. Specifically, we first divide the large-scale alternatives into several clusters, and determine the attribute weights at each round. We then select the locally superior alternative in each cluster. The attribute weights are updated based on the former attributes weights after each clustering, so as to remain consistent with the attributes weights throughout the hierarchical MADM algorithm. Finally, numerical experiments are conducted to demonstrate the effectiveness of the proposed method. (C) 2020 Published by Elsevier Inc.

关键词： Multiple attributes decision making Large-scale alternatives Clustering hierarchical algorithm Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Fast Two-Dimensional Parameters Extraction for Interconnects in Arbitrary Dielectric Layers by hierarchical algorithm

Fast Two-Dimensional Parameters Extraction for Interconnects...

引用

2002海峡两岸三地无线科技研讨会

作者： DAI Wen-liang, LI Zheng-fan, LI Fu-hua Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai, 200030, China

Instead of using the total charge Green抯 function method directly to compute the two-dimensional parameters of interconnects in multi-dielectric media, the Appel抯 hierarchical algorithm is adopted to

关键词： boundary element method hierarchical algorithm total charge Green抯 function method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：