ReassembleNet: Learnable Keypoints and Diffusion for 2D Fresco Reconstruction

A new dataset has been introduced to enhance deep learning-based visual quality inspection in remanufacturing, focusing on gearbox components from automotive transmissions. This dataset aims to automate the quality inspection process, which is currently manual due to the diversity of parts and defect patterns. The study also proposes a contrastive regularization loss to improve model robustness, addressing the challenges of generalizing to new product variants and defects.

DeepContrast is a new method aimed at enhancing deep tissue microscopy images by addressing issues of image degradation, such as noise and blur, which lead to contrast loss. Traditional deep learning approaches require ground truth data for training, which is often unattainable in deep tissue imaging. This method utilizes synthetic data degradations to model the blurring and contrast loss, allowing for improved image quality without the need for clean ground truth data.

The accurate prediction of flow fields around airfoils is essential for aerodynamic design and optimization. While Computational Fluid Dynamics (CFD) models are effective, they are computationally expensive. This has led to the development of surrogate models using deep learning architectures, including Convolutional Neural Networks (CNNs) and Diffusion Models (DMs). The proposed model, FoilDiff, utilizes a hybrid-backbone denoising network that combines convolutional feature extraction with transformer-based global attention, enhancing adaptability and accuracy in flow structure representatio…

The paper titled 'Fairness-Aware Graph Representation Learning with Limited Demographic Information' addresses the challenge of ensuring fairness in Graph Neural Networks (GNNs). It highlights that many existing methods require complete demographic data, which is often unavailable due to privacy concerns. The authors propose a new framework that generates proxies for demographic information using partial data and enforces consistent node embeddings across demographic groups, along with an adaptive confidence strategy to balance fairness and utility.

Graph Neural Networks (GNNs) have shown significant success in various applications, but they face challenges such as oversmoothing and inefficiency on heterophilic graphs. To overcome these limitations, a new framework is introduced that incorporates complex weights into graph structures, allowing for a complex diffusion process. This leads to the development of the Complex-Weighted Convolutional Network (CWCN), which learns complex-weighted structures from data and enhances diffusion with learnable matrices and nonlinear activations, proving to be effective for node-classification tasks.

Certified Signed Graph Unlearning (CSGU) addresses the challenges of privacy in Signed Graph Neural Networks (SGNNs). Traditional graph unlearning methods fail to preserve the unique properties of signed graphs, leading to loss of critical sign information. CSGU introduces a three-stage approach to effectively remove specific data influences while maintaining privacy guarantees and the sociological principles of SGNNs. This advancement is crucial for applications where data sensitivity is paramount.

Circuit link prediction is essential for automating analog circuit design by identifying missing connections in incomplete netlists. Current methods struggle with three key issues: inadequate use of topological patterns, data scarcity due to complex annotations, and limited adaptability to various netlist formats. The proposed Graph Neural Networks Based Analog Circuit Link Prediction (GNN-ACLP) method introduces innovations such as the SEAL framework for improved accuracy and the Netlist Babel Fish tool for format conversion, addressing these challenges effectively.

The paper introduces DualLaguerreNet, a new architecture for Graph Neural Networks (GNNs) that addresses the limitations of single-filter models like LaguerreNet. By decoupling the graph Laplacian into low and high-frequency operators, it allows for independent learning of two adaptive Laguerre polynomial filters. This innovation aims to overcome the compromise problem of averaged responses across the graph spectrum, enhancing performance on complex heterophilic graphs.