In this paper, we propose a two-branch deblurring framework. Given a blurred image, we first extract the edge map and employ an edge refinement network to recover the structure. Then the refined edge map is utilized t...
In this paper, we propose a two-branch deblurring framework. Given a blurred image, we first extract the edge map and employ an edge refinement network to recover the structure. Then the refined edge map is utilized to guide the subsequent deblurring process for correct structure recovery. Specifically, we develop a lightweight omni-dimensional attention module for long-range dependencies modeling and plug it into the edge refinement network, which effectively handles blur patterns with high variation. Furthermore, we propose a dynamic feature upsample module, which integrates dynamic convolution with upsampling and adaptively deals with the non-uniform blur. Extensive experiments show that our method outperforms state-of-the-art methods.
The concept of 3D scene graphs is increasingly recognized as a powerful semantic and hierarchical representation of the environment. Current approaches often address this at a coarse, object-level resolution. In contr...
详细信息
Accurate and flexible world models are crucial for autonomous systems to understand their environment and predict future events. Object-centric models, with structured latent spaces, have shown promise in modeling obj...
详细信息
The purpose of this study tried to examine the need to understand and manage the psychological states (e.g., fatigue, workload, job stress, and anxiety, etc.) of shipyard workers through a review of related studies. A...
详细信息
Driving behavior recognition is a key technology in human-machine cooperative driving, which plays an important role in the construction of an intelligent transportation environment. Due to the similarity of drivers &...
详细信息
Decentralized optimization over time-varying graphs has been increasingly common in modern machine learning with massive data stored on millions of mobile devices, such as in federated learning. This paper revisits th...
详细信息
Decentralized optimization over time-varying graphs has been increasingly common in modern machine learning with massive data stored on millions of mobile devices, such as in federated learning. This paper revisits the widely used accelerated gradient tracking and extends it to time-varying graphs. We prove that the practical single loop accelerated gradient tracking needs $O((\frac{\gamma}{1-\sigma_{\gamma}})^2\sqrt{\frac{L}{\epsilon}})$ and $O((\frac{\gamma}{1-\sigma_{\gamma}})^{1.5}\sqrt{\frac{L}{\mu}} log{\frac{1}{\epsilon}})$ iterations to reach an ε-optimal solution over time-varying graphs when the problems are nonstrongly convex and strongly convex, respectively, where γ and σγ are two common constants charactering the network connectivity, L and µ are the smoothness and strong convexity constants, respectively, and one iteration corresponds to one gradient oracle call and one communication round. Our convergence rates improve significantly over the ones of $O(\frac{1}{\epsilon^{5/7}})$ and $O((\frac{L}{\mu})^{5/7}\frac{1}{(1-\sigma)^{1.5}}\log\frac{1}{\epsilon})$, respectively, which were proved in the original literature of accelerated gradient tracking only for static graphs, where $\frac{\gamma}{1-\sigma_{\gamma}}$ equals 1/1-σ when the network is time-invariant. When combining with a multiple consensus subroutine, the dependence on the network connectivity constants can be further improved to O(1) and $O(\frac{\gamma}{1-\sigma_{\gamma}})$ for the gradient oracle and communication round complexities, respectively. When the network is static, by employing the Chebyshev acceleration, our complexities exactly match the lower bounds without hiding any poly-logarithmic factor for both nonstrongly convex and strongly convex problems.
Based on the model of "Internet+ BIM technology", Smart site can improve the construction Productivity and scientific management. This thesis mainly studied the effective method of building smart site in the...
详细信息
In model-free deep reinforcement learning (RL) algorithms, using noisy value estimates to supervise policy evaluation and optimization is detrimental to the sample efficiency. As this noise is heteroscedastic, its eff...
详细信息
As the development of hardware technology and the application of AI technology become popular, efforts to apply image-based services to real industrial sites are increasing. In particular, the development of image-bas...
详细信息
Estimating 6D poses of targets efficiently is critical for industrial stamping tasks, in which the Point Pair Feature (PPF) method has been widely used. Based on PPF, this paper proposes Fast and Robust PPF, i.e. FaRo...
详细信息
暂无评论