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

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

来源：评论

学校读者我要写书评

暂无评论

Biased feature learning for occlusion invariant face recognition 29

Biased feature learning for occlusion invariant face recogni...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Shao, Changbin Huo, Jing Qi, Lei Feng, Zhen-Hua Li, Wenbin Dong, Chuanqi Gao, Yang State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Jiangsu University of Science and Technology Zhenjiang China Department of Computer Science Centre for Vision Speech and Signal Processing University of Surrey Guildford United Kingdom

ISBN: (纸本)9780999241165

To address the challenges posed by unknown occlusions, we propose a Biased Feature Learning (BFL) framework for occlusion-invariant face recognition. We first construct an extended dataset using a multi-scale data augmentation method. For model training, we modify the label loss to adjust the impact of normal and occluded samples. Further, we propose a biased guidance strategy to manipulate the optimization of a network so that the feature embedding space is dominated by non-occluded faces. BFL not only enhances the robustness of a network to unknown occlusions but also maintains or even improves its performance for normal faces. Experimental results demonstrate its superiority as well as the generalization capability with different network architectures and loss functions. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Two-Stream Regression Network for Dental Implant Position Prediction

arXiv

引用

arXiv 2023年

作者： Yang, Xinquan Li, Xuguang Li, Xuechen Chen, Wenting Shen, Linlin Li, Xin Deng, Yongqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Stomatology Shenzhen University General Hospital Shenzhen China Department of Electrical Engineering City University of Hong Kong Hong Kong

In implant prosthesis treatment, the design of surgical guide requires lots of manual labors and is prone to subjective variations. When deep learning based methods has started to be applied to address this problem, the space between teeth are various and some of them might present similar texture characteristic with the actual implant region. Both problems make a big challenge for the implant position prediction. In this paper, we develop a two-stream implant position regression framework (TSIPR), which consists of an implant region detector (IRD) and a multi-scale patch embedding regression network (MSPENet), to address this issue. For the training of IRD, we extend the original annotation to provide additional supervisory information, which contains much more rich characteristic and do not introduce extra labeling costs. A multi-scale patch embedding module is designed for the MSPENet to adaptively extract features from the images with various tooth spacing. The global-local feature interaction block is designed to build the encoder of MSPENet, which combines the transformer and convolution for enriched feature representation. During inference, the RoI mask extracted from the IRD is used to refine the prediction results of the MSPENet. Extensive experiments on a dental implant dataset through five-fold cross-validation demonstrated that the proposed TSIPR achieves superior performance than existing methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Novel Tri-Band Antenna Design for Wireless LAN Applications

A Novel Tri-Band Antenna Design for Wireless LAN Application...

引用

IEEE Conference on Antenna Measurements & Applications (CAMA)

作者： Sarosh Ahmad Hichem Boubakar Wael Jaafar Halim Yanikomeroglu Department of Signal Theory and Communications Universidad Carlos III de Madrid Spain Laboratory of Information Processing and Telecommunications (LTIT) University of Bechar Bechar Algeria Software and Information Technology Engineering Department Ecole de Technologie Supérieure QC Canada Systems and Computer Engineering Department Carleton University ON Canada

ISBN: (纸本)9781665490382

In this paper, we propose the design of a novel tri-band compact patch antenna. This antenna is resonant within frequencies 2.45 GHz, 3.5 GHz, and 5.8 GHz, making it compatible with wireless local area network (WLAN), world interoperability for microwave access (WiMAX), and Bluetooth. The flexible Roger RT5880 substrate with a thickness of 0.8 mm is used to construct the antenna, and a 50 Ω microstrip line is used as its feeding technique. The final structure has a small size of 30 × 20 × 0.8 mm 3 compared to state-of-the-art designs. Through simulations, we demonstrate the stable and satisfying performances of the novel antenna design over the three targeted frequency bands, thus favoring its use for integrated systems that operate within WLAN, WiMAX, and Bluetooth wireless bands.

关键词： Antenna measurements Microwave antennas Wireless LAN Bluetooth Patch antennas Resonant frequency Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimizing Parameters and Feature Selection in SVM Based on Improved Cockroach Swarm Optimization 16th

An Optimizing Parameters and Feature Selection in SVM Based ...

