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

Nuclear norm regularized coding with local position-patch and nonlocal similarity for face hallucination

学校读者我要写书评

暂无评论

Digital Signal processing 2017年 64卷 107-120页

作者： Guangwei Gao Jian Yang Zhihui Lai Pu Huang Jielin Jiang Hao Gao Dong Yue Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing 210023 PR China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou 350121 PR China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 PR China College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 PR China Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing 210094 PR China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 PR China

Learning-based face hallucination methods have received much attention and progress in past few decades. Specially, position-patch based approaches have been proposed to replace the probabilistic graph-based or manifold learning-based ones. As opposed to the existing patch based methods, where the input image patch matrix is converted into vectors before combination coefficients calculation, in this paper, we propose to directly use the image matrix based regression model for combination coefficients computation to preserve the essential structural information of the input patch matrix. For each input low-resolution (LR) patch matrix, its combination coefficients over the training image patch matrices at the same position can be computed. Then the corresponding high-resolution (HR) patch matrix can be obtained with the LR training patches replaced by the corresponding HR ones. The nonlocal self-similarities are finally utilized to further improve the hallucination performance. Various experimental results on standard face databases indicate that our proposed method outperforms some state-of-the-art algorithms in terms of both visual quantity and objective metrics.

关键词： Face hallucination Position-patch Matrix based regression Nuclear norm Nonlocal similarity

Automatic organs' detection in WCE

学校读者我要写书评

暂无评论

Automatic organs' detection in WCE

International Symposium on Artificial Intelligence and Signal processing (AISP)

作者： Omid Haji-Maghsoudi Alireza Talebpour Hamid Soltanian-Zadeh Navid Haji-maghsoodi Department of Radiation Medicine Shahid Beheshti University of Tehran Tehran Iran Radiology Image Analysis Laboratory Henry Ford Hospital Detroit MI USA Control and Intelligent Processing Center of Excellence (CIPCE) School of Electrical and Computer Engineering University of Tehran Tehran Iran Department of Mechatronics Sharif University of Tehran Tehran Iran

Wireless capsule endoscopy (WCE) views the entire gastrointestinal (GI) tract. A main problem associated with this novel device is that too many frames must be reviewed by physicians. Thus it is essential to find an automatic and intelligent method to help physicians. One of the problems in WCE is its difficulty to distinguish among different organ's tissues. So, we introduce two novel algorithms which are able to classify main organs (among esophagus, stomach, small bowel and colon) in WCE's frames. In order to obtain our aim, we use statistic features (Haralick features) and non-statistic features (different diagrams and Gabor filter banks), colored features and non-colored features. Our experimental studies indicate good results that are shown in conclusion.

关键词： Level set Medical services Gabor filters Active contours Wireless communication Optical wavelength conversion Esophagus

GEM: Context-Aware Gaze EstiMation with Visual Search Behavior Matching for Chest Radiograph

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Shaonan Chen, Wenting Liu, Jie Luo, Xiaoling Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University China Department of Electrical Engineering City University of Hong Kong Hong Kong AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Gaze estimation is pivotal in human scene comprehension tasks, particularly in medical diagnostic analysis. Eye-tracking technology facilitates the recording of physicians’ ocular movements during image interpretation, thereby elucidating their visual attention patterns and information-processing strategies. In this paper, we initially define the context-aware gaze estimation problem in medical radiology report settings. To understand the attention allocation and cognitive behavior of radiologists during the medical image interpretation process, we propose a context-aware Gaze EstiMation (GEM) network that utilizes eye gaze data collected from radiologists to simulate their visual search behavior patterns throughout the image interpretation process. It consists of a context-awareness module, visual behavior graph construction, and visual behavior matching. Within the context-awareness module, we achieve intricate multimodal registration by establishing connections between medical reports and images. Subsequently, for a more accurate simulation of genuine visual search behavior patterns, we introduce a visual behavior graph structure, capturing such behavior through high-order relationships (edges) between gaze points (nodes). To maintain the authenticity of visual behavior, we devise a visual behavior-matching approach, adjusting the high-order relationships between them by matching the graph constructed from real and estimated gaze points. Extensive experiments on four publicly available datasets demonstrate the superiority of GEM over existing methods and its strong generalizability, which also provides a new direction for the effective utilization of diverse modalities in medical image interpretation and enhances the interpretability of models in the field of medical imaging. https://***/Tiger-SN/GEM. Copyright © 2024, The Authors. All rights reserved.

关键词： Eye movements

PARTICLE SWARM OPTIMIZATION（PSO）OF POWER ALLOCATION IN COGNITIVE RADIO SYSTEMS WITH INTERFERENCE CONSTRAINTS

学校读者我要写书评

暂无评论

PARTICLE SWARM OPTIMIZATION（PSO）OF POWER ALLOCATION IN COG...

2011 4th IEEE International Conference on Broadband Network and Multimedia Technology

作者： Saeed Motiian Mohammad Aghababaie Hamid Soltanian-Zadeh Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering Colleague of EngineeringUniversity of TehranTehran 14399-57131Iran School of Cognitive Sciences Institute for Research in Fundamental Sciences(IPM)Tehran 19548-56316 Iran Image Analysis Laboratory Radiology DepartmentHenry Ford HospitalDetroitMichigan 48202USA

Cognitive radio is used for enhancement of spectrum *** many works have been accomplished on the power allocation of cognitive radio,limited efforts have considered evolutionary *** this paper,we study this problem in the cognitive radio networks where interference constraints are defined for protection of quality of service（QoS）for both primary and secondary *** defined as functions of the signal-to-interference-plus-noise ratio（SINR） are matched for each secondary user which meets Nash’s *** general,the region of utilities that meets the constraints is *** is possible to make simplifications,generate a convex region,and then use common convex optimization approaches to obtain a ***,Particle Swarm Optimization（PSO）does not need such simplifications and thus its results are superior to those of the convex optimization *** is an evolutionary algorithm based on social intelligence,utilized in many optimization *** is a global optimizations algorithm that does not require the objective function be differentiable as required in classic optimization methods.

关键词： Cognitive radio Power allocation Particle Swarm Optimization（PSO）.

Accelerated Simulation of Master Equation for Open Quantum Systems

学校读者我要写书评

暂无评论

Accelerated Simulation of Master Equation for Open Quantum S...

Chinese control Conference (CCC)

作者： Bo Yue Yanfang Wang Shibei Xue Department of Automation Shanghai Jiao Tong University Shanghai P. R. China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai P. R. China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai P. R. China

Simulation of open quantum systems is undoubtedly critical to design of quantum devices and applications of quantum technologies since dynamics of open quantum systems cannot be solved analytically in general. However, the dimension of open quantum systems grows exponentially as the number of their subsystems increases or as involving complicated environments, which reduces the computational efficiency of the simulation. In this paper, we boost numerical simulation of master equations of open quantum systems from several aspects with which the total time and the occupied memory in the simulation are significantly reduced without losing precision. Our method can be applied to the simulation of non-Markovian quantum systems described by an augmented system model as well. We conduct numerical experiments on simulation of a non-Markovian spin chain. Compared with the algorithm in a well-known toolbox, QuTiP, our method can take 26.3% time and less memory under fair conditions.

关键词：

