9,398 research outputs found
Exploiting Local Features from Deep Networks for Image Retrieval
Deep convolutional neural networks have been successfully applied to image
classification tasks. When these same networks have been applied to image
retrieval, the assumption has been made that the last layers would give the
best performance, as they do in classification. We show that for instance-level
image retrieval, lower layers often perform better than the last layers in
convolutional neural networks. We present an approach for extracting
convolutional features from different layers of the networks, and adopt VLAD
encoding to encode features into a single vector for each image. We investigate
the effect of different layers and scales of input images on the performance of
convolutional features using the recent deep networks OxfordNet and GoogLeNet.
Experiments demonstrate that intermediate layers or higher layers with finer
scales produce better results for image retrieval, compared to the last layer.
When using compressed 128-D VLAD descriptors, our method obtains
state-of-the-art results and outperforms other VLAD and CNN based approaches on
two out of three test datasets. Our work provides guidance for transferring
deep networks trained on image classification to image retrieval tasks.Comment: CVPR DeepVision Workshop 201
Energy Beamforming with One-Bit Feedback
Wireless energy transfer (WET) has attracted significant attention recently
for providing energy supplies wirelessly to electrical devices without the need
of wires or cables. Among different types of WET techniques, the radio
frequency (RF) signal enabled far-field WET is most practically appealing to
power energy constrained wireless networks in a broadcast manner. To overcome
the significant path loss over wireless channels, multi-antenna or
multiple-input multiple-output (MIMO) techniques have been proposed to enhance
the transmission efficiency and distance for RF-based WET. However, in order to
reap the large energy beamforming gain in MIMO WET, acquiring the channel state
information (CSI) at the energy transmitter (ET) is an essential task. This
task is particularly challenging for WET systems, since existing channel
training and feedback methods used for communication receivers may not be
implementable at the energy receiver (ER) due to its hardware limitation. To
tackle this problem, in this paper we consider a multiuser MIMO system for WET,
where a multiple-antenna ET broadcasts wireless energy to a group of
multiple-antenna ERs concurrently via transmit energy beamforming. By taking
into account the practical energy harvesting circuits at the ER, we propose a
new channel learning method that requires only one feedback bit from each ER to
the ET per feedback interval. The feedback bit indicates the increase or
decrease of the harvested energy by each ER between the present and previous
intervals, which can be measured without changing the existing hardware at the
ER. Based on such feedback information, the ET adjusts transmit beamforming in
different training intervals and at the same time obtains improved estimates of
the MIMO channels to ERs by applying a new approach termed analytic center
cutting plane method (ACCPM).Comment: This is the longer version of a paper to appear in IEEE Transactions
on Signal Processin
Neural fuzzy repair : integrating fuzzy matches into neural machine translation
We present a simple yet powerful data augmentation method for boosting Neural Machine Translation (NMT) performance by leveraging information retrieved from a Translation Memory (TM). We propose and test two methods for augmenting NMT training data with fuzzy TM matches. Tests on the DGT-TM data set for two language pairs show consistent and substantial improvements over a range of baseline systems. The results suggest that this method is promising for any translation environment in which a sizeable TM is available and a certain amount of repetition across translations is to be expected, especially considering its ease of implementation
Multimedia search without visual analysis: the value of linguistic and contextual information
This paper addresses the focus of this special issue by analyzing the potential contribution of linguistic content and other non-image aspects to the processing of audiovisual data. It summarizes the various ways in which linguistic content analysis contributes to enhancing the semantic annotation of multimedia content, and, as a consequence, to improving the effectiveness of conceptual media access tools. A number of techniques are presented, including the time-alignment of textual resources, audio and speech processing, content reduction and reasoning tools, and the exploitation of surface features
Constellation Queries over Big Data
A geometrical pattern is a set of points with all pairwise distances (or,
more generally, relative distances) specified. Finding matches to such patterns
has applications to spatial data in seismic, astronomical, and transportation
contexts. For example, a particularly interesting geometric pattern in
astronomy is the Einstein cross, which is an astronomical phenomenon in which a
single quasar is observed as four distinct sky objects (due to gravitational
lensing) when captured by earth telescopes. Finding such crosses, as well as
other geometric patterns, is a challenging problem as the potential number of
sets of elements that compose shapes is exponentially large in the size of the
dataset and the pattern. In this paper, we denote geometric patterns as
constellation queries and propose algorithms to find them in large data
applications. Our methods combine quadtrees, matrix multiplication, and
unindexed join processing to discover sets of points that match a geometric
pattern within some additive factor on the pairwise distances. Our distributed
experiments show that the choice of composition algorithm (matrix
multiplication or nested loops) depends on the freedom introduced in the query
geometry through the distance additive factor. Three clearly identified blocks
of threshold values guide the choice of the best composition algorithm.
Finally, solving the problem for relative distances requires a novel
continuous-to-discrete transformation. To the best of our knowledge this paper
is the first to investigate constellation queries at scale
- âŠ