检索结果-内蒙古大学图书馆

fast search algorithm FOR VQ-BASED RECOGNITION OF ISOLATED WORDS

IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION 1989年第6期136卷 391-396页

作者： CHEN, SH PAN, JS NATL CHIAO TUNG UNIV CTR TELECOMMUN RESHSINCHUTAIWAN

This paper presents a fast search algorithm for vector quantisation (VQ)-based recognition of isolated words. It incorporates the property of high correlation between speech feature vectors of consecutive frames with the method of triangular inequality elimination to relieve the computational burden of vector-quantising the test feature vectors by full codebook search, and uses the extended partial distortion method to compress the incomplete matching computations of wildly mismatched words. Overall computational load can therefore be drastically reduced while the recognition performance of full search can be retained. Experimental results show that about 93% of multiplications and additions can be saved with a little increase of both comparisons and memory space.

关键词： consecutive frames high correlation wildly mismatched words speech recognition full code-book search memory space isolated word recognition Codes additions vector quantisation-based recognition test feature vectors encoding speech feature vectors Speech and audio signal processing Speech recognition triangular inequality elimination multiplications extended partial distortion method fast search algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast search algorithm for mean-removed vector quantization using edge and texture strengths of a vector

引用

IMAGE AND VISION COMPUTING 2005年第8期23卷 739-746页

作者： Lai, JZC Liaw, YC Nanhua Univ Dept Comp Sci & Informat Engn Chiayi 622 Taiwan Natl Taiwan Ocean Univ Dept Comp Sci Chilung 202 Taiwan

In this paper, a fast search algorithm for mean-removed vector quantization is proposed. Two inequalities are used to reduce distortion computations. Our algorithm makes use of a mean-removed vector's features (edge and texture strengths) to reject many unlikely codewords and it has the same image quality as the full search method. Experimental results show that our algorithm is much better than the full search method in terms of computing time and the number of distortion calculations. Comparing with the full search method, our method can effectively reduce the computing time by 60.2-94.2% and the number of distortion computations by 78.6-97.9% for the codebook sizes of 64-2048. As far as we know, our method is the first of its kind to reduce the encoding time for mean-removed vector quantization. (c) 2005 Elsevier B.V. All rights reserved.

关键词： fast search algorithm vector quantization projection value mean-removed vector quantization

来源：评论

学校读者我要写书评

暂无评论

Performance Re-Evaluation on "Codewords Distribution-Based Optimal Combination of Equal-Average Equal-Variance Equal-Norm Nearest Neighbor fast search algorithm for Vector Quantization Encoding"

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2018年第2期27卷 718-720页

作者： Wang, Yang Pan, Zhibin Li, Rui Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China

In the re-evaluated paper, Xie et al. proposed a new fast search algorithm for vector quantization encoding, which optimized the priority checking order of variance and norm inequality in order to speed up the encoding procedure. CPU time of different encoding algorithms is given to support their algorithm. However, first, some of the experimental data in the re-evaluated paper are unreasonable and unrepeatable. And second, as an improved algorithm of equal-average equal-variance equal-norm nearest neighbor fast search algorithm, the re-evaluated algorithm in fact cannot achieve a better performance than the existing improved equal-average equal-variance nearest neighbor fast search algorithm. In this paper, these two problems are analyzed, re-evaluated, and discussed in detail.

关键词： Vector quantization codewords distribution fast search algorithm priority checking order

来源：评论

学校读者我要写书评

暂无评论

A fast search algorithm with multi-block mode and multi-reference frame

A fast search algorithm with multi-block mode and multi-refe...

引用

5th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Cui, Yansong Deng, Zhongliang Ren, Weizheng Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100088 Peoples R China

ISBN: (纸本)9781424436927

A new fast search algorithm was brought up based on research of motion estimation characteristics of H.264 multiblock mode multi-reference frame. By judging whether motion estimation block is skip mode, and according to relationships between different motion search mode cost functions, motion vector is obtained through the block mode search algorithm and effective reference frame used for the search was determined. Experimental results showed that application of the fast search algorithm in motion estimation reduced computation and improved coding speed of H.264 effectively with image quality and bit stream almost unchanged.

关键词： Multi-block mode Multi-reference frame fast search algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast search algorithm for template matching based on inequality criterion

A fast search algorithm for template matching based on inequ...

引用

7th International Conference on Signal Processing

作者： Wang, Y Lu, HZ Sun, GF Natl Univ Def & Technol ATR State Key Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)7121002159

This paper presents a fast search algorithm for template matching, rising die inequality between the square error distortion measure and the difference which is between the sum of template image and the sum of every possible matching block. Firstly the sums of all possible matching blocks and template are Computed and sorted. Using the inequality criterion, the algorithm prunes the number of candidate matching positions. When computing the sums of blocks, the algorithm utilizes the overlapping of neighboring blocks to accelerate the calculation. Because the inequality criterion does not rely oil any assumption, the search result is equivalent to the result of the full search algorithm. Experimental results show it can save 91.77% to 93.25% execution time comparing with full-search algorithm.

关键词： inequality criterion template matching fast search algorithm full search

来源：评论

学校读者我要写书评

暂无评论

A new fast search algorithm for exact k-nearest neighbors based on optimal triangle-inequality-based check strategy

引用

KNOWLEDGE-BASED SYSTEMS 2020年 189卷 105088-105088页

作者： Pan, Yiwei Pan, Zhibin Wang, Yikun Wang, Wei Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Chinese Acad Sci Inst Automat Natl Lab Pattern Recognit Beijing 100190 Peoples R China

