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

International Conference on Informatics and Computing (ICIC)

作者： Somantri Muhamad Ikhsan Thohir Alun Sujjada Deni Setiawan Ilham Komara Fikri Ardiansyah Efendi Muhamad Muslih Zubaile Bin Abdullah Mohd Zainuri Saringat Department of Software Engineering University Tun Hussein Onn Malaysia Informatics Engineering Study Program Nusa Putra University Sukabumi Indonesia Informatics Engineering Study Program Nusa Putra University Sukabumi Indonesia Department of Software Engineering University Tun Hussein Onn Malaysia Sukabumi Indonesia Department of Information System Nusa Putra University Sukabumi Indonesia Department of Software Engineering Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Johor Bahru Malaysia

ISBN: (数字)9798331517601

ISBN: (纸本)9798331517618

The integration of Internet of Things (IoT) technologies into modern homes has enhanced safety and comfort, particularly in detecting gas leaks, which pose serious fire hazards. Gas leaks can often be detected by smell, but this method fails when no one is present. Previous research using microcontrollers and sensors to detect gas leaks faced challenges with accuracy due to noise interference. This paper proposes the use of a Kalman filter, developed by Rudolf Emil Kalman in 1960, to improve gas leak detection accuracy by filtering out noise. The system comprises an Arduino Nano, ESP8266 WiFi module, MQ-2 gas sensor, buzzer, and ThingSpeak cloud platform. By applying the Kalman filter, noise and data oscillations are reduced, enhancing detection accuracy. Experimental results show the system effectively detects gas leaks, provides real-time data, and triggers alarms. Future improvements could include additional sensors and features to further increase the system’s reliability and functionality.

关键词： Accuracy Noise Sensor phenomena and characterization Sensor systems Real-time systems Kalman filters Internet of Things Reliability Leak detection Gas detectors

来源：评论

学校读者我要写书评

暂无评论

Characterizing Probabilistic Structure in Learning Using Information Sufficiency

Characterizing Probabilistic Structure in Learning Using Inf...

引用

IEEE Workshop on Machine Learning for Signal Processing

作者： Victor Faraggi Jorge F. Silva Camilo Ramírez Alvaro Egaña Eduardo Pavez Information and Decision System Group Universidad de Chile Advanced Laboratory for Geostatistical Supercomputing Universidad de Chile Department of Electrical and Computer Engineering University of Southern California

ISBN: (数字)9798350372250

ISBN: (纸本)9798350372267

We use the concept of information sufficiency (IS) to represent probabilistic structures in machine learning (ML). Our main result provides a functional expression that charac-terizes the class of probabilistic models consistent with an IS encoder-decoder latent predictive structure. This result formally justifies the encoder-decoder forward stages many modern ML architectures adopt to learn latent (compressed) representations in data. To illustrate IS as a realistic and rele-vant model assumption, we revisit some known ML concepts and present some interesting new examples: invariant, robust, sparse, and digital models.

关键词： Conferences Machine learning Signal processing Predictive models Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Linear time approximation algorithm for column subset selection with local search 24

Linear time approximation algorithm for column subset select...

引用

Proceedings of the 38th International Conference on Neural Information Processing systems

作者： Yuanbin Zou Ziyun Huang Jinhui Xu Jianxin Wang Qilong Feng School of Computer Science and Engineering Central South University Changsha China and Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Department of Computer Science and Engineering State University of New York at Buffalo NY School of Computer Science and Engineering Central South University Changsha China and Xiangjiang Laboratory Changsha China and The Hunan Provincial Key Lab of Bioinformatics Central South University Changsha China

ISBN: (纸本)9798331314385

The Column Subset Selection (CSS) problem has been widely studied in dimensionality reduction and feature selection. The goal of the CSS problem is to output a submatrix S, consisting of k columns from an n × d input matrix A that minimizes the residual error ||A – SS† A||2F where S† is the Moore-Penrose inverse matrix of S. Many previous approximation algorithms have non-linear running times in both n and d, while the existing linear-time algorithms have a relatively larger approximation ratios. Additionally, the local search algorithms in existing results for solving the CSS problem are heuristic. To achieve linear running time while maintaining better approximation using a local search strategy, we propose a local search-based approximation algorithm for the CSS problem with exactly k columns selected. A key challenge in achieving linear running time with the local search strategy is how to avoid exhaustive enumerations of candidate columns for constructing swap pairs in each local search step. To address this issue, we propose a two-step mixed sampling method that reduces the number of enumerations for swap pair construction from O(dk) to k in linear time. Although the two-step mixed sampling method reduces the search space of local search strategy, bounding the residual error after swaps is a non-trivial task. To estimate the changes in residual error after swaps, we propose a matched swap pair construction method to bound the approximation loss, ensuring a constant probability of loss reduction in each local search step. In expectation, these techniques enable us to obtain the local search algorithm for the CSS problem with theoretical guarantees, where a 53(k + 1)-approximate solution can be obtained in linear running time O(ndk4 log k). Empirical experiments show that our proposed algorithm achieves better quality and time compared to previous algorithms on both small and large datasets. Moreover, it is at least 10 times faster than state-of-the-art algorith

