A von Bertalanffy Based Model for the Estimation of Oyster (Crassostrea virginica) Growth on Restored Oyster Reefs in Chesapeake Bay

A model to estimate the mean monthly growth of Crassostrea virginica oysters in Chesapeake Bay was developed. This model is based on the classic von Bertalanffy growth function, however the growth constant is changed every monthly timestep in response to short term changes in temperature and salinity. Using a dynamically varying growth constant allows the model to capture seasonal oscillations in growth, and growth responses to changing environmental conditions that previous applications of the von Bertalanffy model do not capture. This model is further expanded to include an estimation of Perkinsus marinus impacts on growth rates as well as estimations of ecosystem services provided by a restored oyster bar over time. The model was validated by comparing growth estimates from the model to oyster shell height observations from a variety of restoration sites in the upper Chesapeake Bay. Without using the P. marinus impact on growth, the model consistently overestimates mean oyster growth. However, when P. marinus effects are included in the model, the model estimates match the observed mean shell height closely for at least the first 3 years of growth. The estimates of ecosystem services suggested by this model imply that even with high levels of mortality on an oyster reef, the ecosystem services provided by that reef can still be maintained by growth for several years. Because larger oyster filter more water than smaller ones, larger oysters contribute more to the filtration and nutrient removal ecosystem services of the reef. Therefore a reef with an abundance of larger oysters will provide better filtration and nutrient removal. This implies that if an oyster restoration project is trying to improve water quality through oyster filtration, it is important to maintain the larger older oysters on the reef.

Generating Discriminative Objective Proposals via Submodular Ranking

Object recognition has long been a core problem in computer vision. To improve object spatial support and speed up object localization for object recognition, generating high-quality category-independent object proposals as the input for object recognition system has drawn attention recently. Given an image, we generate a limited number of high-quality and category-independent object proposals in advance and used as inputs for many computer vision tasks. We present an efficient dictionary-based model for image classification task. We further extend the work to a discriminative dictionary learning method for tensor sparse coding. In the first part, a multi-scale greedy-based object proposal generation approach is presented. Based on the multi-scale nature of objects in images, our approach is built on top of a hierarchical segmentation. We first identify the representative and diverse exemplar clusters within each scale. Object proposals are obtained by selecting a subset from the multi-scale segment pool via maximizing a submodular objective function, which consists of a weighted coverage term, a single-scale diversity term and a multi-scale reward term. The weighted coverage term forces the selected set of object proposals to be representative and compact; the single-scale diversity term encourages choosing segments from different exemplar clusters so that they will cover as many object patterns as possible; the multi-scale reward term encourages the selected proposals to be discriminative and selected from multiple layers generated by the hierarchical image segmentation. The experimental results on the Berkeley Segmentation Dataset and PASCAL VOC2012 segmentation dataset demonstrate the accuracy and efficiency of our object proposal model. Additionally, we validate our object proposals in simultaneous segmentation and detection and outperform the state-of-art performance. To classify the object in the image, we design a discriminative, structural low-rank framework for image classification. We use a supervised learning method to construct a discriminative and reconstructive dictionary. By introducing an ideal regularization term, we perform low-rank matrix recovery for contaminated training data from all categories simultaneously without losing structural information. A discriminative low-rank representation for images with respect to the constructed dictionary is obtained. With semantic structure information and strong identification capability, this representation is good for classification tasks even using a simple linear multi-classifier.