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

Model-aided Deep Neural Network for Source Number Detection

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yang, Yuwen Gao, Feifei Qian, Cheng Liao, Guisheng Department of Automation Tsinghua University Beijing100084 China Department of Electrical and Computer Engineering University of Virginia CharlottesvilleVA22904 United States National Laboratory of Radar Signal Processing Collaborative Innovation Center of Information Sensing Understanding Xidian University Xi’an710071 China

—Source number detection is a critical problem in array signal processing. Conventional model-driven methods e.g., Akaikes information criterion (AIC) and minimum description length (MDL), suffer from severe performance degradation when the number of snapshots is small or the signal-to-noise ratio (SNR) is low. In this paper, we exploit the model-aided based deep neural network (DNN) to estimate the source number. Specifically, we first propose the eigenvalue based regression network (ERNet) and classification network (ECNet) to estimate the number of non-coherent sources, where the eigenvalues of the received signal covariance matrix and the source number are used as the input and the supervise label of the networks, respectively. Then, we extend the ERNet and ECNet for estimating the number of coherent sources, where the forward-backward spatial smoothing (FBSS) scheme is adopted to improve the performance of ERNet and ECNet. Numerical results demonstrate the outstanding performance of ERNet and ECNet over the conventional AIC and MDL methods as well as their excellent generalization capability, which also shows their great potentials for practical applications. Copyright © 2019, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

Detection of Fusarium wilt on Phalaenopsis stem base region using band selection techniques 38

学校读者我要写书评

暂无评论

Detection of Fusarium wilt on Phalaenopsis stem base region ...

38th Annual IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2018

作者： Lee, Meng-Chueh Ma, Kenneth-Yeonkong Ouyang, Yen-Chieh Ou-Yang, Mang Guo, Horng-Yuh Liu, Tsang-Sen Chen, Hsian-Min Wu, Chao-Cheng Chang, Chgein-I Department of Communications Engineering National Chung Hsing University Taichung Taiwan Department of Electrical Engineering National Chung Hsing University Taichung Taiwan National Chiao-Tung University Department of Electrical and Computer Engineering Hsinchu City Taiwan Taiwan Agriculture Research Institute Nan-Tou Taiwan Center for Quantitative Imaging in Medicine Taichung Veterans General Hospital Taichung Taiwan Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County BaltimoreMD21250 United States

ISBN: (纸本)9781538671504

Phalaenopsis is a significant agriculture product with high economic value in Taiwan. However, the fusarium wilt causes Phalaenopsis leaves turning yellow, thinning, water loss, and finally died. This paper presents an emerging method to detect fusarium wilt on Phalaenopsis stem base. In order to build the detection models, the hyperspectral databases are generated form two statues of Phalaenopsis samples, which are health and disease sample. We applied band selection (BS) processing base on band prioritization (BP) and band de-correlation (BD) to extract the significant bands and eliminate the redundant bands. Then, three algorithms were used, orthogonal subspace projection (OSP), constrain energy minimization (CEM), and support vector machine (SVM) to detect the fusarium wilt. © 2018 IEEE

关键词： Diseases Hyperspectral imaging Support vector machines Agriculture Databases Entropy

A Rate-Distortion Approach to Caching

学校读者我要写书评

暂无评论

A Rate-Distortion Approach to Caching

作者： Timo, Roy Bidokhti, Shirin Saeedi Wigger, Michele Geiger, Bernhard C. Ericsson ResearchTorshamnsgatan Stockholm23164 80 Sweden Department of Electrical Engineering Stanford University StanfordCA94305 United States Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA19104 United States Communications and Electronics Department Telecom ParisTech Paris75634 France Institute for Communications Engineering Technical University of Munich Munich80333 Germany Signal Processing and Speech Communication Laboratory Graz University of Technology Graz8010 Austria

In this paper, we consider a lossy single-user caching problem with correlated sources. We first describe the fundamental interplay between the source correlations, the capacity of the user's cache, the user's reconstruction distortion requirements, and the final delivery-phase (compression) rate. We then illustrate this interplay using a multivariate Gaussian source example and a binary symmetric source example. To fully explore the effect of the user's distortion requirements, we formulate the caching problem using f-separable distortion functions recently introduce by Shkel and Verdú. The class of f-separable distortion functions includes separable distortion functions as a special case, and our analysis covers both the expected-and excess-distortion settings in detail. We also determine what 'common information' should be placed in the cache, and what information should be transmitted during the delivery phase. To this end, two new common-information measures are introduced for caching, and their relationship to the common-information measures of Wyner, Gács, and Körner is discussed in detail. © 1963-2012 IEEE.

关键词： signal distortion

Subspace Support Vector Data Description

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Sohrab, Fahad Raitoharju, Jenni Gabbouj, Moncef Iosifidis, Alexandros Laboratory of Signal Processing Tampere University of Technology Finland Department of Engineering Electrical and Computer Engineering Aarhus University Denmark

