Sciweavers

1068 search results - page 165 / 214
» Fast and robust bootstrap
Sort
View
CEC
2007
IEEE
14 years 4 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 4 months ago
Pilot-Aided Fine Synchronization for SC-FDE Systems on Multipath Fading Channels
—With single-carrier frequency-domain equalization (SC-FDE), the carrier-frequency offset (CFO) and samplingfrequency offset (SFO) are embedded in the phase rotations of the comp...
Ping-Hung Chiang, Gordon L. Stüber, Ding-Bing...
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Power Efficient Motion Estimation using Multiple Imprecise Metric Computations
In this paper, we propose power efficient motion estimation (ME) using multiple imprecise sum absolute difference (SAD) metric computations. We extend recent work in [18] by prov...
In Suk Chong, Antonio Ortega
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
14 years 4 months ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand
CIARP
2007
Springer
14 years 4 months ago
Image Segmentation Using Automatic Seeded Region Growing and Instance-Based Learning
Segmentation through seeded region growing is widely used because it is fast, robust and free of tuning parameters. However, the seeded region growing algorithm requires an automat...
Octavio Gómez, Jesús A. Gonzá...