关键词：

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity and High-Efficiency Talking Portrait Synthesis With Detail-Aware Neural Radiance Fields

引用

IEEE Transactions on Visualization and computer Graphics 2024年 PP卷 PP-PP页

作者： Wang, Muyu Zhao, Sanyuan Dong, Xingping Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China Beijing Institute of Technology School of Computer Science Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In this paper, we propose a novel rendering framework based on neural radiance fields (NeRF) named HH-NeRF that can generate high-resolution audio-driven talking portrait videos with high fidelity and fast rendering. Specifically, our framework includes a detail-aware NeRF module and an efficient conditional super-resolution module. Firstly, a detail-aware NeRF is proposed to efficiently generate a high-fidelity low-resolution talking head, by using the encoded volume density estimation and audio-eye-aware color calculation. This module can capture natural eye blinks and high-frequency details, and maintain a similar rendering time as previous fast methods. Secondly, we present an efficient conditional super-resolution module on the dynamic scene to directly generate the high-resolution portrait with our low-resolution head. Incorporated with the prior information, such as depth map and audio features, our new proposed efficient conditional super resolution module can adopt a lightweight network to efficiently generate realistic and distinct high-resolution videos. Extensive experiments demonstrate that our method can generate more distinct and fidelity talking portraits on high resolution (900 × 900) videos compared to state-of-the-art methods. Our code is available at https://***/muyuWang/HHNeRF. © 1995-2012 IEEE.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Exploration of a Novel Method for Thyroid Nodule Ultrasound Image Segmentation 17

Exploration of a Novel Method for Thyroid Nodule Ultrasound ...

引用

17th International Congress on Image and Signal Processing, BioMedical engineering and Informatics, CISP-BMEI 2024

作者： He, Kai Li, Yuan Li, Ting Sun, Xiao Wu, Mei Guo, Wei Zhao, Xian Liu, Zhi Shandong University Key Laboratory of Laser and Infrared System of the Ministry of Education Qingdao266237 China The Second Hospital Cheeloo College of Medicine Shandong University Department of Thoracic Surgery Jinan250012 China Qilu Hospital of Shandong University Department of Ultrasound Jinan250012 China School of Software Shandong University Jinan250101 China School of Information Science and Engineering Shandong University Qingdao266237 China

ISBN: (纸本)9798331507398

Ultrasound examination of thyroid nodules is currently the mainstream method for diagnosing thyroid diseases. Segmentation of thyroid nodule ultrasound images is a cru-cial task in computer-aided diagnosis of thyroid nodules and holds significant importance in the entire diagnostic process. However, due to the complex features and low contrast of thyroid ultrasound images, traditional semantic segmentation algorithms struggle to extract effective features, making it dif-ficult to accurately identify the nodule regions and complete the segmentation task. To address these issues and advance research in thyroid nodule segmentation, this paper proposes a deep learning model for accurate identification and high-quality segmentation of nodule regions in thyroid nodule segmentation. To demonstrate the effectiveness of our method, we collected ultrasound images from clinical examinations at the Second Hospital of Shandong University to serve as our experimental dataset. Evaluations conducted on this dataset show that our method achieves outstanding performance compared to existing mainstream algorithms. © 2024 IEEE.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

Graph-Augmented Contrastive Clustering for Time Series Data

SSRN

引用

SSRN 2024年

作者： Zhang, Qin Liang, Zhuoluo Ngueilbaye, Alladoumbaye Zhang, Peng Chen, Junyang Chen, Xiaojun Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China

The recent emergence of time series contrastive clustering methods can be categorized into two classes. The first class uses contrastive learning for universal representations, which can be effective in various downstream tasks, but overlooks important categorical information and clustering objectives, leading to unsuitable models. The second class incorporates contrastive learning into clustering objectives but fails to fully explore potential connections and structures between time series data. To this end, we propose the "Time Series Graph-augmented Contrastive Clustering (TSGCC) method", a graph-augmented contrastive learning framework aiming to create cluster-friendly features and assignments by iteratively optimizing contrastive loss. The method uses a weighted KNN graph to build positive and negative sample pairs, projecting the instances into a feature space with the dimensionality number of clusters. Experimental results demonstrate that TSGCC outperforms 18 advanced time-series clustering methods on the 36 representatives out of the 128 UCR benchmarks, achieving the best clustering results on 12 datasets, with the highest average rank (3.22) of RI and the second-highest average rank (3.89) of NMI among 18 clustering methods. We further compared our method with recent approaches on the entire set of 128 UCR datasets, demonstrating our method's broad applicability and effectiveness. © 2024, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation 42

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Wang, Haozhao Xu, Wenchao Fan, Yunfeng Li, Ruixuan Zhou, Pan Huazhong University of Science and Technology School of Computer Science and Technology Wuhan China The Hong Kong Polytechnic University Department of Computing Hong Kong Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan China

