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

Band Sampling of Hyperspectral Anomaly Detection in Effective Anomaly Space

IEEE Transactions on Geoscience and Remote Sensing 2024年 62卷 1-29页

作者： Chang, Chein-I Lin, Chien-Yu Hu, Peter Fuming Information and Technology College Dalian116026 China University of Maryland Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering BaltimoreMD21250 United States National Cheng Kung University Department of Electrical Engineering Tainan70101 Taiwan University of Maryland School of Medicine R Adams Cowley Shock Trauma Center Shock Trauma Anesthesia Organized Research Center Department of Anesthesia BaltimoreMD21201 United States

This article investigates four issues, background (BKG) suppression (BS), anomaly detectability, noise effect, and interband correlation reduction (IBCR), which have significant impacts on its performance. Despite that a recently developed effective anomaly space (EAS) was designed to use data sphering (DS) to remove the second-order data statistics characterized by BKG, enhance anomaly detectability, and reduce noise effect, it does not address the IBCR issue. To cope with this issue, this article introduces band sampling (BSam) into EAS to reduce IBCR and further suppress BKG more effectively. By implementing EAS in conjunction with BSam (EAS-BSam), these four issues can be resolved altogether for any arbitrary anomaly detector. It first modifies iterative spectral-spatial hyperspectral anomaly detection (ISSHAD) to develop a new variant of ISSHAD, called iterative spectral-spatial maximal map (ISSMax), and then generalizes ISSMax to EAS-ISSMax, which further enhances anomaly detectability and noise removal. Finally, EAS-BSam is implemented to reduce IBCR. As a result, combining EAS, BSam, and ISSMax yields four versions: EAS-BSam, EAS-ISSMax, BSam-SSMAX, and EAS-BSam-SSMax. Such integration presents a great challenge because all these four versions are derived from different aspects, iterative spectral-spatial feedback process, compressive sensing, and low-rank and sparse matrix decomposition. Experiments demonstrate that EAS-BSam and EAS-BSam-SSMax show their superiority to ISSHAD and many current existing hyperspectral anomaly detection (HAD) methods. © 1980-2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Iterative Gaussian-Laplacian Pyramid Network for Hyperspectral Image Classification

引用

IEEE Transactions on Geoscience and Remote Sensing 2024年 62卷 1-22页

作者： Chang, Chein-I Liang, Chia-Chen Hu, Peter Fuming Information and Technology College Dalian116026 China University of Maryland Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering BaltimoreMD21250 United States National Cheng Kung University Department of Electrical Engineering Tainan70101 Taiwan University of Maryland School of Medicine R Adams Cowley Shock Trauma Center Shock Trauma Anesthesia Organized Research Center Department of Anesthesia BaltimoreMD21201 United States

Gaussian pyramid (GP) is a comm.nly used image coding technique that encodes an image as a pyramid that is stacked by a set of images with Gaussian window-reduced sizes and multiple spatial resolutions. Associated with GP, a Laplacian pyramid (LP) can be also constructed to represent differential images between images in two consecutive layers of GP. Such resulting Gaussian-Laplacian pyramid (GLP) performs data compression in a lossless and lossy manner. A convolutional neural network (CNN) consists of a series of layers concatenated in a feedforward manner where each layer has a convolutional sublayer (CL) and a pooling sublayer (PL). Interestingly, each layer implemented by CL and PL in a CNN can be realized by a single layer in GP in the sense that CL and PL can be carried out by a low-pass Gaussian filter operated as a Gaussian kernel in a single layer of GP. This article develops a new approach to hyperspectral image classification (HSIC), called the GLP network (GLPN), which uses not only GP to realize CNN but also LP to capture differential information between two consecutive layers that CNN cannot. Furthermore, by incorporating an iterative process into GLPN, we can derive an iterative GLPN (IGLPN) that can be considered a companion of a recently developed iterative random training sampling CNN (IRTS-CNN) by replacing CNN with GLPN. Since GLPN can realize CNN in a better way, it is expected that IGLPN will perform better than IRTS-CNN and also significantly reduce computational efficiency compared to IRTS-CNN. © 1980-2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

