Sciweavers

77 search results - page 7 / 16
» Complete, exact, and efficient computations with cubic curve...
Sort
View
ICIP
2008
IEEE
14 years 1 months ago
Localized and computationally efficient approach to shift-variant image deblurring
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...
Murali Subbarao, Youn-sik Kang, Satyaki Dutta, Xue...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 1 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 6 days ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
CVPR
1996
IEEE
13 years 11 months ago
Extracting Salient Curves from Images: An Analysis of the Saliency Network
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
T. D. Alter, Ronen Basri
PRL
2008
126views more  PRL 2008»
13 years 6 months ago
Fourier-based geometric shape prior for snakes
A novel method of snakes with shape prior is presented in this paper. We propose to add a new force which makes the curve evolve to particular shape corresponding to a template to...
Mohamed Ali Charmi, Stéphane Derrode, Faouz...