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

Phase Clustering Based Modulation Classification algorithm for PSK Signal over Wireless Environment

MOBILE INFORMATION SYSTEMS 2016年第Pt.4期2016卷 2398464.1-2398464.1页

作者： An, Qi He, Zi-shu Li, Hui-yong Li, Yong-hua Univ Elect Sci & Technol China Dept Elect Engn Chengdu Peoples R China Air Force Airborne Acad Guilin Peoples R China

Promptitude and accuracy of signals' non-data-aided (NDA) identification is one of the key technology demands in noncooperative wireless communication network, especially in information monitoring and other electronic warfare. Based on this background, this paper proposes a new signal classifier for phase shift keying (PSK) signals. The periodicity of signal's phase is utilized as the assorted character, with which a fractional function is constituted for phase clustering. Classification and the modulation order of intercepted signals can be achieved through its Fast Fourier Transform (FFT) of the phase clustering function. Frequency offset is also considered for practical conditions. The accuracy of frequency offset estimation has a direct impact on its correction. Thus, a feasible solution is supplied. In this paper, an advanced estimator is proposed for estimating the frequency offset and balancing estimation accuracy and range under low signal-to-noise ratio (SNR) conditions. The influence on estimation range brought by themaximum correlation interval is removed through the differential operation of the autocorrelation of the normalized baseband signal raised to the power of Q. Then, a weighted summation is adopted for an effective frequency estimation. Details of equations and relevant simulations are subsequently presented. The estimator proposed can reach an estimation accuracy of 10(-4) even when the SNR is as low as -15 dB. Analytical formulas are expressed, and the corresponding simulations illustrate that the classifier proposed is more efficient than its counterparts even at low SNRs.

关键词： Key technology Classifiers Phase shift keying baseband signal Supernova remnants sorting algorithm differential operation Fast Fourier transform FREQUENCY SHIFT signals Wireless networks signal to noise ratios PS-K Phase

来源：评论

学校读者我要写书评

暂无评论

Inclusion of topographic variables in an unsupervised classification of satellite imagery

引用

CANADIAN JOURNAL OF REMOTE SENSING 2004年第2期30卷 137-149页

作者： Wulder, MA Franklin, SE White, JC Cranny, MM Dechka, JA Forestry Canada Pacific Forestry Ctr Nat Resources Canada Victoria BC V8Z 1M5 Canada Univ Saskatchewan Dept Geog Saskatoon SK S7N 5A2 Canada

Unsupervised classification has emerged as a common method for mapping the land cover of large areas with satellite data. Typically, clusters generated by an unsupervised algorithm, such as the K-means, are merged and labelled using a combination of manual and automated methods. Topographic shadows found in areas of high relief, particularly in areas with low sun angles, increase the complexity of land cover classification, as a single land cover class may have very different spectral responses in shadowed and nonshadowed areas of the image. Methods to increase classification accuracies in areas with severe topographic shadows are required for Canadian large area land cover mapping projects. In a standard supervised classification, increases in land cover map classification accuracy have been obtained by including topographic attributes as inputs to the classification algorithm. In this study we investigate the potential of such data as a means to increase the accuracy of an unsupervised land cover classification in a high-relief area in central British Columbia, Canada. Separate datasets were used in cluster labelling and accuracy assessment. Four classification trials were completed: (i) using a standard approach without the addition of topographic attributes, (ii) using elevation data as an additional input to (i), (iii) prestratifying the image into shadow and nonshadow areas prior to clustering, and (h) combining the methods used in (ii) and (iii). The latter provided the highest level of overall attribute accuracy at 80.1%, with a 95% confidence interval of 73.6%-88.6%. This is an improvement over the standard approach, which produced an overall attribute accuracy of 68.7%, with a 95% confidence interval of 59.8%-77.6%. We concluded that the prestratification of an image into areas of shadow and nonshadow prior to clustering in conjunction with the use of elevation data as an input to the clustering process is a practical method to increase classification accu

关键词： Educated at mainstream school Taxonomy land cover Confidence intervals images high relief Satellite Imagery clustering process shadows sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Kinetic filtering of [¹⁸F]Fluorothymidine in positron emission tomography studies

引用

PHYSICS IN MEDICINE AND BIOLOGY 2010年第3期55卷 695-709页

作者： Gray, Katherine R. Contractor, Kaiyumars B. Kenny, Laura M. Al-Nahhas, Adil Shousha, Sami Stebbing, Justin Wasan, Harpreet S. Coombes, R. Charles Aboagye, Eric O. Turkheimer, Federico E. Rosso, Lula Univ London Imperial Coll Sci Technol & Med Hammersmith Hosp Ctr Clin Sci MRC London England Univ London Imperial Coll Sci Technol & Med Hammersmith Hosp Fac Med Dept Oncol London England Hammersmith Hosp Imperial Coll NHS Trust Dept Nucl Med London England Charing Cross Hosp Imperial Coll NHS Trust Dept Pathol London England Univ London Imperial Coll Sci Technol & Med Hammersmith Hosp Fac Med Div Neurosci & Mental Hlth London England

