Sciweavers

1601 search results - page 304 / 321
» Closed Sets for Labeled Data
Sort
View
BMVC
2010
15 years 4 months ago
Improved Anatomical Landmark Localization in Medical Images Using Dense Matching of Graphical Models
We propose a method for reliably and accurately identifying anatomical landmarks in 3D CT volumes based on dense matching of parts-based graphical models. Such a system can be use...
Vaclav Potesil, Timor Kadir, Günther Platsch,...
ICCV
2007
IEEE
16 years 8 months ago
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...
Dusan Omercevic, Ondrej Drbohlav, Ales Leonardis
ICCV
1999
IEEE
16 years 8 months ago
Segmentation using Eigenvectors: A Unifying View
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
Yair Weiss
FOCS
2009
IEEE
16 years 23 days ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
SPIRE
2009
Springer
16 years 16 days ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...