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

Aedes Aegypti Egg Classification Model Using Support Vector Machine

学校读者我要写书评

暂无评论

Aedes Aegypti Egg Classification Model Using Support Vector ...

International Conference on Computer Research and Development (ICCRD)

作者： Cherry R. Gumiran Arnel C. Fajardo Ruji P. Medina Minh S. Dao Joel M. Gumiran Graduate Program Technological Institue of the Philippines Quezon City Philippines Philippines Isabela State University Cauayan College of Computing Studies Information and Communications Technology Philippines Graduate Prgram Technological Institue of the Philippines Quezon City Philipines Philippines Big Data Integration Research Center National Institute of Information and Communications Technology Tokyo Japan

Aedes aegypti is the dengue fever vector, affecting 3.9 billion people worldwide. Found primarily in subtropical areas such as the Philippines. Numerous approaches and procedures had used to identify this disease carrier throughout its life cycle. However, recognizing it early, primarily during the egg stage, helps monitor the disease carrier's existence. On the other hand, classifying the egg remains an issue due to its resemblance to another mosquito species. As a result, extracted traits of the Aedes egg had added to the classification model. Furthermore, the Support Vector Machine algorithm's effectiveness as a classifier improves classification accuracy, mainly when the feature extracted has been added. Thus, this paper used the Support Vector Machine in designing a model to classify Aedes aegypti eggs. This model differentiates it from non-Aedes with a classification accuracy of 98.23%, which is greater than the classification accuracy compared to previous studies using the pixel and region-based method. In addition, the newly developed model had increased accuracy compared to the model in which the features had omitted from the classification process by 3.26 percent. In addition, the model was validated on a non-Aedes dataset in which it exhibited similar characteristics. As a result, the model reveals improved categorization and is determined to be non-Aedes. Thus, this model demonstrates a considerable boost in classification accuracy.

关键词： Shape Computational modeling Support vector machine classification Color Feature extraction Classification algorithms Viruses (medical)

Multi User Offloading Strategy for Edge computing in Charging Load Forecasting Scenario

学校读者我要写书评

暂无评论

Multi User Offloading Strategy for Edge Computing in Chargin...

Chinese Automation Congress (CAC)

作者： Hongyu Long Zhaocheng Huang Chao Liu Daolin Xu Tao Li Fan Ye Key Laboratory of Big Data Intelligent Computing School of Automation/School of Industrial Internet Chongqing University of Posts and Telecommunications Chongqing China School of Automation/School of Industrial Internet Chongqing University of Posts and Telecommunications Chongqing China Economic and Technical Research Institute of State Grid Chongqing Electric Power Company Chongqing China

In order to mitigate the impact of large-scale new energy vehicle charging access to the grid, edge computing technology is widely used in smart charging perception scenarios. By deploying various edge terminal devices or application software at the perception sites, it can collect and predict the power load in various regions, so as to effectively guide and control the charging amount of new energy vehicles. However, with the increase of computing demand brought by the increase of edge device nodes, the edge server may face the problem of insufficient computing resources, which will affect the low latency characteristics. To alleviate this problem, this paper abstracts each edge terminal device as an independent user with task computing needs, establishes a multi-user edge computing system, and proposes a multi-level resource allocation strategy for edge computing, Decompose and allocate communication channel resources and server resources in multiple rounds. This method can reduce task latency by optimizing the task offloading ratio and resource allocation method of users while meeting their basic needs. The simulation results show that this method can effectively reduce the latency of task computation in multi user scenarios.

关键词：

JERALD: high-fidelity dark matter, stellar mass and neutral hydrogen maps from fast N-body simulations

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Rigo, Mauro Trotta, Roberto Viel, Matteo Theoretical and Scientific Data Science SISSA Via Bonomea 265 Trieste34136 Italy INFN National Institute for Nuclear Physics Via Valerio 2 Trieste34127 Italy ICSC Centro Nazionale di Ricerca in High Performance Computing Big Data e Quantum Computing Via Magnanelli 2 Bologna Italy Astrophysics Group Physics Department Blackett Lab Imperial College London Prince Consort Road LondonSW7 2AZ United Kingdom INAF Osservatorio Astronomico di Trieste Via G. B. Tiepolo 11 TriesteI-34143 Italy

