1 / 1

Precise line scratch detection with a contrario methods

Precise line scratch detection with a contrario methods. Alasdair NEWSON, Patrick PEREZ, Andrés ALMANSA, Yann GOUSSEAU. Prior Art. Context. Kokaram (1996): First line scratch model Bayesian estimation of scratch parameters Joyeux et al . (1999) : Temporal aspects included

decima
Download Presentation

Precise line scratch detection with a contrario methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Preciseline scratch detection with a contrariomethods Alasdair NEWSON, Patrick PEREZ, Andrés ALMANSA, Yann GOUSSEAU Prior Art Context • Kokaram (1996): • First line scratch model • Bayesian estimation of scratch parameters • Joyeuxet al. (1999) : • Temporal aspects included • Scratch tracking with Kalman filter • Bruniet al. (2004) : • Generalised model for scratches • Old archives deteriorate : restoration necessary • Manual restoration extremely time-consuming • Line scratches : persistent defects (last several frames) • Robust detection difficult • Characteristics difficult to determine • Easily confused with thin vertical structures Gray Level Pixel/median value difference Column Left average Right average Scratch width Zoom Scratch example Scratch Pixel Grouping Pixel-wise Scratch Detection Results A contrario methods : object “meaningful” if it is unlikely to be produced in noise image “From Gestalt Theory to Image Analysis : a Probabilistic Approach”, A. Desolneux, L. Moisan, J-M. Morel, Springer-Verlag, 2008 Segment probability in noise follows a Binomial law Original image Detected segments Recall/precision comparison with Bruni’s algorithm (in percentage) • Median difference threshold • Left/right neighbourhood coherence 1/ Accept segments with low Number of False Alarms (NFA) 2/ Impose maximality principle “Segment neither contains nor is contained by a better segment” 3/ Impose exclusion principle Original image Binary detection map • Pros • Sensitive, precise detection • Robust to noise and texture • Good recall • Cons • Over-detection • Thin vertical structures Question : how to group the detected points ? “Associate a pixel to the best segment only”

More Related