Relevant bibliographies by topics / Fast search algorithm / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Fast search algorithm.

Dissertations / Theses on the topic 'Fast search algorithm'

Author: Grafiati
Published: 4 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Fast search algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Kibriya, Ashraf Masood. "Fast Algorithms for Nearest Neighbour Search." The University of Waikato, 2007. http://hdl.handle.net/10289/2463.

Full text
Abstract:
The nearest neighbour problem is of practical significance in a number of fields. Often we are interested in finding an object near to a given query object. The problem is old, and a large number of solutions have been proposed for it in the literature. However, it remains the case that even the most popular of the techniques proposed for its solution have not been compared against each other. Also, many techniques, including the old and popular ones, can be implemented in a number of ways, and often the different implementations of a technique have not been thoroughly compared either. This
APA, Harvard, Vancouver, ISO, and other styles
2

Soongsathitanon, Somphob. "Fast search algorithms for digital video coding." Thesis, University of Newcastle Upon Tyne, 2004. http://hdl.handle.net/10443/1003.

Full text
Abstract:
Motion Estimation algorithm is one of the important issues in video coding standards such as ISO MPEG-1/2 and ITU-T H.263. These international standards regularly use a conventional Full Search (FS) Algorithm to estimate the motion of pixels between pairs of image blocks. Since a FS method requires intensive computations and the distortion function needs to be evaluated many times for each target block. the process is very time consuming. To alleviate this acute problem, new search algorithms, Orthogonal Logarithmic Search (OLS) and Diagonal Logarithmic Search (DLS), have been designed and imp
APA, Harvard, Vancouver, ISO, and other styles
3

Chung, Hing-yip Ronald, and 鍾興業. "Fast motion estimation with search center prediction." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31220721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yu, Ye. "ULTRA-FAST AND MEMORY-EFFICIENT LOOKUPS FOR CLOUD, NETWORKED SYSTEMS, AND MASSIVE DATA MANAGEMENT." UKnowledge, 2018. https://uknowledge.uky.edu/cs_etds/68.

Full text
Abstract:
Systems that process big data (e.g., high-traffic networks and large-scale storage) prefer data structures and algorithms with small memory and fast processing speed. Efficient and fast algorithms play an essential role in system design, despite the improvement of hardware. This dissertation is organized around a novel algorithm called Othello Hashing. Othello Hashing supports ultra-fast and memory-efficient key-value lookup, and it fits the requirements of the core algorithms of many large-scale systems and big data applications. Using Othello hashing, combined with domain expertise in cloud,
APA, Harvard, Vancouver, ISO, and other styles
5

Pařenica, Martin. "Implementace algoritmu pro hledání podobností DNA řetězců v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-236847.

Full text
Abstract:
This paper describes sequence alignment algorithms of nucleotide sequences. There are described pairwise alignment algorithms using database search or dynamic programming. Then in the paper is description of dynamic programming for multiple sequences and algorithm that builds phylogenetic trees. At the end of the first part of the paper is the description of technology FPGA. In the second part that is more practical is described implemntation of the choosen one algorithm. This part includes also examples of some multiple alignments.
APA, Harvard, Vancouver, ISO, and other styles
6

FU, Jing-wei, and 傅敬惟. "Fast Hexagon Search Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/37928024863874686575.

Full text
Abstract:
碩士<br>國立屏東商業技術學院<br>資訊工程系(原資訊科技系)<br>97<br>Motion vector searching is the key issue for video compression. Many studies are proposed for rising video quality and reducing search points. This paper is based on the point of view that most of motion vectors are very short and not far from (0,0) . The new algorithm that based on Hexagon-Based Search Algorithm and Diamond Search Algorithm is proposed, it has less search point and better video quality than other algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Shang-Ju, and 李尚儒. "A Novel Algorithm for Fast Codebook Search." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/47491812853646618150.

