Abstract

Early vision relies heavily on rectangular windows for tasks such as smoothing and computing correspondence. While rectangular windows are efficient, they yield poor results near object boundaries. We describe an efficient method for choosing an arbitrarily shaped connected window, in a manner that varies at each pixel. Our approach can be applied to several problems, including image restoration and visual correspondence. It runs in linear time, and takes a few seconds on traditional benchmark images. Performance on both synthetic and real imagery appears promising.

Keywords

Artificial intelligenceComputer visionWindow (computing)Computer sciencePixelBenchmark (surveying)SmoothingCognitive neuroscience of visual object recognitionObject detectionObject (grammar)Pattern recognition (psychology)

Affiliated Institutions

Related Publications

Publication Info

Year
1998
Type
article
Volume
20
Issue
12
Pages
1283-1294
Citations
155
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

155
OpenAlex

Cite This

Yu. Boykov, Olga Veksler, Ramin Zabih (1998). A variable window approach to early vision. IEEE Transactions on Pattern Analysis and Machine Intelligence , 20 (12) , 1283-1294. https://doi.org/10.1109/34.735802

Identifiers

DOI
10.1109/34.735802