[F-18]Fluorothymidine (FLT) is a cell proliferation marker that undergoes predominantly hepatic metabolism and therefore shows a high level of accumulation in the liver, as well as in rapidly proliferating tumours. Furthermore, the tracer's uptake is substantial in other organs including the heart. We present a nonlinear kinetic filtering technique which enhances the visualization of tumours imaged with FLT positron emission tomography (FLT-PET). A classification algorithm to isolate cancerous tissue from healthy organs was developed and validated using 29 scan data from patients with locally advanced or metastatic breast cancer. A large reduction in signal from the liver and heart of 80% was observed following application of the kinetic filter, whilst the majority of signal from both primary tumours and metastases was retained. A scan acquisition time of 60 min has been shown to be sufficient to obtain the necessary kinetic data. The algorithm extends utility of FLT-PET imaging in oncology research.

关键词： sorting algorithm FLT Visualization PROLIFERATION MARKER metastasis Heart PET Scan Cancer Kinetics Tumours Liver Filtration

来源：评论

学校读者我要写书评

暂无评论

PERFECT-SHUFFLE INTERCONNECTED BITONIC SORTER - OPTOELECTRONIC DESIGN

引用

APPLIED OPTICS 1995年第23期34卷 5077-5090页

作者： DESMULLIEZ, MPY TOOLEY, FAP DINES, JAB GRANT, NL GOODWILL, DJ BAILLIE, D WHERRETT, BS FOULK, PW ASHCROFT, S BLACK, P HERIOT WATT UNIV DEPT ELECT & COMP ENGNEDINBURGH EH14 4ASMIDLOTHIANSCOTLAND

The algorithmic, electronic, and optical aspects of the implementation of a perfect-shuffle interconnected bitonic sorter are analyzed. The performance metrics such as the bit output data rate and the power consumption of the system are quantified. The sorting module is designed to demonstrate the parallel nonlocal interconnection of smart-pixel arrays and the use of optical-image control masks in a functioning information processor.

关键词： OPTICAL COMPUTING OPTICAL COMMUNICATIONS PERFECT SHUFFLE OPTICAL SYSTEMS sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Multimode Pareto fronts for design of reconfigurable analogue circuits

引用

ELECTRONICS LETTERS 2009年第2期45卷 95-96页

作者： Castro-Lopez, R. Roca, E. Fernandez, F. V. Univ Seville CSIC IMSE CNM E-41012 Seville Spain

Multimode Pareto-optimal fronts are presented. This is a novel concept that can be key in the design of reconfigurable analogue circuits, because it contains information not only on the trade-offs among the circuit performances, but also on its reconfiguration capabilities. A method to generate the front, relying on evolutionary optimisation, and a general dominance sorting algorithm that guides the optimisation, are both described.

关键词： Circuit optimization analog circuits configurability sorting algorithm Reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Maritime Border Control Multisensor System

引用

IEEE AEROSPACE AND ELECTRONIC SYSTEMS MAGAZINE 2009年第8期24卷 9-15页

作者： Giompapa, S. Gini, F. Farina, A. Graziano, A. Croci, R. DiStefano, R. Univ Pisa Dept Ingn Informaz I-56122 Pisa Italy SELEX Sistemi Integrati I-00131 Rome Italy

This focuses on the classification task performed into a multi-sensor system for the coastal surveillance. The system is composed of two platforms of sensors: a land-based platform equipped with a land based radar, an Automatic Identification System (AIS) and an infrared camera (IR);an airborne platform carrying an airborne radar that can operate in a spotlight Synthetic Aperture Radar (SAR) mode, a video camera, and a second IR camera. The tasks performed by the system are the detection, tracking, identification, and classification of multiple targets, the evaluation of their threat level, and the selection of an intervention on them. The classification algorithm implemented inside the system exploits an analytical approach based on the confusion matrix (CM) of the imaging sensors that belong to the system. Some measures of effectiveness (MoE) of the system are evaluated, considering both cases where an ideal error-free classification process and a non-ideal classification process are performed.

关键词： Cameras sorting algorithm Coastal surveillance Video cameras Platform confusion matrix Measures of effectiveness spotlight synthetic aperture radar Sensors (image) airborne radar automated identification system Sensor systems

来源：评论

学校读者我要写书评

暂无评论

algorithm for Reaction Classification

引用

JOURNAL OF CHEMICAL INFORMATION AND MODELING 2013年第11期53卷 2884-2895页

作者： Kraut, Hans Eiblmaier, Josef Grethe, Guenter Loew, Peter Matuszczyk, Heinz Saller, Heinz InfoChem GmbH D-81241 Munich Bavaria Germany