We present a new code and approach, JERALD—JAX Enhanced Resolution Approximate Lagrangian Dynamics—, that improves on and extends the Lagrangian Deep Learning method of Dai & Seljak (2021), producing high-resolution dark matter, stellar mass and neutral hydrogen maps from lower-resolution approximate N-body simulations. The model is trained using the Sherwood-Relics simulation suite (for a fixed cosmology), specifically designed for the intergalactic medium and the neutral hydrogen distribution in the cosmic web. The output is tested in the redshift range from z = 5 to z = 0 and the generalization properties of the learned mapping is demonstrated. JERALD produces maps with dark matter, stellar and neutral hydrogen power spectra in excellent agreement with full-hydrodynamic simulations with 8× higher resolution, at large and intermediate scales;in particular, JERALD’s neutral hydrogen power spectra agree with their higher-resolution full-hydrodynamic counterparts within 90% up to k 1 hMpc−1 and within 70% up to k 10 hMpc−1. JERALD provides a fast, accurate and physically motivated approach that we plan to embed in a statistical inference pipeline, such as Simulation-Based Inference, to constrain dark matter properties from large- to intermediate-scale structure observables. Copyright © 2025, The Authors. All rights reserved.

关键词： Dark Matter

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

BiKT: Unleashing the potential of GNNs via Bi-directional Knowledge Transfer

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zheng, Shuai Liu, Zhizhe Zhu, Zhenfeng Zhang, Xingxing Li, Jianxin Zhao, Yao The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China Qiyuan Lab Beijing China The Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing100083 China

Based on the message-passing paradigm, there has been an amount of research proposing diverse and impressive feature propagation mechanisms to improve the performance of GNNs. However, less focus has been put on feature transformation, another major operation of the message-passing framework. In this paper, we first empirically investigate the performance of the feature transformation operation in several typical GNNs. Unexpectedly, we notice that GNNs do not completely free up the power of the inherent feature transformation operation. By this observation, we propose the Bi-directional Knowledge Transfer (BiKT), a plug-and-play approach to unleash the potential of the feature transformation operations without modifying the original architecture. Taking the feature transformation operation as a derived representation learning model that shares parameters with the original GNN, the direct prediction by this model provides a topological-agnostic knowledge feedback that can further instruct the learning of GNN and the feature transformations therein. On this basis, BiKT not only allows us to acquire knowledge from both the GNN and its derived model but promotes each other by injecting the knowledge into the other. In addition, a theoretical analysis is further provided to demonstrate that BiKT improves the generalization bound of the GNNs from the perspective of domain adaption. An extensive group of experiments on up to 7 datasets with 5 typical GNNs demonstrates that BiKT brings up to 0.5% - 4% performance gain over the original GNN, which means a boosted GNN is obtained. Meanwhile, the derived model also shows a powerful performance to compete with or even surpass the original GNN, enabling us to flexibly apply it independently to some other specific downstream tasks. Copyright © 2023, The Authors. All rights reserved.

关键词： Message passing

SED-MVS: Segmentation-Driven and Edge-Aligned Deformation Multi-View Stereo with Depth Restoration and Occlusion Constraint

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yuan, Zhenlong Yang, Zhidong Cai, Yujun Wu, Kuangxin Liu, Mufan Zhang, Dapeng Jiang, Hao Li, Zhaoxin Wang, Zhaoqi The Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Australia The Information Technology Department Hunan Police Academy Changsha410100 China Cooperative MediaNet Innovation Center Shanghai Jiao Tong University Shanghai200240 China DSLAB School of Information Science & Engineering Lanzhou University 730000 China Agricultural Information Institute Chinese Academy of Agricultural Sciences Key Laboratory of Agricultural Big Data Ministry of Agriculture and Rural Affairs 100081 China

Recently, patch-deformation methods have exhibited significant effectiveness in multi-view stereo owing to the deformable and expandable patches in reconstructing textureless areas. However, such methods primarily emphasize broadening the receptive field in textureless areas, while neglecting deformation instability caused by easily overlooked edge-skipping, potentially leading to matching distortions. To address this, we propose SED-MVS, which adopts panoptic segmentation and multi-trajectory diffusion strategy for segmentation-driven and edge-aligned patch deformation. Specifically, to prevent unanticipated edge-skipping, we first employ SAM2 for panoptic segmentation as depth-edge guidance to guide patch deformation, followed by multi-trajectory diffusion strategy to ensure patches are comprehensively aligned with depth edges. Moreover, to avoid potential inaccuracy of random initialization, we combine both sparse points from LoFTR and monocular depth map from DepthAnything V2 to restore reliable and realistic depth map for initialization and supervised guidance. Finally, we integrate segmentation image with monocular depth map to exploit inter-instance occlusion relationship, then further regard them as occlusion map to implement two distinct edge constraint, thereby facilitating occlusion-aware patch deformation. Extensive results on ETH3D, Tanks & Temples, BlendedMVS and Strecha datasets validate the state-of-the-art performance and robust generalization capability of our proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Restoration

CodeEnhance: A Codebook-Driven Approach for Low-Light Image Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xu Hou, XianXu Lai, Zhihui Zhou, Jie Zhang, Ya-Nan Pedrycz, Witold Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China The Department of Electrical & Computer Engineering University of Alberta University of Alberta Canada

