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

Dual-energy X-ray images enhancement based on a discrete wavelet transform fusion technique for luggage inspection at airport

学校读者我要写书评

暂无评论

Dual-energy X-ray images enhancement based on a discrete wav...

International Conference on Image and Signal Processing and their Applications (ISPA)

作者： Mohamed CHOUAI Mostafa MERAH José-Luis SANCHO-GOMEZ Malika MIMI Signals and systems laboratory Mostaganem University Mostaganem Algeria TDAM Research Group (Data Processing and Machine Learning) Information and Communications Universidad Politécnica de Cartagena Cartagena Murcia Spain

ISBN: (纸本)9781728131573

Billions of suitcases and other belongings are checked every year in airport X-ray systems around the world. This process is very important because it involves the detection of potentially dangerous objects such as firearms and explosives. However, the image quality of x-ray screening devices needed to be improved. This article attempts to make a contribution to the field of improving the radiographic image of luggage by proposing a complete procedure for improving the image quality based on discrete wavelet transform (DWT) image fusion followed by a noise suppression operation to obtain a good improvement of the fusion result. This article also presents a comparative analysis of five well-known image enhancement algorithm models, the evaluation is done using the Peak Signal-to-Noise Ratio (PSNR). The results show that the proposed system provides promising results compared to the other techniques tested, which proves that the proposed approach is very appropriate and recommended for easy / fast identification of threatening objects in a manual or automatic manner.

关键词： Transport security Baggage control Image enhancement Fusion Wavelet transform Fusion reactions image enhancement Fusion, biological Image quality wavelet transforms Airports FUSION fusion (melting) discrete wavelet transform image enhancement algorithm Peak signal-to-noise ratio Firearms double energy

RIDNet: Recursive information Distillation Network for Color Image Denoising

学校读者我要写书评

暂无评论

RIDNet: Recursive Information Distillation Network for Color...

International Conference on Computer Vision Workshops (ICCV Workshops)

作者： Shengkai Zhuo Zhi Jin Wenbin Zou Xia Li Shenzhen University China College of Electronics and Information Engineering Shenzhen Key Laboratory of Advanced Machine Learning and Applications Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Intelligent Systems Engineering Sun Yat-sen University Sun Yat-sen University China

ISBN: (数字)9781728150239

ISBN: (纸本)9781728150246

Color image denoising is more challenging in effectiveness when compared with the grayscale one. Most existing methods play a certain role in efficiency or flexibility, but lack robustness to handle various noise levels, especially the severe noise. This keeps them away from being practically applied to color image denoising. To address this issue, we propose a robust CNN based denoiser, namely Recursive information Distillation Network (RIDNet), to handle the denoising task at high noise levels. The proposed RIDNet simultaneously keeps the efficiency and flexibility by introducing the information distillation module and merging a tunable noise level map as the input, respectively. Experiment results on Additive White Gaussian Noise (AWGN) images demonstrate that our method outperforms most of the state-of-the-art color image denoisers.

关键词： Noise reduction Noise level Color Training AWGN Noise measurement Task analysis

Variational Policy Gradient Method for Reinforcement learning with General Utilities

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhang, Junyu Koppel, Alec Bedi, Amrit Singh Szepesvari, Csaba Wang, Mengdi Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Computational and Information Sciences Directorate US Army Research Laboratory AdelphiMD20783 United States Department of Computer Science DeepMind University of Alberta PrincetonNJ08544 United States Department of Electrical Engineering Center for Statistics and Machine Learning Princeton University Deepmind PrincetonNJ08544 United States

In recent years, reinforcement learning (RL) systems with general goals beyond a cumulative sum of rewards have gained traction, such as in constrained problems, exploration, and acting upon prior experiences. In this paper, we consider policy optimization in Markov Decision Problems, where the objective is a general concave utility function of the state-action occupancy measure, which subsumes several of the aforementioned examples as special cases. Such generality invalidates the Bellman equation. As this means that dynamic programming no longer works, we focus on direct policy search. Analogously to the Policy Gradient Theorem Sutton et al. (2000) available for RL with cumulative rewards, we derive a new Variational Policy Gradient Theorem for RL with general utilities, which establishes that the parametrized policy gradient may be obtained as the solution of a stochastic saddle point problem involving the Fenchel dual of the utility function. We develop a variational Monte Carlo gradient estimation algorithm to compute the policy gradient based on sample paths. We prove that the variational policy gradient scheme converges globally to the optimal policy for the general objective, though the optimization problem is nonconvex. We also establish its rate of convergence of the order O(1/t) by exploiting the hidden convexity of the problem, and proves that it converges exponentially when the problem admits hidden strong convexity. Our analysis applies to the standard RL problem with cumulative rewards as a special case, in which case our result improves the available convergence rate. Copyright © 2020, The Authors. All rights reserved.

关键词： Dynamic programming

Optimizing network resource allocation with graph pointer neural network in large-scale AI systems

学校读者我要写书评

暂无评论

Digital Communications and Networks 2024年

