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

AADNet: An End-to-End Deep Learning Model for Auditory Attention Decoding

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nguyen, Nhan Duc Thanh Phan, Huy Geirnaert, Simon Mikkelsen, Kaare Kidmose, Preben Center for Ear-EEG Department of Electrical and Computer Engineering Aarhus University Aarhus N8200 Denmark Amazon CambridgeMA02142 United States Stadius Center for Dynamical Systems Signal Processing and Data Analytics KU Leuven and Leuven.AI - KU Leuven institute for AI Kasteelpark Arenberg 10 LeuvenB-3001 Belgium The Department of Neurosciences Research Group ExpORL Herestraat 49 box 721 LeuvenB-3000 Belgium

Auditory attention decoding (AAD) is the process of identifying the attended speech in a multi-talker environment using brain signals, typically recorded through electroencephalography (EEG). Over the past decade, AAD has undergone continuous development, driven by its promising application in neuro-steered hearing devices. Most AAD algorithms are relying on the increase in neural entrainment to the envelope of attended speech, as compared to unattended speech, typically using a two-step approach. First, the algorithm predicts representations of the attended speech signal envelopes;second, it identifies the attended speech by finding the highest correlation between the predictions and the representations of the actual speech signals. In this study, we proposed a novel end-to-end neural network architecture, named AADNet, which combines these two stages into a direct approach to address the AAD problem. We compare the proposed network against the traditional approaches, including linear stimulus reconstruction, canonical correlation analysis, and an alternative non-linear stimulus reconstruction using two different datasets. AADNet shows a significant performance improvement for both subject-specific and subject-independent models. Notably, the average subject-independent classification accuracies from 56.1% to 82.7% with analysis window lengths ranging from 1 to 40 seconds, respectively, show a significantly improved ability to generalize to data from unseen subjects. These results highlight the potential of deep learning models for advancing AAD, with promising implications for future hearing aids, assistive devices, and clinical assessments. © 2024, CC BY-NC-SA.

关键词： Hearing aids

Automatic Modulation Classification of Frequency-Hopping signals Using High-Dimensional Phase Diagrams

学校读者我要写书评

暂无评论

Automatic Modulation Classification of Frequency-Hopping Sig...

2023 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2023

作者： Chen, Qibo Yan, Kun Wu, Hsiao-Chun Chang, Shih Yu Yan, Xiao Wu, Yiyan Chang, Haonan Guilin University of Electronic Technology Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing GuilinGuangxi China Guilin University of Electronic Technology Department of Information and Telecommunication Guangxi Guilin541004 China Louisiana State University School of Electrical Engineering and Computer Science Baton RougeLA70803 United States San Jose State University Department of Applied Data Science San JoseCA95192 United States University of Electronic Science and Technology of China School of Aeronautics and Astronautics Chengdu China Communications Research Centre Canada OttawaK2H 8S2 Canada Haonan Chang Is with Xi'an University Xi'an China

ISBN: (纸本)9798350321524

Automatic modulation recognition for frequency-hopping (FH) signals remains very challenging to researchers due to the signals' time-varying spectral characteristics. In this work, a novel robust automatic modulation recognition scheme is investigated for FH signals using the phase-space topological features represented by the embedded phase diagrams. As such embedded phase diagrams are often high-dimensional, it is necessary to formulate the phase-space features as tensors. In the training process, the phase-space tensor features will be utilized to establish the regression models as linear encoders for the individual modulations. The aforementioned linear encoders are constructed using the support vector machine (SVM);the phase-space feature-tensors of the training signals of all modulations will be projected by their corresponding regression models (or linearly encoded) to produce the representative code-vectors, respectively. In the test stage, the phase-space feature-tensor produced from a test signal will be projected by each individual trained regression model (or linearly encoded) to generate the respective code-vectors. Then, the code-vectors resulting from the test stage will be compared with the representative code-vectors to find which modulation will lead to the smallest Euclidean distance in between and such a modulation will be picked as the modulation type of the test signal. Monte Carlo simulation results have demonstrated that the average recognition accuracy of our proposed new approach is more than 90% when the signal-to-noise ratio is no less than 0 dB for additive white Gaussian noise. © 2023 IEEE.

