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

Conference on Signal and Data Processing of Small Targets 1997

作者： Wang, H Kirubarajan, T Li, Y BarShalom, Y Univ. of Connecticut (United States)

ISBN: (纸本)0819425850

In this paper we present the development and implementation of a multisensor-multitarget tracking algorithm for large scale air traffic surveillance based on the IMM state estimator combined with a a-dimensional assignment for data association. The algorithm can be used to track a large number of targets from measurements obtained with a large number of radars. The use of the algorithm is illustrated on measurements obtained from 5 FAA radars, which are asynchronous, heterogeneous and geographically distributed over a large area. Both secondary radar data (beacon returns from cooperative targets) as well as primary radar data (skin returns from noncooperative targets) are used. The target IDs from the beacon returns are not used in the data association. The surveillance region includes about 800 targets that exhibit different types of motion. The performance of the IMM estimator is compared with that of the Kalman filter. A number of performance measures that can be used on real data without knowledge of the ground truth are presented for this purpose. It is shown that the IMM estimator performs better than the Kalman filter. The advantage of fusing multisensor data is quantified. It is also shown that the computational requirements in the multisensor case are lower than in single sensor case.

关键词： target tracking estimation multisensor data fusion assignment algorithm IMM estimator 2-D assignment ATC (air traffic control) beacon return skin return

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Networks Relying on Full-Duplex Relays and Mobility-Aware Probabilistic Caching

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2019年第7期67卷 5037-5052页

作者： Tan, Le Thanh Hu, Rose Qingyang Hanzo, Lajos Utah State Univ Dept Elect & Comp Engn Logan UT 84322 USA Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

Joint optimal resource allocation and probabilistic caching design is conceived for device-to-device (D2D) communications in a heterogeneous wireless network (HetNet) relying on full-duplex (FD) relays. In particular, popular contents can be cached at user devices and at relays that are located close to users. A user may request the contents of interest from another user via D2D communications and also from a nearby relay equipped with FD radios. If the requested contents are not found in the buffers of other users/relays within the coverage range, users may opt for connecting to the macro base station (MBS) via a relay by using an FD communication. Furthermore, we propose a beneficial mobility-aware coded caching philosophy for D2D communications in the HetNet considered. Especially, we model the mobility pattern of users as discrete random jumps and exploit coded caching for improving the throughput attained. Subsequently, we develop mathematical models for analyzing the throughput in the presence of edge caching, where both the system-level co-channel interference and the FD self-interference are considered. We circumvent the high complexity of stochastic optimization by developing low-complexity optimization. Finally, numerical results are presented to illustrate the theoretical findings developed in this paper and quantify the throughput gains attained.

关键词： User mobility coded caching particle swarm optimization assignment algorithm full-duplex communications

来源：评论

学校读者我要写书评

暂无评论

Comparison of vehicle re-identification models for trucks based on axle spacing measurements

引用

JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS 2018年第6期22卷 517-529页

作者： Basar, Gulsevi Cetin, Mecit Nichols, Andrew P. Old Dominion Univ Modeling Simulat & Visualizat Engn Dept 132C Kaufman Hall Norfolk VA 23529 USA Old Dominion Univ Civil & Environm Engn Dept Norfolk VA USA Marshall Univ Weisberg Div Engn Huntington WV USA

In previous research, it has been demonstrated that there is enough variation within the truck population in terms of axle spacings and vehicle lengths, which enable anonymous vehicle re-identification between two measurement stations (e.g., two weigh-in-motion (WIM) sites). Matching trucks between two sites can support various applications, such as calibration of WIM equipment and estimation of travel times and origin-destination flows. In this paper, several modeling approaches to solve the re-identification problem are explored including Naive Bayes (NB), Bayesian Models (BM) fitted by mixture models, and the formulation of the re-identification problem as a mathematical assignment problem. In addition, the influence of selecting a similarity measure is evaluated through numerical experiments conducted on real-world data from six pairs of upstream-downstream WIM stations. The results demonstrate that solving the re-identification problem with BMs fit by mixture distributions outperforms solving with NB models, while both are outperformed by the mathematical assignment formulation of the same problem, especially when vehicle-pairs exceeding a high threshold of similarity are matched. In addition, expressing the similarity between measurements from two stations as a percentage difference is found to be relatively more advantageous. For the presented pairs of WIM stations, up to 90% matching accuracy can be achieved when the best combination of re-identification method and similarity measure are implemented, and only those vehicle-pairs exceeding a high threshold of similarity are matched.

关键词： assignment algorithm Bayesian models performance measurement vehicle re-identification weigh-in-motion

来源：评论

学校读者我要写书评

暂无评论

Optimizing the cost function of power series routing algorithm for transparent elastic optical networks

引用