作者： Peiying Zhang Yilin Li Athanasios V. Vasilakos Konstantin Igorevich Kostromitin Jianyong Zhang Mohsen Guizani Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250013 China Department of Networks and Communications College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University P.O. Box 1982 Dammam 31441 Saudi Arabia Department of Physics of Nanoscale Systems South Ural State University Chelyabinsk 454080 the Russian Federation Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Key Lab of All Optical Network and Advanced Telecommunication of EMC Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi 999041 United Arab Emirates

For increasingly complex communication demands of large-scale AI communication systems, the Space-Air-Ground Integrated Network (SAGIN) better caters to demands but also raises concerns about resource scarcity and diversity. This paper innovatively combines Graph Pointer Neural Networks (GPNN) and Reinforcement learning (RL) to enhance resource allocation efficiency. The method leverages the advantages of GPNN in handling graph data and RL in optimizing decisions in dynamic environments. It also targets the optimization goal of maximizing resource allocation while minimizing deployment latency. This paper begins by modeling SAGIN and elucidating the SAGIN logical architecture based on Software-defined Networking (SDN). Subsequently, it introduces an SFC deployment algorithm aimed at joint optimization of resource allocation and latency. The algorithm leverages GPNN and RL to deploy virtual nodes and links, with the goal of optimizing resource allocation and deployment latency. Experiment findings conclusively demonstrate that the efficacy of proposed algorithm in effectively weighing limited heterogeneous resources and minimum mapping delay. Notably, when compared to three other SFC mapping algorithms MLRL, NFVdeep, and RL, the proposed algorithm consistently outperforms them, with an average improvement of 10.17% in long-term average reward/cost, 11.21% in link resource utilization ratio, 15.34% in node resource utilization ratio, and 16.38% in acceptance ratio.

关键词： Space-air-ground integrated network Topological structure Reinforcement learning Service function chain Graph pointer neural network

Strategic priorities for transformative progress in advancing biology with proteomics and artificial intelligence

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Yingying Jun, A. Liu, Zhiwei Sun, Rui Qian, Liujia Payne, Samuel H. Bittremieux, Wout Ralser, Markus Li, Chen Chen, Yi Dong, Zhen Perez-Riverol, Yasset Khan, Asif Sander, Chris Aebersold, Ruedi Vizcaíno, Juan Antonio Krieger, Jonathan R. Yao, Jianhua Wen, Han Zhang, Linfeng Zhu, Yunping Xuan, Yue Sun, Benjamin Boyang Qiao, Liang Hermjakob, Henning Tang, Haixu Gao, Huanhuan Deng, Yamin Zhong, Qing Chang, Cheng Bandeira, Nuno Li, Ming Weinan, E. Sun, Siqi Yang, Yuedong Omenn, Gilbert S. Zhang, Yue Xu, Ping Fu, Yan Liu, Xiaowen Overall, Christopher M. Wang, Yu Deutsch, Eric W. Chen, Luonan Cox, Jürgen Demichev, Vadim He, Fuchu Huang, Jiaxing Jin, Huilin Liu, Chao Li, Nan Luan, Zhongzhi Song, Jiangning Yu, Kaicheng Wan, Wanggen Wang, Tai Zhang, Kang Zhang, Le Bell, Peter A. Mann, Matthias Zhang, Bing Guo, Tiannan Affiliated Hangzhou First People’s Hospital State Key Laboratory of Medical Proteomics School of Medicine Westlake University Zhejiang Province Hangzhou China Westlake Center for Intelligent Proteomics Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Province Hangzhou China Biology Department Brigham Young University ProvoUT84602 United States Department of Computer Science University of Antwerp Antwerp2020 Belgium Department of Biochemistry CharitéUniversitätsmedizin Berlin Berlin Germany Biomedicine Discovery Institute Department of Biochemistry and Molecular Biology Monash University MelbourneVICVIC 3800 Australia Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Harvard Medical School Ludwig Center at Harvard United States Harvard Medical School Broad Institute Ludwig Center at Harvard Dana-Farber Cancer Institute United States Department of Biology Institute of Molecular Systems Biology ETH Zürich Zürich Switzerland Bruker Ltd. MiltonONL9T 6P4 Canada AI for Life Sciences Lab Tencent Shenzhen518057 China State Key Laboratory of Medical Proteomics AI for Science Institute Beijing100080 China Beijing Institute of Lifeomics Beijing102206 China Thermo Fisher Scientific GmbH Hanna-Kunath Str. 11 Bremen28199 Germany Informatics and Predictive Sciences Research Bristol Myers Squibb United States Department of Chemistry Fudan University Songhu Road 2005 Shanghai200438 China Department of Computer Science Luddy School of Informatics Computing and Engineering Indiana University IN47408 United States ProCan® Children’s Medical Research Institute Faculty of Medicine and Health The University of Sydney WestmeadNSW Australia La Jolla CA United States Central China Institute of Artificial Intelligence University of Waterloo Canada AI for Science Institute Center for Machine Learning Research School of Mathematical Sciences Peking University China Research Institute of Intelligent Complex Systems Fudan U