ISBN: (纸本)9798350334142

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods. © 2023 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Transfer Learning Trained LSTM Models for Household Load Profile Forecasting

Transfer Learning Trained LSTM Models for Household Load Pro...

引用

Grid Edge Technologies Conference & Exposition (Grid Edge), IEEE PES

作者： Roshan Klein-Seetharaman Xiangqi Zhu Barry Mather Department of Mathematics Yale University New Haven USA Electrical Engineering and Computer Science Oregon State University Corvallis USA National Renewable Energy Laboratory Power System Engineering Center Golden USA

ISBN: (数字)9798350352528

ISBN: (纸本)9798350352535

Grid edge renewable energy resources, such as rooftop solar photovoltaics, closely interact with consumer load profiles. Therefore, forecasting future electricity demand, ideally at the individual household level, is indispensable. In this paper, we present a transfer learning enhanced household load profile forecasting method. First, we tune a long short-term memory forecasting model to perform day-ahead prediction of household electricity load profiles. Then we improve these individualized models using transfer learning, and we use k-means clustering to create optimal source data sets. We find average improvements of 4.38% (largest improvement of 10.71%) when the entire data set was used to train the source model and 2.45% (largest improvement of 11.57%) in the mean absolute error when households were first clustered and used to train separate source models for each cluster. We find that transfer learning with clustered data can effectively boost the forecasting performance of the LSTM models. We use realistic household power measurements for 148 real residential households in Austin, Texas.

关键词： Photovoltaic systems Renewable energy sources Power measurement Electricity Transfer learning Predictive models Data models Forecasting Long short term memory Load modeling

来源：评论

学校读者我要写书评

暂无评论

SpirDet: Towards Efficient, Accurate and Lightweight Infrared Small Target Detector

arXiv

引用

arXiv 2024年

作者： Mao, Qianchen Li, Qiang Wang, Bingshu Zhang, Yongjun Dai, Tao Chen, C.L. Philip The School of Software Northwestern Polytechnical University Taicang Campus Suzhou215400 China The School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou510641 China

In recent years, the detection of infrared small targets using deep learning methods has garnered substantial attention due to notable advancements. To improve the detection capability of small targets, these methods commonly maintain a pathway that preserves high-resolution features of sparse and tiny targets. However, it can result in redundant and expensive computations. To tackle this challenge, we propose SpirDet, a novel approach for efficient detection of infrared small targets. Specifically, to cope with the computational redundancy issue, we employ a new dual-branch sparse decoder to restore the feature map. Firstly, the fast branch directly predicts a sparse map indicating potential small target locations (occupying only 0.5% area of the map). Secondly, the slow branch conducts fine-grained adjustments at the positions indicated by the sparse map. Additionally, we design an lightweight DO-RepEncoder based on reparameterization with the Downsampling Orthogonality, which can effectively reduce memory consumption and inference latency. Extensive experiments show that the proposed SpirDet significantly outperforms state-of-the-art models while achieving faster inference speed and fewer parameters. For example, on the IRSTD-1K dataset, SpirDet improves MIoU by 4.7 and has a 7× FPS acceleration compared to the previous state-of-the-art model. The code will be open to the public. © 2024, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

StyleAU: StyleGAN based Facial Action Unit Manipulation for Expression Editing

StyleAU: StyleGAN based Facial Action Unit Manipulation for ...

引用

IEEE International Joint Conference on Biometrics (IJCB)

作者： Yanliang Guo Xianxu Hou Feng Liu Linlin Shen Lei Wang Zhen Wang Peng Liu Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Qualcomm Technologies Inc

Facial expression editing has a wide range of applications, such as emotion detection, human-computer interaction, and social entertainment. However, existing expression editing methods either fail to allow for fine-grained editing, resulting in unnatural and unrealistic facial expressions, or generate artifacts and blurs, leading to poor image quality. In this paper, we propose a novel framework called StyleAU, which is based on StyleGAN and facial action units, to address these problems. Our framework leverages the pre-trained StyleGAN prior knowledge to enable action unit editing of the face in the StyleGAN latent space, allowing precise expression editing. In addition, we use an encoder to extract multi-scale content features to achieve high-fidelity image reconstruction. Our approach qualitatively and quantitatively outperforms competing methods for action unit manipulation and expression editing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：