关键词： Support vector machines

Fluid Antennas-Enabled Multiuser Uplink: A Low-Complexity Gradient Descent for Total Transmit Power Minimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hu, Guojie Wu, Qingqing Xu, Kui Ouyang, Jian Si, Jiangbo Cai, Yunlong Al-Dhahir, Naofal The College of Communication Engineering Rocket Force University of Engineering Xi’an710025 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The College of Communications Engineering The Army of Engineering University Nanjing210007 China The Institute of Signal Processing and Transmission Nanjing University of Posts and Telecommunications Nanjing210003 China The Integrated Service Networks Lab of Xidian University Xi’an710100 China The College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China The Department of Electrical and Computer Engineering The University of Texas at Dallas RichardsonTX75080 United States

We investigate multiuser uplink communications from multiple single-antenna users to a base station (BS), which is equipped with multiple fluid antennas (FAs) and adopts zero-forcing receivers to decode multiple signals. We aim to optimize antennas’ positions at the BS, to minimize the total transmit power of all users subject to the minimum rate requirement. After applying transformations, we show that the problem is equivalent to minimizing the sum of each eigenvalue’s reciprocal of a matrix, which is a function of all antennas’ positions at the BS. Subsequently, the projected gradient descent (PGD) method is utilized to find a locally optimal solution. In particular, different from the latest related work, we exploit the eigenvalue decomposition to successfully derive a closed-form gradient for the PGD, which facilitates the practical implementation greatly. We demonstrate by simulations that via careful optimization for all antennas’ positions in our proposed design, the total transmit power of all users can be decreased significantly as compared to competitive benchmarks. Copyright © 2023, The Authors. All rights reserved.

关键词： Antennas

AI-enabled CT-guided end-to-end quantification of total cardiac activity in 18FDG cardiac PET/CT for detection of cardiac sarcoidosis

学校读者我要写书评

暂无评论

Journal of Nuclear Cardiology 2025年 48卷 102195页

作者： Miller, Robert JH. Shanbhag, Aakash Marcinkiewicz, Anna M. Struble, Helen Gransar, Heidi Hijazi, Waseem Fujito, Hidesato Kransdorf, Evan Kavanagh, Paul Liang, Joanna X. Builoff, Valerie Dey, Damini Berman, Daniel S. Slomka, Piotr J. Departments of Medicine (Division of Artificial Intelligence in Medicine) Imaging and Biomedical Sciences Cedars-Sinai Medical Center Los Angeles CA United States Department of Cardiac Sciences University of Calgary Calgary AB Canada Signal and Image Processing Institute Ming Hsieh Department of Electrical and Computer Engineering University of Southern California Los Angeles CA United States Center of Radiological Diagnostics National Medical Institute of the Ministry of the Interior and Administration Warsaw Poland