Reaction classification has important applications, and many approaches to classification have been applied. Our own algorithm tests all maximum common substructures (MCS) between all reactant and product molecules in order to find an atom mapping containing the minimum chemical distance (MCD). Recent publications have concluded that new MCS algorithms need to be compared with existing methods in a reproducible environment, preferably on a generalized test set, yet the number of test sets available is small, and they are not truly representative of the range of reactions that occur in real reaction databases. We have designed a challenging test set of reactions and are making it publicly available and usable with InfoChem's software or other classification algorithms. We supply a representative set of example reactions, grouped into different levels of difficulty, from a large number of reaction databases that chemists actually encounter in practice, in order to demonstrate the basic requirements for a mapping algorithm to detect the reaction centers in a consistent way. We invite the scientific community to contribute to the future extension and improvement of this data set, to achieve the goal of a common standard.

关键词： algorithm reaction classification Reaction centers sorting algorithm Taxonomy REACTION MCS gene algorithms TEST SETS scientific community

来源：评论

学校读者我要写书评

暂无评论

TRAFFIC PATTERN DETECTION IN A PARTIALLY DEPLOYED VEHICULAR AD HOC NETWORK OF VEHICLES

引用

IEEE WIRELESS COMMUNICATIONS 2009年第6期16卷 40-46页

作者： Vaqar, Sayyid A. Basir, Otman Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

Knowledge about traffic conditions on the road play an important role in route planning and avoiding traffic jams. With recent developments in technology, it is possible for vehicles to be equipped with communication and GPS systems. Equipped vehicles on the road can act as nodes to form a vehicular ad hoc network. These nodes can collect information regarding traffic conditions such as position, speed, and direction from other participating nodes. Depending on the number of participating nodes in the ad hoc network, this collected information can provide useful information on driving conditions to the node collecting this information. With proper analysis this information can be used in detecting and/or predicting traffic jam conditions on freeways. In this article the traffic information gathered by a node in an ad hoc network is viewed as a snapshot in time of the current traffic conditions on the road segment. This snapshot is considered as a pattern in time of the current traffic conditions. The pattern. is analyzed using pattern recognition techniques. A weight-of-evidence-based classification algorithm is presented to identify different road traffic conditions. The algorithm is tested using data generated by microscopic modeling of traffic flow for simulation of vehicle or node mobility in ad hoc networks. Test results are presented depicting different percentage levels of vehicles equipped with communication capability.

关键词： vehicle Line of nodes Ad hoc networks sorting algorithm traffic patterns Snapshots Freeway Technology Development route planning Road Traffic Driving Conditions Ganglia traffic congestion Traffic information

来源：评论

学校读者我要写书评

暂无评论

Software Engineering and Scale-Free Networks

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 2009年第4期39卷 845-854页

作者： Wen, Lian Dromey, R. Geoff Kirk, Diana Griffith Univ Software Qual Inst Brisbane Qld 4111 Australia Auckland Univ Technol Auckland 1142 New Zealand

Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the sorting comparison network (SCN). It is found that they both show the same scale-free property under certain conditions as complex networks in other fields. These results suggest that complex-network theory can be a useful approach to the study of software systems. The special properties of SCNs provide a more repeatable and deterministic way to study the evolution and optimization of complex networks. They also suggest that the closer a sorting algorithm is to the theoretical optimal limit, the more its SCN is like a scale-free network. This may also indicate that, to store and retrieve information efficiently, a concept network might need to be scale-free.

关键词： Concept network (CN) scale-free network software engineering sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Reducing Computational Complexity of Gating Procedures Using sorting algorithms

Reducing Computational Complexity of Gating Procedures Using...

引用

International Conference on Information Fusion

作者： Viet Duc Nguyen Tim Claussen Digital Signal Processing and System Theory Christian-Albrechts-Universitat zu Kiel

ISBN: (纸本)9781479902842

Gating is an important part in many data association algorithms, specifically tracking algorithms. Its purpose is the preselection of suitable measurements or observations respectively in order to avoid unlikely measurement-to-track associations. As such, it can be essential for a low computational load. A very common gating method is individual ellipsoidal gating incorporating the Mahalanobis distance. On the one hand it is a reliable gating method used in many different tracking techniques, e.g., the global nearest neighbor method or the Multi-Hypothesis Tracking approach, but on the other hand it can be also very time consuming due to the inversions of covariance matrices related to all the measurement-to-track pairs. In this paper a Gating-by-sorting approach is proposed to accelerate the gating procedure significantly. It uses sorting algorithms to carry out coarse gating followed by a second ellipsoidal gating step. The gating approach is incorporated into a multi-hypothesis tracker and applied to a real radar dataset. Results are obtained by measuring the computational load within tracking processes. They show that the proposed gating algorithm outperforms classical ellipsoidal gating by orders of magnitude.

关键词： sorting algorithm complexity classes nearest neighbor algorithm Primary election data association Inversion tracking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：