Isotropic masks make efficient linear feature detectors

1999 ◽  
Vol 35 (17) ◽  
pp. 1450 ◽  
Author(s):  
E.R. Davies
Keyword(s):  
Linear Feature ◽  
Feature Detectors

Perception

2018 ◽  
Author(s):  
Joel Z. Leibo ◽  
Tomaso Poggio
Keyword(s):  
Computational Neuroscience ◽  
Feature Detection ◽  
Pedestrian Detection ◽  
Detection Systems ◽  
Catching Up ◽  
Feature Detectors ◽  
Recognition Systems ◽  
Engineered Systems ◽  
Perceptual Systems ◽  
The Brain

This chapter provides an overview of biological perceptual systems and their underlying computational principles focusing on the sensory sheets of the retina and cochlea and exploring how complex feature detection emerges by combining simple feature detectors in a hierarchical fashion. We also explore how the microcircuits of the neocortex implement such schemes pointing out similarities to progress in the field of machine vision driven deep learning algorithms. We see signs that engineered systems are catching up with the brain. For example, vision-based pedestrian detection systems are now accurate enough to be installed as safety devices in (for now) human-driven vehicles and the speech recognition systems embedded in smartphones have become increasingly impressive. While not being entirely biologically based, we note that computational neuroscience, as described in this chapter, makes up a considerable portion of such systems’ intellectual pedigree.

scholarly journals Linear-Based Incremental Co-Registration of MLS and Photogrammetric Point Clouds

2021 ◽  
Vol 13 (11) ◽  
pp. 2195
Author(s):  
Shiming Li ◽  
Xuming Ge ◽  
Shengfu Li ◽  
Bo Xu ◽  
Zhendong Wang
Keyword(s):  
Point Cloud ◽  
Laser Scanning ◽  
Point Clouds ◽  
Registration Method ◽  
Cloud Data ◽  
Linear Feature ◽  
Data Registration ◽  
Source Point ◽  
Urban Remote Sensing ◽  
Single Data

Today, mobile laser scanning and oblique photogrammetry are two standard urban remote sensing acquisition methods, and the cross-source point-cloud data obtained using these methods have significant differences and complementarity. Accurate co-registration can make up for the limitations of a single data source, but many existing registration methods face critical challenges. Therefore, in this paper, we propose a systematic incremental registration method that can successfully register MLS and photogrammetric point clouds in the presence of a large number of missing data, large variations in point density, and scale differences. The robustness of this method is due to its elimination of noise in the extracted linear features and its 2D incremental registration strategy. There are three main contributions of our work: (1) the development of an end-to-end automatic cross-source point-cloud registration method; (2) a way to effectively extract the linear feature and restore the scale; and (3) an incremental registration strategy that simplifies the complex registration process. The experimental results show that this method can successfully achieve cross-source data registration, while other methods have difficulty obtaining satisfactory registration results efficiently. Moreover, this method can be extended to more point-cloud sources.

scholarly journals Structural Damage Classification in a Jacket-Type Wind-Turbine Foundation Using Principal Component Analysis and Extreme Gradient Boosting

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2748
Author(s):  
Jersson X. Leon-Medina ◽  
Maribel Anaya ◽  
Núria Parés ◽  
Diego A. Tibaduiza ◽  
Francesc Pozo
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Wind Turbine ◽  
Structural Damage ◽  
Principal Component ◽  
Gradient Boosting ◽  
Damage Classification ◽  
Linear Feature ◽  
Linear Feature Extraction ◽  
Extreme Gradient Boosting

Damage classification is an important topic in the development of structural health monitoring systems. When applied to wind-turbine foundations, it provides information about the state of the structure, helps in maintenance, and prevents catastrophic failures. A data-driven pattern-recognition methodology for structural damage classification was developed in this study. The proposed methodology involves several stages: (1) data acquisition, (2) data arrangement, (3) data normalization through the mean-centered unitary group-scaling method, (4) linear feature extraction, (5) classification using the extreme gradient boosting machine learning classifier, and (6) validation applying a 5-fold cross-validation technique. The linear feature extraction capabilities of principal component analysis are employed; the original data of 58,008 features is reduced to only 21 features. The methodology is validated with an experimental test performed in a small-scale wind-turbine foundation structure that simulates the perturbation effects caused by wind and marine waves by applying an unknown white noise signal excitation to the structure. A vibration-response methodology is selected for collecting accelerometer data from both the healthy structure and the structure subjected to four different damage scenarios. The datasets are satisfactorily classified, with performance measures over 99.9% after using the proposed damage classification methodology.

scholarly journals Unsupervised learning by competing hidden units

2019 ◽  
Vol 116 (16) ◽  
pp. 7723-7731 ◽  
Author(s):  
Dmitry Krotov ◽  
John J. Hopfield
Keyword(s):  
Learning Algorithm ◽  
Lower Layer ◽  
Learning Rule ◽  
Backpropagation Algorithm ◽  
Feedforward Networks ◽  
Feature Detectors ◽  
End To End ◽  
Hidden Layer ◽  
Full Network ◽  
Global Inhibition

It is widely believed that end-to-end training with the backpropagation algorithm is essential for learning good feature detectors in early layers of artificial neural networks, so that these detectors are useful for the task performed by the higher layers of that neural network. At the same time, the traditional form of backpropagation is biologically implausible. In the present paper we propose an unusual learning rule, which has a degree of biological plausibility and which is motivated by Hebb’s idea that change of the synapse strength should be local—i.e., should depend only on the activities of the pre- and postsynaptic neurons. We design a learning algorithm that utilizes global inhibition in the hidden layer and is capable of learning early feature detectors in a completely unsupervised way. These learned lower-layer feature detectors can be used to train higher-layer weights in a usual supervised way so that the performance of the full network is comparable to the performance of standard feedforward networks trained end-to-end with a backpropagation algorithm on simple tasks.

scholarly journals Slowing down wolves to protect boreal caribou populations: a spatial simulation model of linear feature restoration

Ecosphere ◽  
2019 ◽  
Vol 10 (10) ◽  
Author(s):  
Matthias C. Spangenberg ◽  
Robert Serrouya ◽  
Melanie Dickie ◽  
Craig A. DeMars ◽  
Théo Michelot ◽  
...  
Keyword(s):  
Simulation Model ◽  
Spatial Simulation ◽  
Linear Feature ◽  
Slowing Down ◽  
Spatial Simulation Model ◽  
Boreal Caribou

scholarly journals Local kernel nonparametric discriminant analysis for adaptive extraction of complex structures

Open Physics ◽  
2017 ◽  
Vol 15 (1) ◽  
pp. 270-279
Author(s):  
Quanbao Li ◽  
Fajie Wei ◽  
Shenghan Zhou
Keyword(s):  
Feature Extraction ◽  
Data Structure ◽  
Discriminant Analysis ◽  
Ad Hoc ◽  
Adaptive Method ◽  
Local Data ◽  
Linear Discriminant ◽  
Linear Feature ◽  
Nonparametric Discriminant Analysis ◽  
Nonlinear Feature Extraction

AbstractThe linear discriminant analysis (LDA) is one of popular means for linear feature extraction. It usually performs well when the global data structure is consistent with the local data structure. Other frequently-used approaches of feature extraction usually require linear, independence, or large sample condition. However, in real world applications, these assumptions are not always satisfied or cannot be tested. In this paper, we introduce an adaptive method, local kernel nonparametric discriminant analysis (LKNDA), which integrates conventional discriminant analysis with nonparametric statistics. LKNDA is adept in identifying both complex nonlinear structures and the ad hoc rule. Six simulation cases demonstrate that LKNDA have both parametric and nonparametric algorithm advantages and higher classification accuracy. Quartic unilateral kernel function may provide better robustness of prediction than other functions. LKNDA gives an alternative solution for discriminant cases of complex nonlinear feature extraction or unknown feature extraction. At last, the application of LKNDA in the complex feature extraction of financial market activities is proposed.

Sign in / Sign up

Export Citation Format

Share Document