<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JSIP</journal-id><journal-title-group><journal-title>Journal of Signal and Information Processing</journal-title></journal-title-group><issn pub-type="epub">2159-4465</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jsip.2017.82005</article-id><article-id pub-id-type="publisher-id">JSIP-76121</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Sound-Environment Monitoring Method Based on Computational Auditory Scene Analysis
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mitsuru</surname><given-names>Kawamoto</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>Service Sensing, Assimilation, and Modeling Research Group, Human Informatics Research Institute, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Japan</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>m.kawamoto@aist.go.jp</email></corresp></author-notes><pub-date pub-type="epub"><day>05</day><month>05</month><year>2017</year></pub-date><volume>08</volume><issue>02</issue><fpage>65</fpage><lpage>77</lpage><history><date date-type="received"><day>February</day>	<month>24,</month>	<year>2017</year></date><date date-type="rev-recd"><day>Accepted:</day>	<month>May</month>	<year>9,</year>	</date><date date-type="accepted"><day>May</day>	<month>12,</month>	<year>2017</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Monitoring techniques are a key technology for examining the conditions in various scenarios, e.g., structural conditions, weather conditions, and disasters. In order to understand such scenarios, the appropriate extraction of their features from observation data is important. This paper proposes a monitoring method that allows sound environments to be expressed as a sound pattern. To this end, the concept of synesthesia is exploited. That is, the keys, tones, and pitches of the monitored sound are expressed using the three elements of color, that is, the hue, saturation, and brightness, respectively. In this paper, it is assumed that the hue, saturation, and brightness can be detected from the chromagram, sonogram, and sound spectrogram, respectively, based on a previous synesthesia experiment. Then, the sound pattern can be drawn using color, yielding a “painted sound map.” The usefulness of the proposed monitoring technique is verified using environmental sound data observed at a galleria.
 