Full text
Abstract:
碩士<br>國立交通大學<br>電控工程系所<br>98<br>In this thesis, we propose an algorithm to reduce the complexity to search the most suitable codeword for a given codebook. It is proven in the thesis that about half codewords are eliminated in each iteration. In addition, we derive two lower bounds for the proposed algorithm and show that they reach the actual SNR loss in high resolution codebook. Furthermore, the complexity analysis and simulations are given to see that the advantages of taking this algorithm are revealed in the scenario of large codebook size.
APA, Harvard, Vancouver, ISO, and other styles
8

Chang, Ming-Che, and 張銘哲. "Adaptive Cross Search for Fast Motion Estimation Algorithm." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/su6hj9.

Full text
Abstract:
碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>96<br>When digital video data are stored in storage devices or transmitted in communication channel, it requires huge space of storage or occupies wide transmission bandwidth. This results in the great development and demand in video compression standards like MPEG-1, MPEG-2, MPEG-4, H.261, H.263, and H.264, etc. Motion estimation plays a very important role in video data compression system. Its main goal is to find out the similar data between neighbor video frames so as to reduce the temporal redundancy in video frames. Therefore, the accuracy of motion estima
APA, Harvard, Vancouver, ISO, and other styles
9

Chang, Shun-Chieh, and 張舜傑. "The Research of VQ-Based Fast Search Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/k7gsrf.

Full text
Abstract:
博士<br>國立臺北科技大學<br>電機工程系博士班<br>100<br>This dissertation proposes a fast search algorithm for vector quantization (VQ) based on a fast locating method, and uses learning and trade-off analysis to implement this algorithm. The proposed algorithm is a binary search space VQ (BSS-VQ) that determines a search subspace by binary search in each dimension, and the full search VQ (FSVQ) or partial distance elimination (PDE) is subsequently used to obtain the best-matched codeword. In trade-off analysis, a slight loss occurred in quantization quality; however, a substantial computational saving was achie
APA, Harvard, Vancouver, ISO, and other styles
10

Jhao, Bin-Cheng, and 趙斌成. "Fast predictive search algorithm for video motion estimation." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/43132089826832406542.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Kuo, Chien-Liang, and 郭建良. "Fast Partial Codebook Search Algorithm for Vector Quantization." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/91097170823278569147.

Full text
Abstract:
碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>91<br>In this thesis, we propose two methods which base on mean-sorted method , to filter the impossible codeword in advance, expecting to reduce the times of the calculation of Euclidean Distance in the Encoding times.In these algorithms,we choice different projection masks for each codeword by it''s pixels value, and store in the Codebook;Or after producing the codebook , producing a unique projection mask for each codeword according to it''s distribution of pixels value.When compressing,take out the previous records, and set these on the codeword and source vec
APA, Harvard, Vancouver, ISO, and other styles
12

Wang, Shu-Yen, and 王書彥. "Fast Cellular Search Algorithm for Block-Matching Estimation." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/22435183367158286304.

Full text
Abstract:
碩士<br>長庚大學<br>電機工程研究所<br>91<br>The multimedia data which includes image, audio and video is more and more larger with accompanying the progress of digital technology and the development of internet. When digital video data are stored in storage devices or transmitted in communication channel, it requires huge space of storage or occupies wide transmission bandwidth. Therefore, the motion estimation takes an important role in video coder that has a big influence on the performance of a video coding system. In general, the motion field of the current block can be tracked from the motion fields o
APA, Harvard, Vancouver, ISO, and other styles
13

Yeh, Chien-hsing, and 葉建興. "A Fast Quantum Search Algorithm and its Application." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/93712296814320678370.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>電子工程系<br>95<br>Quantum computation and quantum information science, which combine the exploration of quantum mechanics and new physical principals, have been a promise for solving complicated problems that are not tractable by conventional computers. In this thesis, we consider quantum search algorithms to search the minimum in an unordered database of N items. Traditionally, the running time required to locate the minimum is O(N) steps. To alleviate the computational load, various quantum search algorithm of complexity O(N^{1/2}) have been addressed. This thesis presents tw
APA, Harvard, Vancouver, ISO, and other styles
14

