Sciweavers

1523 search results - page 68 / 305
» The Computational Complexity of Linear Optics
Sort
View
TIP
2008
108views more  TIP 2008»
13 years 8 months ago
Design of Linear Equalizers Optimized for the Structural Similarity Index
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
Sumohana S. Channappayya, Alan C. Bovik, Constanti...
GLOBECOM
2006
IEEE
14 years 2 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
ICPR
2008
IEEE
14 years 3 months ago
Epipolar geometry and log-polar transform in wide baseline stereo matching
This paper presents an interesting observation that epipolar geometry and log–polar transform can be naturally combined by setting the center of the log–polar transform into t...
Kimmo Palander, Sami S. Brandt
CVPR
2004
IEEE
14 years 11 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...
WG
2001
Springer
14 years 1 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...