The k-nearest neighbor (KNN) algorithm has been widely used in pattern recognition, regression, outlier detection and other data mining areas. However, it suffers from the large distance computation cost, especially when dealing with big data applications. In this paper, we propose a new fast search (FS) algorithm for exact k-nearest neighbors based on optimal triangle-inequality-based (OTI) check strategy. During the procedure of searching exact k-nearest neighbors for any query, the OTI check strategy can eliminate more redundant distance computations for the instances located in the marginal area of neighboring clusters compared with the original TI check strategy. Considering the large space complexity and extra time complexity of OTI, we also propose an efficient optimal triangle-inequality-based (EOTI) check strategy. The experimental results demonstrate that our proposed two algorithms (OTI and EOTI) achieve the best performance compared with other related KNN fast search algorithms, especially in the case of dealing with high-dimensional datasets. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Exact k-nearest neighbors fast search algorithm Clustering Triangle inequality Optimal check strategy

来源：评论

学校读者我要写书评

暂无评论

A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2007年第8期8卷 1304-1310页

作者： XIE Chun-lai CHEUNG Chun-ho LIU Wei-zhong Department of Electronic Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Hong Kong Institute of Technology Hong Kong China

In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.

关键词： Motion estimation fast search algorithm Adjustable search patterns Threshold strategy Hexagonal search pattern

来源：评论

学校读者我要写书评

暂无评论

A cross octagonal search algorithm for fast block motion estimation

A cross octagonal search algorithm for fast block motion est...

引用

International Symposium on Intelligent Signal Processing and Communication Systems

作者： Liang, YL Liu, J Du, MH S China Univ Technol Coll Elect & Informat Engn Guangzhou 510640 Peoples R China

ISBN: (纸本)0780392663

A Cross Octagonal search algorithm (COSA) is proposed in this paper to perform block motion estimation in video sequence compression. In contrast with the classical fast block motion algorithm, cross and octagonal search pattern is adopted in search process in this algorithm. Based on the characteristic of motion vector's cross center biased distribution, the correlation of the ending points in the searching pattern can be reduced. So in this paper octagonal pattern is used and cross pattern is used in COSA to reduce the number of searching points. The experimental results show that the cross octagonal search algorithm performs better than HEXBS and Hybrid Unsymmetrical cross Multi-Hexagon-grid search (UMHexagonS) which is adopted by Joint Modal for near four years and still be used in the latest version JM9.6.

关键词： block motion estimation fast search algorithm cross octagonal search algorithm

来源：评论

学校读者我要写书评

暂无评论

Enhancing Camera Source Identification: A Rapid algorithm with Enhanced Discriminative Power

引用

APPLIED SCIENCES-BASEL 2025年第1期15卷 261-261页

作者： Lai, Zhimao Cheng, Lijuan Feng, Renhai China Peoples Police Univ Sch Immigrat Adm Guangzhou Guangzhou 510663 Peoples R China Guangdong Univ & Technol Sch Automat Guangzhou 510006 Peoples R China Tianjin Univ Sch Elect & Informat Engn Tianjin 300072 Peoples R China

Digital image source identification primarily focuses on analyzing and detecting the machine imprints or camera fingerprints left by imaging devices during the imaging process to trace the origin of digital images. The development of a swift search algorithm is crucial for the effective implementation of camera source identification. Despite its importance, this domain has witnessed limited research, with existing studies predominantly focusing on search efficiency while neglecting robustness, which is essential. In practical scenarios, query images often suffer from poor signal quality due to noise, and the variability in fingerprint quality across different sources presents a significant challenge. Conventional brute-force search algorithms (BFSAs) prove largely ineffective under these conditions because they lack the necessary robustness. This paper addresses the issues in digital image source identification by proposing a rapid fingerprint search algorithm based on global information. The algorithm innovatively introduces a search priority queue (SPQ), which analyzes the global correlation between the query fingerprint and all reference fingerprints in the database to construct a comprehensive priority ranking, thereby achieving the efficient retrieval of matching fingerprints. Compared to the traditional brute-force search algorithm (BFSA), our method significantly reduces computational complexity in large-scale databases, optimizing from O(nN) to O(nlogN), where n is the length of the fingerprint, and N is the number of fingerprints in the database. Additionally, the algorithm demonstrates strong robustness to noise, maintaining a high matching accuracy rate even when image quality is poor and noise interference is significant. Experimental results show that in a database containing fingerprints from 70 cameras, our algorithm is 50% faster in average search time than BFSA, and its matching accuracy rate exceeds 90% under various noise levels. This method not o

关键词： source camera identification digital image forensics fast search algorithm fingerprint digest correlation-based detection hash table

来源：评论

学校读者我要写书评

暂无评论

A novel fast search motion estimation boosted by multilayer concept

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2016年第4期75卷 2169-2188页

作者： Paramkusam, A. V. Reddy, V. S. K. JNTUH Malla Reddy Coll Engn Elect & Commun Hyderabad Andhra Pradesh India

Most of the fast search motion estimation algorithms reduce the computational cost of motion estimation (ME) greatly by checking only a few search points inside the search area by using full distortion measure. This paper proposes multi-layer motion estimation (MME) which employs partial distortion as its distortion measure to reduce the number of computations involved in each search point instead of reducing the number of search points. The MME, first, constructs the layers from the reference frame so as to facilitate the calculation of partial distortion measures on the layers. Later, it searches motion vectors by computing the partial distortion measures on the layers. A layer is an image which is derived from the reference frame such that the summation of a block of pixels in the reference frame determines the point of a layer. It has been noticed on different video sequences that many motion vectors on the layers are the same as those searched on the reference frame. Experimental results on a wide variety of video sequences show that the proposed algorithm outperforms the other popular conventional fast search motion estimation algorithms computationally while maintaining the motion prediction quality very close to the full-search algorithm.

关键词： Block matching algorithm Motion estimation Multi layer motion estimation fast search algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：