Lue, Chien Chih, and 呂建志. "A Fast Search Algorithm for Vector Quantization Codebook Generation." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/16664514047637526747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

CHIEH, CHUNG MING, and 鍾明潔. "An improvement of fast search algorithm for vector quantization." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/64771750684446335732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Tsai, Chung-Wei, and 蔡鐘葳. "A Hexagon-Based Fast Search Algorithm for Motion Estimation." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/28355244015462725269.

Full text
Abstract:
碩士<br>南台科技大學<br>電子工程系<br>98<br>In video compression, motion estimation plays a key role for educing the complexity of the calculation. There are different impacts on the performance while using various search algorithms for motion estimation. Efficient algorithm can save more computing time and more search points. A rapid search algorithm using the principle of Hexagon-Based Search algorithm (HEXBS) for motion estimation called Hexagon-Based Fast Search algorithm (HEXFS) is proposed. The proposed algorithm combines the hexagon search algorithm and a two-step search algorithm which uses two cro
APA, Harvard, Vancouver, ISO, and other styles
17

Wang, Wei Yi, and 王偉一. "A Fast Local Search Algorithm for Virtual Network Embedding." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/66124207234591887052.

Full text
Abstract:
碩士<br>國立清華大學<br>通訊工程研究所<br>104<br>Network virtualization is a popular topic about providing next-generation Internet services. It primarily virtualizes the resources managed by the Infrastructure Provider (InP) and the demands claimed by the Service Provider (SP) to make the concepts of the resource allocation and the user isolation to be more clearly. We inspired by the insight of the pricing problem, so that we set the price of virtual requests on the objective function. Then we focuses on a relatively fast algorithm for solving the VNE than exact solutions. We propose the Permutation Swap M
APA, Harvard, Vancouver, ISO, and other styles
18

Wang, Ying-Chih, and 王穎智. "Fast Fractional Pixel Search Algorithm in H.264/AVC." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/35548902198281173606.

Full text
Abstract:
碩士<br>國立中央大學<br>通訊工程研究所<br>95<br>H.264/AVC is a new video compression coding standard, in which quarter resolution and motion compensation can achieve more accurate motion description. It means that we need more time to find the best condition. Therefore, reducing the computational complexity for fractional pixels is necessary and significant. We proposed a fast fractional pixel search algorithm using symmetric convex cup for half and quarter resolution. In any case (half and quarter resolution), we can roughly reduce 65%~78% of computation complexity compared to that in the reference software
APA, Harvard, Vancouver, ISO, and other styles
19

LEE, Yi-Hui, and 李怡慧. "Fast motion estimation algorithm based on adaptive search pattern." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/79257830641405966245.

Full text
Abstract:
碩士<br>義守大學<br>資訊工程學系碩士班<br>95<br>Motion estimation plays an important role in the video coding. The objective of the motion estimation is to remove the temporal redundancy between video frames, and then achieve high compression ratio. In video coding, the full search motion estimation algorithm is searching all possible positions in the searching area, thus it has the optimum performance for motion compensation. But it requires the highest computational load, therefore, the fast algorithms is developed to reduce the computational burden. Traditional fast algorithms are used to search pattern t
APA, Harvard, Vancouver, ISO, and other styles
20

Hus, Chun-I., and 許竣壹. "Fast VQ Codeword Search Algorithm by Multiple Eliminating Conditions." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/64595187327595390033.

Full text
Abstract:
碩士<br>大葉大學<br>資訊工程學系碩士班<br>98<br>Vector Quantization (VQ) is a widely application technology in recent ten years such as video, speech and image. During the encoding process for image vector quantization compress technology, is require search the close codeword in codebook by Full Search. The complexity is proportional to the dimensions K of codeword and the size N of codebook. In this paper, for reduce the complexity of Full Search(FS) , we employed the Mean-distance ordered Partial codebook Search algorithm (MPS) [1]to determine initial codeword and search sequence. In addition, we calculate
APA, Harvard, Vancouver, ISO, and other styles
21

