Skip to main navigation Skip to search Skip to main content

Temporal Superpixels Based on Proximity-Weighted Patch Matching

  • Korea University

Research output: Contribution to conferenceConference paperpeer-review

Abstract

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 robustly, by considering the patch matching distances of neighboring superpixels as well as the target superpixel. 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, based on a cost function, composed of color, spatial, contour, and temporal consistency terms. Finally, we execute superpixel splitting, merging, and relabeling to regularize superpixel sizes and reduce incorrect labels. Experiments show that the proposed algorithm outperforms the state-of-the-art conventional algorithms significantly.

Original languageEnglish
Title of host publicationProceedings - 2017 IEEE International Conference on Computer Vision, ICCV 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3630-3638
Number of pages9
ISBN (Electronic)9781538610329
DOIs
StatePublished - 2017.12.22
Event16th IEEE International Conference on Computer Vision, ICCV 2017 - Venice, Italy
Duration: 2017.10.222017.10.29

Publication series

NameProceedings of the IEEE International Conference on Computer Vision
Volume2017-October
ISSN (Print)1550-5499

Conference

Conference16th IEEE International Conference on Computer Vision, ICCV 2017
Country/TerritoryItaly
CityVenice
Period17.10.2217.10.29

Fingerprint

Dive into the research topics of 'Temporal Superpixels Based on Proximity-Weighted Patch Matching'. Together they form a unique fingerprint.

Cite this