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

Image saliency and co-saliency detection by low-rank multiscale fusion

学校读者我要写书评

暂无评论

Image saliency and co-saliency detection by low-rank multisc...

作者： Huang, Rui Feng, Wei Sun, Jizhou Zou, Yaobin College of Computer Science and Technology Civil Aviation University of China Tianjin300300 China Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering China Three Gorges University Yichang443003 China College of Intelligence and Computing School of Computer Science and Technology Tianjin University Tianjin300350 China Key Research Center for Surface Monitoring and Analysis of Cultural Relics State Administration of Cultural Heritage China

Saliency and co-saliency detection aim to distinguish conspicuous foreground objects from single and multiple images, thus are essential in many multimedia and vision applications. To achieve balanced efficiency and accuracy, most recent successful saliency detectors are based on superpixels. However, saliency detection with single-scale superpixel segmentation may fail in capturing intrinsic salient objects of complex natural scenes with small-scale high-contrast backgrounds. To tackle this problem, we present a simple strategy using multiscale superpixels to jointly detect salient object via low-rank optimisation. Specifically, we first build a multiscale superpixel pyramid and derive the corresponding saliency map by multimodal saliency features and priors at each single scale. Then, we use joint low-rank analysis of multiscale saliency maps to obtain a more reliable and adaptively-fused saliency map, which properly takes all scales saliency into account. We further propose a GMM generative co-saliency prior to enable the above approach to detect co-salient objects from multiple images. Extensive experiments on benchmark datasets validate the effectiveness and superiority of the proposed saliency and co-saliency detector over state-of-the-arts. Copyright © 2019 Inderscience Enterprises Ltd.

关键词： Object detection

Cloud-based remote control framework for unmanned surface vehicles ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2020年第2期53卷 14564-14569页

作者： Zhao Wang Shaolong Yang Xianbo Xiang Antonio Vasilijević Nikola Mišković Ðula Nađ School of Naval Architecture and Ocean Engineering Huazhong University of Science and Technology Wuhan 430074 China Hubei Key Laboratory of Naval Architecture and Ocean Engineering Hydrodynamics (HUST) Wuhan 430074 PR China Laboratory for Underwater Systems and Technologies Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia

This paper proposes a cloud-based mission control framework for a fleet of unmanned vehicles. The framework enables easy remote access to fleet operations regardless of operator location. By leveraging cloud-based technologies the framework accomplishes scalable monitoring, remote control, data acquisition and sharing. While the front-end is applicable across mobile robotic systems, the back-end presented in this paper provides integration with the Robot Operating System (ROS); thus, enabling integration of various marine robotic agents based on the same robot framework. The proposed framework operation is demonstrated on the H2OmniX unmanned surface vehicles during trials in Biograd na Moru, Croatia.

关键词： remote control distributed control cloud-based control Robot Operating System

Further Investigations on Nonlinear Complexity of Periodic Binary Sequences

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yuan, Qin Li, Chunlei Zeng, Xiangyong Helleseth, Tor He, Debiao Faculty of Mathematics and Statistics Hubei Key Laboratory of Applied Mathematics Hubei University Hubei Wuhan430062 China Department of Informatics University of Bergen BergenN-5020 Norway Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Hubei Wuhan430072 China

Nonlinear complexity is an important measure for assessing the randomness of sequences. In this paper we investigate how circular shifts affect the nonlinear complexities of finite-length binary sequences and then reveal a more explicit relation between nonlinear complexities of finite-length binary sequences and their corresponding periodic sequences. Based on the relation, we propose two algorithms that can generate all periodic binary sequences with any prescribed nonlinear complexity. © 2024, CC BY.

关键词： Binary sequences

Rectangular multiple-relaxation-time lattice Boltzmann method for the Navier-Stokes and nonlinear convection-diffusion equations: General equilibrium and some important issues

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chai, Zhenhua Yuan, Xiaolei Shi, Baochang Institute of Interdisciplinary Research for Mathematics and Applied Science School of Mathematics and Statistics Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan430074 China College of Mathematics and Information Science Hebei University Baoding071002 China