Huang, Jen-He, and 黃壬禾. "A Fast Algorithm for Continuous Frequent K-N Match Search." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/28729620940563414380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Huang, Li-Jiuan, and 黃莉娟. "A Predictive Cross-Hexagon Search Algorithm for Fast Motion Estimation." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/60826263949707609984.

Full text
Abstract:
碩士<br>國立中興大學<br>電機工程學系所<br>95<br>Block-matching motion estimation plays an important role in real-time video compression thus has significant impact on searching speed and quality of performance. In order to address these issues, we introduce a highly efficient predictive fast motion estimation algorithm named a predictive cross-hexagon search (PCHS) algorithm that can considerably reduce the complexity of the JVT encoder. In contrast with the classical fast motion estimation algorithms, PCHS adapts three techniques, including prediction of search center, different size of search patterns and
APA, Harvard, Vancouver, ISO, and other styles
23

Fei, Hwai-Chung, and 費懷忠. "Fast Block-Based Motion Estimation Algorithm Using Downhill Simplex Search." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/81140572408455659177.

Full text
Abstract:
碩士<br>國立清華大學<br>資訊工程學系<br>93<br>In this thesis, we propose a fast block-based motion estimation algorithm which utilizes downhill simplex search for video coding. Downhill simplex search mainly consists of two parts: initialization of simplex part and downhill simplex iterations part. In the initialization part, spatially and temporally neighboring blocks of the current block is used to help finding a good initial simplex. The initial simplex is essential to the whole process because it has great influences on the search time and accuracy. After the initial simplex is decided, the four actions
APA, Harvard, Vancouver, ISO, and other styles
24

Hsu, Kuang-Jen, and 許光仁. "Performance Analysis of Fast Address Search Algorithm of NAT-PT." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/75310101057614051712.

Full text
Abstract:
碩士<br>大葉大學<br>資訊工程學系碩士班<br>93<br>The limited size and structure of the Internet address spaces of IPv4 have caused difficulties in coping with fast growing number of Internet users. IPv6 is a feasible solution for the problems identified with IPv4. It not only provides larger address spaces but also support security, mobility, and quality of service. However, before a complete deployment of IPv6 become reality, two network protocols IPv4 and IPv6 will co-exist and inter-working between them is important. The transition from IPv4 to IPv6 will be lengthy, while network devices supporting both pr
APA, Harvard, Vancouver, ISO, and other styles
25

Lee, Shih-Hao, and 李世豪. "Fast Tuple Search Algorithm for Two-Dimensional Conflict-Free Filters." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/81402365226398346556.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>電子工程系<br>90<br>This paper presents a novel two-dimensional packet classification scheme for conflict-free filters that can provide both fast access time and low update time. The proposed scheme performs a sequence of intelligent binary search over two-dimensional hash tables, which effectively prune unnecessary search. We also present an optimization scheme using two-dimensional prefix expansion and dynamic programming to further reduce the access time and memory requirements. By running a intensive simulations, the proposed scheme can reach 4.7 hash probes in the average-cas
APA, Harvard, Vancouver, ISO, and other styles
26

Wu, Hung-Wei, and 吳宏偉. "A Fast Packet Classification Algorithm using Diagonal Tuple Space Search." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/58555757859477606203.

Full text
Abstract:
碩士<br>國立中興大學<br>資訊科學研究所<br>91<br>As the network speed grows, we have witnessed the widespread of the applications and services over the Internet. As the result, how to provide a quality of services (QoS) scheme effectively has become an important issue. The first step to support QoS would be to offer an efficient flow classification scheme. In this thesis, we discuss how to provide an efficient flow classification based on source and destination IP addresses, i.e., two-dimensional flow classifications for the general application in the Internet. In addition, we devise a procedure
APA, Harvard, Vancouver, ISO, and other styles
27

Chen, Han-Yen, and 陳翰彥. "Fast encoding algorithm for HEVC using temporal-spatial correlation search." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/63039125351637113030.