引用

16th International Conference on Intelligent Information Hiding and Multimedia Signal processing, IIH-MSP 2020 in conjunction with the 13th International Conference on Frontiers of Information technology, Applications and Tools, FITAT 2020

作者： Nguyen, Trong-The Yu, Jie Nguyen, Thi-Thanh-Tan Lai, Quoc-Anh Ngo, Truong-Giang Dao, Thi-Kien Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of Mechanical and Automotive Engineering Fujian University of Technology Fuzhou China Information Technology Faculty Electric Power University Hanoi Viet Nam Department of Pattern Recognition & Image Processing Institute of Information Technology Vietnam Academy of Science and Technology Hanoi Viet Nam Faculty of Computer Science and Engineering Thuyloi University 175 Tay Son Dong Da Hanoi Viet Nam

ISBN: (纸本)9789813367562

This study improves a classifier of the support vector machine (SVM) by optimizing its parameters by adjusting cockroach swarm optimization (CSO). Classification system design includes data inputs, pre-process, and classification. The relief technique selects the feature subset, and the kernel parameters used as input for the system. The feature selection and classification of data sets were figured out by the combination of ICSO and SVM with its optimized parameters synchronous. Simulation results of the proposed scheme are compared with other systems, e.g., GA-SVM, PSO-SVM, and CSO-SVM, which show that the proposed project can achieve better classification accuracy than the different algorithms. It is promising that the proposed scheme can be applied to high-dimensional data classification, such as image classification, signal classification. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

KADEL: Knowledge-Aware Denoising Learning for Commit Message Generation

arXiv

引用

arXiv 2024年

作者： Tao, Wei Zhou, Yucheng Wang, Yanlin Zhang, Hongyu Wang, Haofen Zhang, Wenqiang Shanghai Engineering Research Center of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Software Engineering Sun Yat-sen University Guangdong Zhuhai519082 China School of Big Data and Software Engineering Chongqing University Chongqing China College of Design and Innovation Tongji University Shanghai China Engineering Research Center of AI and Robotics Ministry of Education Academy for Engineering and Technology Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 220 Handan Road Shanghai200433 China

Commit messages are natural language descriptions of code changes, which are important for software evolution such as code understanding and maintenance. However, previous methods are trained on the entire dataset without considering the fact that a portion of commit messages adhere to good practice (i.e., good-practice commits), while the rest do not. On the basis of our empirical study, we discover that training on good-practice commits significantly contributes to the commit message generation. Motivated by this finding, we propose a novel knowledge-aware denoising learning method called KADEL. Considering that good-practice commits constitute only a small proportion of the dataset, we align the remaining training samples with these good-practice commits. To achieve this, we propose a model that learns the commit knowledge by training on good-practice commits. This knowledge model enables supplementing more information for training samples that do not conform to good practice. However, since the supplementary information may contain noise or prediction errors, we propose a dynamic denoising training method. This method composes a distribution-aware confidence function and a dynamic distribution list, which enhances the effectiveness of the training process. Experimental results on the whole MCMD dataset demonstrate that our method overall achieves state-of-the-art performance compared with previous methods. © 2024, CC BY.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Asymmetry Total Variation and Framelet Regularized Nonconvex Low-Rank Tensor Completion

SSRN

引用

SSRN 2022年

作者： Chen, Yongyong Zhao, Xiaojia Xu, Tingting Zeng, Haijin Xu, Yanhui Chen, Junxing The School of Computer Science and Technology Harbin Institute of Technology Shenzhen518055 China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies Shenzhen518055 China Image Processing and Interpretation Imec Research Group Ghent University Belgium Department of Electrical and Computer Engineering Faculty of Science and Technology University of Macau China The College of Medicine and Biological Information Engineering Northeastern University Shenyang110004 China

