Finsler Active Contours

©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TPAMI.2007.70713In this paper, we propose an image segmentation technique based on augmenting the conformal (or geodesic) active contour framework with directional information. In the isotropic case, the euclidean metric is locally multiplied by a scalar conformal factor based on image information such that the weighted length of curves lying on points of interest (typically edges) is small. The conformal factor that is chosen depends only upon position and is in this sense isotropic. Although directional information has been studied previously for other segmentation frameworks, here, we show that if one desires to add directionality in the conformal active contour framework, then one gets a well-defined minimization problem in the case that the factor defines a Finsler metric. Optimal curves may be obtained using the calculus of variations or dynamic programming-based schemes. Finally, we demonstrate the technique by extracting roads from aerial imagery, blood vessels from medical angiograms, and neural tracts from diffusion-weighted magnetic resonance imagery

Constraining Modified Gravity with Euclid

Future proposed satellite missions as Euclid can offer the opportunity to test general relativity on cosmic scales through mapping of the galaxy weak lensing signal. In this paper we forecast the ability of these experiments to constrain modified gravity scenarios as those predicted by scalar-tensor and $f(R)$ theories. We found that Euclid will improve constraints expected from the PLANCK satellite on these modified gravity models by two orders of magnitude. We discuss parameter degeneracies and the possible biases introduced by modified gravity

CMB and Cosmological Parameters: Current Status and Prospects

The last years have been an exciting period for the field of the Cosmic Microwave Background (CMB) research. With recent CMB balloon-borne and ground-based experiments we are entering a new era of 'precision' cosmology that enables us to use the CMB anisotropy measurements to constrain the cosmological parameters and test new theoretical scenarios.Comment: 21 pages, 5 figures. Based on an invited review at the XIII Rencontres de Blois - Frontiers of the Universe, June 17-23,200

Constraining Fundamental Physics with Future CMB Experiments

The Planck experiment will soon provide a very accurate measurement of Cosmic Microwave Background anisotropies. This will let cosmologists determine most of the cosmological parameters with unprecedented accuracy. Future experiments will improve and complement the Planck data with better angular resolution and better polarization sensitivity. This unexplored region of the CMB power spectrum contains information on many parameters of interest, including neutrino mass, the number of relativistic particles at recombination, the primordial Helium abundance and the injection of additional ionizing photons by dark matter self-annihilation. We review the imprint of each parameter on the CMB and forecast the constraints achievable by future experiments by performing a Monte Carlo analysis on synthetic realizations of simulated data. We find that next generation satellite missions such as CMBPol could provide valuable constraints with a precision close to that expected in current and near future laboratory experiments. Finally, we discuss the implications of this intersection between cosmology and fundamental physics.Comment: 11 pages, 14 figure

A Framework for Crop Disease Detection Using Feature Fusion Method

Crop disease detection methods vary from traditional machine learning, which uses Hand-Crafted Features (HCF) to the current deep learning techniques that utilize deep features. In this study, a hybrid framework is designed for crop disease detection using feature fusion. Convolutional Neural Network (CNN) is used for high level features that are fused with HCF. Cepstral coefficients of RGB images are presented as one of the features along with the other popular HCF. The proposed hybrid model is tested on the whole leaf images and also on the image patches which have individual lesions. The experimental results give an enhanced performance with a classification accuracy of 99.93% for the whole leaf images and 99.74% for the images with individual lesions. The proposed model also shows a significant improvement in comparison to the state-of-art techniques. The improved results show the prominence of feature fusion and establish cepstral coefficients as a pertinent feature for crop disease detection

Probing Dark Energy with Supernovae : Bias from the time evolution of the equation of state

Observation of thousands of type Ia supernovae should offer the most direct approach to probe the dark energy content of the universe. This will be undertaken by future large ground-based surveys followed by a space mission (SNAP/JDEM). We address the problem of extracting the cosmological parameters from the future data in a model independent approach, with minimal assumptions on the prior knowledge of some parameters. We concentrate on the comparison between a fiducial model and the fitting function and adress in particular the effect of neglecting (or not) the time evolution of the equation of state. We present a quantitative analysis of the bias which can be introduced by the fitting procedure. Such bias cannot be ignored as soon as the statistical errors from present data are drastically improved.Comment: 22 pages, 10 figures, submitted to Phys. Rev.

Computer Vision Problems in 3D Plant Phenotyping

