Sciweavers

517 search results - page 50 / 104
» An Approximate Algorithm for Structural Matching of Images
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Accelerating active contour algorithms with the Gradient Diffusion Field
Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge in...
Willie Kiser, Pradeep Sen, Chris Musial
ICIP
2009
IEEE
14 years 9 months ago
Non-local Image Smoothing By Applying Anisotropic Diffusion Pde's In The Space Of Patches
We design a family of non-local image smoothing algorithms which approximate the application of diffusion PDE's on a specific Euclidean space of image patches. We first map a...
JMLR
2012
11 years 10 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
ECCV
2006
Springer
14 years 9 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
AIRS
2005
Springer
14 years 1 months ago
MPEG-7 Visual-Temporal Clustering for Digital Image Collections
We present a novel, yet simple algorithm for clustering large collections of digital images. The method is applicable to consumer digital photo libraries, where it can be used to o...
Robert O'Callaghan, Miroslaw Bober