Sciweavers

1539 search results - page 64 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
98
Voted
ICMCS
2007
IEEE
188views Multimedia» more  ICMCS 2007»
15 years 8 months ago
A Fast Approach for Natural Image Matting using Structure Information
Natural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem – we must estimate bo...
Qianhui Ning, Weiqiang Wang, Caifeng Zhu, Laiyun Q...
IJCV
2008
173views more  IJCV 2008»
15 years 2 months ago
Fast Non-Rigid Surface Detection, Registration and Realistic Augmentation
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches be...
Julien Pilet, Vincent Lepetit, Pascal Fua
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint
126
Voted
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
15 years 11 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
15 years 9 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...