Full text
Abstract:
碩士<br>義守大學<br>電子工程學系<br>102<br>With the rapid development of mobile multimedia technology, the panels of 4K2K (or 8K4K) high-resolution will become the main specification of large size digital TV in future. However, the current H.264 video coding standard can’t support the video applications of full high definition (FHD) and ultrahigh definition (UHD) resolution. Therefore, the ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Pictures Expert Group (MPEG) through their Joint Collaborative Team on Video Coding (JCT-VC) has been developed a newest high efficiency video coding (HEVC) f
APA, Harvard, Vancouver, ISO, and other styles
28

Po-Sen, Huang. "A Hybrid Fast Full Search Motion Estimation Algorithm for Video Compression." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0005-1408200613350000.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Pan, Yu-Nan, and 潘宇男. "A Fast Search Algorithm for Motion Estimation on H.264/AVC." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/13164805993351985861.

Full text
Abstract:
碩士<br>國立中央大學<br>電機工程研究所<br>92<br>The upcoming video coding standard, MPEG-4 AVC/JVT/H.264, motion estimation allowed to use multiple references and multiple block sizes to improve the rate-distortion performance. However, full exhaustive search of all block sizes is computational intensive with complexity increasing linearly to the number of allowed reference frame and block size. In this thesis, a novel search algorithm, predict hexagon search (PHS), is proposed. The PHS pattern is applied by the comparison with the hexagon based search pattern. It can predict the hexagon search pattern in ho
APA, Harvard, Vancouver, ISO, and other styles
30

Yan, Long-Jhe, and 顏龍晢. "A Novel Fast Search Algorithm for VQ-Based Speech/Image Coding." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/d3w2ym.

Full text
Abstract:
博士<br>國立臺北科技大學<br>電機工程系所<br>98<br>This dissertation presents an efficient quasi-binary search algorithm for vector quantization (VQ). The proposed algorithm adopts a tree-structured VQ with overlapped codewords (TSOC) to reduce computational complexity and enhance quantization quality. This algorithm uses overlapped codewords to expand the scope of the search path to traverse more appropriate codewords. In our speech experiment, compared with the full search VQ (FSVQ), the average computational savings for triangle inequality elimination (TIE), tree-structured VQ (TSVQ) and TSOC are 24.68%, 88
APA, Harvard, Vancouver, ISO, and other styles
31

Wei-ShanHung and 洪瑋三. "3D Image Compression By Fast Motion Estimation And Depth Search Algorithm." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/81736682286465244017.

Full text
Abstract:
碩士<br>國立成功大學<br>電機工程學系碩博士班<br>101<br>With the popularity of 3D movies in recent years, such as Avatar few years ago, and the most popular Life of Pi this year, 3D images becomes an integral part in the entertainment. Moreover, in addition to the movie industry, 3DTV will gradually enter the home audio and video entertainment. For 3D image compression, there is one of the most famous techniques called “Advanced Three-Dimensional Television System Technologies (ATTEST).” It use a monoscopic video (color image) and per pixel depth information (depth image) to compress and encode. Through transmis
APA, Harvard, Vancouver, ISO, and other styles
32

Hung, Chi-Huey, and 洪吉慧. "Regularized-Structure Equal Gain Codebook Designs and Their Fast Search Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/46809851364596314446.

Full text
Abstract:
碩士<br>國立交通大學<br>電控工程研究所<br>100<br>In this thesis, we propose an algorithm to design regularized-structure equal gain codebook for single-stream and multi-stream data. In addition, their corresponding fast codebook search algorithms are also proposed to reduce the complexity for searching the most suitable codeword in a given codebook. From the simulation results we see that our proposed ”equal-gain” codebook has good performances with negligible loss compared with other optimal ”non equal-gain” codebooks but with good structured characteristic, which is convenient for codeword search. The simu
APA, Harvard, Vancouver, ISO, and other styles
33