OPTICAL SWITCHING AND NETWORKING 2018年 29卷 57-64页

作者： Cavalcante, M. A. Pereira, H. A. Chaves, D. A. R. Almeida, R. C., Jr. Univ Fed Campina Grande Elect Engn & Informat Ctr Elect Engn Dept Campina Grande Paraiba Brazil Univ Pernambuco Polytech Sch Pernambuco Comp Engn Dept Recife PE Brazil Univ Fed Pernambuco Technol Ctr & Geosci Elect & Syst Dept Photon Grp Recife PE Brazil

In this article, it is investigated the impact of different parameters and which parameters to use by the power series routing methodology adapted for reducing the call request blocking probability in transparent elastic optical networks. Some of the used parameters are specifically related to elastic optical networks, such as: slot contiguity, transmission bit rate and modulation format. The amplified spontaneous emission noise generated by optical amplifiers (booster, in-line and pre-amplifier) as well as the losses and gains observed by optical signals along the lightpaths are considered in our simulations. We verified that, depending on the considered parameters and their quantity, there is a perceivable impact on the network performance in terms of blocking probability of call requests. The results revealed the most important parameters and their combinations that shall be considered by the cost function of the power series routing algorithm in our simulated scenarios of elastic optical networks.

关键词： Amplified spontaneous emission Elastic optical networks Power series routing algorithm Routing, modulation level and spectrum assignment algorithm Signal-to-noise ratio

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cramer-Rao bound for target tracking in clutter

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2005年第4期41卷 1154-1167页

作者： Zhang, X Willett, P Bar-Shalom, Y Univ Connecticut Dept Elect & Comp Engn Storrs CT 06269 USA

Recently, there have been several new results for an old topic, the Cramer-Rao lower bound (CRLB). Specifically, it has been shown that for a wide class of parameter estimation problems (e.g. for objects with deterministic dynamics) the matrix CRLB, with both measurement origin uncertainty (i.e., in the presence of false alarms or random clutter) and measurement noise, is simply that without measurement origin uncertainty times a scalar information reduction factor (IRF). Conversely, there has arisen a neat expression for the CRLB for state estimation of a stochastic dynamic nonlinear system (i.e., objects with a stochastic motion);but this is only valid without measurement origin uncertainty. The present paper can be considered a marriage of the two topics: the clever Riccati-like form from the latter is preserved, but it includes the IRF from the former. The effects of plant and observation dynamics on the CRLB are explored. Further, the CRLB is compared via simulation to two common target tracking algorithms, the probabilistic data association filter (PDAF) and the multi-frame (N-D) assignment algorithm.

关键词： .state estimation parameter estimation alarms CRLB measurement noise assignment algorithm Dynamic Cramer-Rao Bound

来源：评论

学校读者我要写书评

暂无评论

NETWORK FLOW MODELS IN IMAGE-PROCESSING

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1986年第1期37卷 31-34页

作者： TSO, M UNIV MANCHESTER INST SCI & TECHNOLDEPT MATHMANCHESTER M60 1QDLANCSENGLAND

Two problems in image processing are presented: chromosome classification and the construction of cross-sectional images from non-cross-sectional views. Both problems are formulated as network flow models, a type of model generally found in the O.R. setting. This shows the applicability of such O.R. techniques to problems of intelligent information processing.

关键词： assignment algorithm Chromosome Karyotyping Computed Tomography Dynamic Programming Image Reconstruction Transportation Problem

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Optimal Tapered Matching, With Application to Disparities in Survival

引用

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2008年第4期17卷 914-924页

作者： Daniel, Shoshana R. Armstrong, Katrina Silber, Jeffrey H. Rosenbaum, Paul R. Univ Penn Wharton Sch Dept Stat Philadelphia PA 19104 USA Covance Periapproval Serv Inc Conshohocken PA 19428 USA Univ Penn Sch Med Philadelphia PA 19104 USA Childrens Hosp Philadelphia Ctr Outcomes Res Philadelphia PA 19104 USA

In a tapered matched comparison, one group of individuals, called the focal group, is compared to two or more nonoverlapping matched comparison groups constructed from One Population in such a way that Successive comparison groups increasingly resemble the local group. An optimally tapered matching solves two problems simultaneously: it optimally divides the single comparison population into nonoverlapping comparison groups and optimally pairs members of the focal group with members of each comparison group. We Show how to use the optimal assignment algorithm in a new way to solve the optimally tapered matching problem, with implementation ill R. This issue often arises in studies of groups defined by race, gender, or other categorizations such that equitable public policy might require all understanding of the mechanisms that produce disparate outcomes, where certain specific mechanisms would be judged illegitimate, necessitating reform. In particular, we use data from Medicare and the SEER Program of the National Cancer Institute as part of all ongoing study of black-white disparities in survival among women with endometrial cancer.