Artificial intelligence (AI) is transforming scientific research, including proteomics. Advances in mass spectrometry (MS)-based proteomics data quality, diversity, and scale, combined with groundbreaking AI techniques, are unlocking new challenges and opportunities in biological discovery. Here, we highlight key areas where AI is driving innovation, from data analysis to new biological insights. These include developing an AI-friendly ecosystem for proteomics data generation, sharing, and analysis;improving peptide and protein identification and quantification;characterizing protein-protein interactions and protein complexes;advancing spatial and perturbation proteomics;integrating multi-omics data;and ultimately enabling AI-empowered virtual cells. © 2025, CC BY.

关键词： Biotic

Uplink-downlink duality between multiple-access and broadcast channels with compressing relays

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Liang Liu, Ya-Feng Patil, Pratik Yu, Wei the Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong the State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Edward S. Rogers Sr. Department of Electrical and Computer Engineering the University of Toronto the Department of Statistics and Data Science and the Machine Learning Department Carnegie Mellon University PittsburghPA15213 United States The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto 10 King’s College Road TorontoONM5S3G4 Canada

—Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers;the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink. Copyright © 2020, The Authors. All rights reserved.

关键词： Linear programming

Invariant Attribute Profiles: A Spatial-Frequency Joint Feature Extractor for Hyperspectral Image Classification

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hong, Danfeng Wu, Xin Ghamisi, Pedram Chanussot, Jocelyn Yokoya, Naoto Zhu, Xiao Xiang Wessling82234 Germany Munich80333 Germany School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Fractional Signals and Systems Beijing100081 China Machine Learning Group Exploration Division Helmholtz Institute Freiberg for Resource Technology Helmholtz-Zentrum Dresden-Rossendorf Freiberg09599 Germany Univ. Grenoble Alpes INRIA CNRS Grenoble INP LJK GrenobleF-38000 France Faculty of Electrical and Computer Engineering University of Iceland Reykjavik101 Iceland RIKEN Tokyo103-0027 Japan

This is the pre-acceptance version, to read the final version please go to IEEE Transactions on Geoscience and Remote Sensing on IEEE Xplore. Up to the present, an enormous number of advanced techniques have been developed to enhance and extract the spatially semantic information in hyperspectral image processing and analysis. However, locally semantic change, such as scene composition, relative position between objects, spectral variability caused by illumination, atmospheric effects, and material mixture, has been less frequently investigated in modeling spatial information. As a consequence, identifying the same materials from spatially different scenes or positions can be difficult. In this paper, we propose a solution to address this issue by locally extracting invariant features from hyperspectral imagery (HSI) in both spatial and frequency domains, using a method called invariant attribute profiles (IAPs). IAPs extract the spatial invariant features by exploiting isotropic filter banks or convolutional kernels on HSI and spatial aggregation techniques (e.g., superpixel segmentation) in the Cartesian coordinate system. Furthermore, they model invariant behaviors (e.g., shift, rotation) by the means of a continuous histogram of oriented gradients constructed in a Fourier polar coordinate. This yields a combinatorial representation of spatial-frequency invariant features with application to HSI classification. Extensive experiments conducted on three promising hyperspectral datasets (Houston2013 and Houston2018) demonstrate the superiority and effectiveness of the proposed IAP method in comparison with several state-of-the-art profile-related techniques. The codes will be Copyright © 2019, The Authors. All rights reserved.

关键词： Remote sensing

Why is the Winner the Best?

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

Random occlusion-recovery for person re-identification

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wu, Di Zhang, Kun Cheng, Fei Zhao, Yang Liu, Qi Yuan, Chang-An Huang, De-Shuang Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University School of Computing Edinburgh Napier University 10 Colinton Road EdinburghEH10 5DT United Kingdom Science Computing and Intelligent Information Processing of Guang Xi Higher Education Key Laboratory Guangxi Teachers Education University Nanning Guangxi530001 China Beijing E-Hualu Info Technology Co. Ltd Beijing China

As a basic task of multi-camera surveillance system, person re-identification aims to re-identify a query pedestrian observed from non-overlapping multiple cameras or across different time with a single camera. Recently, deep learning-based person re-identification models have achieved great success in many benchmarks. However, these supervised models require a large amount of labeled image data, and the process of manual labeling spends much manpower and time. In this study, we introduce a method to automatically synthesize labeled person images and adopt them to increase the sample number per identity for person re-identification datasets. To be specific, we use block rectangles to randomly occlude pedestrian images. Then, a generative adversarial network (GAN) model is proposed to use paired occluded and original images to synthesize the de-occluded images that similar but not identical to the original image. Afterwards, we annotate the de-occluded images with the same labels of their corresponding raw images and use them to augment the number of samples per identity. Finally, we use the augmented datasets to train baseline model. The experiment results on CUHK03, Market-1501 and DukeMTMC-reID datasets show that the effectiveness of the proposed method. Copyright © 2018, The Authors. All rights reserved.

关键词： Generative adversarial networks