Convex hulls | Spatial analysis

Local convex hull

Local convex hull (LoCoH) is a method for estimating size of the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions, or herd of buffaloes), and for constructing a utilization distribution. The latter is a probability distribution that represents the probabilities of finding an animal within a given area of its home range at any point in time; or, more generally, at points in time for which the utilization distribution has been constructed. In particular, different utilization distributions can be constructed from data pertaining to particular periods of a diurnal or seasonal cycle. Utilization distributions are constructed from data providing the location of an individual or several individuals in space at different points in time by associating a local distribution function with each point and then summing and normalizing these local distribution functions to obtain a distribution function that pertains to the data as a whole. If the local distribution function is a parametric distribution, such as a symmetric bivariate normal distribution then the method is referred to as a kernel method, but more correctly should be designated as a parametric kernel method. On the other hand, if the local kernel element associated with each point is a local convex polygon constructed from the point and its k-1 nearest neighbors, then the method is nonparametric and referred to as a k-LoCoH or fixed point LoCoH method. This is in contrast to r-LoCoH (fixed radius) and a-LoCoH (adaptive radius) methods. In the case of LoCoH utilization distribution constructions, the home range can be taken as the outer boundary of the distribution (i.e. the 100th percentile). In the case of utilization distributions constructed from unbounded kernel elements, such as bivariate normal distributions, the utilization distribution is itself unbounded. In this case the most often used convention is to regard the 95th percentile of the utilization distribution as the boundary of the home range. To construct a k-LoCoH utilization distribution: 1. * Locate the k − 1 nearest neighbors for each point in the dataset. 2. * Construct a convex hull for each set of nearest neighbors and the original data point. 3. * Merge these hulls together from smallest to largest. 4. * Divide the merged hulls into isopleths where the 10% isopleth contains 10% of the original data points, the 100% isopleth contains all the points, etc. In this sense, LoCoH methods are a generalization of the home range estimator method based on constructing the minimum convex polygon (MCP) associated with the data. The LoCoH method has a number of advantages over parametric kernel methods. In particular: * As more data are added, the estimates of the home range become more accurate than for bivariate normal kernel constructions. * LoCoH handles 'sharp' features such as lakes and fences much better than parametric kernel constructions. * As mentioned above, the home range is a finite region without having to resort to an ad-hoc choice, such as the 95th percentile to obtain bounded region. LoCoH has a number of implementations including a now-defunct LoCoH Web Application. LoCoH was formerly known as k-NNCH, for k-nearest neighbor convex hulls. It has recently been shown that the a-LoCoH is the best of the three LoCoH methods mentioned above (see Getz et al. in the references below). (Wikipedia).

Video thumbnail

Driving Downtown - Detroit Michigan

Detroit is the most populous city in the U.S. state of Michigan, and the seat of Wayne County, the most populous county in the state and the largest city on the United States-Canada border. It is a primary business, cultural, financial and transportation center in the Metro Detroit area, a

From playlist Driving Downtown Originals

Video thumbnail

Driving Downtown - New Orleans 4K - USA

Driving Downtown - New Orleans Louisiana USA - Episode 37. Starting Point: https://goo.gl/maps/MRVzaZe3yrn . New Orleans is a major United States port and the largest city and metropolitan area in the state of Louisiana. The city is named after the Duke of Orleans, who reigned as Regent

From playlist Location by Country - United States of America - J Utah

Video thumbnail

Driving Downtown - Early Morning on Bourbon St – New Orleans Louisiana

New Orleans is a major United States port and the largest city and metropolitan area in the state ofLouisiana. The population of the city was 343,829 as of the 2010 U.S. Census.[2][3] The New Orleans metropolitan area (New Orleans–Metairie–Kenner Metropolitan Statistical Area) had a popula

From playlist Driving Downtown Originals

Video thumbnail

Driving Downtown - Boston USA

Boston (pronounced i/ˈbɒstən/) is the capital and largest city[10] of the Commonwealth of Massachusetts in the United States. Boston also serves as county seat of Suffolk County. The largest city in New England, the city proper, covering 48 square miles (124 km2), had an estimated populat

From playlist Driving Downtown Originals

Video thumbnail

Driving Into Downtown - Boston Massachusetts

Boston (pronounced i/ˈbɒstən/) is the capital and largest city[10] of the Commonwealth of Massachusetts in the United States. Boston also serves as county seat of Suffolk County. The largest city in New England, the city proper, covering 48 square miles (124 km2), had an estimated populat

From playlist Driving Downtown Originals

Video thumbnail

Driving Downtown - Santa Monica 4K - Los Angeles USA

Is Santa Monica the most recognizable beach in the USA?? Comment below! :) Hundreds of movies have been filmed or set in part within the city of Santa Monica. Santa Monica is well known for its iconic pier, Third Street Promenade, and as home to many rich and famous individuals and compa