EEG based stress classification by using difference plots of variational modes and machine learning

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第12期14卷 16347-16360页

作者： Salankar, Nilima Qaisar, Saeed Mian School of Computer Science University of Petroleum and Energy Studies Dehradun India Persistent System Limited IT Park Maharashtra Nagpur India Department of Electrical and Computer Engineering EFfat University Jeddah22332 Saudi Arabia Communication and Signal Processing Lab Energy and Technology Research Center Effat University Jeddah22332 Saudi Arabia

The recent trend in healthcare is to use the automated biomedical signals processing for an augmented and precise diagnosis. In this context, an original approach is presented for categorization of stress and non-stress classes by processing the multichannel Electroencephalogram (EEG) signals. The EEG signals are decomposed by using the "Empirical Mode Decomposition" (EMD) and "Variational Mode Decomposition" (VMD), respectively render the "Intrinsic Mode Functions" (IMFs) and Modes. The Second Order Difference Plots (SODPs) are traced for each IMF and Mode. Shapes of SODPs are used to discriminate the two intended categories. The feature space includes areas, Central Tendency Measures (CTMs) and means of SODPs. It is derived from first 7 IMFs and Modes. The identification of stress and non-stress categories is performed by using the robust machine learning algorithms namely, the Support Vector Machine (SVM), Boosting with Random Forest (RF) and Multilayer Perceptron Neural Network (MLPNN). The applicability is tested by using a publicly available EEG signals dataset, recorded during mental arithmetic test. A detailed evaluation is carried out at the subset, individual channel and lobes wise. Noteworthy highest accuracies of subset wise 99.89%, channel wise 98.89% and lobe wise 99.99% are obtained respectively. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Peak Age of Information under Tandem of Queues

Peak Age of Information under Tandem of Queues

引用

IEEE International Symposium on Information Theory

作者： Ashirwad Sinha Shubhransh Singhvi Praful D. Mankar Harpreet S. Dhillon Signal Processing & Communications Research Center IIIT Hyderabad India Bradley Department of Electrical and Computer Engineering Virginia Tech Blacksburg VA USA

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

This paper considers a comm.nication system where a source sends time-sensitive information to its destination via queues in tandem. We assume that the arrival process as well as the service process (of each server) are memoryless, and each of the servers has no buffer. For this setup, we develop a recursive framework to characterize the mean peak age of information (PAoI) under preemptive and non-preemptive policies with $N$ servers having different service rates. For the preemptive case, the proposed framework also allows to obtain mean age of information (AoI).

关键词： Numerical analysis comm.nication systems Information age Servers Queueing analysis Information theory

来源：评论

学校读者我要写书评

暂无评论

Peak Age of Information under Tandem of Queues

arXiv

引用

arXiv 2024年

作者： Sinha, Ashirwad Singhvi, Shubhransh Mankar, Praful D. Dhillon, Harpreet S. Signal Processing & Communications Research Center IIIT Hyderabad India Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA24061 United States

This paper considers a comm.nication system where a source sends time-sensitive information to its destination via queues in tandem. We assume that the arrival process as well as the service process (of each server) are memoryless, and each of the servers has no buffer. For this setup, we develop a recursive framework to characterize the mean peak age of information (PAoI) under preemptive and non-preemptive policies with N servers having different service rates. For the preemptive case, the proposed framework also allows to obtain mean age of information (AoI). Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

On the Service Rate Region of Reed-Muller Codes

arXiv

引用

arXiv 2025年

作者： Ly, Hoang Soljanin, Emina Lalitha, V. Department of Electrical and Computer Engineering Rutgers The State University of New Jersey PiscatawayNJ08854 United States Signal Processing and Communications Research Center IIIT Hyderabad India

