paper-with-me

홈 › Papers

SIN:Superpixel Interpolation Network

2021-10-17 · Qing Yuan, Songfeng Lu, Yan Huang, Wuxin Sha

Superpixels have been widely used in computer vision tasks due to their representational and computational efficiency. Meanwhile, deep learning and end-to-end framework have made great progress in various fields including computer vision. However, existing superpixel algorithms cannot be integrated into subsequent tasks in an end-to-end way. Traditional algorithms and deep learning-based algorithms are two main streams in superpixel segmentation. The former is non-differentiable and the latter needs a non-differentiable post-processing step to enforce connectivity, which constraints the integration of superpixels and downstream tasks. In this paper, we propose a deep learning-based superpixel segmentation algorithm SIN which can be integrated with downstream tasks in an end-to-end way. Owing to some downstream tasks such as visual tracking require real-time speed, the speed of generating superpixels is also important. To remove the post-processing step, our algorithm enforces spatial connectivity from the start. Superpixels are initialized by sampled pixels and other pixels are assigned to superpixels through multiple updating steps. Each step consists of a horizontal and a vertical interpolation, which is the key to enforcing spatial connectivity. Multi-layer outputs of a fully convolutional network are utilized to predict association scores for interpolations. Experimental results show that our approach runs at about 80fps and performs favorably against state-of-the-art methods. Furthermore, we design a simple but effective loss function which reduces much training time. The improvements of superpixel-based tasks demonstrate the effectiveness of our algorithm. We hope SIN will be integrated into downstream tasks in an end-to-end way and benefit the superpixel-based community. Code is available at: \href{https://github.com/yuanqqq/SIN}{https://github.com/yuanqqq/SIN}.

📄 PDF Abstract BibTeX arXiv:2110.08702

Code (1)

yuanqqq/sin 공식 구현 pytorch

Tasks

Computational EfficiencySuperpixelsVisual Tracking

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Robust Interpolation of Correspondences for Large Displacement Optical Flow

2017-07-01 · CVPR 2017 7 · Yinlin Hu, Yunsong Li, Rui Song

The interpolation of correspondences (EpicFlow) was widely used for optical flow estimation in most-recent works. It has the advantage of edge-preserving and efficiency. However, it is vulnerable to input matching noise,…

Optical Flow EstimationSuperpixels

Deterministic Guided LiDAR Depth Map Completion

2021-06-14 · Bryan Krauss, Gregory Schroeder, Marko Gustke, Ahmed Hussein

Accurate dense depth estimation is crucial for autonomous vehicles to analyze their environment. This paper presents a non-deep learning-based approach to densify a sparse LiDAR-based depth map using a guidance RGB image…

Autonomous VehiclesDeep LearningDepth CompletionDepth Estimation

Robust Physical Adversarial Patches Using Dynamically Optimized Clusters

2025-11-23 · Harrison Bagley, Will Meakin, Simon Lucey, Yee Wei Law 외 arxiv

Physical adversarial attacks on deep learning systems is concerning due to the ease of deploying such attacks, usually by placing an adversarial patch in a scene to manipulate the outcomes of a deep learning model. Train…

SuperpixelGridCut, SuperpixelGridMean and SuperpixelGridMix Data Augmentation

2022-04-11 · Karim Hammoudi, Adnane Cabani, Bouthaina Slika, Halim Benhabiles 외

A novel approach of data augmentation based on irregular superpixel decomposition is proposed. This approach called SuperpixelGridMasks permits to extend original image datasets that are required by training stages of ma…

Data Augmentationimage-classificationImage Classification

Temporal Superpixels Based on Proximity-Weighted Patch Matching

2017-10-01 · ICCV 2017 10 · Se-Ho Lee, Won-Dong Jang, Chang-Su Kim

A temporal superpixel algorithm based on proximity-weighted patch matching (TS-PPM) is proposed in this work. We develop the proximity-weighted patch matching (PPM), which estimates the motion vector of a superpixel robu…

Patch MatchingSuperpixels