Quantifying long-term phenological patterns of aerial insectivores roosting in the Great Lakes region using weather surveillance radar.

Organisms have been shifting their timing of life history events (phenology) in response to changes in the emergence of resources induced by climate change. Yet understanding these patterns at large scales and across long time series is often challenging. Here we used the US weather surveillance radar network to collect data on the timing of communal swallow and martin roosts and evaluate the scale of phenological shifts and its potential association with temperature. The discrete morning departures of these aggregated aerial insectivores from ground-based roosting locations are detected by radars around sunrise. For the first time, we applied a machine learning algorithm to automatically detect and track these large-scale behaviors. We used 21 years of data from 12 weather surveillance radar stations in the Great Lakes region to quantify the phenology in roosting behavior of aerial insectivores at three spatial levels: local roost cluster, radar station, and across the Great Lakes region. We show that their peak roosting activity timing has advanced by 2.26 days per decade at the regional scale. Similar signals of advancement were found at the station scale, but not at the local roost cluster scale. Air temperature trends in the Great Lakes region during the active roosting period were predictive of later stages of roosting phenology trends (75% and 90% passage dates). Our study represents one of the longest-term broad-scale phenology examinations of avian aerial insectivore species responding to environmental change and provides a stepping stone for examining potential phenological mismatches across trophic levels at broad spatial scales.

Migratory flight on the Pacific Flyway: strategies and tendencies of wind drift compensation.

Applications of remote sensing data to monitor bird migration usher a new understanding of magnitude and extent of movements across entire flyways. Millions of birds move through the western USA, yet this region is understudied as a migratory corridor. Characterizing movements in the Pacific Flyway offers a unique opportunity to study complementary patterns to those recently highlighted in the Atlantic and Central Flyways. We use weather surveillance radar data from spring and autumn (1995-2018) to examine migrants' behaviours in relation to winds in the Pacific Flyway. Overall, spring migrants tended to drift on winds, but less so at northern latitudes and farther inland from the Pacific coastline. Relationships between winds and autumn flight behaviours were less striking, with no latitudinal or coastal dependencies. Differences in the preferred direction of movement (PDM) and wind direction predicted drift patterns during spring and autumn, with increased drift when wind direction and PDM differences were high. We also observed greater total flight activity through the Pacific Flyway during the spring when compared with the autumn. Such complex relationships among birds' flight strategies, winds and seasonality highlight the variation within a migration system. Characterizations at these scales complement our understanding of strategies to clarify aerial animal movements.

Deep Filter Banks for Texture Recognition, Description, and Segmentation.

Visual textures have played a key role in image understanding because they convey important semantics of images, and because texture representations that pool local image descriptors in an orderless manner have had a tremendous impact in diverse applications. In this paper we make several contributions to texture understanding. First, instead of focusing on texture instance and material category recognition, we propose a human-interpretable vocabulary of texture attributes to describe common texture patterns, complemented by a new describable texture dataset for benchmarking. Second, we look at the problem of recognizing materials and texture attributes in realistic imaging conditions, including when textures appear in clutter, developing corresponding benchmarks on top of the recently proposed OpenSurfaces dataset. Third, we revisit classic texture represenations, including bag-of-visual-words and the Fisher vectors, in the context of deep learning and show that these have excellent efficiency and generalization properties if the convolutional layers of a deep model are used as filter banks. We obtain in this manner state-of-the-art performance in numerous datasets well beyond textures, an efficient method to apply deep features to image regions, as well as benefit in transferring features from one domain to another.

Neural Shape Parsers for Constructive Solid Geometry.

Constructive solid geometry (CSG) is a geometric modeling technique that defines complex shapes by recursively applying boolean operations on primitives such as spheres and cylinders. We present CSGNet, a deep network architecture that takes as input a 2D or 3D shape and outputs a CSG program that models it. Parsing shapes into CSG programs is desirable as it yields a compact and interpretable generative model. However, the task is challenging since the space of primitives and their combinations can be prohibitively large. CSGNet uses a convolutional encoder and recurrent decoder based on deep networks to map shapes to modeling instructions in a feed-forward manner and is significantly faster than bottom-up approaches. We investigate two architectures for this task-a vanilla encoder (CNN) - decoder (RNN) and another architecture that augments the encoder with an explicit memory module based on the program execution stack. The stack augmentation improves the reconstruction quality of the generated shape and learning efficiency. Our approach is also more effective as a shape primitive detector compared to a state-of-the-art object detector. Finally, we demonstrate CSGNet can be trained on novel datasets without program annotations through policy gradient techniques.

Bilinear Convolutional Neural Networks for Fine-grained Visual Recognition.

We present a simple and effective architecture for fine-grained recognition called Bilinear Convolutional Neural Networks (B-CNNs). These networks represent an image as a pooled outer product of features derived from two CNNs and capture localized feature interactions in a translationally invariant manner. B-CNNs are related to orderless texture representations built on deep features but can be trained in an end-to-end manner. Our most accurate model obtains 84.1%, 79.4%, 84.5% and 91.3% per-image accuracy on the Caltech-UCSD birds [66], NABirds [63], FGVC aircraft [42], and Stanford cars [33] dataset respectively and runs at 30 frames-per-second on a NVIDIA Titan X GPU. We then present a systematic analysis of these networks and show that (1) the bilinear features are highly redundant and can be reduced by an order of magnitude in size without significant loss in accuracy, (2) are also effective for other image classification tasks such as texture and scene recognition, and (3) can be trained from scratch on the ImageNet dataset offering consistent improvements over the baseline architecture. Finally, we present visualizations of these models on various datasets using top activations of neural units and gradient-based inversion techniques. The source code for the complete system is available at http://vis-www.cs.umass.edu/bcnn.

Efficient classification for additive kernel SVMs.

We show that a class of nonlinear kernel SVMs admits approximate classifiers with runtime and memory complexity that is independent of the number of support vectors. This class of kernels, which we refer to as additive kernels, includes widely used kernels for histogram-based image comparison like intersection and chi-squared kernels. Additive kernel SVMs can offer significant improvements in accuracy over linear SVMs on a wide variety of tasks while having the same runtime, making them practical for large-scale recognition or real-time detection tasks. We present experiments on a variety of datasets, including the INRIA person, Daimler-Chrysler pedestrians, UIUC Cars, Caltech-101, MNIST, and USPS digits, to demonstrate the effectiveness of our method for efficient evaluation of SVMs with additive kernels. Since its introduction, our method has become integral to various state-of-the-art systems for PASCAL VOC object detection/image classification, ImageNet Challenge, TRECVID, etc. The techniques we propose can also be applied to settings where evaluation of weighted additive kernels is required, which include kernelized versions of PCA, LDA, regression, k-means, as well as speeding up the inner loop of SVM classifier training algorithms.