Pin-ChenKuo and 郭品岑. "A Projection Disparity Search Algorithm for Fast H.264/MVC Encoding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/04249116925241525707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Huang, Po-Sen, and 黃柏森. "A Hybrid Fast Full Search Motion Estimation Algorithm for Video Compression." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/22491327725135420338.

Full text
Abstract:
碩士<br>國立中興大學<br>電機工程學系所<br>94<br>Along with technology progress, people require the video quality also higher than the past. In order to achieve the high resolution and high quality, the real time lossless algorithms become more and more important. Traditionally, we will use the full search block matching algorithm (FSBMA) to search the best matching image block. As this algorithm has large computational overhead, it is not suitable for real time propose. Hence, many fast FSBMAs are developed. Our thesis also proposed a new hybrid FSBMA method to solve the needs of real-time computation. The h
APA, Harvard, Vancouver, ISO, and other styles
35

Kuang-Tso, Lu, and 盧光佐. "A New Cross-Triangular Search Algorithm for Fast Block Motion Estimation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/61524120004359697824.

Full text
Abstract:
碩士<br>國立中興大學<br>電機工程學系<br>93<br>Block-matching motion estimation plays an important role in real-time video compression process. In block-matching motion estimation, search patterns with different shapes, sizes or the center-biased properties of motion vector distribution have a significant impact on the searching speed and quality of performance. Using this characteristic, a new cross-triangular search (CTS) algorithm is developed. The CTS algorithm essentially employs small cross-search pattern (SCSP) and two different kinds of triangular-search patterns (TSP) consecutively in the searching
APA, Harvard, Vancouver, ISO, and other styles
36

Fan, Kuo-Lun, and 范國倫. "Binary Search & Mean Value Predictive Hybrid Fast Vector Quantization Algorithm." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/54042830044642569713.

Full text
Abstract:
碩士<br>立德管理學院<br>應用資訊研究所<br>91<br>Vector Quantization (VQ) is an effective technology for signal compression. In traditional VQ, most of the computation concentrates on searching the nearest codeword in the codebook for each input vector. We propose a fast VQ algorithm to reduce encoding time. There are two main parts in our proposed algorithm. One is pre-processing process and the other is practical encoding process. In pre-processing, we will generate some tables that we need to employ to practical encoding. On the second part, that is a practical encoding and we use the tables that generated
APA, Harvard, Vancouver, ISO, and other styles
37

Yeh, Ming-Yueh, and 葉明岳. "A Predictive Kite-Cross-Diamond Search Algorithm for Fast Block Motion Estimation." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/5e6bf2.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>電機工程系<br>94<br>Motion estimation plays an important role in the architecture of video coding. The main purpose of the motion estimation is to remove the redundancy between continuous video frames. So the search algorithm of estimation will influence the computation complexity and the quality of video frames. Full-search method is a traditional search algorithm. It exhaustively searches all possible candidate motion vectors in the search area, so it has the optimum perfor- mance for the estimated video frames. However, high computational cost is its drawback, therefore man
APA, Harvard, Vancouver, ISO, and other styles
38

Lin, Su-Juan, and 林素娟. "A Fast Search Algorithm for Vector Quantization Based on Mean Pyramids Structure." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/05776438560126288808.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>管理研究所資訊管理學程<br>87<br>Vector quantization plays an important role in data compression. In the codebook design phase and the encoding phase, given a block represented as a vector, searching for closest codeword is time--consuming. Based on the mean pyramid structure, a new and faster search algorithm for VQ is presented and it improves the previous result by Lee and Chen. Some experimental results demonstrate the computational advantage of the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
39

Hung, Yu-chun, and 洪裕淳. "Fast Multi-Frame Motion Search Algorithm and VLSI Architecture for H.264." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/83964496300806115301.

Full text
Abstract:
碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>95<br>Video coding techniques continue to rapid development for digital media recently. The new H.264/AVC coder can provide better coding efficiently than the previous other techniques. However, the implementation of real-time for H.264/AVC system is difficult due to computational complexity. In this thesis, first we propose a fast algorithm to for multi-frame motion estimation that consists of adaptive full-search, three-step and diamond searches. We aim to reduce the computation for five reference frames while use 16×16 block coding mode. Our experimental resu
APA, Harvard, Vancouver, ISO, and other styles
40

