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

IEEE International Conference on Computer Vision (ICCV)

作者： Yoeruek, Erdem Vidal, Rene Johns Hopkins Univ Ctr Imaging Sci Baltimore MD 21218 USA

ISBN: (纸本)9781479930227

We propose a new and efficient method for 3D object localization and fine-grained 3D pose estimation from a single 2D image. Our approach follows the classical paradigm of matching a 3D model to the 2D observations. Our first contribution is a 3D object model composed of a set of 3D edge primitives learned from 2D object blueprints, which can be viewed as a 3D generalization of HOG features. This model is used to define a matching cost obtained by applying a rigid-body transformation to the 3D object model, projecting it onto the image plane, and matching the projected model to HOG features extracted from the input image. Our second contribution is a very efficient branch-and-bound algorithm for finding the 3D pose that maximizes the matching score. For this, 3D integral images of quantized HOGs are employed to evaluate in constant time the maximum attainable matching scores of individual model primitives. We applied our method to three different datasets of cars and achieved promising results with testing times as low as less than half a second.

关键词： 3D Localization 3D Pose Estimation 3D Wireframe Model Blueprints branch and bound algorithm Model Matching wire-drawing machine Model matching branch and bound algorithms pose estimation Three Dimensions image plane TESTING TIME two dimentional images

来源：评论

学校读者我要写书评

暂无评论

A Synchronized Model for Crash Prediction and Resource Allocation to Prioritize Highway Safety Improvement Projects

引用

Procedia - Social and Behavioral Sciences 2013年 104卷 992-1001页

作者： Sabyasachee Mishra Assistant Professor 3815 Central Avenue Department of Civil Engineering University of Memphis Memphis TN 38152 USA

Urban intersections are key locations of traffic crashes that contribute significantly to the economic losses. Safety management process undertaken by most states in the United States (U.S), is often referred to as the hazard elimination program which consists of three steps: (1) selections of hazardous locations, (candidate locations) where safety improvements are warranted, (2) development of countermeasures for potential reduction of crashes, (3) allocation of resources among the independent candidate locations in conformance to budgetary and other constraints. Often these three steps are independently considered with very limited detail on each step in the state planning agencies. This paper presents a simultaneous model which predicts the occurrence of crashes and allocates resources by maximizing benefits subjected to budget and other constraints. The analysis is carried out for a planning period of five years. The crash prediction is analysed as a negative binomial model. The resource allocation model is solved using branch and bound algorithm. Prediction and allocation is conducted simultaneously to achieve realistic results rather than analysing both steps independently. The allocation model further prioritizes the projects to be implemented to optimally distribute funds to maximize benefits. Model results reveal that the proposed approach can be used as a tool for resource allocation on highway safety projects for urban intersections.

关键词： Negative Binomial model branch and bound algorithm Resource allocation

来源：评论

学校读者我要写书评

暂无评论

ON THE SUBOPTIMAL SOLUTIONS USING THE ADAPTIVE branch and bound algorithm FOR FEATURE SELECTION

ON THE SUBOPTIMAL SOLUTIONS USING THE ADAPTIVE BRANCH AND BO...

引用

6th International Conference on Wavelet Analysis and Pattern Recognition

作者： Nakariyakul, Songyot Thammasat Univ Dept Elect & Comp Engn Ampher Khlongluang 12120 Pathumthani Thailand

ISBN: (纸本)9781424422388

The branch and bound algorithm is an optimal feature selection method that is well-known for its computational efficiency. The recently developed adaptive branch and bound algorithm has been shown to be several times faster than other versions of the branch and bound algorithm. If the optimality of the algorithm is allowed to be compromised, we can further improve the search speed by employing the look-ahead search strategy to eliminate many solutions deemed to be suboptimal early in the search. We investigate the effects of this scheme on the computational cost and suboptimal solutions obtained using the adaptive branch and bound algorithm and compare them with those using the basic branch and bound algorithm. Our experimental results for two different databases demonstrate that by setting the look-ahead parameter to an appropriate value, we can significantly reduce the search time of the adaptive branch and bound algorithm while retaining its optimal solutions.

