Saliency Object Detection from Video Streams using Salient-Graph Model with High-Level Background Prior
Ruchi Kshatri1, Kavita2
1Ruchi Kshatri *, Research Scholar, Jayoti Vidyapeeth Women’s University, Jaipur, India.
2Dr.Kavita, Associate Professor, Jayoti Vidyapeeth Women’s University, Jaipur, India
Manuscript received on August 03, 2019. | Revised Manuscript received on August 22, 2019. | Manuscript published on August 30, 2019. | PP: 3021-3025 | Volume-8 Issue-6, August 2019. | Retrieval Number: F9023088619/2019©BEIESP | DOI: 10.35940/ijeat.F9023.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This study proposes a novel salient graph model with high-level background prior. As usual, the collected data is pre-processed and then used for segmentation analysis. Object detection is still a daunting task due to increased complexity of false positive rate. Thus, a salient graph model is constructed using high-level background prior. Initially, the contrast of an image enhanced for superpixels and used for finding the shortest path of visible region. Then, saliency map is formed by spatial analysis of those visible superpixels. In salient post-processing, the salient graph is constructed by labelling background nodes with minimized cost. Based on formed salient region, each adjacent superpixel with background nodes are used for queries. Atlast, the estimated saliency and objectness measures detects the objects with minimal constraints. The proposed framework is analyzed on SegTrack and SegTrack 2, video segmentation dataset. The results states that the proposed method achieves better results than state of the art models by improved precision, recall, F-measure and computational time.
Keywords: Salient object detection, Background prior, Superpixels, Graph construction, Saliency measure and the salient graphs.