In this paper, we develop a general rectangular multiple-relaxation-time lattice Boltzmann (RMRT-LB) method for the Navier-Stokes equations (NSEs) and nonlinear convection-diffusion equation (NCDE) by extending our recent unified framework of MRT-LB method [Z.H. Chai and B.C. Shi, Phys. Rev. E 102, 023306 (2020)], where a rectangular equilibrium distribution function (REDF) [J.H. Lu et al, Phil. Trans. R. Soc. A 369, 2311-2319 (2011)] on a rectangular lattice is utilized. Due to the anisotropy of discrete velocities on a rectangular lattice, the third-order moment of REDF is inconsistent with that of popular LB method, and thus the previous unified framework of MRT-LB method cannot be directly applied to the NSEs using the REDF on the rectangular rDdQq (q discrete velocities in d-dimensional space, d ≥ 1) lattice. The macroscopic NSEs can be recovered from the RMRT-LB method through the direct Taylor expansion method by properly selecting the relaxation sub-matrix S2 which is related to kinetic viscosity and bulk viscosity. While the rectangular lattice does not lead to the change of the zero-th, first and second-order moments of REDF, thus the unified framework of MRT-LB method can be directly applied to the NCDE. It should be noted that the RMRT-LB model for NSEs can be derived on the rDdQq lattice, including rD2Q9, rD3Q19, and rD3Q27 lattices, while there are no rectangular D3Q13 and D3Q15 lattices within this framework of RMRT-LB method. Thanks to the block-lower triangular-relaxation matrix introduced in the unified framework, the RMRT-LB versions (if existed) of the previous MRT-LB models can be obtained, including those based on raw (natural)-moment, central-moment, Hermite-moment, and central Hermite-moment, respectively. It is also found that when the standard or regular lattice is used, and the sound speed is taken as an adjustable parameter, the present RMRT-LB method becomes a new class of MRT-LB method for the NSEs and NCDE, and the commonly used MRT-LB

关键词： Navier Stokes equations

Evolutionary Competitive Multiobjective Multitasking: One-Pass Optimization of Heterogeneous Pareto Solutions

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年

作者： Li, Yanchi Wu, Xinyi Gong, Wenyin Xu, Meng Wang, Yubo Gu, Qiong China University of Geosciences School of Computer Wuhan430074 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Hubei University of Arts and Science School of Computer Engineering Xiangyang441053 China Hubei University of Arts and Science Hubei Key Laboratory of Power System Design and Test for Electrical Vehicle Xiangyang441053 China

Competitive multiobjective multitask optimization (CMO-MTO) problems involve multiple tasks with comparable objectives but heterogeneous decision variables. The final Pareto front in CMO-MTO consists of multiple subsets corresponding to different tasks. Since the Pareto front subset of one task may be dominated by that of another, competition arises among tasks. Additionally, there may be exploitable similarities among tasks that evolutionary multitasking methods can leverage. For a comprehensive study of CMO-MTO, we construct 12 benchmark CMO-MTO problems with varied competitive relationships and inter-task similarities. To effectively solve CMO-MTO problems, we propose a reference vector contribution-based multitask evolutionary algorithm (RVC-MTEA). RVC-MTEA facilitates both global and local knowledge transfer based on vector contributions and integrates global archives to gather non-dominated solutions across multiple competitive tasks. Comparative results with four popular single-task and six state-of-the-art multitask evolutionary algorithms demonstrate the efficacy of RVC-MTEA. Finally, we apply RVC-MTEA to several real-world applications, showcasing the potential of CMO-MTO in practical decision-making scenarios. © 1997-2012 IEEE.

关键词： Competition

Incentive Sharing: A Consumer-Data Privacy Trusted Sharing Paradigm Via Proximal Policy Optimization in Industry 5.0

学校读者我要写书评

暂无评论

IEEE Transactions on Consumer Electronics 2024年

作者： Cai, Ting Hu, Ying Li, Xiang Chen, Wuhui Wu, Yuxin Ye, Zhiwei Zheng, Zibin Hubei University of Technology China China Hubei University of Technology School of Computer Science The Provincial Key Laboratory of Green Intelligent Computing Network Wuhan430068 China Sun Yat-sen University China Pengcheng Laboratory China Hubei University of Arts and Science School of Computer Engineering Xiangyang441053 China Sun Yat-sen University School of Software Engineering Zhuhai519000 China

Industry 5.0 emphasizes consumer data sharing to drive data-driven innovation and enhance user experiences in consumer electronics. Blockchain-integrated federated learning (blockchained FL) has recently emerged as a privacy-Trusted paradigm to facilitate sharing. However, most blockchained FL sharing paradigms cannot adapt to the complexity or variability of consumer data and network conditions such as: 1) inadequate balancing of the trade-off between data quality and training costs during device selection;2) incentives are designed to maximize instantaneous profit without considering the long-Term dynamics of electronic devices. These limitations lead to low-quality model training and security degradation. This paper proposes a novel blockchained FL incentive-sharing paradigm that dynamically selects consumer devices from a long-Term perspective while balancing data quality and training costs. Specifically, we first present a reputation strategy to enhance security by applying a predefined threshold to prevent malicious and low-quality consumers from participating in FL. Then, to optimize device selection under complex and dynamic consumer environments with high-dimensional system states, a Proximal Policy Optimization (PPO)-based incentive mechanism is proposed, which includes: 1) building an 'intelligent engine' to select the optimal consumer devices for each round of FL based on data quality and costs, and 2) implementing incentives to achieve long-Term maximization of the system's social welfare. Extensive simulations show that our sharing paradigm has, on average, 46.97% higher social welfare and 77.27% lower social costs than baselines and can guarantee high data quality in a trustless environment. © 1975-2011 IEEE.

