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

Generative Face Parsing Map Guided 3D Face Reconstruction Under Occluded Scenes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhao, Dapeng Qi, Yue State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Peng Cheng Laboratory Shenzhen China Qingdao Research Institute of Beihang University Qingdao China

Over the past few years, single-view 3D face reconstruction methods can produce beautiful 3D models. Nevertheless, the input of these works is unobstructed faces. We describe a system designed to reconstruct convincing face texture in the case of occlusion. Motivated by parsing facial features, we propose a complete face parsing map generation method guided by landmarks. We estimate the 2D face structure of the reasonable position of the occlusion area, which is used for the construction of 3D texture. An excellent anti-occlusion face reconstruction method should ensure the authenticity of the output, including the topological structure between the eyes, nose, and mouth. We extensively tested our method and its components, qualitatively demonstrating the rationality of our estimated facial structure. We conduct extensive experiments on general 3D face reconstruction tasks as concrete examples to demonstrate the method’s superior regulation ability over existing methods often break down. We further provide numerous quantitative examples showing that our method advances both the quality and the robustness of 3D face reconstruction under occlusion scenes. Copyright © 2024, The Authors. All rights reserved.

关键词： 3D reconstruction

Pioneering Deterministic Scheduling and Network Structure Optimization for Time-Critical Computing Tasks in Industrial IoT

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Yujiao Zhu, Yining Zhang, Huayu Pan, Yan Jia, Qingmin Xie, Renchao Yang, Gang Yu, F. Richard Future Network Research Center Purple Mountain Laboratories Nanjing211111 China The School of Computer Science Northwestern Polytechnical University Xi’an710029 China Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology China The State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China The Department of Systems and Computer Engineering Carleton University Ottawa Canada

The Industrial Internet of Things (IIoT) has become a critical technology to accelerate the process of digital and intelligent transformation of industries. As the cooperative relationship between smart devices in IIoT becomes more complex, getting deterministic responses of IIoT periodic time-critical computing tasks becomes a crucial and nontrivial problem. However, few current works in cloud/edge/fog computing focus on this problem. This paper is a pioneer to explore the deterministic scheduling and network structural optimization problems for IIoT periodic time-critical computing tasks. We first formulate the two problems and derive theorems to help quickly identify computation and network resource sharing conflicts. Based on this, we propose a deterministic scheduling algorithm, IIoTBroker, which realizes deterministic response for each IIoT task by optimizing the fine-grained computation and network resources allocations, and a network optimization algorithm, IIoTDeployer, providing a cost-effective structural upgrade solution for existing IIoT networks. Our methods are illustrated to be cost-friendly, scalable, and deterministic response guaranteed with low computation cost from our simulation results. © 2024, CC BY-NC-ND.

关键词： Internet of things

A Communication-Induced Checkpointing Algorithm for Consistent-Transaction in Distributed Database systems 1

学校读者我要写书评

暂无评论

8th International Symposium on Security in Computing and Communications, SSCC 2020

作者： Mansouri, Houssem Pathan, Al-Sakib Khan Laboratory of Networks and Distributed Systems Computer Science Department Faculty of Sciences Ferhat Abbas Setif University 1 Setif Algeria Department of Computer Science and Engineering Independent University Dhaka Bangladesh

ISBN: (数字)9789811604225

ISBN: (纸本)9789811604218

For better protection of distributed systems, two well-known techniques are: checkpointing and rollback recovery. While failure protection is often considered a separate issue, it is crucial for establishing better secure distributed systems. This article is dedicated to the proposal of a new checkpointing algorithm for saving a consistent-transaction state in distributed databases ensuring that database management systems are able, after a failure, to recover the state of the database. The proposed communication-induced algorithm does not hamper the normal transaction processing and saves a global consistent-transaction state that records only the fully completed transactions. Analysis and experimental results of our proposal show that the proposed scheme saves a minimum number of forced checkpoints and has some performance gains compared to the alternative approaches. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Distributed database systems

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

CoRaiS: Lightweight Real-Time Scheduler for Multi-Edge Cooperative Computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Yujiao Jia, Qingmin Chen, Jinchao Yao, Yuan Pan, Yan Xie, Renchao Yu, F. Richard Future Network Research Center Purple Mountain Laboratories Nanjing211111 China The School of Computer Science Northwestern Polytechnical University Xi'An710029 China Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology China The State Key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China The Department of Systems and Computer Engineering Carleton University Ottawa Canada