Background: [18F]-fluorodeoxyglucose ([18F]FDG) positron emission tomography (PET) plays a central role in diagnosing and managing cardiac sarcoidosis. We propose a fully automated pipeline for quantification of [18F]FDG PET activity using deep learning (DL) segmentation of cardiac chambers on computed tomography (CT) attenuation maps and evaluate quantitative approaches based on this framework. Methods: We included consecutive patients undergoing [18F]FDG PET/CT for suspected cardiac sarcoidosis. DL segmented left atrium, left ventricle (LV), right atrium, right ventricle, aorta, LV myocardium, and lungs from CT attenuation scans. CT-defined anatomical regions were applied to [18F]FDG PET images automatically to quantify target to background ratio (TBR), volume of inflammation (VOI) and cardiometabolic activity (CMA) using full sized and shrunk segmentations. Results: A total of 69 patients were included, with mean age of 56.1 ± 13.4 and cardiac sarcoidosis present in 29 (42 %). CMA had highest prediction performance (area under the receiver operating characteristic curve [AUC] .919, 95 % confidence interval [CI] .858 – .980) followed by VOI (AUC .903, 95 % CI .834 – .971), TBR (AUC .891, 95 % CI .819 – .964), and maximum standardized uptake value (AUC .812, 95 % CI .701 – .923). Abnormal CMA (≥1) had a sensitivity of 100 % and specificity 65 % for cardiac sarcoidosis. Lung quantification was able to identify patients with pulmonary abnormalities. Conclusion: We demonstrate that fully automated volumetric quantification of [18F]FDG PET for cardiac sarcoidosis based on CT attenuation map-derived volumetry is feasible, rapid, and has high prediction performance. This approach provides objective measurements of cardiac inflammation with consistent definition of myocardium and background region. © 2025 American Society of Nuclear Cardiology

关键词： Cardiac sarcoidosis Deep learning Hypermetabolism Positron emission tomography Quantification

Novel Personalized Multimedia Recommendation Systems Using Tensor Singular-Value-Decomposition

学校读者我要写书评

暂无评论

Novel Personalized Multimedia Recommendation Systems Using T...

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Shih Yu Chang Hsiao-Chun Wu Kun Yan Xinjia Chen Yiyan Wu Department of Applied Data Science San Jose State University San Jose CA USA School of Electrical Engineering and Computer Science Louisiana State University Baton Rouge LA USA Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing Guilin University of Electronic Technology Guilin China Department of Information and Telecommunication Guilin University of Electronic Technology Guilin China Department of Engineering Technology Northwestern State University of Louisiana Natchitoches LA USA Communications Research Centre Canada Ottawa ON Canada

Nowadays, multimedia data are often produced by various sources, e.g., Internet of Things (IoT), social media, customer databases, etc. As tremendous multimedia data are produced every day, users or E-commerce customers cannot infer information from such data by themselves and therefore recommender systems have been developed to help users to select the products or services which better fit users’ preferences or requirements. Nonetheless, there exists few works on the incorporation of side information or multiple attributes about items into the design of a more robust recommender system. In this work, we propose a novel approach based on the third-order tensor singular-value-decomposition (T3-SVD) to design new personalized multimedia recommender systems (PMRSs) for internet users. A PMRS can dynamically adjust its recommendation strategy subject to a particular user’s on-line transaction behavior. To evaluate the effectiveness of our proposed PMRS based on T3-SVD, we compare the performances of our proposed new PMRS and two other existing tensor-based recommendation systems over realworld data in terms of normalized root-mean-square error (NRMSE). As a result, our proposed new PMRS greatly outperforms the other two existing systems.

关键词：

Improved track-before-detect method for detecting range-spread targets in generalized Pareto clutter

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第4期62卷 44-46页

作者： Jian XUE Shuwen XU Penglang SHUI National Lab of Radar Signal Processing Collaborative Innovation Center of Information Sensing and UnderstandingXidian University Department of Electrical and Computer Engineering Mcmaster University

Dear editor,High-resolution radars demonstrate a good targetdetection performance, especially for weak targets such as periscopes and small boats [1]. Methods for adaptive detection employed by high-resolution

关键词： TBD Improved track-before-detect method for detecting range-spread targets in generalized Pareto clutter SCR

Weakly-Supervised Semantic Segmentation of Circular-Scan, Synthetic-Aperture-Sonar Imagery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sledge, Isaac J. Byrne, Dominic M. King, Jonathan L. Ostertag, Steven H. Woods, Denton L. Prater, James L. Kennedy, Jermaine L. Marston, Timothy M. Príncipe, José C. The Advanced Signal Processing and Automated Target Recognition Branch Naval Surface Warfare Center Panama CityFL United States The Naval Sea Systems Command United States The Applied Sensing and Processing Branch Naval Surface Warfare Center Panama CityFL United States The Littoral Acoustics and Target Physics Branch Naval Surface Warfare Center Panama CityFL United States The Division Head of the Sensing Sciences and Systems Division Naval Surface Warfare Center Panama CityFL United States The Applied Physics Laboratory University of Washington SeattleWA United States The Department of Electrical and Computer Engineering The Department of Biomedical Engineering University of Florida GainesvilleFL United States The University of Florida United States

