Results 281 to 290 of about 5,975,260 (378)

CBAM: Convolutional Block Attention Module

European Conference on Computer Vision, 2018
We propose Convolutional Block Attention Module (CBAM), a simple yet effective attention module for feed-forward convolutional neural networks. Given an intermediate feature map, our module sequentially infers attention maps along two separate dimensions,
Sanghyun Woo, Jongchan Park, Joon-Young Lee, In-So Kweon   +3 more
semanticscholar   +1 more source

Block and sliding-block source coding

IEEE Transactions on Information Theory, 1977
A new form of source coding subject to a fidelity criterion, called sliding-block coding, has recently been introduced by Gray, Neuhoff, and Ornstein. A method of conversion from block coding to sliding-block coding, or vice versa, with an arbitrarily small increase in rate is shown for ergodic sources.
David L. Neuhoff, P. Shields
openaire   +3 more sources

Linear Block Codes [PDF]

, 2020
As usual, in this chapter we consider that p denotes a prime number, q is a prime power and \({\mathbb F}_{q}\) is the finite field with q elements. We begin by defining the general concept of a code over \({\mathbb F}_{q}\); after this, we present the concept of a linear code that is the more important class of codes in coding and information theory ...
La Guardia, Giuliano Gadioli
openaire   +1 more source

On the trellis structure of block codes

Proceedings of 1994 IEEE International Symposium on Information Theory, 1995
Summary: The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing ...
Frank R. Kschischang, V. Sorokine
openaire   +3 more sources

Energy-Efficient Full Diversity Collaborative Unitary Space-Time Block Code Designs via Unique Factorization of Signals

IEEE Transactions on Information Theory, 2011
In this paper, a novel concept called a uniquely factorable constellation pair (UFCP) is proposed for the systematic design of a noncoherent full diversity collaborative unitary space-time block code by normalizing two Alamouti codes for a wireless ...
Dong Xia, Jian-Kang Zhang, S. Dumitrescu
semanticscholar   +1 more source

On polyalphabetic block codes

IEEE Information Theory Workshop, 2005., 2005
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Valentin Afanassiev, Martin Bossert, E. Gabidulin, G. Schmidt, Vladimir Sidorenko   +4 more
openaire   +2 more sources

Receptive Field Block Net for Accurate and Fast Object Detection

European Conference on Computer Vision, 2017
Current top-performing object detectors depend on deep CNN backbones, such as ResNet-101 and Inception, benefiting from their powerful feature representations but suffering from high computational costs. Conversely, some lightweight model based detectors
Songtao Liu, Di Huang, Yunhong Wang
semanticscholar   +1 more source

Extension of source coding theorems for block codes to sliding-block codes

IEEE Transactions on Information Theory, 1980
For arbitrary alphabets and single-letter fidelity criteria, two theorems are given which allow any fixed-rate or variable-rate source coding theorem for block codes to be extended to sliding-block codes. Applications are given to universal coding and to the coding of a stationary nonergodic source.
openaire   +2 more sources

On braided block codes

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
Two families of braided block codes are analyzed, tightly braided block codes and sparsely braided block codes. Bounds on the free distance of tightly braided block codes are derived. Asymptotic iterative decoding performance of sparsely braided block codes is studied.
Kamil Sh. Zigangirov, Dmitri Truhachev, Michael Lentmaier   +2 more
openaire   +2 more sources