Tai, Wun-ming, and 戴文明. "A Fast Fractional-Pixel Search Algorithm Based on Linear-Prediction Motion Estimation." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/46410754095058548095.

Full text
Abstract:
碩士<br>國立屏東商業技術學院<br>資訊工程系(所)<br>102<br>To improve the accuracy of motion estimation (ME) in the H.264 video coding, a fractional-pixel ME algorithm is almost mandatory. However, if the image resolution is increased, there is need for additional ME computations that involve considerably more fractional pixels. Therefore, in order to solve the above computational problem, a fast fractional-pixel search algorithm based on the linear prediction and a small diamond, called LFFS method, is developed in this paper. In addition, the proposed linear prediction ME method substantially reduces the fracti
APA, Harvard, Vancouver, ISO, and other styles
41

Chou, Yen-Yu, and 周彥佑. "Hybrid Hexagon Fast Search Algorithm for Motion Estimations in Video Coding Applications." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/09505684010823812035.

Full text
Abstract:
碩士<br>中興大學<br>電機工程學系所<br>99<br>In video compression systems, motion estimation plays an important role and provides a critical technology to reduce the bit rate tremendously. The search algorithm of motion estimations will influence the quality of video compression directly. The full search algorithm obviously gives the best video quality, but requires heavy computations. Therefore, many fast search algorithms are proposed to improve this problem due to the full search method. In this thesis, we propose a hybrid hexagon search algorithm (HHS). The proposed method reduces the computation comp
APA, Harvard, Vancouver, ISO, and other styles
42

LIN, JYUN-WEI, and 林俊維. "A Spectrum-Relation-Based Algorithm for Fast Quantization Step Search of MP3 Encoder." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/05905776704979737920.

Full text
Abstract:
碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>97<br>With the development of multimedia Products, the bits rate of multimedia is increasing day to day. So the data compress technology is being developed. In audio, the most commonly used is MPEG-1 audio/layer 3(MP3) which had the most compression ratio. With the increase in the number of channels, the operational complexity is increasing witch it. In this paper, we write the procedure in order to realize mp3 encoder and decoder actually, after prove the result is correct, we analyze every the complexity of every encoding block. Then, we improve the quantizat
APA, Harvard, Vancouver, ISO, and other styles
43

Lin, Chen-Fu, and 林正福. "An Adaptive Fast Full Search Motion Estimation Algorithm for H.264 Video Coding." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/18091306058424088203.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>92<br>In this study, an adaptive fast full search motion estimation (ME) algorithm for H.264 is proposed. The objective of the proposed algorithm is to speed up the H.264 video coding procedure performed at the encoder, without influencing the coding results. To reduce the computational complexity of the full search motion estimation algorithm, two main techniques are proposed in this study. First, the proposed modified data reusing (MDR) technique is used to speed up the ME processing time by reducing the SAD computations. In the proposed MDR technique, b
APA, Harvard, Vancouver, ISO, and other styles
44

Li, Wentsai, and 李文材. "A Fast Search Algorithm For Vector Quantization Based Upon Principal Component Analysis Technique." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/77155267868561563369.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>83<br>A new technique for reducing the encoding time of the vector quantization (VQ) is proposed in this thesis. In the original VQ scheme, for an input vector, the whole codebook had to be searched to get the closest codework form the codebook. Therefore, it needs a large amount of computation effort to decide which codework in the codebook is the closest one. Our proposed scheme uses the principal component analysis (PCA), a technique of multivariates analysis, to reduce the compression time. In our scheme, we only search a small part of the codebook for the closes
APA, Harvard, Vancouver, ISO, and other styles
45

Huang, Jia-Kuan, and 黃家寬. "The Design and Implementation of a Fast Search Algorithm for Image Vector Quantization." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/82561649703942393723.