</p></abstract><kwd-group><kwd>Sound-Environment Visualization</kwd><kwd> Environmental Sounds</kwd><kwd> Monitoring</kwd><kwd> Painted Sound Patterns</kwd><kwd> Synesthesia</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Recently, the analysis of large data sets, so-called “big data,” has allowed a variety of information to be extracted, and this information can help create certain services. Further, monitoring techniques can be useful for determining the phenomena that initially generated the recorded data. Thus, monitoring techniques are regarded as those that allow identification of the monitored environment conditions through analysis of the data observed within the area. For example, in the case of structural monitoring, which is known as building health monitoring, deterioration and damage to buildings can be checked using findings obtained through the analysis of sensor data, e.g., data acquired from acceleration sensors and cameras [<xref ref-type="bibr" rid="scirp.76121-ref1">1</xref>] . In this paper, sound environments are assumed to be the target field of the monitoring problem; that is, sound environment monitoring is addressed.</p><p>Various methods for understanding sound environments have been proposed to date. However, almost all researchers have focused on topics related to environmental sound recognition (ESR) [<xref ref-type="bibr" rid="scirp.76121-ref2">2</xref>] . For example, ESR techniques implemented with features such as a zero-crossing rate, Cepstral features, MPEG-7- based features, and autoregression-based features, which are extracted from environmental sounds, have been proposed [<xref ref-type="bibr" rid="scirp.76121-ref3">3</xref>] - [<xref ref-type="bibr" rid="scirp.76121-ref9">9</xref>] , along with a method of understanding environmental sounds that employs a matching pursuit algorithm [<xref ref-type="bibr" rid="scirp.76121-ref10">10</xref>] . To the best of the author’s knowledge, no studies have focused on determination of sound environments; therefore, such a method is presented here.</p><p>This study proposes an unconventional method that allows the analysis of sound environments using color, where the color rules are based on the concept of synesthesia [<xref ref-type="bibr" rid="scirp.76121-ref11">11</xref>] . That is, sound positions can be estimated using a sound position estimation approach, and a color based on three features extracted from the observed environmental sounds can be painted at the estimated position. Hence, painted sound patterns referred to as “painted sound maps” are obtained, from which sound environment scenarios can be recognized. The efficacy of the proposed monitoring method is evaluated using environmental sound data observed at a galleria.</p></sec><sec id="s2"><title>2. Proposed Method</title><sec id="s2_1"><title>2.1. Overview of Proposed Method</title><p>For application of the proposed method, environmental sounds are first collected using a microphone array (<xref ref-type="fig" rid="fig1">Figure 1</xref>). Using these sounds, various sound environment conditions can be estimated. These scenarios are then expressed</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Microphone array utilized to collect environmental sounds at galleria</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x2.png"/></fig><p>using colors, based on the knowledge of synesthesia.</p><p>Synesthesia is a phenomenon in which one kind of sensory stimulation is expressed as another sensation [<xref ref-type="bibr" rid="scirp.76121-ref12">12</xref>] . In the case of synesthesia relating sound and color, Nagata et al. have reported an experimental result in which keys, tones, and pitches were respectively related to hue, saturation, and brightness [<xref ref-type="bibr" rid="scirp.76121-ref13">13</xref>] . Based on this result, this study utilizes information on the keys, tones, and pitches of environmental sounds to draw painted sound maps.</p><p>Keys, tones, and pitches are assumed to be detected by the chromagram, sonogram, and sound spectrogram, respectively. Hence, the hue score is calculated using the key histogram yielded by the chromagram. Similarly, the saturation and brightness scores are calculated using the frequency-band histograms produced by the sonogram and sound spectrogram, respectively, with a clustering method then being applied to the environmental-sound spectrogram. Similar frequency components are categorized so that the frequency component dispersion of the environmental sounds is clarified. This dispersion information is then used to calculate the histogram with respect to the spectrogram frequency elements.</p><p>Below, the proposed method of sound environment analysis is presented in detail. The sound data <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x3.png" xlink:type="simple"/></inline-formula> can be obtained using the microphone array shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, where a short-term Fourier transform <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x4.png" xlink:type="simple"/></inline-formula> is applied to<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x5.png" xlink:type="simple"/></inline-formula>. Then, the amplitude of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x6.png" xlink:type="simple"/></inline-formula> has max<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x8.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x7.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x9.png" xlink:type="simple"/></inline-formula> is a constant value, and the maximum period of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x10.png" xlink:type="simple"/></inline-formula> is 2 s. The sound position estimation is conducted using multiple signal classification (MUSIC) [<xref ref-type="bibr" rid="scirp.76121-ref14">14</xref>] , utilizing the microphone array outputs.</p></sec><sec id="s2_2"><title>2.2. Key Information Extraction from Chromagram</title><p>The environmental sound chromagram is calculated using the MATLAB chroma toolbox [<xref ref-type="bibr" rid="scirp.76121-ref15">15</xref>] . First, the environmental-sound pitch features can be computed using the audio_to_pitch_via_FB function. <xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref> show an environmental sound and its pitch features obtained using audio_to_pitch_via_FB, respectively. Next, a chromagram can be calculated (<xref ref-type="fig" rid="fig4">Figure 4</xref>) using pitch_to_ chroma, based on pitch features such as those shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Environmental sound</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x11.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Pitch features of environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x12.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Chromagram of environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x13.png"/></fig><p>Subsequently, a histogram showing the key information indicated in the chromagram is calculated. For example, <xref ref-type="fig" rid="fig5">Figure 5</xref> shows the histogram calculated based on the chromagram shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>, where the ma_sh function of the MATLAB ma toolbox [<xref ref-type="bibr" rid="scirp.76121-ref16">16</xref>] , which can calculate a spectrum histogram from the chromagram, is used. The MATLAB function, hist, is then applied to the spectrum histogram. Depending on the histogram variability, the histogram data can be transformed into an 8-bit binary code as follows: 1) The histogram mean is calculated (dashed line in <xref ref-type="fig" rid="fig5">Figure 5</xref>); 2) Values greater or less than the mean are replaced with “1” or “0,” respectively; 3) An 8-bit binary code is obtained; the code corresponding to <xref ref-type="fig" rid="fig5">Figure 5</xref> is “00000101.” Hence, the hue score is determined by converting the binary code to decimal values. It is apparent that a higher score indicates an environmental sound consisting of some dominant keys.</p></sec><sec id="s2_3"><title>2.3. Tonal Information Extraction from Sonogram</title><p>The sonogram can be calculated using the MATLAB ma toolbox [<xref ref-type="bibr" rid="scirp.76121-ref16">16</xref>] , where the loudness sensation per frequency band is estimated using auditory models and the ma_sone function of the ma toolbox. <xref ref-type="fig" rid="fig6">Figure 6</xref> shows the sonogram of the environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p><p>The frequency-band histogram of the sonogram is computed [<xref ref-type="bibr" rid="scirp.76121-ref16">16</xref>] , and the saturation score is then determined using the same approach as that used for the hue score. Therefore, it is apparent that a higher score indicates an environmental sound with some characteristic components in the loudness sensation per frequency band.</p></sec><sec id="s2_4"><title>2.4. Pitch Information Extraction from Spectrogram</title><p>A spectrogram can also be calculated. <xref ref-type="fig" rid="fig7">Figure 7</xref> shows the spectrogram of the</p><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Key histogram obtained from <xref ref-type="fig" rid="fig4">Figure 4</xref> chromagram, with mean</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x14.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Sonogram of environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x15.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Spectrogram of environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x16.png"/></fig><p>environmental sound shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. An edge-extraction image processing technique is applied to the spectrogram, and the number of pixels in its frequency characteristic areas and their centroid frequencies are then computed. The frequency characteristic areas of the spectrogram detected by the edge extraction technique are categorized using an improved affinity propagation (IAP) method (see Appendix). For details of the affinity propagation, see [<xref ref-type="bibr" rid="scirp.76121-ref17">17</xref>] .</p><p>Each exemplar centroid frequency obtained by the IAP is classified into a low-, medium-, or high-frequency group; then, the frequency-group histogram can be acquired. The brightness score is obtained from the histogram in a similar manner to the case of the hue score. However, when the 8-bit binary code is obtained, the threshold determining “1” or “0” values is set to zero. Therefore, a low score indicates that the dominant frequency of the environmental sound is low, while a higher score indicates that the environmental sound consists of various frequencies.</p></sec><sec id="s2_5"><title>2.5. Painted Sound Map from Three Scores</title><p>The hue, saturation, and brightness scores are used to draw the painted sound map, where the hue-saturation-brightness color model obtained using these three scores is converted to a red-green-blue (RGB) color model.</p></sec></sec><sec id="s3"><title>3. Experimental Results and Discussion</title><p>In this section, the efficacy of the painted sound map method is demonstrated using environmental sounds observed in the sound environment shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. In each demonstration, the painted sound map is drawn using the environmental sounds generated in a single day. Further, in each figure shown below, the position of the microphone array is indicated by a red circle.</p><sec id="s3_1"><title>3.1. Painted Sound Map of Sound Environment on Typical Day</title><p>The sound environment shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> is a shopping-center galleria, the painted sound map of which is shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>. A train station is located near the galleria, outside the left side of <xref ref-type="fig" rid="fig8">Figure 8</xref>. Therefore, train sounds are generated intermittently. Further, rattling sounds from chairs and desks are generated during the galleria preparation time, along with the voices of children and students visiting the galleria.</p><p><xref ref-type="fig" rid="fig9">Figure 9</xref> shows the painted sound map for a different day. It is notable that the generated sound patterns are similar to those in <xref ref-type="fig" rid="fig8">Figure 8</xref>. From these two maps, it can be concluded that painted sound maps can be utilized to determine similarities in the sound patterns of sound environments.</p></sec><sec id="s3_2"><title>3.2. Painted Sound Map on Windy Day</title><p><xref ref-type="fig" rid="fig1">Figure 1</xref>0 shows a painted sound map obtained on a windy day. Comparing Figures 8-10, it is apparent that the painted sound map varies with the state of the sound environment; hence, painted sound maps can be utilized to detect variations in a sound environment.</p></sec><sec id="s3_3"><title>3.3. Mini-Concert Event</title><p><xref ref-type="fig" rid="fig1">Figure 1</xref>1 shows the painted sound map obtained for the same area during a mini-concert event. Blue tones are emphasized at the event location, which is on the left-hand side of the map. In addition, the painted sound map obtained on the same day is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>2. At a glance, the painted sound map is simi-</p><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Painted sound map of <xref ref-type="fig" rid="fig1">Figure 1</xref> sound environment</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x17.png"/></fig><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Painted sound map showing similar sound patterns to those of <xref ref-type="fig" rid="fig8">Figure 8</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x18.png"/></fig><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> Painted sound map obtained on windy day</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x19.png"/></fig><fig id="fig11"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>1</label><caption><title> Painted sound map obtained during mini-concert event</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x20.png"/></fig><fig id="fig12"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>2</label><caption><title> Painted sound map obtained on event day</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-3400493x21.png"/></fig><p>lar to those shown in <xref ref-type="fig" rid="fig8">Figure 8</xref> and <xref ref-type="fig" rid="fig9">Figure 9</xref>. This indicates that the snapshot provided by the painted sound maps is important as regards detection of sound environmental changes.</p><p>From all the above results, it can be concluded that the proposed painted sound map drawn using the three scores discussed above is effective for sound environment analysis. In particular, this approach is useful for visually detecting and determining the sound environment conditions and their variations, and it should be noted that the snapshots provided by the painted sound maps work effectively in this regard.</p></sec></sec><sec id="s4"><title>4. Conclusions</title><p>This paper has proposed a method of monitoring sound environments based on computational auditory scene analysis. The proposed visualization technique allows sound environment conditions to be determined and represented using colors.</p><p>As future research work, the proposed monitoring technique can be applied to the monitoring of superannuated building structural conditions.</p></sec><sec id="s5"><title>Acknowledgements</title><p>The author thanks Dr. Sashima and Dr. Kurumatani for helpful discussions. This work was partly supported by a JSPS KAKENHI Grant (Number 16H02911).</p></sec><sec id="s6"><title>Cite this paper</title><p>Kawamoto, M. (2017) Sound-Environment Monitoring Method Based on Computational Auditory Scene Analysis. Journal of Signal and Information Processing, 8, 65-77. https://doi.org/10.4236/jsip.2017.82005</p></sec><sec id="s7"><title>Appendix</title><sec id="s7_1"><title>1.1. Improved Affinity Propagation</title><p>The method proposed in this paper employs a message exchange clustering algorithm based on an affinity propagation (AP) method [<xref ref-type="bibr" rid="scirp.76121-ref17">17</xref>] . The AP performs clustering such that the data can be categorized by modifying the messages <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x22.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x23.png" xlink:type="simple"/></inline-formula> according to</p><disp-formula id="scirp.76121-formula175"><label>, (1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x24.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.76121-formula176"><label>, (2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x25.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.76121-formula177"><label>, (3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x26.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula> is a message being sent from data point <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula> in a cluster to a centroid candidate k (exemplar) in the cluster, indicating the appropriateness of data point k becoming the exemplar of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula>. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula>is a message being sent from an exemplar candidate k to data point<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula>, indicating the appropriateness of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula> becoming a cluster member of k. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula>is the similarity between data points <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x34.png" xlink:type="simple"/></inline-formula> and k, where, in each iterative step l, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x35.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x36.png" xlink:type="simple"/></inline-formula> are updated with those of the previous iteration, i.e., <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x37.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x38.png" xlink:type="simple"/></inline-formula>. The parameter “lam” denotes a damping factor and is set to 0 &lt; lam &lt; 1.</p><p>In the AP method, the exemplar is the data point k satisfying the inequality;</p><disp-formula id="scirp.76121-formula178"><label>. (4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x39.png"  xlink:type="simple"/></disp-formula><p>Then, the exemplar satisfying condition (4) can be altered by the preference <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula> [<xref ref-type="bibr" rid="scirp.76121-ref17">17</xref>] . That is, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula>influences the output clusters and the number of clusters. The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x42.png" xlink:type="simple"/></inline-formula> values are set before modification of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x43.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x44.png" xlink:type="simple"/></inline-formula>. In the original AP method, the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x45.png" xlink:type="simple"/></inline-formula> values were set to the median of all <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x46.png" xlink:type="simple"/></inline-formula> values.</p><p>Here, it should be noted that the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula> values can be modified during the updates of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x48.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x49.png" xlink:type="simple"/></inline-formula>. Wang et al. have proposed an adaptive scanning method of preferences applicable to the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x50.png" xlink:type="simple"/></inline-formula> space to determine the optimal clustering solution [<xref ref-type="bibr" rid="scirp.76121-ref18">18</xref>] . They have also proposed a damping-factor adaptive adjustment method to improve the AP method convergence. This study proposes an <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x51.png" xlink:type="simple"/></inline-formula> modification algorithm using the similarity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x52.png" xlink:type="simple"/></inline-formula> and satisfying the condition,</p><disp-formula id="scirp.76121-formula179"><label>. (5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x53.png"  xlink:type="simple"/></disp-formula><p>That is, based on the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x54.png" xlink:type="simple"/></inline-formula> values with respect to the data point <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x55.png" xlink:type="simple"/></inline-formula> satisfying condition (5), all <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x56.png" xlink:type="simple"/></inline-formula> values are updated using</p><disp-formula id="scirp.76121-formula180"><label>. (6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x57.png"  xlink:type="simple"/></disp-formula><p>This means that the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x58.png" xlink:type="simple"/></inline-formula> values are updated such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x59.png" xlink:type="simple"/></inline-formula> does not become an outlier in its cluster. The parameters abs(x), mean(x), and std(x) denote the absolute value, the mean value, and the standard deviation of x, respectively.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Clustering performance comparison</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >VRC</th><th align="center" valign="middle" >Number of exemplars</th><th align="center" valign="middle" >Running time [s]</th></tr></thead><tr><td align="center" valign="middle" >Original AP method</td><td align="center" valign="middle" >32.93</td><td align="center" valign="middle" >4.7</td><td align="center" valign="middle" >0.0078</td></tr><tr><td align="center" valign="middle" >Adaptive AP method</td><td align="center" valign="middle" >35.99</td><td align="center" valign="middle" >5.5</td><td align="center" valign="middle" >0.2146</td></tr><tr><td align="center" valign="middle" >Proposed IAP method</td><td align="center" valign="middle" >38.47</td><td align="center" valign="middle" >9.6</td><td align="center" valign="middle" >0.1013</td></tr></tbody></table></table-wrap><p>Further, X denotes all data in a cluster consisting of data Xk’’. The parameters <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x60.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x61.png" xlink:type="simple"/></inline-formula> are positive constants greater and less than one, respectively. Therefore, the AP algorithm proposed in this study is implemented by adding the original rules (1)-(4) to rules (5) and (6).</p></sec><sec id="s7_2"><title>1.2. Improved Affinity Propagation (IAP) Performance</title><p>In this subsection, the proposed IAP method is compared with the original and adaptive AP methods, using the 2D random data points <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x62.png" xlink:type="simple"/></inline-formula> generated with<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x63.png" xlink:type="simple"/></inline-formula>. The data point number is N = 30. The original and adaptive AP methods are implemented using the MATLAB program obtained from [<xref ref-type="bibr" rid="scirp.76121-ref19">19</xref>] . The performances of the three algorithms are evaluated using the Calinski-Harabasz criterion [<xref ref-type="bibr" rid="scirp.76121-ref20">20</xref>] , which is the ratio of the between-cluster variance to the total within-cluster variance, defined as</p><disp-formula id="scirp.76121-formula181"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x64.png"  xlink:type="simple"/></disp-formula><p>Here, k denotes the number of clusters and SS<sub>B</sub> is the overall between-cluster variance, which is essentially the variance of all the cluster centroids from the grand centroid in the dataset, defined as</p><disp-formula id="scirp.76121-formula182"><label>. (8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x65.png"  xlink:type="simple"/></disp-formula><p>Here, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x66.png" xlink:type="simple"/></inline-formula>indicates the number of elements per cluster, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x67.png" xlink:type="simple"/></inline-formula>is the centroid of cluster i, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x68.png" xlink:type="simple"/></inline-formula>is the overall mean of the dataset, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x69.png" xlink:type="simple"/></inline-formula> is the L2 norm of *. Further, SS<sub>W</sub> is the overall within-cluster variance, defined as</p><disp-formula id="scirp.76121-formula183"><label>, (9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/3-3400493x70.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula> is a data point, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x72.png" xlink:type="simple"/></inline-formula>is the ith cluster, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x73.png" xlink:type="simple"/></inline-formula> is the centroid of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x74.png" xlink:type="simple"/></inline-formula> A large positive value of VRC indicates that the clustering performance is superior. In this study, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x75.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-3400493x76.png" xlink:type="simple"/></inline-formula> in (5) and (6) were set to 1.5 and 0.9, respectively.</p><p><xref ref-type="table" rid="table1">Table 1</xref> shows the performance results, which were averaged over the results of 30 trials. It is apparent that the proposed IAP method has a longer computational time and more exemplars than the original AP method. However, the former exhibits superior clustering performance, compared with the two conventional methods. Note that the running time was calculated using a PC (CPU: i7-4770@3.4 GHz, RAM: 8.0 GB). Hence, it can be concluded that rules (5) and (6) work effectively in the original AP method.</p></sec></sec></body><back><ref-list><title>References</title><ref id="scirp.76121-ref1"><label>1</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Hamamoto</surname><given-names> T. </given-names></name>,<etal>et al</etal>. (<year>2015</year>)<article-title>Structural Health Monitoring of Buildings</article-title><source> Transactions of Foundation Engineering &amp; Equipment</source><volume> 43</volume>,<fpage> 17</fpage>-<lpage>20</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.76121-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Chachada, J.S. and Kuo, C.-C.J. (2014) Environmental Sound Recognition: A Survey. SIP (2014), Vol. 3, e14, 1-15.  
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S2048770314000122</mixed-citation></ref><ref id="scirp.76121-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Mitrovic, D., Zeppelzauer, M. and Breiteneder, C. (2010) Features for Content-Based Audio Retrieval. In: Advances in Computers, Vol. 78, Elsevier, Amsterdam, 71-150.</mixed-citation></ref><ref id="scirp.76121-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Deng, J.D., Simmermacher, C. and Cranefield, S. (2008) A Study on Feature Analysis for Musical Instrument Classification. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 38, 429-438. https://doi.org/10.1109/TSMCB.2007.913394</mixed-citation></ref><ref id="scirp.76121-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Peltonen, V., Tuomi, J., Klapuri, A., Huopaniemi, J. and Sorsa, T. (2002) Computational Auditory Scene Recognition. 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Orlando, FL, 13-17 May 2002, II-1941-II-1944.</mixed-citation></ref><ref id="scirp.76121-ref6"><label>6</label><mixed-citation publication-type="book" xlink:type="simple">Potamitis, I. and Ganchev, T. (2008) Generalized Recognition of Sound Events: Approaches and Applications. In: Tsihrintzis, G.A. and Jain, L.C., Eds., Multimedia Services in Intelligent Environments, Springer, Berlin, Heidelberg, 41-79.</mixed-citation></ref><ref id="scirp.76121-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Wang, J.-C., Wang, J.-F., He, K.W. and Hsu, C.-S. (2006) Environmental Sound Classification Using Hybrid SVM/KNN Classifier and MPEG-7 Audio Low-Level Descriptor. International Joint Conference on Neural Networks, Vancouver, 16-21 July 2006, 1731-1735.</mixed-citation></ref><ref id="scirp.76121-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Muhammad, G., Alotaibi, Y.A., Alsulaiman, M. and Huda, M.N. (2010) Environment Recognition Using Selected MPEG-7 Audio Features and Mel-Frequency Cepstral Coefficients. 2010 5th International Conference on Digital Telecommunications (ICDT), Athens, 13-19 June 2010, 11-16.  
https://doi.org/10.1109/ICDT.2010.10</mixed-citation></ref><ref id="scirp.76121-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Tsau, E., Kim, S.-H. and Kuo, C.-C.J. (2011) Environmental Sound Recognition with CELP-Based Features. 2011 10th International Symposium on Signals, Circuits and Systems (ISSCS), lasi, 30 June-1 July 2011, 1-4.  
https://doi.org/10.1109/ISSCS.2011.5978729</mixed-citation></ref><ref id="scirp.76121-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Chu, S., Narayanan, S. and Kuo, C.-C.J. (2009) Environmental Sound Recognition with Time-Frequency Audio Features. IEEE Transactions on Audio, Speech, and Language Processing, 17, 1142-1158. https://doi.org/10.1109/TASL.2009.2017438</mixed-citation></ref><ref id="scirp.76121-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">The Color Science Association of Japan (2011) Handbook of Color Science. 3rd Edition, University of Tokyo Press, Japan. (In Japanese)</mixed-citation></ref><ref id="scirp.76121-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Cytowic, R.E. (2003) The Man Who Tasted Shapes. MIT Press, Cambridge, MA.</mixed-citation></ref><ref id="scirp.76121-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Nagata, N., Iwai, D., Tsusa, M., Wake, S.H. and Inokuchi, S. (2003) Non-Verbal Mapping between Sound and Color-Mapping Derived from Colored Hearing Possessors and Its Applications. IEICE, J86-A, 1219-1230. (In Japanese)</mixed-citation></ref><ref id="scirp.76121-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Schmidt, R.O. (1986) Multiple Emitter Location and Signal Parameter Estimation. IEEE Transactions on Antennas and Propagation, 34, 276-280.  
https://doi.org/10.1109/TAP.1986.1143830</mixed-citation></ref><ref id="scirp.76121-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Muller, M. and Ewert, S. (2011) Chroma Toolbox: Matlab Implementations for Extracting Variants of Chroma-Based Audio Features. Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR 2011), Miami, 24-28 October 2011, 215-220.</mixed-citation></ref><ref id="scirp.76121-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">http://www.pampalk.at/ma/documentation.html</mixed-citation></ref><ref id="scirp.76121-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Frey, B.J. and Dueck, D. (2007) Clustering by Passing Messages between Data Points. Science, 315, 972-976. https://doi.org/10.1126/science.1136800</mixed-citation></ref><ref id="scirp.76121-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Wang, R., Zhang, J., Li, D., Zhang, X. and Guo, T. (2007) Adaptive Affinity Propagation Clustering. Acta Automatica Sinica, 33, 1242-1246.</mixed-citation></ref><ref id="scirp.76121-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">https://jp.mathworks.com/matlabcentral/fileexchange/18244-adaptive-affinity-propagation-clustering</mixed-citation></ref><ref id="scirp.76121-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Calinski, T. and Harabaz, J. (1974) A Dendrite Method for Cluster Analysis. Communications in Statistics, 3, 1-27. https://doi.org/10.1080/03610927408827101</mixed-citation></ref></ref-list></back></article>