关键词： branch and bound algorithm Dimensionality reduction Feature selection Optimal subset search Suboptimal solutions

来源：评论

学校读者我要写书评

暂无评论

Self-control of the time complexity of a constraint satisfaction problem solver program

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第12期85卷 2697-2706页

作者： Eracar, Yoenet A. Kokar, Mieczyslaw M. Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA Northeastern Univ Dept Mech & Ind Engn Boston MA 02115 USA

This paper presents the self-controlling software paradigm and reports on its use to control the branch and bound based constraint satisfaction problem solving algorithm. In this paradigm, an algorithm is first conceptualized as a dynamical system and then a feedback control loop is added to control its behavior. The loop includes a Quality of Service component that assesses the performance of the algorithm during its run time and a controller that adjusts the parameters of the algorithm in order to achieve the control goal. Although other approaches - generally termed as "self-*" - make use of control loops, this use is limited to the structure of the software system, rather than to its behavior and its dynamics. This paper advocates the analysis of dynamics of any program with control loops. The self-controlling software paradigm is evaluated on two different NP-hard constraint satisfaction and optimization problems. The results of the evaluation show an improvement in the performance due to the added control loop for both of the tested constraint satisfaction problems. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Self-controlling software Constraint satisfaction problem branch and bound algorithm PID controller Job scheduling problem Fixture design problem

来源：评论

学校读者我要写书评

暂无评论

Three-Dimensional Resonant Hopping Strategies and the Jupiter Magnetospheric Orbiter

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2012年第1期35卷 340-344页

作者： Campagnola, Stefano Kawakatsu, Yasuhiro Japan Aerosp Explorat Agcy Inst Space & Astronaut Sci Chuo Ku Sagamihara Kanagawa 2525210 Japan

This Note studies 3-D-resonant hopping, showing that the Tisserand constant is the main problem parameter. Some new analytical formulas and the 3-D Tisserand graph, which are the first main results, are developed to support the design of resonant hopping transfers. The formulas are implemented in a branch-and-bound algorithm for the computation of resonant hopping transfers. All the feasible solutions for a specific choice of boundary condition are computed in just a few minutes, despite the high dimensionality of the solution space, which grows exponentially with the number of gravity assists. The algorithm and the computation of the solution space are the second main results of the Note, and they are used for the trajectory design of JAXA's JMO.

关键词： Pericenter Callisto Jupiter Ganymede Orbiter Japan Aerospace Exploration Agency branch and bound algorithm Spacecraft Trajectories Gravity Assist Trajectories

来源：评论

学校读者我要写书评

暂无评论

Application of Paths Information in Network Design Problem

引用

JOURNAL OF TRANSPORTATION ENGINEERING 2012年第7期138卷 863-870页

作者： Izadpanah, Pedram Aashtiani, Hedayat Z. McMaster Univ Dept Civil Engn Hamilton ON L8S 4L8 Canada Sharif Univ Technol Dept Civil Engn Tehran Iran

In a discrete network design problem, an optimal subset is chosen from a set of proposed link additions to an existing road network in order to minimize the total cost of users. The problem has been called as a complex issue in the transportation planning literature. The main source of complexity is that the problem is a bilevel program in which the lower-level program is a traffic assignment problem. In this paper, a path-based traffic assignment problem is used as the lower-level problem. The path-based algorithms not only provide the link-flow solution, but also the useful path-flow solution (path information) that may be required or used in certain applications, such as network design problem. To solve a network design problem, the traffic assignment problem will need to be solved many times. The main objective of this paper is to expedite the solution of the network design problem by initializing traffic assignment problems with path sets already found in previously performed traffic assignments. The rationale behind this idea is that the addition of a number of proposed links to a network will not change the used paths for the majority of origin-destination (OD) pairs. In this paper, the network design problem is solved by a branch and bound algorithm for a small network and a relatively large network. It is shown that the proposed method is capable of reducing the computation time to one-fifth in real-size networks. DOI: 10.1061/(ASCE)TE.1943-5436.0000389. (C) 2012 American Society of Civil Engineers.