关键词： Differential privacy

Validating SMT Solvers via Skeleton Enumeration Empowered by Historical Bug-Triggering Inputs

学校读者我要写书评

暂无评论

Validating SMT Solvers via Skeleton Enumeration Empowered by...

International Conference on Software engineering (ICSE)

作者： Maolin Sun Yibiao Yang Ming Wen Yongcong Wang Yuming Zhou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Technology Huazhong University of Science and Technology China

SMT solvers check the satisfiability of logic formulas over first-order theories, which have been utilized in a rich number of critical applications, such as software verification, test case generation, and program synthesis. Bugs hidden in SMT solvers would severely mislead those applications and further cause severe consequences. Therefore, ensuring the reliability and robustness of SMT solvers is of critical importance. Although many approaches have been proposed to test SMT solvers, it is still a challenge to discover bugs effectively. To tackle such a challenge, we conduct an empirical study on the historical bug-triggering formulas in SMT solvers' bug tracking systems. We observe that the historical bug-triggering formulas contain valuable skeletons (i.e., core structures of formulas) as well as associated atomic formulas which can cast significant impacts on formulas' ability in triggering bugs. Therefore, we propose a novel approach that utilizes the skeletons extracted from the historical bug-triggering formulas and enumerates atomic formulas under the guidance of association rules derived from historical formulas. In this study, we realized our approach as a practical fuzzing tool HistFuzz and conducted extensive testing on the well-known SMT solvers Z3 and cvc5. To date, HistFuzz has found 111 confirmed new bugs for Z3 and cvc5, of which 108 have been fixed by the developers. More notably, out of the confirmed bugs, 23 are soundness bugs and invalid model bugs found in the solvers' default mode, which are essential for SMT solvers. In addition, our experiments also demonstrate that HistFuzz outperforms the state-of-the-art SMT solver fuzzers in terms of achieved code coverage and effectiveness.

关键词：

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Roy Y. Liu, Haixia Liu, Hao Department of Mathematics City University of Hong Kong Kowloon Tong Hong Kong School of Mathematics and Statistics Institute of Interdisciplinary Research for Mathematics and Applied Science Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Hubei Wuhan China Department of Mathematics Hong Kong Baptist University Kowloon Tong Hong Kong

In this paper, we present a convergence analysis of the Group Projected Subspace Pursuit (GPSP) algorithm proposed by He et al. [HKL+23] (Group Projected subspace pursuit for IDENTification of variable coefficient differential equations (GP-IDENT), Journal of Computational Physics, 494, 112526) and extend its application to general tasks of block sparse signal recovery. We prove that when the sampling matrix satisfies the Block Restricted Isometry Property (BRIP) with a sufficiently small Block Restricted Isometry Constant (BRIC), GPSP exactly recovers the true block sparse signals. When the observations are noisy, this convergence property of GPSP remains valid if the magnitude of the true signal is sufficiently large. GPSP selects the features by subspace projection criterion (SPC) for candidate inclusion and response magnitude criterion (RMC) for candidate exclusion. We compare these criteria with counterparts of other state-of-the-art greedy algorithms. Our theoretical analysis and numerical ablation studies reveal that SPC is critical to the superior performances of GPSP, and that RMC can enhance the robustness of feature identification when observations contain noises. We test and compare GPSP with other methods in diverse settings, including heterogeneous random block matrices, inexact observations, face recognition, and PDE identification. We find that GPSP outperforms the other algorithms in most cases for various levels of block sparsity and block sizes, justifying its effectiveness for general applications. © 2024, CC BY.

关键词： Face recognition

A note on optimal decay rates for the axisymmetric D-solutions to the steady Navier-Stokes equations

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Weng, Shangkun Xie, Chunjing School of Mathematics and Statistics Computational Science Hubei Key Laboratory Wuhan University Wuhan Hubei Province430072 China Department of Mathematics Institute of Natural Sciences Ministry of Education Key Laboratory of Scientific and Engineering Computing Shanghai Jiao Tong University Shanghai200240 China

In this paper, we investigate the decay properties of an axisymmetric D-solutions to stationary incompressible Navier-Stokes systems in R3. We obtain the optimal decay rate |u(x)| | xC|+1 for axisymmetric flows without swirl. Furthermore, we find a dichotomy for the decay rates of the swirl component ua, that is, either O(+11) +1or |ue(r,z)| (C1r)3, where p = Vr2+ z2. In the latter case, we can further deduce that the other two components of the velocity field also attain the optimal decay rates: |ur(r, z)| + |uz(r, z)| C+1-. We do not require any small assumptions on the forcing *** Codes 76D05 Copyright © 2017, The Authors. All rights reserved.

关键词： Navier Stokes equations