This paper proposes a novel method for solving one-class classification problems. The proposed approach, namely Subspace Support Vector Data Description, maps the data to a subspace that is optimized for one-class classification. In that feature space, the optimal hypersphere enclosing the target class is then determined. The method iteratively optimizes the data mapping along with data description in order to define a compact class representation in a low-dimensional feature space. We provide both linear and non-linear mappings for the proposed method. Experiments on 14 publicly available datasets indicate that the proposed Subspace Support Vector Data Description provides better performance compared to baselines and other recently proposed one-class classification methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Data description

Joint active and passive beamforming for intelligent reflecting surface-assisted massive MIMO systems

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Li, Xingjian Fang, Jun Gao, Feifei Li, Hongbin National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China Chengdu611731 China Institute of Information Processing Department of Automation Tsinghua University Beijing100084 China Department of Electrical and Computer Engineering Stevens Institute of Technology HobokenNJ07030 United States

In this paper, we study the problem of joint active and passive beamforming for intelligent reflecting surface (IRS)assisted massive MIMO systems, where multiple IRSs equipped with a large number of passive elements are deployed to assist a base station (BS) to simultaneously serve a small number of single-antenna users in the same time-frequency resource. Our objective is to maximize the minimum signal to interference plus noise (SINR) at users by jointly optimizing the transmit precoding vector at the BS and phase shift parameters at IRSs. We show that an interesting automatic interference cancelation (AIC) property holds asymptotically as the number of passive elements approaches infinity, i.e., when an IRS is optimally tuned to serve a certain user, this IRS will become interference-free to other users. By utilizing this property, the max-min problem can be converted into an IRS-user association problem, where the objective is to determine which IRSs are assigned for each user. An exhaustive search scheme and a greedy search scheme are proposed to solve the IRS-user association problem. Our theoretical analysis reveals that our proposed solution attains an SINR that scales quadratically with the number of reflecting elements. Also, our theoretical result suggests that even with a moderate number of active antennas at the BS, a massive MIMO like gain can be achieved by increasing the number of passive reflecting elements, thus significantly reducing the energy consumption at the BS. Simulation results are provided to corroborate our theoretical results and to illustrate the effectiveness of our proposed solution. Copyright © 2019, The Authors. All rights reserved.

关键词： MIMO systems

Understanding metric-related pitfalls in image analysis validation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Reinke, Annika Tizabi, Minu D. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Kavur, A. Emre Rädsch, Tim Sudre, Carole H. Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Buettner, Florian Cardoso, M. Jorge Cheplygina, Veronika Chen, Jianxu Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kleesiek, Jens Kofler, Florian Kooi, Thijs Kopp-Schneider, Annette Kozubek, Michal Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Riegler, Michael A. Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. van Calster, Ben Varoquaux, Gaël Yaniv, Ziv R. Jäger, Paul F. Maier-Hein, Lena Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg A Partnership Between DKFZ University Medical Center Heidelberg Germany Heidelberg Division of Medical Image Computing Germany Heidelberg Division of Intelligent Medical Systems Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montreal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Leuven Belgium partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany and Frankfurt Cancer Insititute Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for Statistics in Medicine University of Oxford Oxford United Kingdom Center for Biomedical In

Validation metrics are key for tracking scientific progress and bridging the current chasm between artificial intelligence (AI) research and its translation into practice. However, increasing evidence shows that particularly in image analysis, metrics are often chosen inadequately. While taking into account the individual strengths, weaknesses, and limitations of validation metrics is a critical prerequisite to making educated choices, the relevant knowledge is currently scattered and poorly accessible to individual researchers. Based on a multi-stage Delphi process conducted by a multidisciplinary expert consortium as well as extensive community feedback, the present work provides the first reliable and comprehensive common point of access to information on pitfalls related to validation metrics in image analysis. While focused on biomedical image analysis, the addressed pitfalls generalize across application domains and are categorized according to a newly created, domain-agnostic taxonomy. The work serves to enhance global comprehension of a key topic in image analysis validation. © 2023, CC BY.

关键词： computer vision

OCTAVA: An open-source toolbox for quantitative analysis of optical coherence tomography angiography images

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Untracht, Gavrielle R. Matos, Rolando Dikaios, Nikolaos Bapir, Mariam Durrani, Abdullah K. Butsabong, Teemapron Campagnolo, Paola Sampson, David D. Heiss, Christian Sampson, Danuta M. Optical+Biomedical Engineering Laboratory School of Electrical Electronic and Computer Engineering The University of Western Australia 35 Stirling Highway PerthWA6009 Australia Surrey Biophotonics Advanced Technology Institute School of Physics School of Biosciences and Medicine University of Surrey Surrey GuildfordGU2 7XH United Kingdom Department of Biochemical Sciences Department of Clinical and Experimental Medicine School of Biosciences and Medicine University of Surrey Surrey GuildfordGU2 7XH United Kingdom Mathematics Research Center Academy of Athens Athens106 79 Greece Surrey and Sussex Healthcare NHS Trust East Surrey Hospital Surrey RedhillRH1 5RH United Kingdom Surrey Biophotonics Centre for Vision Speech and Signal Processing School of Biosciences and Medicine The University of Surrey GuildfordGU2 7XH United Kingdom