In recent years, there has been significant progress in Computer Vision based plant phenotyping (quantitative analysis of biological properties of plants) technologies. Traditional methods of plant phenotyping are destructive, manual and error prone. Due to non-invasiveness and non-contact properties as well as increased accuracy, imaging techniques are becoming state-of-the-art in plant phenotyping. Among several parameters of plant phenotyping, growth analysis is very important for biological inference. Automating the growth analysis can result in accelerating the throughput in crop production. This thesis contributes to the automation of plant growth analysis. First, we present a novel system for automated and non-invasive/non-contact plant growth measurement. We exploit the recent advancements of sophisticated robotic technologies and near infrared laser scanners to build a 3D imaging system and use state-of-the-art Computer Vision algorithms to fully automate growth measurement. We have set up a gantry robot system having 7 degrees of freedom hanging from the roof of a growth chamber. The payload is a range scanner, which can measure dense depth maps (raw 3D coordinate points in mm) on the surface of an object (the plant). The scanner can be moved around the plant to scan from different viewpoints by programming the robot with a specific trajectory. The sequence of overlapping images can be aligned to obtain a full 3D structure of the plant in raw point cloud format, which can be triangulated to obtain a smooth surface (triangular mesh), enclosing the original plant. We show the capability of the system to capture the well known diurnal pattern of plant growth computed from the surface area and volume of the plant meshes for a number of plant species. Second, we propose a technique to detect branch junctions in plant point cloud data. We demonstrate that using these junctions as feature points, the correspondence estimation can be formulated as a subgraph matching problem, and better matching results than state-of-the-art can be achieved. Also, this idea removes the requirement of a priori knowledge about rotational angles between adjacent scanning viewpoints imposed by the original registration algorithm for complex plant data. Before, this angle information had to be approximately known. Third, we present an algorithm to classify partially occluded leaves by their contours. In general, partial contour matching is a NP-hard problem. We propose a suboptimal matching solution and show that our method outperforms state-of-the-art on 3 public leaf datasets. We anticipate using this algorithm to track growing segmented leaves in our plant range data, even when a leaf becomes partially occluded by other plant matter over time. Finally, we perform some experiments to demonstrate the capability and limitations of the system and highlight the future research directions for Computer Vision based plant phenotyping

Computer Vision Problems in 3D Plant Phenotyping

In recent years, there has been significant progress in Computer Vision based plant phenotyping (quantitative analysis of biological properties of plants) technologies. Traditional methods of plant phenotyping are destructive, manual and error prone. Due to non-invasiveness and non-contact properties as well as increased accuracy, imaging techniques are becoming state-of-the-art in plant phenotyping. Among several parameters of plant phenotyping, growth analysis is very important for biological inference. Automating the growth analysis can result in accelerating the throughput in crop production. This thesis contributes to the automation of plant growth analysis. First, we present a novel system for automated and non-invasive/non-contact plant growth measurement. We exploit the recent advancements of sophisticated robotic technologies and near infrared laser scanners to build a 3D imaging system and use state-of-the-art Computer Vision algorithms to fully automate growth measurement. We have set up a gantry robot system having 7 degrees of freedom hanging from the roof of a growth chamber. The payload is a range scanner, which can measure dense depth maps (raw 3D coordinate points in mm) on the surface of an object (the plant). The scanner can be moved around the plant to scan from different viewpoints by programming the robot with a specific trajectory. The sequence of overlapping images can be aligned to obtain a full 3D structure of the plant in raw point cloud format, which can be triangulated to obtain a smooth surface (triangular mesh), enclosing the original plant. We show the capability of the system to capture the well known diurnal pattern of plant growth computed from the surface area and volume of the plant meshes for a number of plant species. Second, we propose a technique to detect branch junctions in plant point cloud data. We demonstrate that using these junctions as feature points, the correspondence estimation can be formulated as a subgraph matching problem, and better matching results than state-of-the-art can be achieved. Also, this idea removes the requirement of a priori knowledge about rotational angles between adjacent scanning viewpoints imposed by the original registration algorithm for complex plant data. Before, this angle information had to be approximately known. Third, we present an algorithm to classify partially occluded leaves by their contours. In general, partial contour matching is a NP-hard problem. We propose a suboptimal matching solution and show that our method outperforms state-of-the-art on 3 public leaf datasets. We anticipate using this algorithm to track growing segmented leaves in our plant range data, even when a leaf becomes partially occluded by other plant matter over time. Finally, we perform some experiments to demonstrate the capability and limitations of the system and highlight the future research directions for Computer Vision based plant phenotyping