Sciweavers

43 search results - page 5 / 9
» Matching and edge-connectivity in regular graphs
Sort
View
EMMCVPR
2005
Springer
14 years 7 days ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
JEI
2006
82views more  JEI 2006»
13 years 6 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
IPPS
2006
IEEE
14 years 22 days ago
Power consumption comparison for regular wireless topologies using fault-tolerant beacon vector routing
Fault-tolerant Beacon Vector Routing (FBVR) is an efficient technique for routing in the presence of node failures. Several common wireless topologies exist that can be used with...
Luke Demoracski, Dimiter R. Avresky
CVPR
2009
IEEE
15 years 1 months ago
A Graph-based Approach to Skin Mole Matching Incorporating Template-Normalized Coordinates
Density of moles is a strong predictor of malignant melanoma. Some dermatologists advocate periodic fullbody scan for high-risk patients. In current practice, physicians compare...
Ghassan Hamarneh, Hengameh Mirzaalian, Tim K. Lee
INFOCOM
2009
IEEE
14 years 1 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...