《電子技術(shù)應(yīng)用》
您所在的位置:首頁(yè) > 其他 > 設(shè)計(jì)應(yīng)用 > K-means聚類-DCT壓縮算法在振動(dòng)傳感器中的研究與應(yīng)用
K-means聚類-DCT壓縮算法在振動(dòng)傳感器中的研究與應(yīng)用
2023年電子技術(shù)應(yīng)用第1期
王昱欽1,,王鑫2,,劉保強(qiáng)1,,李軼1,洪晟3
1.江蘇自動(dòng)化研究所,,江蘇 連云港 222000;2.中國(guó)人民解放軍32381部隊(duì),,北京 100000,; 3.北京航空航天大學(xué) 網(wǎng)絡(luò)空間安全學(xué)院,北京 100191
摘要: 為延長(zhǎng)無(wú)線振動(dòng)傳感器在需要對(duì)大量高頻振動(dòng)數(shù)據(jù)進(jìn)行采集情況下的使用壽命,,首先對(duì)現(xiàn)有振動(dòng)數(shù)據(jù)壓縮算法進(jìn)行了研究,,對(duì)其存在的問(wèn)題進(jìn)行了分析,并在此基礎(chǔ)上提出了一種基于K-means聚類-DCT雙重?cái)?shù)據(jù)壓縮算法的壓縮方法,。所采用的K-means聚類-DCT雙重?cái)?shù)據(jù)壓縮算法針對(duì)預(yù)測(cè)性維護(hù)數(shù)據(jù)特點(diǎn),,首先利用K-means算法對(duì)振動(dòng)數(shù)據(jù)進(jìn)行聚合分類,再根據(jù)振動(dòng)信號(hào)頻域特點(diǎn)進(jìn)行離散余弦變換(Discret Cosine Transform, DCT)壓縮,。通過(guò)實(shí)際驗(yàn)證表明,,采用該算法對(duì)振動(dòng)數(shù)據(jù)進(jìn)行數(shù)據(jù)聚合,可以非常明顯地提高數(shù)據(jù)壓縮的效率,,從而在傳輸時(shí)將冗余數(shù)據(jù)有效減少,。而在相同數(shù)據(jù)量情況下,采用改進(jìn)的雙重壓縮算法的峰值信噪比與其他算法相比,,其具有更好的性能,。
中圖分類號(hào):TP212
文獻(xiàn)標(biāo)志碼:A
DOI: 10.16157/j.issn.0258-7998.222844
中文引用格式: 王昱欽,王鑫,,劉保強(qiáng),,等. K-means聚類-DCT壓縮算法在振動(dòng)傳感器中的研究與應(yīng)用[J]. 電子技術(shù)應(yīng)用,2023,,49(1):81-85.
英文引用格式: Wang Yuqin,,Wang Xin,Liu Baoqiang,,et al. Research and application of K-means clustering and DCT compression algorithm in vibration sensor[J]. Application of Electronic Technique,,2023,49(1):81-85.
Research and application of K-means clustering and DCT compression algorithm in vibration sensor
Wang Yuqin1,,Wang Xin2,,Liu Baoqiang1,Li Yi1,,Hong Sheng3
1.Jiangsu Automation Research Institute,, Lianyungang 222000, China,; 2.Unit 32381 of the Chinese People′s Liberation Army,, Beijing 100000, China,; 3.School of Cyber Science and Technology,, Beihang University, Beijing 100191,, China
Abstract: In order to prolong the service life of wireless vibration sensors when collecting a large number of high-frequency vibration data, this paper studied the existing vibration data compression algorithms, put forward and analyzed the existing problems, and on this basis, proposed an effective mechanism of K-means clustering-discrete cosine transform (DCT) dual data compression. According to the characteristics of predictive maintenance data, K-means clustering-DCT dual compression algorithm firstly used K-means algorithm to aggregate and classify vibration data, and then carried out DCT compression according to the frequency domain characteristics of vibration signals. The verification results showed that the algorithm significantly improved the data compression efficiency and reduced the transmission of redundant data by aggregating vibration data. In addition, under the condition of the same amount of data, the algorithm had better application performance after improving the peak signal-to-noise ratio compared with other algorithms.
Key words : sensor,;low frequency vibration;intermediate frequency vibration,;high frequency vibration,;K-means clustering and DCT compression algorithm

0 引言

    在工作時(shí)機(jī)械設(shè)備基本都存在比較明顯的振動(dòng)情況,如果想要監(jiān)測(cè)設(shè)備的運(yùn)行狀態(tài),,是可以通過(guò)分析機(jī)械設(shè)備所產(chǎn)生的振動(dòng)信號(hào)來(lái)實(shí)現(xiàn)的,,并且通過(guò)分析監(jiān)測(cè)結(jié)果的變化情況可以在早期及時(shí)地發(fā)現(xiàn)機(jī)械設(shè)備可能出現(xiàn)的故障情況[1],。但是如果要想通過(guò)設(shè)備所產(chǎn)生的振動(dòng)信號(hào)對(duì)其運(yùn)行狀態(tài)情況獲得非常準(zhǔn)確的評(píng)估或預(yù)測(cè)結(jié)果,則需要對(duì)機(jī)械設(shè)備所產(chǎn)生的大量高頻振動(dòng)數(shù)據(jù)進(jìn)行有效分析[2],,為了能夠有效采集到大量高頻振動(dòng)數(shù)據(jù),,需要安裝大量的傳感器用于采集機(jī)械設(shè)備在工作時(shí)所產(chǎn)生的高頻振動(dòng)數(shù)據(jù)[3]。但是現(xiàn)有的基于ZigBee,、藍(lán)牙技術(shù)等低功耗,、低速率的無(wú)線傳輸技術(shù)是無(wú)法滿足此類應(yīng)用需求的,無(wú)法滿足需求的原因主要有兩個(gè)方面[4]:(1)對(duì)高頻振動(dòng)數(shù)據(jù)進(jìn)行采集會(huì)快速消耗終端節(jié)點(diǎn)所使用的電池電量,,進(jìn)而影響整個(gè)采集系統(tǒng)的工作壽命,;(2)大量數(shù)據(jù)的無(wú)線傳輸會(huì)嚴(yán)重占用系統(tǒng)帶寬資源,從而會(huì)造成傳輸過(guò)程丟包率的升高,,最終會(huì)影響到數(shù)據(jù)分析的準(zhǔn)確性[5]




本文詳細(xì)內(nèi)容請(qǐng)下載:http://forexkbc.com/resource/share/2000005081,。




作者信息:

王昱欽1,,王鑫2,劉保強(qiáng)1,,李軼1,,洪晟3

(1.江蘇自動(dòng)化研究所,江蘇 連云港 222000,;2.中國(guó)人民解放軍32381部隊(duì),,北京 100000;
3.北京航空航天大學(xué) 網(wǎng)絡(luò)空間安全學(xué)院,,北京 100191)




wd.jpg

此內(nèi)容為AET網(wǎng)站原創(chuàng),,未經(jīng)授權(quán)禁止轉(zhuǎn)載。