关键词： Network design Traffic assignment Path branch and bound algorithm Integer programming

来源：评论

学校读者我要写书评

暂无评论

Two-machine flow shop total tardiness scheduling problem with deteriorating jobs

引用

APPLIED MATHEMATICAL MODELLING 2012年第11期36卷 5418-5426页

作者： Bank, M. Ghomi, S. M. T. Fatemi Jolai, F. Behnamian, J. Amirkabir Univ Technol Dept Ind Engn Tehran *** Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran

This paper studies a two-machine scheduling problem with deteriorating jobs which their processing times depend on their waiting time. We develop a branch and bound algorithm to minimize the total tardiness criteria. A lower bound, several dominance properties and an initial upper bound derived from a heuristic algorithm are used to increase the speed of branch and bound algorithm and decrease its required memory space. Computational results are presented to evaluate effectiveness and efficiency of the algorithms. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Flow shop Scheduling Deteriorating job branch and bound algorithm Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

The multi-resource agent bottleneck generalised assignment problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第2期50卷 309-324页

作者： Karsu, Ozlem Azizoglu, Meral Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey

In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we define a tabu search algorithm and alpha approximation algorithm. Our computational results have revealed that both algorithms can find high quality solutions to large sized instances very quickly. To the best of our knowledge our study is the first reported attempt to solve the problem. We hope our study fills an important gap in the literature.

关键词： bottleneck generalised assignment problem multi periods branch and bound algorithm linear programming relaxation

来源：评论

学校读者我要写书评

暂无评论

Global optimization algorithm for a generalized linear multiplicative programming

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2012年第1-2期40卷 551-568页

作者： Jiao, Hongwei Liu, Sanyang Chen, Yongqiang Xidian Univ Dept Math Sci Xian 710071 Peoples R China Henan Inst Sci & Technol Dept Math Xinxiang 453003 Peoples R China Henan Normal Univ Coll Math & Informat Xinxiang 453007 Peoples R China

This article present a branch and bound algorithm for globally solving generalized linear multiplicative programming problems with coefficients. The main computation involve solving a sequence of linear relaxation programming problems, and the algorithm economizes the required computations by conducting the branch and bound search in R-p, rather than in R-n, where p is the number of rank and n is the dimension of decision variables. The proposed algorithm will be convergent to the global optimal solution by means of the subsequent solutions of the series of linear relaxation programming problems. Numerical results are given to show the feasibility and effectiveness of the proposed algorithm.

关键词： Multiplicative programming Global optimization branch and bound algorithm Deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms with Restrictive Input Constrains on Genome Exemplar Distance Caculation

Algorithms with Restrictive Input Constrains on Genome Exemp...

引用

International Conference on Business, Economics, and Financial Sciences, Management (BEFM 2011)

作者： Chen, Yehong Zhu, Daming Tang, Weifang Chen, Qi Zhang, Jie Shandong Polytech Univ Informat Sch Jinan Shandong Peoples R China Shandong Univ Comp Sci & Technol Inst Jinan Shandong Peoples R China

ISBN: (纸本)9783642279652

The comparative study of gene order rearrangements has been restricted to the case when the genes in one genome are homologous to at most one gene in the other genome. Sankoff (1999) proposes the estimation of true exemplars, a selection of one gene from each gene family in both genomes such that the distance between the resulting exemplar strings is minimized, which is called exemplar distance. David Bryant in his paper show that the calculation of the exemplar distance between two genomes is NP-hard for both the signed reversals distance and the breakpoint distance, even with quite restrictive conditions on the input. Limite the input according to strictive conditions used by David Bryants' proof, here we provides two algorithm to solve problem under some input conditions, one is branch and bound algorithms. the other is Greedy algorithm for both distances. different DATA can use different algorithm to get better performance.

关键词： Exemplar Distance NP-HARD branch and bound algorithm Greedy algorithm vertex cover problem Set cover

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：