From playlist Location by Country - United States of America - J Utah

Video thumbnail

Driving Downtown – Baltimore St – Baltimore Maryland

Baltimore is the largest city in the State of Maryland, the largest independent city in the United States, and the 26th-most populous city in the country. It is located in the central area of the state along the tidal portion of the Patapsco River, an arm of the Chesapeake Bay. The indepen

From playlist Driving Downtown Originals

Video thumbnail

Local polynomial convexity of a certain class of surfaces by Sushil Gorai

PROGRAM CAUCHY-RIEMANN EQUATIONS IN HIGHER DIMENSIONS ORGANIZERS: Sivaguru, Diganta Borah and Debraj Chakrabarti DATE: 15 July 2019 to 02 August 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Complex analysis is one of the central areas of modern mathematics, and deals with holomo

From playlist Cauchy-Riemann Equations in Higher Dimensions 2019

Video thumbnail

Class 17: D-Forms

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This class introduces the pita form and Alexandrov-Pogorelov Theorem. D-forms are discussed with a construction exercise, followed

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

Graph Alg. IV: Intro to geometric algorithms - Lecture 9

All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm Visit the forum at: http://www.coderisland.c

From playlist ArsDigita Algorithms by Shai Simonson

Video thumbnail

Driving Downtown - Boston 4K - USA

Driving Downtown - Boston Massachusetts USA - Episode 23. Starting Point: Northern Avenue & D Street https://goo.gl/maps/XjJ8En2CQkM2 . Boston is the capital and largest city[8] of the Commonwealth of Massachusetts in the United States. Boston also served as the county seat of Suffolk Coun

From playlist Location by Country - United States of America - J Utah

Video thumbnail

How Our Boat Rudders Are Built

We cover some of the techniques behind building a sturdy and affordable boat rudder. We also dive into some other methods to building rudders. Previous video: https://youtu.be/jYoS8JnCZpw Find us on Patreon and our website: https://www.patreon.com/techingredients https://www.techingredie

From playlist Boats

Video thumbnail

Peter Pivovarov: Random s-concave functions and isoperimetry

I will discuss stochastic geometry of s-concave functions. In particular, I will explain how a ”local” stochastic isoperimetry underlies several functional inequalities. A new ingredient is a notion of shadow systems for s-concave functions. Based on joint works with J. Rebollo Bueno.

From playlist Workshop: High dimensional spatial random systems

Video thumbnail

Parsimonious Representations in data science - Dr Armin Eftekhari, University of Edinburgh

Every minute, humankind produces about 2000 Terabytes of data and learning from this data has the potential to improve many aspects of our lives. Doing so requires exploiting the geometric structure hidden within the data. Our overview of models in data and computational sciences starts wi

From playlist Data science classes

Video thumbnail

Kazuo Murota: Extensions and Ramifications of Discrete Convexity Concepts

Submodular functions are widely recognized as a discrete analogue of convex functions. This convexity view of submodularity was established in the early 1980's by the fundamental works of A. Frank, S. Fujishige and L. Lovasz. Discrete convex analysis extends this view to broader classes of

From playlist HIM Lectures 2015

Video thumbnail

Stability of the set of quantum states - S. Weis - Workshop 2 - CEB T3 2017

Stephan Weis / 26.10.17 Stability of the set of quantum states A convex set C is stable if the midpoint map (x,y) - (x+y)/2 is open. For compact C the Vesterstrøm–O’Brien theorem asserts that C is stable if and only if the barycentric map from the set of all Borel probability measures to

From playlist 2017 - T3 - Analysis in Quantum Information Theory - CEB Trimester

Video thumbnail

Lecture 15: General & Edge Unfolding

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with describing polyhedron unfolding for convex and nonconvex polygons. Algorithms for shortest path solutions

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

Driving Downtown - Montreal 4K - Canada

Driving Downtown - Montreal Quebec Canada - Episode 52. Starting Point: Rue Saint-Catherine https://goo.gl/maps/y8XTHksECEN2 . Montreal is the most populous municipality in the Canadian province of Quebec and the second-most populous municipality in Canada as a whole. Originally called Vil

From playlist Location by Continent - North America - J Utah

Video thumbnail

Elena Kosygina: "Stochastic homogenization of a class of nonconvex viscous HJ equations in one s..."

High Dimensional Hamilton-Jacobi PDEs 2020 Workshop IV: Stochastic Analysis Related to Hamilton-Jacobi PDEs "Stochastic homogenization of a class of nonconvex viscous HJ equations in one space dimension" Elena Kosygina - Bernard M. Baruch College and the CUNY Graduate Center Abstract: We

From playlist High Dimensional Hamilton-Jacobi PDEs 2020

Related pages

Utilization distribution | Convex polygon | Probability distribution