Low-light image enhancement (LLIE) aims to improve low-illumination images. However, existing methods face two challenges: (1) uncertainty in restoration from diverse brightness degradations;(2) loss of texture and color information caused by noise suppression and light enhancement. In this paper, we propose a novel enhancement approach, CodeEnhance, by leveraging quantized priors and image refinement to address these challenges. In particular, we reframe LLIE as learning an image-to-code mapping from low-light images to discrete codebook, which has been learned from high-quality images. To enhance this process, a Semantic Embedding Module (SEM) is introduced to integrate semantic information with low-level features, and a Codebook Shift (CS) mechanism, designed to adapt the pre-learned codebook to better suit the distinct characteristics of our low-light dataset. Additionally, we present an Interactive Feature Transformation (IFT) module to refine texture and color information during image reconstruction, allowing for interactive enhancement based on user preferences. Extensive experiments on both real-world and synthetic benchmarks demonstrate that the incorporation of prior knowledge and controllable information transfer significantly enhances LLIE performance in terms of quality and fidelity. The proposed CodeEnhance exhibits superior robustness to various degradations, including uneven illumination, noise, and color distortion. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Enhancing EEG-Based Cross-Subject Emotion Recognition via Adaptive Source Joint Domain Adaptation

学校读者我要写书评

暂无评论

IEEE Transactions on Affective computing 2024年

作者： Liu, Ke Luo, Xin Zhu, Wenrui Yu, Zhuliang Yu, Hong Xiao, Bin Wu, Wei Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing China South China University of Technology College of Automation Science and Engineering Guangzhou510641 China Shanghai Jiao Tong University School of Medicine Department of Neurology Songjjiang Hospital and Songjiang Research Institute Shanghai Key Laboratory of Emotions and Affective Disorders Shanghai201600 China

EEG emotion recognition is crucial in both human-machine interaction and healthcare. However, recognizing emotions across different subjects remains challenging due to individual variability. While existing multi-source domain adaptation methods have been utilized for cross-subject EEG emotion decoding, they often struggle with irrelevant or weakly relevant source domains, leading to negative transfer. Additionally, variations within subdomains are often neglected in these studies. We propose a joint domain adaptation method, Adaptive Source Joint Domain Adaptation (ASJDA) to address these issues. ASJDA utilizes an unsupervised adaptive source selection strategy to select a subset of source domains by evaluating the Jensen-Shannon divergence between the source and target domains, choosing those most relevant to the target. Subsequently, it implements joint domain adaptation with these chosen sources at both the domain and category subdomain levels. Our proposed method outperforms existing state-of-the-art methods, achieving cross-subject accuracies of 96.81% in SEED, 89.69% in SEED-IV, and 69.31% in DEAP. This work significantly advances the state of the art in EEG emotion recognition by effectively addressing the challenges of cross-subject variability. The source code for ASJDA is available at https://***/Pam098/ASJDA. © 2010-2012 IEEE.

关键词： adaptive source selection cross-subject domain adaptation EEG emotion recognition

A Generative Adversarial Active Learning Method for Effective Outlier Detection

学校读者我要写书评

暂无评论

A Generative Adversarial Active Learning Method for Effectiv...

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Mohamed Jaward Bah Ji Zhang Ting Yu Feng Xia Zhao Li Shuigeng Zhou Hongzhi Wang Big Data Intelligence Research Center Zhejiang Lab Hangzhou China University of Southern Queensland School of Sciences Toowoomba Australia Institute of Innovation Science and Sustainability Federation University Australia Ballarat Australia Zhejiang University China Fudan University School of Computer Science Shanghai China Harbin Institute of Technology Massive Data Computing Lab China

Outlier detection is an important data mining task, and developing effective methods to detect outliers is challenging in cases where there is insufficient labeled data. Manually labeling the data is labor-intensive and time-consuming. Because of a limited number of labeled samples, the classes are unbalanced, resulting in a class-imbalance problem. Existing methods fail to address these aforementioned issues holistically and fall short in generating quality outlier samples for effective outlier detection accuracy. In this paper, we propose a new solution that tackles these problems. We propose a. Generative Adversarial Active Learning method (DIR-GAAL), which generates Diverse, Informative, and Representative outlier samples through active learning, and employs the mini-max game between the generator and discriminator in a generative adversarial network. We conducted extensive experiments on several benchmark datasets to evaluate the performance of our method. When compared to other benchmark methods, our method consistently demon-strates better outlier detection accuracy without being negatively affected by the class-imbalance problem.

关键词： Learning systems Games Benchmark testing Generative adversarial networks Generators Labeling Task analysis