首页> 外文期刊>Journal of Computational Methods in Sciences and Engineering >Collaborative representation based classification for vehicle recognition in acoustic sensor networks
【24h】

Collaborative representation based classification for vehicle recognition in acoustic sensor networks

机译:基于协作表示的声音传感器网络中车辆识别的分类

获取原文
获取原文并翻译 | 示例

摘要

Sparse Representation Classification has led to state-of-the-art results in pattern classification tasks. However, as Sparse Representation Classification has significantly high lower complexity, and vehicle recognition is a typical small-sample-size problem and trained dictionary is under-complete, all these give rise to big representation errors and unstable recognition results. In this paper, we develop a new Collaborative Representation based vehicle recognition framework, using acoustic sensor networks to reduce the time complexity in the training and testing phases, and to improve the classification accuracy in complex scenes. In the recognition, the acoustic signals of vehicles are extracted from the acoustic information to gel linearly separable samples by Fast Fourier Transform, and then we encode a testing sample through linear combination of all the training samples with regularized least square and classify the testing sample into the class with the minimum representation error. As demonstrated by experimental results, the proposed method has the following two unique and important characteristics: (1) it achieves a superior performance under the circumstance of complex data sets (2) It also shows highly competitive recognition accuracy while has low computational complexity and memory requirements, compared to k-Nearest Neighbor, Support Vector Machines and Sparse Representation Classification algorithm.
机译:稀疏表示分类导致了模式分类任务中的最新成果。但是,由于稀疏表示分类具有较低的复杂度,并且车辆识别是一个典型的小样本量问题,而经过训练的词典不够完整,所有这些都会导致较大的表示错误和不稳定的识别结果。在本文中,我们开发了一种新的基于协作表示的车辆识别框架,该框架使用声学传感器网络降低了训练和测试阶段的时间复杂度,并提高了复杂场景中的分类精度。在识别中,通过快速傅立叶变换从声学信息中提取车辆的声音信号以凝胶化线性可分离的样本,然后我们通过将所有训练样本与正则化最小二乘线性组合来对测试样本进行编码,并将其分类为具有最小表示错误的类。实验结果表明,该方法具有以下两个独特而重要的特点:(1)在复杂数据集的情况下具有较高的性能(2)识别精度高,计算复杂度低,存储量小。要求,与k最近邻,支持向量机和稀疏表示分类算法相比。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号