Full text
Abstract:
碩士<br>南台科技大學<br>電子工程系<br>91<br>Vector quantization (VQ) has been widely used in communications and multimedia applications for signal compression due to its excellent rate-distortion performance. The method groups the source inputs into blocks (or vectors) and compares each input vector with each codevector in the codebook in order to find the codevector closest to the input vector. Then, the index corresponding to the closest codevector is transmitted to the decoder. The most popular codebook-search method is the full search algorithm (FSA). The FSA is simple but consumes longer time. Recentl
APA, Harvard, Vancouver, ISO, and other styles
46

Xu, Zhi-Xiong, and 許智雄. "Combining Dynamic Search Range with Improved Normalized Partial Distortion Search for Fast Motion Estimation Algorithm in Video Coding." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/cg67wv.

Full text
Abstract:
碩士<br>國立臺中科技大學<br>資訊工程系碩士班<br>100<br>H.264/AVC is JVT video coding standard developed by a good video coding efficiency, in recent years, with the network bandwidth improvements, and advances in technology, multimedia products and services continued to emerge, such as video telephone, on-demand video system (VOD), video conferencing, high-definition digital television (HDTV), etc.. All need a good video compression standards support in the H.264/AVC encoder architecture. Motion estimated (ME) is the compression of the entire video, accounted for the largest amount of computation, this thesis
APA, Harvard, Vancouver, ISO, and other styles
47

Long, Li Hsing, and 李信龍. "Fast dual diamond search algorithm for block-matching estimation in real-time video coding." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/10975231164992996547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Wen-Kang, Wei, and 魏文港. "Fast Codeword Search Algorithm for Vector Quantization on System-on-Programmable-Chip Development Platform." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/56969365671629946978.

Full text
Abstract:
碩士<br>國立臺灣師範大學<br>資訊工程研究所<br>93<br>This paper presents a novel VLSI architecture for hardware realization of vector quantizer (VQ) encoders using partial distance search (PDS). In most applications, the PDS is adopted as a software approach for attaining moderate codeword search acceleration. In this paper, a novel PDS algorithm well-suited for hardware realization is proposed. The algorithm employs subspace search, bitplane reduction and multiple-coefficient accumulation techniques for the effective reduction of the area complexity and computation latency. Concurrent encoding of different inp
APA, Harvard, Vancouver, ISO, and other styles
49

Po-Hung, Chen, and 陳柏宏. "A SUBSAMPLING HIERARCHICAL SEARCH ALGORITHM FOR FAST BLOCK MOTION ESTIMATION AND IT'S VLSI ARCHITECTURE." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/56652623777472299686.

Full text
Abstract:
碩士<br>大同工學院<br>電機工程研究所<br>86<br>Due to the limitation of transmission bandwidth, low-bit rate motionvideo coding and transmitting for integrated service digital networks (ISDN) and high definition television (HDTV) systems has an important andgrowing research area. To realize a high-compression codec (coder and decoder), several image coding techniques have been proposed. Among these, motion compensated image coding is widely used to reduce the temporal redundancy, and the key to success of such scheme is to develop a good motion estimation technique to predict the current frame based on the p
APA, Harvard, Vancouver, ISO, and other styles
50

SHEN, ZHI. "Nonlinear Modeling of Inertial Errors by Fast Orthogonal Search Algorithm for Low Cost Vehicular Navigation." Thesis, 2012. http://hdl.handle.net/1974/6968.

Full text
Abstract:
Due to their complementary characteristics, Global Positioning System (GPS) is usually integrated with standalone navigation devices like odometers and inertial measurement units (IMU). Recently, intensive research has focused on utilizing Micro-Electro-Mechanical-System (MEMS) grade inertial sensors in the integration because of their low cost. In this study, a reduced inertial sensor system (RISS) is considered. It comprises a MEMS grade single axis gyroscope, the vehicle built-in odometer, and two optional MEMS grade accelerometers. Estimation technique is needed to allow the data fusion of
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Fast search algorithm' for other source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography