Sciweavers

2774 search results - page 347 / 555
» Exploiting Deep Structure
Sort
View
ECCV
2010
Springer
15 years 4 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
IJPP
2010
156views more  IJPP 2010»
15 years 3 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
CVPR
2011
IEEE
15 years 2 months ago
Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
Mehrtash Harandi, Sareh, Shirazi (National ICT Aus...
TCS
2011
15 years 1 months ago
Highly concurrent multi-word synchronization
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
Hagit Attiya, Eshcar Hillel
VC
2011
161views more  VC 2011»
15 years 1 months ago
A GPU framework for parallel segmentation of volumetric images using discrete deformable models
Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image segmentation problems is still not fully exploited and re...
Jérôme Schmid, José Antonio Ig...