The low-rank tensor representation has shown enormous potential and advantages in diverse applications. However, (1) due to the inherent limitations of the low-rank tensor model, the tensor nuclear norm is utilized yet as a biased estimate of the tensor rank, which limits the image recovery performance. (2) most current low-rank approximation-based methods focus on the preservation of global information, while ignoring the local details preservation such as the spatial piece-wise smoothness and sharp edges. To overcome he above obstacles, we propose a novel asymmetry three-dimensional total variation and framelet regularized nonconvex low-rank tensor completion (ATV-FNTC) model, which integrates the nonconvex penalty function and asymmetric three-dimensional total variation into one unified model. Specifically, ATV-FNTC introduces one nonconvex penalty function as a tighter regularizer to approximate the tensor rank. Different from existing methods, the asymmetric three-dimensional total variation regularization is developed to achieve more accurate recovery of detailed information and flexibly control the smoothing strength of different dimensions of tensor data. Furthermore, we design an iterative algorithm to solve the nonconvex ATV-FNTC model by the alternating direction methods of multipliers. Experimental results reveal the superiority of the proposed method compared with several state-of-the-art methods when handling different completion tasks. © 2022, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

ReactFace: Online Multiple Appropriate Facial Reaction Generation in Dyadic Interactions

arXiv

引用

arXiv 2023年

作者： Luo, Cheng Song, Siyang Xie, Weicheng Spitale, Micol Ge, Zongyuan Shen, Linlin Gunes, Hatice Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China Department of Computer Science University of Nottingham Ningbo China Ningbo315100 China Computer Sciences University of Exeter ExeterEX4 4PY United Kingdom Department of Computer Science and Technology University of Cambridge CambridgeCB3 0FT United Kingdom Airdoc-Monash Research Centre Monash University Faculty of IT Monash University Melbourne Australia

In dyadic interaction, predicting the listener’s facial reactions is challenging as different reactions could be appropriate in response to the same speaker’s behaviour. Previous approaches predominantly treated this task as an interpolation or fitting problem, emphasizing deterministic outcomes but ignoring the diversity and uncertainty of human facial reactions. Furthermore, these methods often failed to model short-range and long-range dependencies within the interaction context, leading to issues in the synchrony and appropriateness of the generated facial reactions. To address these limitations, this paper reformulates the task as an extrapolation or prediction problem, and proposes an novel framework (called ReactFace) to generate multiple different but appropriate facial reactions from a speaker behaviour rather than merely replicating the corresponding listener facial behaviours. Our ReactFace generates multiple different but appropriate photo-realistic human facial reactions by: (i) learning an appropriate facial reaction distribution representing multiple different but appropriate facial reactions;and (ii) synchronizing the generated facial reactions with the speaker verbal and non-verbal behaviours at each time stamp, resulting in realistic 2D facial reaction sequences. Experimental results demonstrate the effectiveness of our approach in generating multiple diverse, synchronized, and appropriate facial reactions from each speaker’s behaviour. The quality of the generated facial reactions is intimately tied to the speaker’s speech and facial expressions, achieved through our novel speaker-listener interaction modules. Our code is made publicly available at https://***/lingjivoo/ReactFace. Copyright © 2023, The Authors. All rights reserved.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

A Multi-Level Thresholding image Segmentation Based on an Improved Artificial Bee Colony Algorithm 2nd

A Multi-Level Thresholding Image Segmentation Based on an Im...

引用

2nd EAI International Conference on Robotic Sensor Networks, ROSENET 2018

作者： Xia, Xingyu Gao, Hao Hu, Haidong Lan, Rushi Pun, Chi-Man The Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing China Department of Computer and Information Science University of Macau China Beijing Institute of Control Engineering Beijing China Key Laboratory of Intelligent Processing of Computer Image and Graphics Guilin University of Electronic Technology Guilin China

ISBN: (纸本)9783030177621

As a popular evolutionary algorithm, artificial bee colony (ABC) algorithm has been successfully applied into the threshold-based image segmentation problem. Based on our analysis, we find that the Otsu segmentation function is separable which means each variable is independent. Due to its one-dimensional search strategy and relative power global but poorer local search abilities, ABC could find an acceptable but not precise segmentation results. For making more precise search and further enhancing the achievements on image segmentation, we propose an Otsu segmentation method based on a new ABC algorithm with an improved scout bee strategy. Different from the traditional scout bee strategy, we use a local search strategy when a bee stagnates for a defined value. The experimental results on Berkeley segmentation database demonstrate the effectiveness of our algorithm. © 2020, Springer Science and Business Media Deutschland GmbH. All rights reserved.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：