Humayun, A; Mac Aodha, O; Brostow, GJ; (2011) Learning to Find Occlusion Regions. In: 2011 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR). (pp. ? - ?). IEEE
Full text not available from this repository.
For two consecutive frames in a video, we identify which pixels in the first frame become occluded in the second. Such general-purpose detection of occlusion regions is difficult and important because one-to-one correspondence of imaged scene points is needed for many tracking, video segmentation, and reconstruction algorithms. Our hypothesis is that an effective trained occlusion detector can be generated on the basis of i) a broad spectrum of visual features, and ii) representative but synthetic training sequences. By using a Random Forest based framework for feature selection and training, we found that the proposed feature set was sufficient to frequently assign a high probability of occlusion to just the pixels that were indeed becoming occluded. Our extensive experiments on many sequences support this finding, and while accuracy is certainly still scene-dependent, the proposed classifier could be a useful preprocessing step to exploit temporal information in video.
|Title:||Learning to Find Occlusion Regions|
|Event:||IEEE Conference on Computer Vision and Pattern Recognition (CVPR)|
|Location:||Colorado Springs, CO|
|Dates:||2011-06-20 - 2011-06-25|
|Keywords:||OPTICAL-FLOW ESTIMATION, BOUNDARIES, STEREO, COLOR|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record