Distributed Neighbor Selection in Multi-agent Networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Shao, Haibin Pan, Lulu Mesbahi, Mehran Xi, Yugeng Li, Dewei Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China William E. Boeing Department of Aeronautics and Astronautics University of Washington SeattleWA98195-2400 United States

Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper examines whether network functionality and performance can be maintained-and even enhanced-when agents interact only with a subset of their respective (available) neighbors. As shown in the paper, the answer to this inquiry is affirmative. In this direction, we show that by exploring the monotonicity property of the Laplacian eigenvectors, a neighbor selection rule with guaranteed performance enhancements, can be realized for consensus-type networks. For distributed implementation, a quantitative connection between entries of Laplacian eigenvectors and the "relative rate of change" in the state between neighboring agents is further established;this connection facilitates a distributed algorithm for each agent to identify "favorable" neighbors to interact with. Multi-agent networks with and without external influence are examined, as well as extensions to signed networks. This paper underscores the utility of Laplacian eigenvectors in the context of distributed neighbor selection, providing novel insights into distributed data-driven control of multi-agent systems. Copyright © 2021, The Authors. All rights reserved.

关键词： Multi agent systems

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

学校读者我要写书评

暂无评论

Distributed Shadow Dynamic Consensus Optimization Framework ...

IEEE PES Conference on Innovative Smart Grid Technologies - Middle East (ISGT Middle East)

作者： Liying Yu Peng Wang Zhe Chen Dewen Li Ning Li Rachid Cherkaoui Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China School of Electricity and Electronic Engineering École Polytechnique Fédérale de Lausanne Switzerland

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communication principle. The global resource allocation can be solved by introducing the local shadow power demand. Then, for the general market clearing optimization problem, a distributed dynamic consensus algorithm is presented to estimate the general equality constraint. The optimal locational marginal price (LMP) and power allocation in each sub-group are obtained in this step. Finally, the optimal solution is corrected when considering the transmission constraint. A theoretical analysis of the DSDC framework is provided. The algorithm and model are tested by the IEEE 30-bus test system to support the proposed DSDC framework.

关键词： Power demand Heuristic algorithms ISO Consensus algorithm Dynamic scheduling Power markets Smart grids

Robust Remote Sensing Scene Classification with Multi-View Voting and Entropy Ranking

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Jinyang Wang, Tao Gan, Min Hadjichristofi, George Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering International Digital Economy College Minjiang University Fuzhou350108 China College of Computer and Data Science Fuzhou University Fuzhou350108 China Department of Computer Science and Engineering European University Cyprus Nicosia1516 Cyprus

Deep convolutional neural networks have been widely used in scene classification of remotely sensed images. In this work, we propose a robust learning method for the task that is secure against partially incorrect categorization of images. Specifically, we remove and correct errors in the labels progressively by iterative multi-view voting and entropy ranking. At each time step, we first divide the training data into disjoint parts for separate training and voting. The unanimity in the voting reveals the correctness of the labels, so that we can train a strong model with only the images with unanimous votes. In addition, we adopt entropy as an effective measure for prediction uncertainty, in order to partially recover labeling errors by ranking and selection. We empirically demonstrate the superiority of the proposed method on the WHU-RS19 dataset and the AID dataset. Copyright © 2023, The Authors. All rights reserved.

关键词： Entropy

Global Update Guided Federated Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wu, Qilong Liu, Lin Xue, Shibei Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China School of Electronic Information Engineering Shanghai Dianji University Shanghai201306 China

Federated learning protects data privacy and security by exchanging models instead of data. However, unbalanced data distributions among participating clients compromise the accuracy and convergence speed of federated learning algorithms. To alleviate this problem, unlike previous studies that limit the distance of updates for local models, we propose global-update-guided federated learning (FedGG), which introduces a model-cosine loss into local objective functions, so that local models can fit local data distributions under the guidance of update directions of global models. Furthermore, considering that the update direction of a global model is informative in the early stage of training, we propose adaptive loss weights based on the update distances of local models. Numerical simulations show that, compared with other advanced algorithms, FedGG has a significant improvement on model convergence accuracies and speeds. Additionally, compared with traditional fixed loss weights, adaptive loss weights enable our algorithm to be more stable and easier to implement in practice. Copyright © 2022, The Authors. All rights reserved.

关键词： Data privacy