{"title":"A contrario detection of good continuation of points","authors":"José Lezama, R. G. V. Gioi, G. Randall, J. Morel","doi":"10.1109/ICIP.2014.7025964","DOIUrl":null,"url":null,"abstract":"We will consider the problem of detecting configurations of points regularly spaced and lying on a smooth curve. This corresponds to the notion of good continuation introduced in the Gestalt theory. We present a robust algorithm for clustering points along such curves, whilst at the same time discarding noisy samples. Based on the a contrario methodology, the detector builds upon a simple, symmetric primitive for a triplet of points, and finds statistically meaningful chains of such triplets. An efficient implementation is proposed using the Floyd-Warshall algorithm. Experiments on synthetic and real data show that the method is able to identify the perceptually relevant configuration of points in good continuation.","PeriodicalId":6856,"journal":{"name":"2014 IEEE International Conference on Image Processing (ICIP)","volume":"31 1","pages":"4757-4761"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Image Processing (ICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2014.7025964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We will consider the problem of detecting configurations of points regularly spaced and lying on a smooth curve. This corresponds to the notion of good continuation introduced in the Gestalt theory. We present a robust algorithm for clustering points along such curves, whilst at the same time discarding noisy samples. Based on the a contrario methodology, the detector builds upon a simple, symmetric primitive for a triplet of points, and finds statistically meaningful chains of such triplets. An efficient implementation is proposed using the Floyd-Warshall algorithm. Experiments on synthetic and real data show that the method is able to identify the perceptually relevant configuration of points in good continuation.