Dataset Information

A Complexity-Entropy Based Approach for the Detection of Fish Choruses

ABSTRACT: Automated acoustic indices to infer biological sounds from marine recordings have produced mixed levels of success. The use of such indices in complex marine environments, dominated by several anthropogenic and geophonic sources, have yet to be understood fully. In this study, we introduce a noise resilient method based on complexity-entropy (hereafter named C-H) for the detection of biophonic sounds originating from fish choruses. The C-H method was tested on data collected in Changhua and Miaoli (Taiwan) during the spring in both 2016 and 2017. Miaoli was exposed to continual shipping activity, which led to an increase of ~10 dB in low frequency ambient noise levels (5–500 Hz). The acoustic dataset was successively analyzed via the acoustic complexity index, the acoustic diversity index and the bioacoustic index. The C-H method was found to be strongly correlated with fish chorusing (Pearson correlation: rH < ?0.9; rC > 0.89), and robust to noise originating from shipping activity or natural sources, such as wind and tides (rH and rC were between 0.22 and ?0.19). Other indices produced lower or null correlations with fish chorusing due to missed identification of the choruses or sensitivity to other sound sources. In contrast to most acoustic indices, the C-H method does not require a prior setting of frequency and amplitude thresholds, and is therefore, more user friendly to untrained technicians. We conclude that the use of the C-H method has potential implications in the efficient detection of fish choruses for management or conservation purposes and could help with overcoming the limitations of acoustic indices in noisy marine environments.

SUBMITTER: Siddagangaiah S

PROVIDER: S-EPMC7514308 | biostudies-literature | 2019 Oct

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:Landscape is an ecological category represented by a complex system formed by interactions between society and nature. Spatial patterns of different land uses present in a landscape reveal past and present processes responsible for its dynamics and organisation. Measuring the complexity of these patterns (in the sense of their spatial heterogeneity) allows us to evaluate the integrity and resilience of these complex environmental systems. Here, we show how landscape metrics based on information entropy can be applied to evaluate the complexity (in the sense of spatial heterogeneity) of patches patterns, as well as their transition zones, present in a Cerrado conservation area and its surroundings, located in south-eastern Brazil. The analysis in this study aimed to elucidate how changes in land use and the consequent fragmentation affect the complexity of the landscape. The scripts CompPlex HeROI and CompPlex Janus were created to allow calculation of information entropy (He), variability (He/Hmax), and López-Ruiz, Mancini, and Calbet (LMC) and Shiner, Davison, and Landsberg (SDL) measures. CompPlex HeROI enabled the calculation of these measures for different regions of interest (ROIs) selected in a satellite image of the study area, followed by comparison of the complexity of their patterns, in addition to enabling the generation of complexity signatures for each ROI. CompPlex Janus made it possible to spatialise the results for these four measures in landscape complexity maps. As expected, both for the complexity patterns evaluated by CompPlex HeROI and the complexity maps generated by CompPlex Janus, the areas with vegetation located in a region of intermediate spatial heterogeneity had lower values for the He and He/Hmax measures and higher values for the LMC and SDL measurements. So, these landscape metrics were able to capture the behaviour of the patterns of different types of land use present in the study area, bringing together uses linked to vegetation with increased canopy coverage and differentiating them from urban areas and transition areas that mix different uses. Thus, the algorithms implemented in these scripts were demonstrated to be robust and capable of measuring the variability in information levels from the landscape, not only in terms of spatial datasets but also spectrally. The automation of measurement calculations, owing to informational entropy provided by these scripts, allows a quick assessment of the complexity of patterns present in a landscape, and thus, generates indicators of landscape integrity and resilience.

Project description:Anurans (frogs and toads) are among the most globally threatened taxonomic groups. Successful conservation of anurans will rely on improved data on the status and changes in local populations, particularly for rare and threatened species. Automated sensors, such as acoustic recorders, have the potential to provide such data by massively increasing the spatial and temporal scale of population sampling efforts. Analyzing such data sets will require robust and efficient tools that can automatically identify the presence of a species in audio recordings. Like bats and birds, many anuran species produce distinct vocalizations that can be captured by autonomous acoustic recorders and represent excellent candidates for automated recognition. However, in contrast to birds and bats, effective automated acoustic recognition tools for anurans are not yet widely available. An effective automated call-recognition method for anurans must be robust to the challenges of real-world field data and should not require extensive labeled data sets. We devised a vocalization identification tool that classifies anuran vocalizations in audio recordings based on their periodic structure: the repeat interval-based bioacoustic identification tool (RIBBIT). We applied RIBBIT to field recordings to study the boreal chorus frog (Pseudacris maculata) of temperate North American grasslands and the critically endangered variable harlequin frog (Atelopus varius) of tropical Central American rainforests. The tool accurately identified boreal chorus frogs, even when they vocalized in heavily overlapping choruses and identified variable harlequin frog vocalizations at a field site where it had been very rarely encountered in visual surveys. Using a few simple parameters, RIBBIT can detect any vocalization with a periodic structure, including those of many anurans, insects, birds, and mammals. We provide open-source implementations of RIBBIT in Python and R to support its use for other taxa and communities.

Project description:The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns' entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.

Project description:The Complexity-entropy causality plane (CECP) is a parsimonious representation space for time series. It has only two dimensions: normalized permutation entropy ([Formula: see text]) and Jensen-Shannon complexity ([Formula: see text]) of a time series. This two-dimensional representation allows for detection of slow or rapid drifts in the condition of mechanical components monitored through sensor measurements. The CECP representation can be used for both predictive analytics and visual monitoring of changes in component condition. This method requires minimal pre-processing of raw signals. Furthermore, it is insensitive to noise, stationarity, and trends. These desirable properties make CECP a good candidate for machine condition monitoring and fault diagnostics. In this work we study the effectiveness of CECP on three rotary component condition assessment applications. We use CECP representation of vibration signals to differentiate various machine component health conditions for rotary machine components, namely roller bearing and gears. The results confirm that the CECP representation is able to detect, with high accuracy, changes in underlying dynamics of machine component degradation states. From class separability perspective, the CECP representation is able to generate linearly separable classes for the classification of different fault states. This classification performance improves with increasing signal length. For signal length of 16,384 data points, the fault classification accuracy varies from 90% to 100% for bearing applications, and from 85% to 100% for gear applications. We observed that the optimum parameter for CECP representatino depends on the application. For bearing applications we found that embedding dimension D = 4, 5, 6, and embedding delay τ = 1, 2, 3 are suitable for good fault classification. For gear applications we find that embedding dimension D = 4, 5, and embedding delay τ = 1, 5 are suitable for fault classification.

Dataset Information

A Complexity-Entropy Based Approach for the Detection of Fish Choruses

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets