In this article, we propose a novel framework for camouflaged object detection (COD),
named D C-Net, which contains two new modules: Dual-branch features extraction (DFE) …

In this paper, we consider one of the most important missing target search problems, in
which the bounded linear search interval has been divided into a number of small sub …

Abstract The Segment Anything Model (SAM) a prompt-driven foundational model has
demonstrated remarkable performance in natural image segmentation. However its …

We consider a new type of asymmetric rendezvous search problem in which player II needs
to give player I a 'gift'which can be in the form of information or material. The gift can either …

According to the process of the human visual observation mechanism we propose a novel
architecture for camouflaged object detection (COD), which is composed of two main …

We propose a new framework for camouflaged object detection (COD) named FLCNet,
which comprises three modules: an underlying feature mining module (UFM), a texture …

We rethink the segment anything model (SAM) and propose a novel multiprompt network
called COMPrompter for camouflaged object detection (COD). SAM has zero-shot …

The coordinated search method for a one-dimensional Brownian particle in the fluid is
investigated in this paper. This technique helps to remove pollutants and impurities from the …

We study the classic problem of searching for a hidden target in the line and the $ m $-ray
star, in a setting in which the searcher has some prediction on the hider's position. We first …

A Search and Rescue game (SR game) is a new type of game on a graph that has quickly
found applications in scheduling, object detection, and adaptive search. In this paper, we …