Multi-edge cooperative computing that combines constrained resources of multiple edges into a powerful resource pool has the potential to deliver great benefits, such as a tremendous computing power, improved response time, more diversified services. However, the mass heterogeneous resources composition and lack of scheduling strategies make the modeling and cooperating of multi-edge computing system particularly complicated. This paper first proposes a system-level state evaluation model to shield the complex hardware configurations and redefine the different service capabilities at heterogeneous edges. Secondly, an integer linear programming model is designed to cater for optimally dispatching the distributed arriving requests. Finally, a learning-based lightweight real-time scheduler, CoRaiS, is proposed. CoRaiS embeds the real-time states of multi-edge system and requests information, and combines the embeddings with a policy network to schedule the requests, so that the response time of all requests can be minimized. Evaluation results verify that CoRaiS can make a high-quality scheduling decision in real time, and can be generalized to other multi-edge computing system, regardless of system scales. Characteristic validation also demonstrates that CoRaiS successfully learns to balance loads, perceive real-time state and recognize heterogeneity while scheduling. © 2024, CC BY-NC-ND.

关键词： Edge computing

Correction: Materials laboratories of the future for alloys, amorphous, and composite materials (MRS Bulletin, (2025), 50, 2, (190-207), 10.1557/s43577-024-00846-y)

学校读者我要写书评

暂无评论

MRS Bulletin 2025年 1-2页

作者： Banerjee, Sarbajit Meng, Y. Shirley Minor, Andrew M. Zhang, Minghao Zaluzec, Nestor J. Chan, Maria K.Y. Seidler, Gerald McComb, David W. Agar, Joshua Mukherjee, Partha P. Melot, Brent Chapman, Karena Guiton, Beth S. Klie, Robert F. McCue, Ian D. Voyles, Paul M. Robertson, Ian Li, Ling Chi, Miaofang Destino, Joel F. Devaraj, Arun Marquis, Emmanuelle A. Segre, Carlo U. Liu, Huinan H. Yang, Judith C. Momeni, Kasra Misra, Amit Abdolrahim, Niaz Medvedeva, Julia E. Cai, Wenjun Sehirlioglu, Alp Dizbay-Onat, Melike Mehta, Apurva Graham-Brady, Lori Maruyama, Benji Rajan, Krishna Warner, Jamie H. Taheri, Mitra L. Kalinin, Sergei V. Reeja-Jayan, B. Schwarz, Udo D. Simon, Sindee L. Brown, Craig M. Department of Chemistry and Department of Materials Science & Engineering Texas A & M University College Station United States Pritzker School of Molecular Engineering The University of Chicago Chicago United States Department of Materials Science & Engineering University of California Berkeley Berkeley United States National Center for Electron Microscopy Molecular Foundry Lawrence Berkeley National Laboratory Berkeley United States Center for Nanoscale Materials Argonne National Laboratory Lemont United States Department of Physics University of Washington Seattle United States Department of Materials Science & Engineering The Ohio State University Columbus United States Department of Mechanical Engineering and Mechanics Drexel University Philadelphia United States School of Mechanical Engineering Purdue University West Lafayette United States Department of Chemistry University of Southern California Los Angeles United States Department of Chemistry Stony Brook University The State University of New York Stony Brook United States Department of Chemistry University of Kentucky Lexington United States Department of Physics University of Illinois at Chicago Chicago United States Department of Materials Science & Engineering Northwestern University Evanston Bangladesh Department of Materials Science & Engineering University of Wisconsin–Madison Madison United States Department of Materials Science and Engineering University of Pennsylvania Philadelphia United States Department of Mechanical Engineering and Materials Science Duke University Durham United States Department of Chemistry Creighton University Omaha United States Physical and Computational Sciences Directorate Pacific Northwest National Laboratory Richland United States Department of Materials Science & Engineering University of Michigan–Ann Arbor Ann Arbor United States Department of Physics Illinois Institute of Technology Chicago United States Department of Bioengineering and the Mater

This article was updated to correct Minghao Zhang’s affiliation from "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA" to "Pritzker School of Molecular engineering, The University of Chicago, Chicago, USA;Argonne National laboratory, Lemont, USA." Argonne National laboratory was left off the original publication. © The Author(s) 2025.

关键词：

Decoupling General and Personalized Knowledge in Federated Learning via Additive and Low-rank Decomposition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xinghao Liu, Xuefeng Niu, Jianwei Wang, Haolin Tang, Shaojie Zhu, Guogang Su, Hao State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China Jindal School of Management University of Texas at Dallas United States

