Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2024
Using unmanned aerial vehicle acquired RGB images and Density-Cluster-Count model for tree-level apple flower quantification
Computers and Electronics in Agriculture (COEA), Volume 226, Issue Chttps://doi.org/10.1016/j.compag.2024.109389Highlights- A flower cluster counting method based on density estimation and the density peak was carried out.
- The density distribution maps for apple flowers at tree-level was created.
- The potential for tree-level apple flower quantification ...
Accurate estimation of apple flower quantity is vital for flower thinning strategies, yield prediction, and other aspects related to orchard management. Compared to flower quantity estimation based on partial regions, achieving tree-level flower ...
- research-articleOctober 2024
Deep JKO: Time-implicit particle methods for general nonlinear gradient flows
Journal of Computational Physics (JOCP), Volume 514, Issue Chttps://doi.org/10.1016/j.jcp.2024.113187AbstractWe develop novel neural network-based implicit particle methods to compute high-dimensional Wasserstein-type gradient flows with linear and nonlinear mobility functions. The main idea is to use the Lagrangian formulation in the Jordan–...
Highlights- A neural network empowered implicit particle method is proposed for computing high dimensional nonlinear gradient flows.
- Our method leverages JKO's structure preservation and mesh-free discretization for high-dimensional problems.
- ...
- ArticleSeptember 2024
MixerFlow: MLP-Mixer Meets Normalising Flows
Machine Learning and Knowledge Discovery in Databases. Research TrackPages 180–196https://doi.org/10.1007/978-3-031-70341-6_11AbstractNormalising flows are generative models that transform a complex density into a simpler density through the use of bijective transformations enabling both density estimation and data generation from a single model. In the context of image ...
- research-articleSeptember 2024
Optimal training of Mean Variance Estimation neural networks
AbstractThis paper focusses on the optimal implementation of a Mean Variance Estimation network (MVE network) (Nix and Weigend, 1994). This type of network is often used as a building block for uncertainty estimation methods in a regression setting, for ...
-
- research-articleSeptember 2024
Adaptive directional estimator of the density in R d for independent and mixing sequences
Journal of Multivariate Analysis (JMUL), Volume 203, Issue Chttps://doi.org/10.1016/j.jmva.2024.105332AbstractA new multivariate density estimator for stationary sequences is obtained by Fourier inversion of the thresholded empirical characteristic function. This estimator does not depend on the choice of parameters related to the smoothness of the ...
- research-articleAugust 2024
Connection density based clustering: A graph-based density clustering method
AbstractIn this paper, a graph-based density clustering framework is proposed that detects the boundary points of clusters rather than cluster exemplars in high density regions. The framework introduces the connection density to measure the density ...
Highlights- Introducing the connection density to measure the density relationship between points.
- Utilizing the connectivity of the graph to achieve clustering by cutting off edges with low connection density.
- Automatically identifying ...
- research-articleAugust 2024
Probabilistic neural networks for incremental learning over time-varying streaming data with application to air pollution monitoring
- Danuta Rutkowska,
- Piotr Duda,
- Jinde Cao,
- Maciej Jaworski,
- Marek Kisiel-Dorohinicki,
- Dacheng Tao,
- Leszek Rutkowski
AbstractThis paper proposes a novel algorithm for incremental learning over streaming data in a non-stationary environment. The idea refers to the applicability of Probabilistic Neural Networks (PNNs), commonly used as a fast and robust method for ...
Highlights- The incremental version of the Probabilistic Neural Network (IPNN) based on the orthogonal series, able to work in non-stationary environments.
- Mathematical proofs of the convergence of the proposed estimators for different types of ...
- research-articleMarch 2024
Counting in congested crowd scenes with hierarchical scale-aware encoder–decoder network
Expert Systems with Applications: An International Journal (EXWA), Volume 238, Issue PDhttps://doi.org/10.1016/j.eswa.2023.122087AbstractAs an indispensable component of intelligent monitoring systems, crowd counting plays a crucial role in many fields, particularly crowd management and control during the COVID-19 pandemic. Despite the promising achievements of many methods, crowd ...
- research-articleMarch 2024
High-dimensional Bernstein–von Mises theorem for the Diaconis–Ylvisaker prior
Journal of Multivariate Analysis (JMUL), Volume 200, Issue Chttps://doi.org/10.1016/j.jmva.2023.105279AbstractWe study the asymptotic normality of the posterior distribution of canonical parameter in the exponential family under the Diaconis–Ylvisaker prior which is a conjugate prior when the dimension of parameter space increases with the sample size. ...
- research-articleMarch 2024
FRMDN: Flow-based Recurrent Mixture Density Network
Expert Systems with Applications: An International Journal (EXWA), Volume 237, Issue PAhttps://doi.org/10.1016/j.eswa.2023.121360AbstractThe class of recurrent mixture density networks is an important class of probabilistic models used extensively in sequence modeling and sequence-to-sequence mapping applications. In this class of models, the density of a target sequence in each ...
Highlights- Two aspects of RMDNs have been explored for efficient density estimation.
- A normalizing flow is employed to increase the flexibility of RMDNs.
- A parameter-sharing approach for GMM is applied that decomposes the precision matrix.
- research-articleFebruary 2024
SA-DCPNet: Scale-aware deep convolutional pyramid network for crowd counting
Neural Computing and Applications (NCAA), Volume 36, Issue 16Pages 9283–9295https://doi.org/10.1007/s00521-024-09572-7AbstractCrowd counting is one of the most complex research topics in the field of computer vision. There are many challenges associated with this task, including severe occlusion, scale variation, and complex background. Multi-column networks are commonly ...
- research-articleJanuary 2024
Floating-point histograms for exploratory analysis of large scale real-world data sets
Intelligent Data Analysis (INDA), Volume 28, Issue 5Pages 1347–1394https://doi.org/10.3233/IDA-230638Histograms are among the most popular methods used in exploratory analysis to summarize univariate distributions. In particular, irregular histograms are good non-parametric density estimators that require very few parameters: the number of bins with ...
- research-articleNovember 2023
On the Representation and Learning of Monotone Triangular Transport Maps
Foundations of Computational Mathematics (FOCM), Volume 24, Issue 6Pages 2063–2108https://doi.org/10.1007/s10208-023-09630-xAbstractTransportation of measure provides a versatile approach for modeling complex probability distributions, with applications in density estimation, Bayesian inference, generative modeling, and beyond. Monotone triangular transport maps—approximations ...
- research-articleNovember 2023
Decomposition-based multiobjective evolutionary algorithm with density estimation-based dynamical neighborhood strategy
Applied Intelligence (KLU-APIN), Volume 53, Issue 24Pages 29863–29901https://doi.org/10.1007/s10489-023-05105-2AbstractThe multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem (MOP) into several scalar subproblems and then optimizes them cooperatively in their respective neighborhoods. Since the ...
- research-articleOctober 2023
Density estimation for toroidal data using semiparametric mixtures
AbstractToroidal data is an extension of circular data on a torus and plays a critical part in various scientific fields. This article studies the density estimation of multivariate toroidal data based on semiparametric mixtures. One of the major ...
- research-articleSeptember 2023
- research-articleSeptember 2023
Crowd counting from single images using recursive multi-pathway zooming and foreground enhancement
Highlights- A Multi-Pathway Zooming Network is proposed, in which features at different resolutions are sequentially integrating and interacting during multi-glimpse ...
Crowd counting is a challenging task due to many challenges such as scale variations and noisy background. To handle these challenges, we propose a novel framework named Multi-Pathway Zooming Network (MZNet) in this paper. The proposed ...
- research-articleAugust 2023
How to implement signed-rank wilcox.test() type procedures when a center of symmetry is unknown
Computational Statistics & Data Analysis (CSDA), Volume 184, Issue Chttps://doi.org/10.1016/j.csda.2023.107746AbstractThe aim is twofold: (1) to indicate that the one-sample Wilcoxon signed rank test cannot be used directly when a center of symmetry is unknown; and (2) to propose and examine correct schemes for applying the Wilcoxon signed rank test ...
- research-articleJune 2023
Density estimation for spherical data using nonparametric mixtures
Computational Statistics & Data Analysis (CSDA), Volume 182, Issue Chttps://doi.org/10.1016/j.csda.2023.107715AbstractNonparametric density estimation is studied for spherical data that may arise in many scientific and practical fields. In particular, nonparametric mixture models based on likelihood maximization are used. A nonparametric mixture has component ...