We study the Service Rate Region (SRR) of Reed-Muller (RM) codes in the context of distributed storage systems. The SRR is a convex polytope comprising all achievable data access request rates under a given coding scheme. It represents a critical metric for evaluating system efficiency and scalability. Using the geometric properties of RM codes, we characterize recovery sets for data objects, including their existence, uniqueness, and enumeration. This analysis reveals a connection between recovery sets and minimum-weight codewords in the dual RM code, providing a framework for identifying small recovery sets. Using these results, we derive explicit and tight bounds for the maximal achievable demand for individual data objects, which define the maximal simplex within the service rate region. © 2025, CC BY.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Personalized Multimedia Recomm.ndation Systems Using Higher-Order Tensor Singular-Value-Decomposition

引用

IEEE Transactions on Broadcasting 2024年第1期70卷 148-160页

作者： Chang, Shih Yu Wu, Hsiao-Chun Yan, Kun Chen, Xinjia Huang, Scott Chih-Hao Wu, Yiyan San Jose State University Department of Applied Data Science San JoseCA95192 United States Louisiana State University School of Electrical Engineering and Computer Science Baton RougeLA70803 United States Yuan Ze University Innovation Center for AI Applications Chungli32003 Taiwan Guilin University of Electronic Technology Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing Department of Information and Telecommunication Guilin541004 China Northwestern State University Department of Engineering Technology NatchitochesLA71497 United States National Tsing Hua University Department of Electrical Engineering Hsinchu300 Taiwan Communications Research Centre Canada OttawaK2H 8S2 Canada

Because of rapid growth of multimedia data over the Internet, the infobesity has been emerging in recent years. Many recomm.nder systems (RSs) have been proposed using a variety of techniques, including artificial intelligence, machine learning, statistical analysis, and data mining. Nowadays, E-comm.rce companies such as Amazon, eBay, Netflix, etc. have applied RSs conveniently to provide better customer services than before by enabling customized multimedia-content recomm.ndations. It is well known that classical RSs are almost all based on the user-item attribute matrices. However, this two-fold user-item relationship should be extended to the emerging many-fold relationship among an arbitrary number of attribute groups so that the corresponding new RSs may lead to better performances. Therefore, in this paper, we introduce a novel personalized multimedia recomm.nder system (PMRS) according to our proposed new parallel higher-order tensor singular-value-decomposition (PHOTSVD) algorithm. This PHOTSVD algorithm is capable of accomm.dating an arbitrary number of entities such as social-media channels, users, queries, webpages, etc. in a robust RS. Furthermore, we also investigate the cold start and data bias problems critical to RSs. Finally, we compare the performances of our proposed new PMRS and three other existing tensor-based RSs over realworld data with respect to the well-adopted metric, namely normalized root-mean-square error (NRMSE). Our proposed new PMRS greatly outperforms the other three existing tensor-based RSs in terms of NRMSE. © 1963-12012 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

MN-Net: Speech Enhancement Network via Modeling the Noise

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language processing 2025年 33卷 1208-1219页

作者： Ying Hu Qin Yang Wenbing Wei Li Lin Liang He Zhijian Ou Wenzhong Yang School of Computer Science and Technology Key Laboratory of Signal Detection and Processing Xinjiang University Urumqi China Xinjiang Institute of Electronics Research Shares Company Ltd. Urumqi China Department of Electrical Engineering Tsinghua University Beijing China Beijing National Research Center for information Science and Technology Department of Electronics Tsinghua University Beijing China

Currently, deep learning-based speech enhancement methods generally focus on target speech extraction while neglecting modeling the other sound sources in the mixture. These methods still can't distinguish the target speech from the interference well. In this paper, we present a monaural speech enhancement network via Modeling the Noise (MN-Net), which includes a shared Encoder and three separate Decoders for parallel modeling the magnitude and phase spectrogram of target speech, and the complex spectrogram of noise. Specifically, we propose a Multi-Branch Feature Extractor (MBFE) module to capture the richer contextual information in mixture, and a Spatial Reconstruction Unit (SRU) to remove the redundancy from extracted features. We compared our proposed MN-Net with 18 classical speech enhancement methods on the VoiceBank+DEMAND dataset, and with 9 ones on DNS-Challenge dataset for denoising task, and with 7 ones on the WHAMR! dataset for simultaneous denoising & de-reverberation task. Our proposed MBFE module was applied to two classical speech enhancement methods, DB-AIAT and CMGAN, replacing their DenseBlocks module. The results demonstrate that applying the MBFE module can boost their performances while keeping smaller model size. A series of visualization analysis intuitively verify that modeling the noise can enable the network to distinguish the target speech from noise and other interference more accurately.

关键词： Noise Feature extraction Spectrogram Speech enhancement Decoding Kernel Transformers Noise reduction Data mining Training

来源：评论

学校读者我要写书评

暂无评论

Enhancing Device-Free Gesture Recognition Capability of Mobile comm.nication signals

引用

IEEE Transactions on comm.nications 2025年

作者： Wu, Jingmiao He, Weijie Sun, Kai Huang, Wei Zhang, Haijun Leung, Victor C. M. Inner Mongolia University School of Electronic Information Engineering Inner Mongolia Key Laboratory of Intelligent Communication and Sensing and Signal Processing Hohhot010021 China University of Science and Technology at Beijing Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services Beijing100083 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

Device-free gesture recognition using mobile comm.nication signals is a convenient and efficient technology with broad application prospects in smart homes and human-computer interaction. It utilizes the effect of gestures on surrounding signals to achieve gesture recognition. The cell-specific reference signals (CRS) information can be used to achieve the task in close-range training scenarios. However, when gestures are performed at long-range or in non-training scenarios, the recognition performance will significantly degrade. To enhance device-free gesture recognition capability in arbitrary scenarios, we propose the signal quality enhancement algorithm and the gesture spectrogram construction method to solve this problem. Specifically, we superimpose the CRS information from multiple carriers to improve the gesture signal-to-noise ratio and increase the gesture sensing range. Then, we extract the gesture dynamic components from the CRS information and construct gesture spectrograms to represent scenario-independent gesture motion patterns. Using the gesture spectrogram features, we design a deep network to accomplish the gesture recognition task. We built a prototype system on a software-defined radio platform. Experimental results show that our proposed method can effectively increase the gesture sensing range from 30m² to 228m² and achieve an average recognition accuracy of 82.5% for five types of gestures in arbitrary scenarios. © 1972-2012 IEEE.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Efficient Contextformer: Spatio-Channel Window Attention for Fast Context Modeling in Learned Image Compression

arXiv

引用

arXiv 2023年

作者： Burakhan Koyuncu, A. Jia, Panqi Boev, Atanas Alshina, Elena Steinbach, Eckehard The Technical University of Munich School of Computation Information and Technology Department of Computer Engineering Media Technology Munich80333 Germany The Friedrich-Alexander University Department of Electrical-Electronic-Communication Engineering Multimedia Communications and Signal Processing Erlangen91058 Germany The Huawei Munich Research Center Munich80992 Germany

Entropy estimation is essential for the performance of learned image compression. It has been demonstrated that a transformer-based entropy model is of critical importance for achieving a high compression ratio, however, at the expense of a significant computational effort. In this work, we introduce the Efficient Contextformer (eContextformer) - a computationally efficient transformer-based autoregressive context model for learned image compression. The eContextformer efficiently fuses the patch-wise, checkered, and channel-wise grouping techniques for parallel context modeling, and introduces a shifted window spatio-channel attention mechanism. We explore better training strategies and architectural designs and introduce additional complexity optimizations. During decoding, the proposed optimization techniques dynamically scale the attention span and cache the previous attention computations, drastically reducing the model and runtime complexity. Compared to the non-parallel approach, our proposal has ∼145x lower model complexity and ∼210x faster decoding speed, and achieves higher average bit savings on Kodak, CLIC2020, and Tecnick datasets. Additionally, the low complexity of our context model enables online rate-distortion algorithms, which further improve the compression performance. We achieve up to 17% bitrate savings over the intra coding of Versatile Video Coding (VVC) Test Model (VTM) 16.2 and surpass various learning-based compression models. © 2023, CC BY-NC-ND.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：