Volume 9 Number 3 (Mar. 2014)
Home > Archive > 2014 > Volume 9 Number 3 (Mar. 2014) >
JSW 2014 Vol.9(3): 748-756 ISSN: 1796-217X
doi: 10.4304/jsw.9.3.748-756

Sparse Affinity Propagation for Image Analysis

Xue Zhang, Jian Cheng Lv
Machine Intelligence Laboratory, College of Computer Science, Sichuan University, Chengdu 610065, P.R. China

Abstract—It is challenging to find a small set of data points, so-called exemplars or landmarks, that are nicely representative of itself and other data points. Affinity propagation (AP) is an effective algorithm that identifies exemplars among data points by recursively sending realvalued messages between pairs of data points. AP calculates the message using the similarity among data points. Hence, the construction of similarity graph lies in the heart of the AP algorithm. A common choice for similarity is negative Euclidean distance. However, most data points, especial high-dimensional data, lies into the non-Euclidean space such that Euclidean distance cannot capture the real structure of data. Moreover, Euclidean distance is sensitive to noise and outliers such that the performance of the algorithm will be degraded when data are grossly corrupted. In this paper, we propose an algorithm, named as Sparse Affinity Propagation (SAP), which adopts sparse representation coefficient to depict the relationship among data points. For a given data set, SAP calculates the sparse representation for each data point by solving a convex problem; and then, builds a similarity graph using the representation coefficient; after that, obtains the exemplars by performing AP over the sparse similarity graph. To verify the efficacy of our algorithm, we carried out numerous experiments in the context of data summarization. Empirical studies show that SAP is superior to AP and other baseline algorithms for image analysis in accuracy and robustness.

Index Terms—Data Summarization, Subset Selection, ℓ1- minimization, Compressive Sensing, Message Propagation.


Cite: Xue Zhang, Jian Cheng Lv, "Sparse Affinity Propagation for Image Analysis," Journal of Software vol. 9, no. 3, pp. 748-756, 2014.

General Information

ISSN: 1796-217X (Online)
Frequency:  Bimonthly (Since 2020)
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Apr 26, 2021 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Jun 22, 2020 News!

    Papers published in JSW Vol 14, No 1- Vol 15 No 4 have been indexed by DBLP     [Click]

  • Sep 13, 2021 News!

    The papers published in Vol 16, No 6 have all received dois from Crossref    [Click]

  • Jan 28, 2021 News!

    [CFP] 2021 the annual meeting of JSW Editorial Board, ICCSM 2021, will be held in Rome, Italy, July 21-23, 2021   [Click]

  • Sep 13, 2021 News!

    Vol 16, No 6 has been published with online version     [Click]