Sciweavers

11 search results - page 1 / 3
» Efficiently computing minimax expected-size confidence regio...
Sort
View
ICML
2007
IEEE
15 years 4 hour ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
ICIP
2002
IEEE
15 years 24 days ago
Efficient selection of image patches with high motion confidence
Motion confidence measures aim to identify how well an image patch determines image motion. These kinds of confidence measures are commonly used to select points for optical flow ...
Peter Sand, Leonard McMillan
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 11 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi

Publication
285views
14 years 9 months ago
Bilateral Symmetry Detection and Segmentation via Symmetry-Growing
We present a novel and robust method for localizing and segmenting bilaterally symmetric patterns from real-world images. On the basis of symmetrically matched pairs of local featu...
Minsu Cho (Seoul National University), Kyoung Mu L...
ECCV
2000
Springer
15 years 1 months ago
Significantly Different Textures: A Computational Model of Pre-attentive Texture Segmentation
Abstract. Recent human vision research [1] suggests modelling preattentive texture segmentation by taking a set of feature samples from a local region on each side of a hypothesize...
Ruth Rosenholz