Optical coherence tomography angiography (OCTA) performs non-invasive visualization and characterization of microvasculature in research and clinical applications mainly in ophthalmology and dermatology. A wide variety of instruments, imaging protocols, processing methods and metrics have been used to describe the microvasculature, such that comparing different study outcomes is currently not feasible. With the goal of contributing to standardization of OCTA data analysis, we report a user-friendly, open-source toolbox, OCTAVA (OCTA Vascular Analyzer), to automate the pre-processing, segmentation, and quantitative analysis of en face OCTA maximum intensity projection images in a standardized workflow. We present each analysis step, including optimization of filtering and choice of segmentation algorithm, and definition of metrics. We perform quantitative analysis of OCTA images from different commercial and non-commercial instruments and samples and show OCTAVA can accurately and reproducibly determine metrics for characterization of microvasculature. Wide adoption could enable studies and aggregation of data on a scale sufficient to develop reliable microvascular biomarkers for early detection, and to guide treatment, of microvascular disease. © 2021, CC BY-NC-SA.

关键词： Optical tomography

Accuracy improvement in range measurements of short-range FSK radars

学校读者我要写书评

暂无评论

Accuracy improvement in range measurements of short-range FS...

2018 IEEE MTT-S International Wireless Symposium, IWS 2018

作者： Munoz-Ferreras, Jose-Maria Wang, Jing Zhou, Tianyi Gomez-Garcia, Roberto Li, Changzhi Ran, Lixin Department of Signal Theory and Communications University of Alcalá Alcalá de Henares Madrid28871 Spain Department of Electrical and Computer Engineering Texas Tech University LubbockTX79409 United States Laboratory of Applied Research on Electromagnetics Zhejiang University Hangzhou310027 China

ISBN: (纸本)9781538663462

Frequency-shift-keying (FSK) radars are used to measure the absolute range and radial speed of multiple moving targets with different velocities in short-range scenarios. The range is calculated from a well-known formula that depends on the phase difference of the in-phase/quadrature (I/Q) components associated with the two time-multiplexed transmitted tones. From a signal perspective, this work demonstrates that an additional novel term in the equation must be compensated to gain enhanced range accuracy in the measurements. This may facilitate the exploitation of longer waveform periods, leading to a relaxation in the stringent locking-time requirements currently imposed on the phase-locked loops of the signal-generation blocks in FSK radars. Moreover, detailed simulation examples for multiple moving targets are addressed. The obtained results validate the theoretical framework and the proposed computationally-efficient compensation algorithm for improved absolute-range-measurement accuracy in FSK radars. © 2018 IEEE.

关键词： Radar measurement

Granular Computing: An Augmented Scheme of Degranulation Through a Modified Partition Matrix

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Xu, Kaijie Pedrycz, Witold Li, Zhiwu Xing, Mengdao School of Electro-Mechanical Engineering Xidian University Xi’an710071 China Department of remote sensing science and technology School of Electronic Engineering Xidian University Xi’an710071 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2V4 Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia Institute of Systems Engineering Macau University of Science and Technology Macau999078 China National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China Collaborative Innovation Center of Information Sensing and Understanding Xidian University Xi’an710071 China National Key Laboratory of Microwave Imaging Technology Institute of Electronics Chinese Academy of Sciences Beijing100190 China

As an important technology in artificial intelligence Granular Computing (GrC) has emerged as a new multi-disciplinary paradigm and received much attention in recent years. Information granules forming an abstract and efficient characterization of large volumes of numeric data have been considered as the fundamental constructs of GrC. By generating centroids (prototypes) and partition matrix, fuzzy clustering is a commonly encountered way of information granulation. As a reverse process of granulation, degranulation involves data reconstruction completed on a basis of the granular representatives (decoding information granules into numeric data). Previous studies have shown that there is a relationship between the reconstruction error and the performance of the granulation process. Typically, the lower the degranulation error is, the better performance of granulation process becomes. However, the existing methods of degranulation usually cannot restore the original numeric data, which is one of the important reasons behind the occurrence of the reconstruction error. To enhance the quality of reconstruction (degranulation), in this study, we develop an augmented scheme through modifying the partition matrix. By proposing the augmented scheme, we dwell on a novel collection of granulation-degranulation mechanisms. In the constructed approach, the prototypes can be expressed as the product of the dataset matrix and the partition matrix. Then, in the degranulation process, the reconstructed numeric data can be decomposed into the product of the partition matrix and the matrix of prototypes. Both the granulation and degranulation are regarded as generalized rotation between the data subspace and the prototype subspace with the partition matrix and the fuzzification factor. By modifying the partition matrix, the new partition matrix is constructed through a series of matrix operations. We offer a thorough analysis of the developed scheme. Copyright © 2020, The Authors. Al

关键词： Granulation