Sciweavers

5595 search results - page 129 / 1119
» Comparing Subsumption Optimizations
Sort
View
ICMCS
2007
IEEE
194views Multimedia» more  ICMCS 2007»
15 years 11 months ago
Automatically Tuning Background Subtraction Parameters using Particle Swarm Optimization
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
Brandyn White, Mubarak Shah
PG
2007
IEEE
15 years 11 months ago
Contour Correspondence via Ant Colony Optimization
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...
SIPS
2007
IEEE
15 years 11 months ago
Optimal Data Mapping for Motion Compensation in H.264 Video Decoding
— Long initial access cycles of SDRAM are the major performance burden of motion compensation in a video decoder. To minimize its effect while improve overall available memory ba...
Guo-Shiuan Yu, Tian-Sheuan Chang
161
Voted
VTC
2007
IEEE
146views Communications» more  VTC 2007»
15 years 11 months ago
Orthogonal STBC in General Nakagami-m Fading Channels: BER Analysis and Optimal Power Allocation
Abstract— We analyze the performance of multiple-input multiple-output (MIMO) systems employing orthogonal space-time block codes (STBC) in general Nakagami-m fading channels wit...
Andreas Müller, Joachim Speidel
ISNN
2007
Springer
15 years 11 months ago
Neural Networks Training with Optimal Bounded Ellipsoid Algorithm
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
José de Jesús Rubio, Wen Yu