关键词： assignment algorithm Combinatorial optimization Matched sampling

来源：评论

学校读者我要写书评

暂无评论

Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes

引用

BIOMETRICS 2012年第2期68卷 628-636页

作者： Yang, Dan Small, Dylan S. Silber, Jeffrey H. Rosenbaum, Paul R. Univ Penn Wharton Sch Dept Stat Philadelphia PA 19104 USA

In multivariate matching, fine balance constrains the marginal distributions of a nominal variable in treated and matched control groups to be identical without constraining who is matched to whom. In this way, a fine balance constraint can balance a nominal variable with many levels while focusing efforts on other more important variables when pairing individuals to minimize the total covariate distance within pairs. Fine balance is not always possible;that is, it is a constraint on an optimization problem, but the constraint is not always feasible. We propose a new algorithm that returns a minimum distance finely balanced match when one is feasible, and otherwise minimizes the total distance among all matched samples that minimize the deviation from fine balance. Perhaps we can come very close to fine balance when fine balance is not attainable;moreover, in any event, because our algorithm is guaranteed to come as close as possible to fine balance, the investigator may perform one match, and on that basis judge whether the best attainable balance is adequate or not. We also show how to incorporate an additional constraint. The algorithm is implemented in two similar ways, first as an optimal assignment problem with an augmented distance matrix, second as a minimum cost flow problem in a network. The case of knee surgery in the Obesity and Surgical Outcomes Study motivated the development of this algorithm and is used as an illustration. In that example, 2 of 47 hospitals had too few nonobese patients to permit fine balance for the nominal variable with 47 levels representing the hospital, but our new algorithm came very close to fine balance. Moreover, in that example, there was a shortage of nonobese diabetic patients, and incorporation of an additional constraint forced the match to include all of these nonobese diabetic patients, thereby coming as close as possible to balance for this important but recalcitrant covariate.

关键词： assignment algorithm Fine balance Matching Network optimization Observational study Optimal matching

来源：评论

学校读者我要写书评

暂无评论

NeuroPath2Path: Classification and elastic morphing between neuronal arbors using path-wise similarity

引用

NEUROINFORMATICS 2020年第3期18卷 479-508页

作者： Batabyal, Tamal Condron, Barry Acton, Scott T. Univ Virginia Dept Elect & Comp Engn Charlottesville VA 22908 USA Univ Virginia Dept Biol Charlottesville VA USA Univ Virginia Dept Biomed Engn Charlottesville VA USA

Neuron shape and connectivity affect function. Modern imaging methods have proven successful at extracting morphological information. One potential path to achieve analysis of this morphology is through graph theory. Encoding by graphs enables the use of high throughput informatic methods to extract and infer brain function. However, the application of graph-theoretic methods to neuronal morphology comes with certain challenges in term of complex subgraph matching and the difficulty in computing intermediate shapes in between two imaged temporal samples. Here we report a novel, efficacious graph-theoretic method that rises to the challenges. The morphology of a neuron, which consists of its overall size, global shape, local branch patterns, and cell-specific biophysical properties, can vary significantly with the cell's identity, location, as well as developmental and physiological state. Various algorithms have been developed to customize shape based statistical and graph related features for quantitative analysis of neuromorphology, followed by the classification of neuron cell types using the features. Unlike the classical feature extraction based methods from imaged or 3D reconstructed neurons, we propose a model based on the rooted path decomposition from the soma to the dendrites of a neuron and extract morphological features from each constituent path. We hypothesize that measuring the distance between two neurons can be realized by minimizing the cost of continuously morphing the set of all rooted paths of one neuron to another. To validate this claim, we first establish the correspondence of paths between two neurons using a modified Munkres algorithm. Next, an elastic deformation framework that employs the square root velocity function is established to perform the continuous morphing, which, as an added benefit, provides an effective visualization tool. We experimentally show the efficacy of NeuroPath2Path, NeuroP2P, over the state of the art.

关键词： Neuron morphology assignment algorithm Elastic morphing Tree matching Shape classification Biomedical image analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Matching of an Optimally Chosen Subset in Observational Studies

引用

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2012年第1期21卷 57-71页

作者： Rosenbaum, Paul R. Univ Penn Dept Stat Philadelphia PA 19104 USA

An algorithm is proposed for optimally matching to controls an optimally chosen subset of treated subjects. The algorithm makes three optimal decisions at once: (i) the number of treated subjects to match, (ii) the identity of the treated subjects to match, and (iii) the identity of the controls with whom they are paired. The algorithm finds an optimal assignment for an augmented distance matrix. An example from critical care medicine is considered in detail. An R-workspace is available under "supplemental materials";it can reproduce the matches in the example.

关键词： assignment algorithm Matched sample Network optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：