Sciweavers

918 search results - page 146 / 184
» Energy Efficient Programmable Computation
Sort
View
DAGM
2009
Springer
13 years 8 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
ISVC
2010
Springer
13 years 8 months ago
A Meshless Method for Variational Nonrigid 2-D Shape Registration
We present a method for nonrigid registration of 2-D geometric shapes. Our contribution is twofold. First, we extend the classic chamfer-matching energy to a variational functional...
Wei Liu, Eraldo Ribeiro
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 6 months ago
A new key establishment scheme for wireless sensor networks
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the se...
Eric Ke Wang, Lucas Chi Kwong Hui, Siu-Ming Yiu
TPDS
2008
161views more  TPDS 2008»
13 years 7 months ago
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
You-Chiun Wang, Yu-Chee Tseng
ICCV
2007
IEEE
14 years 9 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov