DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/8410
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNarang, Pratik-
dc.contributor.authorRajput, Amitesh Singh-
dc.date.accessioned2023-01-09T10:29:21Z-
dc.date.available2023-01-09T10:29:21Z-
dc.date.issued2022-
dc.identifier.urihttps://ieeexplore.ieee.org/document/9977584-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8410-
dc.description.abstractImages captured from behind a fence, window, or during rain generally face occlusions. Though prior works have addressed the problems of individually de-raining, reflection, and occlusion removal, a common approach that removes all the obstruction has found little attention in the literature. In this paper, we address the image occlusion problem by proposing a deep learning-based approach wherein the proposed method uses motion differences between two images and extracts important moving features from videos to separate the background and the obstruction. To accomplish this task, a novel 3D-convolution architecture is introduced, which is trained with synthetically blended videos. We have used learned layer-based CNN methods combined with dense-optical flow with generative networks for better output images. Moreover, a dataset for obstruction removal with sequences for reflection and fencing removal is proposed. The proposed approach is well experimented over a different variety of images and is found as a good candidate against state-of-the-art schemes.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectComputer Scienceen_US
dc.subjectObstruction removalen_US
dc.subjectDeep Learningen_US
dc.subjectGANsen_US
dc.subjectCNNen_US
dc.titleEraisNET: An Optical Flow based 3D ConvNET for Erasing Obstructionsen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.