{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T11:11:21Z","timestamp":1723547481300},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T00:00:00Z","timestamp":1413417600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>Similarity measures have application in many scenarios of digital image processing. The correntropy is a robust and relatively new similarity measure that recently has been employed in various engineering applications. Despite other competitive characteristics, its computational cost is relatively high and may impose hard-to-cope time restrictions for high-dimensional applications, including image analysis and computer vision.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Methods<\/jats:title>\n            <jats:p>We propose a parallelization strategy for calculating the correntropy on multi-core architectures that may turn the use of this metric viable in such applications. We provide an analysis of its parallel efficiency and scalability.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>The simulation results were obtained on a shared memory system with 24 processing cores for input images of different dimensions. We performed simulations of various scenarios with images of different sizes. The aim was to analyze the parallel and serial fraction of the computation of the correntropy coefficient and the influence of these fractions in its speedup and efficiency.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusions<\/jats:title>\n            <jats:p>The results indicate that correntropy has a large potential as a metric for image analysis in the multi-core era due to its high parallel efficiency and scalability.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/s13173-014-0018-4","type":"journal-article","created":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T16:34:21Z","timestamp":1413390861000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the parallel efficiency and scalability of the correntropy coefficient for image analysis"],"prefix":"10.1186","volume":"20","author":[{"given":"Aluisio I","family":"R\u00eago Fontes","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Xavier-de-Souza","sequence":"additional","affiliation":[]},{"given":"Adri\u00e3o D","family":"D\u00f3ria Neto","sequence":"additional","affiliation":[]},{"given":"Luiz Felipe","family":"de Queiroz Silveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MIM.2013.6417053","volume":"16","author":"E Chalom","year":"2013","unstructured":"Chalom E, Asa E, Biton E: Measuring image similarity: an overview of some useful applications comparing images using a pattern. IEEE Instrum Meas Mag 2013, 16: 24\u201328. 10.1109\/MIM.2013.6417053","journal-title":"IEEE Instrum Meas Mag"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1109\/TSP.2006.872524","volume":"54","author":"I Santamar\u00eda","year":"2006","unstructured":"Santamar\u00eda I, Member S, Pokharel PP, Member S, Principe JC: Generalized correlation function: definition, properties, and application to blind equalization. IEEE Trans Signal Process 2006, 54: 2187\u20132197. 10.1109\/TSP.2006.872524","journal-title":"IEEE Trans Signal Process"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.neunet.2007.12.039","volume":"21","author":"J-W Xu","year":"2008","unstructured":"Xu J-W, Bakardjian H, Cichocki A, Principe JC: A new nonlinear similarity measure for multichannel signals. Neural Netw 2008, 21: 222\u2013231. 10.1016\/j.neunet.2007.12.039","journal-title":"Neural Netw"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"1","author":"E Parzen","year":"1962","unstructured":"Parzen E: On estimation of a probability density function and mode. Ann Math Stat 1962, 1: 1065\u20131076. 10.1214\/aoms\/1177704472","journal-title":"Ann Math Stat"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TNNLS.2012.2226471","volume":"24","author":"R He","year":"2013","unstructured":"He R, Zheng W-S, Hu B-G, Member S: Two-stage nonnegative sparse representation for large-scale face recognition. IEEE Trans Neural Netw Learn Syst 2013, 24: 35\u201346. 10.1109\/TNNLS.2012.2226471","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1109\/TPAMI.2010.220","volume":"33","author":"R He","year":"2011","unstructured":"He R, Zheng W-S, Hu B-G: Maximum correntropy criterion for robust face recognition. IEEE Trans Pattern Anal Mach Intell 2011, 33: 1561\u20131576. 10.1109\/TPAMI.2010.220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1109\/TIP.2013.2237920","volume":"22","author":"X-X Li","year":"2013","unstructured":"Li X-X, Dai D-Q, Zhang X-F, Ren C-X: Structured sparse error coding for face recognition with occlusion. IEEE Trans Image Process 2013, 22: 1889\u2013900. 10.1109\/TIP.2013.2237920","journal-title":"IEEE Trans Image Process"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1016\/j.patcog.2008.09.023","volume":"42","author":"K-H Jeong","year":"2009","unstructured":"Jeong K-H, Liu W, Han S, Hasanbelliu E, Principe JC: The correntropy MACE filter. Pattern Recognit 2009, 42: 871\u2013885. 10.1016\/j.patcog.2008.09.023","journal-title":"Pattern Recognit"},{"key":"18_CR9","first-page":"2757","volume":"1","author":"E Hasanbelliu","year":"2009","unstructured":"Hasanbelliu E, Principe JC, Slatton C: Correntropy based matched filtering for classification in sidescan sonar imagery. IEEE Int Conf 2009, 1: 2757\u20132761.","journal-title":"IEEE Int Conf"},{"key":"18_CR10","first-page":"613","volume":"2","author":"K-H Jeong","year":"2007","unstructured":"Jeong K-H, Han S, Principe JC: The fast correntropy mace filter. IEEE Speech Signal Process 2007, 2: 613\u2013615.","journal-title":"IEEE Speech Signal Process"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Seth S, Principe JC (2009) On speeding up computation in information theoretic learning. Int Joint Conf Neural Netw: 2883\u20132887. Seth S, Principe JC (2009) On speeding up computation in information theoretic learning. Int Joint Conf Neural Netw: 2883-2887.","DOI":"10.1109\/IJCNN.2009.5178933"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Principe JC (2010) Information theoretic learning: R\u00e9nyi's entropy and kernel perspectives. Springer. 2010. Principe JC (2010) Information theoretic learning: R\u00e9nyi's entropy and kernel perspectives. Springer. 2010.","DOI":"10.1007\/978-1-4419-1570-2"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TPAMI.2013.188","volume":"36","author":"Y Yang","year":"2014","unstructured":"Yang Y, Feng Y, Suykens JA: Robust recovery of corrupted low-rank matrix by implicit regularizers. IEEE Trans Pattern Anal Mach Intell 2014, 36(4):770\u2013783. 10.1109\/TPAMI.2013.188","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/TPAMI.2013.102","volume":"36","author":"R He","year":"2014","unstructured":"He R, Zheng W, Tan T, Sun Z: Half-quadratic-based iterative minimization for robust sparse representation. IEEE Trans Anal Mach Intell 2014, 36: 261\u2013275. 10.1109\/TPAMI.2013.102","journal-title":"IEEE Trans Anal Mach Intell"},{"key":"18_CR15","unstructured":"Yang Y, Feng Y, Suykens JA (2013) A nonconvex relaxation approach to robust matrix completion. IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, vol. 11,1764\u20131770. Yang Y, Feng Y, Suykens JA (2013) A nonconvex relaxation approach to robust matrix completion. IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, vol. 11,1764-1770."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2008.209","volume":"41","author":"MD Hill","year":"2008","unstructured":"Hill MD, Marty MR: Amdahl's law in the multicore era. IEEE Comput Soc 2008, 41: 33\u201338. 10.1109\/MC.2008.209","journal-title":"IEEE Comput Soc"},{"key":"18_CR17","unstructured":"Sun X-H, Chen Y, Byna S (2008) Scalable computing in the multicore era. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Programming. Sun X-H, Chen Y, Byna S (2008) Scalable computing in the multicore era. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Programming."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1109\/IJCNN.1999.832648","volume":"3","author":"JC Principe","year":"1999","unstructured":"Principe JC, Xu D: An introduction to information theoretic learning. IJCNN Neural Networks 1999, 3: 1783\u20131787. 10.1109\/IJCNN.1999.832648","journal-title":"IJCNN Neural Networks"},{"key":"18_CR19","first-page":"122","volume":"21","author":"AI Fontes","year":"2014","unstructured":"Fontes AI, Silveira LF, Principe JC: Performance evaluation of the correntropy coefficient in automatic modulation classification. Expert Syst Appl 2014, 21: 122\u2013131.","journal-title":"Expert Syst Appl"},{"key":"18_CR20","first-page":"134","volume":"10","author":"H Qu","year":"2013","unstructured":"Qu H, Ma W, Zhao J, Wang T: Prediction method for network traffic based on maximum correntropy criterion. IEEE Chin Commun 2013, 10: 134\u2013145.","journal-title":"IEEE Chin Commun"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/LSP.2014.2319308","volume":"21","author":"B Chen","year":"2014","unstructured":"Chen B, Xing L, Liang J, Zheng N, Principe JC: Steady-state mean-square error analysis for adaptive filtering under the maximum correntropy criterion. IEEE Signal Process Soc 2014, 21: 880\u2013884. 10.1109\/LSP.2014.2319308","journal-title":"IEEE Signal Process Soc"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1109\/TIP.2013.2237920","volume":"22","author":"X-X Li","year":"2013","unstructured":"Li X-X, Dai D-Q, Zhang X-F, Ren C-X: Structured sparse error coding for face recognition with occlusion. IEEE Trans Image Process 2013, 22: 1889\u20131900. 10.1109\/TIP.2013.2237920","journal-title":"IEEE Trans Image Process"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Petersen WP, Arbenz P (2003) Introduction to parallel computing. Hardcover. Petersen WP, Arbenz P (2003) Introduction to parallel computing. Hardcover.","DOI":"10.1093\/oso\/9780198515760.001.0001"},{"key":"18_CR24","first-page":"483","volume":"12","author":"G Amdahl","year":"2007","unstructured":"Amdahl G: Validity of the single processor approach to achieving large scale computing capabilities. IEEE Solid-State Circuits Soc Newslett 2007, 12: 483\u2013485.","journal-title":"IEEE Solid-State Circuits Soc Newslett"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"JL Gustafson","year":"1988","unstructured":"Gustafson JL: Reevaluating Amdahl's law. Commun ACM 1988, 31: 532\u2013533. 10.1145\/42411.42415","journal-title":"Commun ACM"},{"key":"18_CR26","unstructured":"Chandra R (2001) Parallel Programming in OpenMP. Hardcover. Chandra R (2001) Parallel Programming in OpenMP. Hardcover."}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0018-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13173-014-0018-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0018-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0018-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T10:45:50Z","timestamp":1723545950000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-014-0018-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,16]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1186\/s13173-014-0018-4","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"type":"print","value":"0104-6500"},{"type":"electronic","value":"1678-4804"}],"subject":[],"published":{"date-parts":[[2014,10,16]]},"assertion":[{"value":"20 March 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"18"}}