Abstract
In this paper, a temporal superpixel algorithm using proximity-weighted patch matching (PPM) is proposed to yield temporally consistent superpixels for image and video processing. PPM estimates the motion vector of a superpixel robustly, by considering the patch matching distances of neighboring superpixels as well as the superpixel itself. In each frame, we initialize superpixels by transferring the superpixel labels of the previous frame using PPM motion vectors. Then, we update the superpixel labels of boundary pixels by minimizing a cost function, which is composed of feature distance, compactness, contour, and temporal consistency terms. Finally, we carry out superpixel splitting, merging, and relabeling to regularize superpixel sizes and correct inaccurate labels. Extensive experimental results confirm that the proposed algorithm outperforms the state-of-the-art conventional algorithms significantly. Also, it is demonstrated that the proposed algorithm can be applied to video object segmentation and video saliency detection tasks.
| Original language | English |
|---|---|
| Pages (from-to) | 13811-13839 |
| Number of pages | 29 |
| Journal | Multimedia Tools and Applications |
| Volume | 79 |
| Issue number | 19-20 |
| DOIs | |
| Publication status | Published - 2020 May 1 |
Bibliographical note
Funding Information:This work was supported by the research fund of Signal Intelligence Research Center supervised by Defense Acquisition Program Administration and Agency for Defense Development of Korea, and by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. NRF-2018R1A2B3003896).
Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Image processing
- Image segmentation
- Saliency detection
- Superpixel
- Temporal superpixel
- Video processing
ASJC Scopus subject areas
- Software
- Media Technology
- Hardware and Architecture
- Computer Networks and Communications