204 research outputs found
Finitely forcible graphons
AbstractWe investigate families of graphs and graphons (graph limits) that are determined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turán, Erdős–Simonovits and Chung–Graham–Wilson, we construct numerous finitely forcible graphons. Most of these fall into two categories: one type has an algebraic structure and the other type has an iterated (fractal-like) structure. We also give some necessary conditions for forcibility, which imply that finitely forcible graphons are “rare”, and exhibit simple and explicit non-forcible graphons
Multi-view Face Detection Using Deep Convolutional Neural Networks
In this paper we consider the problem of multi-view face detection. While
there has been significant research on this problem, current state-of-the-art
approaches for this task require annotation of facial landmarks, e.g. TSM [25],
or annotation of face poses [28, 22]. They also require training dozens of
models to fully capture faces in all orientations, e.g. 22 models in HeadHunter
method [22]. In this paper we propose Deep Dense Face Detector (DDFD), a method
that does not require pose/landmark annotation and is able to detect faces in a
wide range of orientations using a single model based on deep convolutional
neural networks. The proposed method has minimal complexity; unlike other
recent deep learning object detection methods [9], it does not require
additional components such as segmentation, bounding-box regression, or SVM
classifiers. Furthermore, we analyzed scores of the proposed face detector for
faces in different orientations and found that 1) the proposed method is able
to detect faces from different angles and can handle occlusion to some extent,
2) there seems to be a correlation between dis- tribution of positive examples
in the training set and scores of the proposed face detector. The latter
suggests that the proposed methods performance can be further improved by using
better sampling strategies and more sophisticated data augmentation techniques.
Evaluations on popular face detection benchmark datasets show that our
single-model face detector algorithm has similar or better performance compared
to the previous methods, which are more complex and require annotations of
either different poses or facial landmarks.Comment: in International Conference on Multimedia Retrieval 2015 (ICMR
Adversarial Privacy-preserving Filter
While widely adopted in practical applications, face recognition has been
critically discussed regarding the malicious use of face images and the
potential privacy problems, e.g., deceiving payment system and causing personal
sabotage. Online photo sharing services unintentionally act as the main
repository for malicious crawler and face recognition applications. This work
aims to develop a privacy-preserving solution, called Adversarial
Privacy-preserving Filter (APF), to protect the online shared face images from
being maliciously used.We propose an end-cloud collaborated adversarial attack
solution to satisfy requirements of privacy, utility and nonaccessibility.
Specifically, the solutions consist of three modules: (1) image-specific
gradient generation, to extract image-specific gradient in the user end with a
compressed probe model; (2) adversarial gradient transfer, to fine-tune the
image-specific gradient in the server cloud; and (3) universal adversarial
perturbation enhancement, to append image-independent perturbation to derive
the final adversarial noise. Extensive experiments on three datasets validate
the effectiveness and efficiency of the proposed solution. A prototype
application is also released for further evaluation.We hope the end-cloud
collaborated attack framework could shed light on addressing the issue of
online multimedia sharing privacy-preserving issues from user side.Comment: Accepted by ACM Multimedia 202
Glimpse: Continuous, Real-Time Object Recognition on Mobile Devices
Glimpse is a continuous, real-time object recognition system for camera-equipped mobile devices. Glimpse captures full-motion video, locates objects of interest, recognizes and labels them, and tracks them from frame to frame for the user. Because the algorithms for object recognition entail significant computation, Glimpse runs them on server machines. When the latency between the server and mobile device is higher than a frame-time, this approach lowers object recognition accuracy. To regain accuracy, Glimpse uses an active cache of video frames on the mobile device. A subset of the frames in the active cache are used to track objects on the mobile, using (stale) hints about objects that arrive from the server from time to time. To reduce network bandwidth usage, Glimpse computes trigger frames to send to the server for recognizing and labeling. Experiments with Android smartphones and Google Glass over Verizon, AT&T, and a campus Wi-Fi network show that with hardware face detection support (available on many mobile devices), Glimpse achieves precision between 96.4% to 99.8% for continuous face recognition, which improves over a scheme performing hardware face detection and server-side recognition without Glimpse's techniques by between 1.8-2.5×. The improvement in precision for face recognition without hardware detection is between 1.6-5.5×. For road sign recognition, which does not have a hardware detector, Glimpse achieves precision between 75% and 80%; without Glimpse, continuous detection is non-functional (0.2%-1.9% precision)
Bundling by volume exclusion in non-equilibrium spaghetti
In physical networks, like the brain or metamaterials, we often observe local
bundles, corresponding to locally aligned link configurations. Here we
introduce a minimal model for bundle formation, modeling physical networks as
non-equilibrium packings of hard-core 3D elongated links. We show that growth
is logarithmic in time, in stark contrast with the algebraic behavior of lower
dimensional random packing models. Equally important, we find that this slow
kinetics is metastable, allowing us to analytically predict an algebraic growth
due to the spontaneous formation of bundles. Our results offer a mechanism for
bundle formation resulting purely from volume exclusion, and provide a
benchmark for bundling activation and growth during the assembly of physical
networks
Adiabatic quantum algorithm for search engine ranking
We propose an adiabatic quantum algorithm for generating a quantum pure state
encoding of the PageRank vector, the most widely used tool in ranking the
relative importance of internet pages. We present extensive numerical
simulations which provide evidence that this algorithm can prepare the quantum
PageRank state in a time which, on average, scales polylogarithmically in the
number of webpages. We argue that the main topological feature of the
underlying web graph allowing for such a scaling is the out-degree
distribution. The top ranked entries of the quantum PageRank state
can then be estimated with a polynomial quantum speedup. Moreover, the quantum
PageRank state can be used in "q-sampling" protocols for testing properties of
distributions, which require exponentially fewer measurements than all
classical schemes designed for the same task. This can be used to decide
whether to run a classical update of the PageRank.Comment: 7 pages, 5 figures; closer to published versio
Monotone graph limits and quasimonotone graphs
The recent theory of graph limits gives a powerful framework for
understanding the properties of suitable (convergent) sequences of
graphs in terms of a limiting object which may be represented by a symmetric
function on , i.e., a kernel or graphon. In this context it is
natural to wish to relate specific properties of the sequence to specific
properties of the kernel. Here we show that the kernel is monotone (i.e.,
increasing in both variables) if and only if the sequence satisfies a
`quasi-monotonicity' property defined by a certain functional tending to zero.
As a tool we prove an inequality relating the cut and norms of kernels of
the form with and monotone that may be of interest in its
own right; no such inequality holds for general kernels.Comment: 38 page
Automatic Classification of Roof Shapes for Multicopter Emergency Landing Site Selection
Geographic information systems (GIS) now provide accurate maps of terrain,
roads, waterways, and building footprints and heights. Aircraft, particularly
small unmanned aircraft systems, can exploit additional information such as
building roof structure to improve navigation accuracy and safety particularly
in urban regions. This paper proposes a method to automatically label building
roof shape types. Satellite imagery and LIDAR data from Witten, Germany are fed
to convolutional neural networks (CNN) to extract salient feature vectors.
Supervised training sets are automatically generated from pre-labeled buildings
contained in the OpenStreetMap database. Multiple CNN architectures are trained
and tested, with the best performing networks providing a condensed feature set
for support vector machine and decision tree classifiers. Satellite and LIDAR
data fusion is shown to provide greater classification accuracy than through
use of either data type individually
Evanescence in Coined Quantum Walks
In this paper we complete the analysis begun by two of the authors in a
previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795
(2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the
"exponential decay'' regions at the leading edges of the main peaks in the
Schr{\"o}dinger (or wave-mechanics) picture. This calculation required us to
generalise the method of stationary phase and we describe this extension in
some detail, including self-contained proofs of all the technical lemmas
required. We also rigorously establish the exact Feynman equivalence between
the path-integral and wave-mechanics representations for this system using some
techniques from the theory of special functions. Taken together with the
previous work, we can now prove every theorem by both routes.Comment: 32 pages AMS LaTeX, 5 figures in .eps format. Rewritten in response
to referee comments, including some additional references. v3: typos fixed in
equations (131), (133) and (134). v5: published versio
- …