We propose a weakly-supervised framework for the semantic segmentation of circular-scan synthetic-aperture-sonar (CSAS) imagery. The first part of our framework is trained in a supervised manner, on image-level labels, to uncover a set of semi-sparse, spatially-discriminative regions in each image. The classification uncertainty of each region is then evaluated. Those areas with the lowest uncertainties are then chosen to be weakly labeled segmentation seeds, at the pixel level, for the second part of the framework. Each of the seed extents are progressively resized according to an unsupervised, information-theoretic loss with structured-prediction regularizers. This reshaping process uses multi-scale, adaptively-weighted features to delineate class-specific transitions in local image content. Content-addressable memories are inserted at various parts of our framework so that it can leverage features from previously seen images to improve segmentation performance for related images. We evaluate our weakly-supervised framework using real-world CSAS imagery that contains over ten seafloor classes and ten target classes. We show that our framework performs comparably to nine fully-supervised deep networks. Our framework also outperforms eleven of the best weakly-supervised deep networks. We achieve state-of-the-art performance when pre-training on natural imagery. The average absolute performance gap to the next-best weakly-supervised network is well over ten percent for both natural imagery and sonar imagery. This gap is found to be statistically significant. © 2024, CC BY.

关键词： Semantic Segmentation

An information-theoretic approach for automatically determining the number of state groups when aggregating markov chains

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sledge, Isaac J. Príncipe, José C. Advanced Signal Processing and Automated Target Recognition Branch Naval Surface Warfare Center Panama City United States Department of Electrical and Computer Engineering University of Florida Department of Biomedical Engineering University of Florida

A fundamental problem when aggregating Markov chains is the specification of the number of state groups. Too few state groups may fail to sufficiently capture the pertinent dynamics of the original, high-order Markov chain. Too many state groups may lead to a non-parsimonious, reduced-order Markov chain whose complexity rivals that of the original. In this paper, we show that an augmented value-of-information-based approach to aggregating Markov chains facilitates the determination of the number of state groups. The optimal state-group count coincides with the case where the complexity of the reduced-order chain is balanced against the mutual dependence between the original- and reduced-order chain dynamics. © 2021, CC BY.

关键词： Information theory

Adapting the Exploration Rate for Value-of-Information-Based Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sledge, Isaac J. Príncipe, José C. Advanced Signal Processing and Automated Target Recognition Branch Naval Surface Warfare Center Panama CityFL United States lab The Naval Sea Systems Command United States Department of Electrical and Computer Engineering The Department of Biomedical Engineering University of Florida GainesvilleFL32611 United States The University of Florida United States

In this paper, we consider the problem of adjusting the exploration rate when using value-of-information-based exploration. We do this by converting the value-of-information optimization into a problem of finding equilibria of a flow for a changing exploration rate. We then develop an efficient pathfollowing scheme for converging to these equilibria and hence uncovering optimal action-selection policies. Under this scheme, the exploration rate is automatically adapted according to the agent’s experiences. Global convergence is theoretically assured. We first evaluate our exploration-rate adaptation on the Nintendo GameBoy games Centipede and Millipede. We demonstrate aspects of the search process, like that it yields a hierarchy of state abstractions. We also show that our approach returns better policies in fewer episodes than conventional search strategies relying on heuristic, annealing-based exploration-rate adjustments. We then illustrate that these trends hold for deep, value-of-information-based agents that learn to play ten simple games and over forty more complicated games for the Nintendo GameBoy system. Performance either near or well above the level of human play is observed. © 2022, CC BY.

关键词： Reinforcement learning