The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Correntropy: Properties and Applications in Non-Gaussian Signal Processing
Abstract
The optimality of second-order statistics depends heavily on the assumption of Gaussianity. In this paper, we elucidate further the probabilistic and geometric meaning of the recently defined correntropy function as a localized similarity measure. A close relationship between correntropy and M-estimation is established. Connections and differences between correntropy and kernel methods are presented. As such correntropy has vastly different properties compared with second-order statistics that can be very useful in non-Gaussian signal processing, especially in the impulsive noise environment. Examples are presented to illustrate the technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
Density Estimation for Statistics and Data Analysis
(1986) · Springer eBooks · doi:10.1007/978-1-4899-3324-9 · Cited by 8,525
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Fast and robust fixed-point algorithms for independent component analysis
Hyvarinen, A. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.761722 · Cited by 6,246
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Neural and adaptive systems : fundamentals through simulations
Príncipe, J. C., Euliano, N. R., & Lefebvre, W. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 991
Cited by
Maximum correntropy Kalman filter
Chen, B., Liu, X., Zhao, H., & Principe, J. C. (2017) · Automatica · doi:10.1016/j.automatica.2016.10.004 · Cited by 923
Self-citationClassification with Noisy Labels by Importance Reweighting
Liu, T., & Tao, D. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2456899 · Cited by 782
A novel deep autoencoder feature learning method for rotating machinery fault diagnosis
Shao, H., Jiang, H., Zhao, H., & Wang, F. (2017) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2017.03.034 · Cited by 684
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Robust Principal Component Analysis Based on Maximum Correntropy Criterion
He, R., Hu, B.-G., Zheng, W.-S., & Kong, X.-W. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2103949 · Cited by 359
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
He, R., Zheng, W.-S., Tan, T., & Sun, Z. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.102 · Cited by 342
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307
“One popular second order metric is correntropy [80].”
BackgroundMaheshwari, S., Pachori, R. B., & Acharya, U. R. (2017) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2016.2544961 · Cited by 283
Minimum Error Entropy Kalman Filter
Chen, B., Dang, L., Gu, Y., Zheng, N., & Principe, J. C. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2019.2957269 · Cited by 266
Self-citationRegularized Robust Coding for Face Recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235849 · Cited by 259
Robust guided image filtering using Nonconvex potentials
Ham, B., Cho, M., & Ponce, J. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2669034 · Cited by 219
Xue, J., Ma, W., Feng, X., Guo, P., Guo, Y., Hu, X., & Chen, B. (2023) · Energy · doi:10.1016/j.energy.2023.129279 · Cited by 36
Metadata
- Authors
- Liu, W., Pokharel, P. P., & Principe, J. C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2007-11
- Volume
- 55
- Issue
- 11
- Pages
- 5286-5298
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2135160607
- Cited by
- 1,695
- References
- 23
- FWCI
- 21.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.