To address data heterogeneity, the key strategy of Personalized Federated Learning (PFL) is to decouple general knowledge (shared among clients) and client-specific knowledge, as the latter can have a negative impact on collaboration if not removed. Existing PFL methods primarily adopt a parameter partitioning approach, where the parameters of a model are designated as one of two types: parameters shared with other clients to extract general knowledge and parameters retained locally to learn client-specific knowledge. However, as these two types of parameters are put together like a jigsaw puzzle into a single model during the training process, each parameter may simultaneously absorb both general and client-specific knowledge, thus struggling to separate the two types of knowledge effectively. In this paper, we introduce FedDecomp, a simple but effective PFL paradigm that employs parameter additive decomposition to address this issue. Instead of assigning each parameter of a model as either a shared or personalized one, FedDecomp decomposes each parameter into the sum of two parameters: a shared one and a personalized one, thus achieving a more thorough decoupling of shared and personalized knowledge compared to the parameter partitioning method. In addition, as we find that retaining local knowledge of specific clients requires much lower model capacity compared with general knowledge across all clients, we let the matrix containing personalized parameters be low rank during the training process. Moreover, a new alternating training strategy is proposed to further improve the performance. Experimental results across multiple datasets and varying degrees of data heterogeneity demonstrate that FedDecomp outperforms state-of-the-art methods up to 4.9%. The code is available at https://***/XinghaoWu/FedDecomp. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

Generative Landmarks Guided Eyeglasses Removal 3D Face Reconstruction

学校读者我要写书评

暂无评论

arXiv 2024年

Single-view 3D face reconstruction is a fundamental computer Vision problem of extraordinary difficulty. Current systems often assume the input is unobstructed faces which makes their method not suitable for in-the-wild conditions. We present a method for performing a 3D face that removes eyeglasses from a single image. Existing facial reconstruction methods fail to remove eyeglasses automatically for generating a photo-realistic 3D face"in-the-wild".The innovation of our method lies in a process for identifying the eyeglasses area robustly and remove it intelligently. In this work, we estimate the 2D face structure of the reasonable position of the eyeglasses area, which is used for the construction of 3D texture. An excellent anti-eyeglasses face reconstruction method should ensure the authenticity of the output, including the topological structure between the eyes, nose, and mouth. We achieve this via a deep learning architecture that performs direct regression of a 3DMM representation of the 3D facial geometry from a single 2D image. We also demonstrate how the related face parsing task can be incorporated into the proposed framework and help improve reconstruction quality. We conduct extensive experiments on existing 3D face reconstruction tasks as concrete examples to demonstrate the method’s superior regulation ability over existing methods often break down. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep learning

Implicit smoothed particle hydrodynamics model for simulating incompressible fluid-elastic coupling

学校读者我要写书评

暂无评论

Implicit smoothed particle hydrodynamics model for simulatin...

作者： Wang, Xiaokun Wang, Tiancheng Wang, Jiamin Xu, Yanrui Ban, Xiaojuan Huang, Houbin Zhu, Zhihong Chang, Jian Zhang, Jian Jun School of Intelligence Science and Technology University of Science and Technology Beijing Beijing China Beijing Key Laboratory of Knowledge Engineering for Materials Science University of Science and Technology Beijing Beijing China National Centre for Computer Animation Bournemouth University Poole United Kingdom Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing Beijing China Key Laboratory of Perception and Control of Intelligent Bionic Unmanned Systems Ministry of Education University of Science and Technology Beijing Beijing China Chinese PLA General Hospital Beijing China Hainan Hospital of Chinese PLA General Hospital Hainan Sanya China

Fluid simulation has been one of the most critical topics in computer graphics for its capacity to produce visually realistic effects. The intricacy of fluid simulation manifests most with interacting dynamic elements. The coupling for such scenarios has always been challenging to manage due to the numerical instability arising from the coupling boundary between different elements. Therefore, we propose an implicit smoothed particle hydrodynamics fluid-elastic coupling approach to reduce the instability issue for fluid-fluid, fluid-elastic, and elastic-elastic coupling circumstances. By deriving the relationship between the universal pressure field with the incompressible attribute of the fluid, we apply the number density scheme to solve the pressure Poisson equation for both fluid and elastic material to avoid the density error for multi-material coupling and conserve the non-penetration condition for elastic objects interacting with fluid particles. Experiments show that our method can effectively handle the multiphase fluids simulation with elastic objects under various physical properties. © 2023 The Authors. computer Animation and Virtual Worlds published by John Wiley & Sons Ltd.

关键词： Poisson equation