ArticlePDF Available

Fobe Algorithm for Video Processing Applications

March 2014
SSRN Electronic Journal 3(3):7569-7574

Authors:

Samarkand State University named after Sharof Rashidov

In this paper two existing algorithms named as Cross-Diamond Search algorithm CDS and Fast Objected-Base Efficient Three Step Search algorithm are used. The cross-diamond search algorithm employs two diamond search patterns (a large and small) and a halfway-stop technique. It finds small motion vectors with fewer search points than the DS algorithm while maintaining similar or even better search quality. The efficient Three Step Search (E3SS) algorithm requires less computation and performs better in terms of PSNR. Modified objected block-base vector search algorithm (MOBS) fully utilizes the correlations existing in motion vectors to reduce the computations. Fast Objected-Base Efficient (FOBE) Three Step Search algorithm combines E3SS and MOBS. By combining these two existing algorithms CDS and MOBS, a new algorithm is proposed with reduced computational complexity without degradation in quality.

Flow Chart of the CDS algorithm

…

Search Pattern used in the first step of E3SS.

…

Calculated motion vectors for the selected two frames

…

Figures - uploaded by Christo Ananth

Content may be subject to copyright.

Content uploaded by Christo Ananth

Content may be subject to copyright.

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

Fobe Algorithm for Video Processing

Applications

Christo Ananth1, A.Sujitha Nandhini2, A.Subha Shree3, S.V.Ramyaa4, J.Princess5

Assistant Professor, Dept. Of ECE, Francis Xavier Engineering College, Tirunelveli, India1

U.G.Scholar, Dept. Of ECE, Francis Xavier Engineering College, Tirunelveli, India2

U.G.Scholar, Dept. Of ECE, Francis Xavier Engineering College, Tirunelveli, India3

U.G.Scholar, Dept. Of ECE, Francis Xavier Engineering College, Tirunelveli, India4

U.G.Scholar, Dept. Of ECE, Francis Xavier Engineering College, Tirunelveli , India5

Abstract: In this paper two existing algorithms named as Cross-Diamond Search algorithm CDS and Fast Objected-

Base Efficient Three Step Search algorithm are used. The cross-diamond search algorithm employs two diamond

search patterns (a large and small) and a halfway-stop technique. It finds small motion vectors with fewer search points

than the DS algorithm while maintaining similar or even better search quality. The efficient Three Step Search (E3SS)

algorithm requires less computation and performs better in terms of PSNR. Modified objected block-base vector search

algorithm (MOBS) fully utilizes the correlations existing in motion vectors to reduce the computations. Fast Objected-

Base Efficient (FOBE) Three Step Search algorithm combines E3SS and MOBS. By combining these two existing

algorithms CDS and MOBS, a new algorithm is proposed with reduced computational complexity without degradation

in quality.

Keywords: Block-matching motion estimation, cross-center biased characteristic, cross-diamond search algorithm,

Motion vector.

I. INTRODUCTION

Block-matching motion estimation is the cardinal process for many motion-compensated video-coding standards

[1]–[5], in which temporal redundancy between successive frames is efficiently removed. It divides frames into equally

sized rectangular blocks and finds out the displacement of the best-matched block from the previous frame as the

motion vector to the block in the current frame within a search window. However, the motion estimation could be very

computational intensive and can consume up to 80% of computational power of the encoder if exhaustively evaluating

all possible candidate blocks. Many fast block-matching algorithms (BMA) were proposed for alleviating the heavy

computations consumed by the brute-force full-search algorithm (FS), such as the three-step search (3SS) [6], the new

three-step search (N3SS) [7], the four-step search (4SS) [8], the block-based gradient descent search (BBGDS) [9], and

the diamond search (DS) [10], [11] algorithms, etc. DS employs a diamond-shaped pattern and results in fewer search

points with similar distortion performance as compared to N3SS and 4SS. Basically, DS performs block-matching just

like 4SS. It rotates the square-shaped search pattern by 45 to form a diamond-shaped one and with its size kept

unchanged throughout the search before the new minimum block distortion measure (BDM) reaches the center of the

diamond. The merits that DS yields faster searching speed can be regarded as: 1) the diamond-shaped pattern, which

tries to be having as an ideal circle-shaped coverage for considering possible directions of an investigating motion

vector and 2) fewer checking points in the final converging step. we propose a novel fast BMAs called cross-diamond

search (CDS) algorithm by introducing a cross-shaped search pattern (CSP) as the initial step, instead of the diamond-

shaped, to the DS algorithm.

II. RELATED WORK

A. Cross-Diamond Searching Patterns

The DS algorithm uses a large diamond-shaped pattern (LDSP) and small diamond-shaped pattern (SDSP), as

depicted in Fig. 1. As the motion vectors distribution possesses over 96% CCB characteristics in the central 5X5 DCB

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

area, an initial CSP, as shown in Fig. 2. is proposed as the initial step to the DS algorithm, and is termed the CDS

algorithm.

B. The CDS Algorithm

CDS differs from DS by: 1) performing a CCB CSP in the first step and 2) employing a halfway-stop technique for

quasi- stationary or stationary candidate blocks. Below summarizes the CDS algorithm.

STEP (I)—STARTING:

A minimum BDM is found from the nine search points of the CSP located at the center of search window. If the

minimum BDM point occurs at the center of the CSP, the search stops. Otherwise, go to Step (ii)

way to comply with the conference paper formatting requirements is to use this document as a template and simply

type your text into it.

Fig 1: Cross Shaped Pattern

Fig.1. shows the starting of Cross Shaped Pattern from which minimum BDM is found from the nine search

points of the CSP located at the center of search window. Extended version of Large Diamond Shaped Pattern and

Small Diamond Shaped Pattern are also shown diagrammatically. It is to be noted that when block distortion measure

occurs at Cross Shaped Pattern center, the searching procedure stops. Or else the algorithm proceeds for Half Diamond

Searching, Searching and Ending Steps.

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

Fig 2. LDSP and SDSP

STEP (II)—HALF-DIAMOND SEARCHING:

Two additional search points of the central LDSP closest to the current minimum of the central CSP are

checked, i.e., two of the four candidate points located at(±1,±1) .

If the minimum BDM found in previous step located at the middle wing of the CSP, i.e.,( ±1,0)or (0, ±1), and

the new minimum BDM found in this step still coincides with this point, the search stops. (This is called the second-

step stop, e.g., Fig. 4(b)). Otherwise, go to Step (iii).

STEP (III)—SEARCHING:

A new LDSP is formed by repositioning the minimum BDM found in previous step as the center of the LDSP.

If the new minimum BDM point is still at the center of the newly formed LDSP, then go to Step (iv) (Ending);

otherwise, this step is repeated again.

STEP (IV)—ENDING:

With the minimum BDM point in the previous step as the center, a new SDSP is formed. Identify the new minimum

BDM point from the four new candidate points, which is the final solution for the motion vector.

Fig 3: Flow Chart of the CDS algorithm

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

III. PROPOSED METHOD

The Fast Objected-Base Efficient (FOBE) Three Step Search algorithm can be summarized as follows:

Step 1)

At the beginning, the outer eight points and middle five points are checked. If the minimum BDM point is found at

the search window center the search will be stopped: otherwise go to step2.

Step 2)

If the minimum point is one of the outer eight points, the procedure is the same as in 3SS, otherwise go to step3.

Step 3)

If the minimum point is one of the small diamond four points, the small diamond moves its search centered to the

current minimum BDM point and continues to search the other points on the small diamond until the minimum is found

at the search window center.

Fig 4:Search Pattern used in the first step of E3SS.

Fig.5: Flow diagram for FOBE Algorithm

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

IV. RESULTS AND DISCUSSION

First, CDS algorithm is applied and the results are obtained by calculating the motion vector for the video sequence

selected. This is shown in Fig 6.

Fig 6: Calculated motion vectors for the selected two frames

Fig 7: Splitted frames of the selected video sequence.

TABLE I

COMPARISON OF COMPUTATIONS

ISSN (Print) : 2320 – 3765

ISSN (Online): 2278 – 8875

International Journal of Advanced Research in Electrical,

Electronics and Instrumentation Engineering

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 3,March 2014

Fig 8: Computations with MAD

Fig 9: Computations with SAD

The corresponding splitted frames of the video sequence is shown in Fig 7.

REFERENCES

[1] Information Technology—Coding of Moving Pictures and Associated Audio for Digital Storage Media at up to About 1.5 Mbit/s–Part 2: Video,

ISO/IEC 11 172-2 (MPEG-1 Video), 2012.

[2] Information Technology—Generic Coding of Moving Pictures and Associated Audio Information: Video, ISO/IEC 13 818-2 (MPEG-2 Video),

2000.

[3] Information Technology—Coding of Audio Visual Objects - Part 2: Visual, ISO/IEC 14 469-2 (MPEG-4 Visual), 2010.

[4] Video Codec for Audiovisual Services at p _ 64 kbits/s, ITU-T Recommendation H.261, Mar. 2011.

[5]Video Coding for Low Bit Rate Communication, ITU-T Recommendation H.263, Feb. 2010.

[6] T. Koga, K. Iinuma, A. Hirano, Y. Iijima, and T. Ishiguro, “Motion compensated interframe coding for video conferencing,” in Proc. National

Telecommunications Conf., New Orleans, LA, Nov.2011, pp.G5.3.1–G5.3.5.

[7] R. Li, B. Zeng, and M. L. Liou, “A new three-step search algorithm for block motion estimation,” IEEE Trans. Circuits Syst. Video Technol., vol.

4, pp. 438–443, Aug. 2009.

[8] L. M. Po and W. C. Ma, “A novel four-step search algorithm for fast block motion estimation,” IEEE Trans. Circuits Syst. Video Technol., vol. 6,

pp. 313–317, June 2008.

[9] L. K. Liu and E. Feig, “A block-based gradient descent search algorithm for block motion estimation in video coding,” IEEE Trans. Circuits Syst.

Video Technol., vol. 6, pp. 419–423, Aug. 2006.

[10] J. Y. Tham, S. Ranganath, M. Ranganath, and A. A. Kassim, “A novel unrestricted center-biased diamond search algorithm for block motion

estimation,” IEEE Trans. Circuits Syst. Video Technol., vol. 8, pp.369–377, Aug. 2007.

[11] S. Zhu and K. K. Ma, “A new diamond search algorithm for fast block matching motion estimation,” IEEE Trans. Image Processing, vol. 9, pp.

287–290, Feb. 2007.

[12] J. R. Jain and A. K. Jain, “Displacement measurement and its application in interface image coding,” IEEE Trans. Commun., vol. COM-29, pp.

1799–1808, Dec. 2006.

Call for Papers - Journal of Electrical Systems (JES), E-ISSN: 1112-5209, indexed in Scopus & Web of Science

Preprint

Full-text available

May 2024

Christo Ananth

At the forefront of technological innovation and scholarly discourse, the Journal of Electrical Systems (JES) is a peer-reviewed publication dedicated to advancing the understanding and application of electrical systems, communication systems and information science. With a commitment to excellence, we provide a platform for researchers, academics, and professionals to contribute to the ever-evolving field of electrical engineering, communication technology and Information Systems. The mission of JES is to foster the exchange of knowledge and ideas in electrical and communication systems, promoting cutting-edge research and facilitating discussions that drive progress in the field. We aim to be a beacon for those seeking to explore, challenge, and revolutionize the way we harness, distribute, and utilize electrical energy and information systems..

Call for Chapters- Edited Book: Quantum Networks and Their Applications in AI, IGI Global, USA, ISBN 9798369358320

Preprint

Full-text available

Apr 2024

Christo Ananth

The research on Quantum Networked Artificial Intelligence is at the intersection of Quantum Information Science (QIS), Artificial Intelligence, Soft Computing, Computational Intelligence, Machine Learning, Deep Learning, Optimization, Etc. It Touches On Many Important Parts Of Near-Term Quantum Computing And Noisy Intermediate-Scale Quantum (NISQ) Devices. The research on quantum artificial intelligence is grounded in theories, modelling, and significant studies on hybrid classical-quantum algorithms using classical simulations, IBM Q services, PennyLane, Google Cirq, D-Wave quantum annealer etc. So far, the research on quantum artificial intelligence has given us the building blocks to achieve quantum advantage to solve problems in combinatorial optimization, soft computing, deep learning, and machine learning much faster than traditional classical computing. Solving these problems is important for making quantum computing useful for noise-resistant large-scale applications. This makes it much easier to see the big picture and helps with cutting-edge research across the quantum stack, making it an important part of any QIS effort. Researchers — almost daily — are making advances in the engineering and scientific challenges to create practical quantum networks powered with artificial intelligence

Call for Papers- Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA), ISSN (Print): 2093-5374, ISSN (Online): 2093-5382, indexed in Scopus

Preprint

Full-text available

Apr 2024

Christo Ananth

JoWUA is an online peer-reviewed journal and aims to provide an international forum for researchers, professionals, and industrial practitioners on all topics related to wireless mobile networks, ubiquitous computing, and their dependable applications. JoWUA consists of high-quality technical manuscripts on advances in the state-of-the-art of wireless mobile networks, ubiquitous computing, and their dependable applications; both theoretical approaches and practical approaches are encouraged to submit. All published articles in JoWUA are freely accessible in this website because it is an open access journal. JoWUA has four issues (March, June, September, December) per year with special issues covering specific research areas by guest editors. The editorial board of JoWUA makes an effort for the increase in the quality of accepted articles compared to other competing journals..

Call for Papers - PROCEEDINGS ON ENGINEERING SCIENCES, P-ISSN-2620-2832, E-ISSN 2683-4111, indexed in Scopus

Preprint

Full-text available

Apr 2024

Christo Ananth

Proceedings on Engineering Sciences examines new research and development at the engineering. It provides a common forum for both front line engineering as well as pioneering academic research. The journal's multidisciplinary approach draws from such fields as Automation, Automotive engineering, Business, Chemical engineering, Civil engineering, Control and system engineering, Electrical and electronic engineering, Electronics, Environmental engineering, Industrial and manufacturing engineering, Industrial management, Information and communication technology, Management and Accounting, Management and quality studies, Management Science and Operations Research, Materials engineering, Mechanical engineering, Mechanics of Materials, Mining and energy, Safety, Risk, Reliability, and Quality, Software engineering, Surveying and transport, Architecture and urban engineering.

Call for Papers - Utilitas Mathematica, E-ISSN: 0315-3681, indexed in Scopus

Preprint

Full-text available

Apr 2024

Christo Ananth

Utilitas Mathematica Journal is a broad scope journal that publishes original research and review articles on all aspects of both pure and applied mathematics. This journal is the official publication of the Utilitas Mathematica Academy, Canada. It enjoys good reputation and popularity at international level in terms of research papers and distribution worldwide. Offers selected original research in Pure and Applied Mathematics and Statistics. UMJ coverage extends to Operations Research, Mathematical Economics, Mathematics Biology and Computer Science. Published in association with the Utilitas Mathematica Academy. The leadership of the Utilitas Mathematica Journal commits to strengthening our professional community by making it more just, equitable, diverse, and inclusive. We affirm that our mission, Promote the Practice and Profession of Statistics, can be realized only by fully embracing justice, equity, diversity, and inclusivity in all of our operations. Individuals embody many traits, so the leadership will work with the members of UMJ to create and sustain responsive, flourishing, and safe environments that support individual needs, stimulate intellectual growth, and promote professional advancement for all.

Call for Chapters- Edited Book: Real World Challenges in Quantum Electronics and Machine Computing, IGI Global, USA, ISBN 9798369340011

Preprint

Full-text available

Apr 2024

Christo Ananth

Most experts would consider this the biggest challenge. Quantum computers are extremely sensitive to noise and errors caused by interactions with their environment. This can cause errors to accumulate and degrade the quality of computation. Developing reliable error correction techniques is therefore essential for building practical quantum computers. While quantum computers have shown impressive performance for some tasks, they are still relatively small compared to classical computers. Scaling up quantum computers to hundreds or thousands of qubits while maintaining high levels of coherence and low error rates remains a major challenge. Developing high-quality quantum hardware, such as qubits and control electronics, is a major challenge. There are many different qubit technologies, each with its own strengths and weaknesses, and developing a scalable, fault-tolerant qubit technology is a major focus of research. Funding agencies, such as government agencies, are rising to the occasion to invest in tackling these quantum computing challenges. Researchers — almost daily — are making advances in the engineering and scientific challenges to create practical quantum computers.

Call for Chapters- Edited Book: Real-World Applications of Quantum Computers and Machine Intelligence, IGI Global, USA, ISBN 9798369336014

Preprint

Full-text available

Apr 2024

Christo Ananth

It is no surprise that Quantum Computing will prove to be a big change for the world. The practical examples of quantum computing can prove to be a good substitute for traditional computing methods. Quantum computing can be applied to many concepts in today’s era when technology has grown by leaps and bounds. It has a wide beach of applications ranging from Cryptography, Climate Change and Weather Forecasting, Drug Development and Discovery, Financial Modeling, Artificial Intelligence, etc. Giant firms have already begun the process of quantum computing in the field of artificial intelligence. The search algorithms of today are mostly designed according to classical computing methods. While Comparing Quantum Computers with Data Mining with Other Counterpart Systems, we are able to understand its significance thereby applying new techniques to obtain new real-time results and solutions.

Call for Papers- Thematic Issue: Food, Drug and Energy Production, PERIÓDICO TCHÊ QUÍMICA, ISSN: 1806-0374 (Printed); 2179-0302 (Online), indexed in ESCI (Web of Science)

Preprint

Full-text available

Apr 2024

Christo Ananth

Published since 2004, Periódico Tchê Química (PQT) is a is a triannual (published every four months), international, fully peer-reviewed, and open-access Journal that welcomes high-quality theoretically informed publications in the multi and interdisciplinary fields of Chemistry, Biology, Physics, Mathematics, Pharmacy, Medicine, Engineering, Agriculture and Education in Science. Researchers from all countries are invited to publish on its pages. The Journal is committed to achieving a broad international appeal, attracting contributions, and addressing issues from a range of disciplines. The Periódico Tchê Química is a double-blind peer-review journal dedicated to express views on the covered topics, thereby generating a cross current of ideas on emerging matters.

Call for Papers - Onkologia i Radioterapia, P-ISSN-1896-8961, E-ISSN 2449-9161, indexed in Scopus

Preprint

Full-text available

Apr 2024

Christo Ananth

Onkologia I Radioterapia is an international peer reviewed journal which publishes on both clinical and pre-clinical research related to cancer. Journal also provide latest information in field of oncology and radiotherapy to both clinical practitioner as well as basic researchers. Submission for publication can be submitted through online submission, Editorial manager system, or through email as attachment to journal office. For any issue, journal office can be contacted through email or phone for instatnt resolution of issue. Onkologia I Radioterapia is a peer-reviewed scopus indexed medical journal publishing original scientific (experimental, clinical, laboratory), review and case studies (case report) in the field of oncology and radiotherapy. In addition, publishes letters to the Editorial Board, reports on scientific conferences, book reviews, as well as announcements about planned congresses and scientific congresses. Oncology and Radiotherapy appear four times a year. All articles published with www.itmedical.pl and www.medicalproject.com.pl is now available on our new website.

Call for Papers - Journal of Indian School of Political Economy, E-ISSN 0971-0396, indexed in UGC Group I

Preprint

Full-text available

Apr 2024

Christo Ananth

The journal is published every quarter and contains 200 pages in each issue. It is devoted to the study of Indian economy, polity and society. Research papers, review articles, book reviews are published in the journal. All research papers published in the journal are subject to an intensive refereeing process. Each issue of the journal also includes a section on documentation, which reproduces extensive excerpts of relevant reports of committees, working groups, task forces, etc., which may not be readily accessible, official documents compiled from scattered electronic and/or other sources and statistical supplement for ready reference of the readers. It is now in its nineteenth year of publication. So far, five special issues have been brought out, namely: (i) The Scheduled Castes: An Inter-Regional Perspective, (ii) Political Parties and Elections in Indian States : 1990-2003, (iii) Child Labour, (iv) World Trade Organisation Agreements, and (v) Basel-II and Indian Banks.

A Novel Unrestricted Center-Biased Diamond Search Algorithm for Block Motion Estimation

Article

Full-text available

Sep 1998

The widespread use of block-based interframe motion estimation for video sequence compression in both MPEG and H.263 standards is due to its effectiveness and simplicity of implementation. Nevertheless, the high computational complexity of the full-search algorithm has motivated a host of suboptimal but faster search strategies. A popular example is the three-step search (TSS) algorithm. However, its uniformly spaced search pattern is not well matched to most real-world video sequences in which the motion vector distribution is nonuniformly biased toward the zero vector. Such an observation inspired the new three-step search (NTSS) which has a center-biased search pattern and supports a halfway-stop technique. It is faster on average, and gives better motion estimation as compared to the well-known TSS. Later, the four-step search (4SS) algorithm was introduced to reduce the average case from 21 to 19 search points, while maintaining a performance similar to NTSS in terms of motion compensation errors. We propose a novel unrestricted center-biased diamond search (UCBDS) algorithm which is more efficient, effective, and robust than the previous techniques. It has a best case scenario of only 13 search points and an average of 15.5 block matches. This makes UCBDS consistently faster than the other suboptimal block-matching techniques. This paper also compares the above methods in which both the processing speed and the accuracy of motion compensation are tested over a wide range of test video sequences

A block-based gradient descent search algorithm for block motion estimation in video coding

Article

Full-text available

Aug 1996

A block-based gradient descent search (BBGDS) algorithm is proposed in this paper to perform block motion estimation in video coding. The BBGDS evaluates the values of a given objective function starting from a small centralized checking block. The minimum within the checking block is found, and the gradient descent direction where the minimum is expected to lie is used to determine the search direction and the position of the new checking block. The BBGDS is compared with full search (FS), three-step search (TSS), one-at-a-time search (OTS), and new three-step search (NTSS). Experimental results show that the proposed technique provides competitive performance with reduced computational complexity

Motion-compensated interframe coding for video coferencing

Article

Jan 1981

Displacement Measurement and Its Application in Interframe Image Coding

Article

Jan 1982

A new technique for estimating interframe displacement of small blocks with minimum mean square error is presented. An efficient algorithm for searching the direction of displacement has been described. The results of applying the technique to two sets of images are presented which show 8-10 dB improvement in interframe variance reduction due to motion compensation. The motion compensation is applied for analysis and design of a hybrid coding scheme and the results show a factor of two gain at low bit rates.

A New Diamond Search Algorithm for Fast Block Matching Motion Estimation

Article

Mar 2000

Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast block-matching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well-known three-step search (TSS) algorithm. Compared with the new three-step search (NTSS) algorithm, the DS algorithm achieves close performance but requires less computation by up to 22% on average. Experimental results also show that the DS algorithm is better than the four-step search (4SS) and block-based gradient descent search (BBGDS), in terms of mean-square error performance and required number of search points

A novel four-step algorithm for fast block motion estimation

Article

Jul 1996

Based on the real world image sequence's characteristic of center-biased motion vector distribution, a new four-step search (4SS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed in this paper. A halfway-stop technique is employed in the new algorithm with searching steps of 2 to 4 and the total number of checking points is varied from 17 to 27. Simulation results show that the proposed 4SS performs better than the well-known three-step search and has similar performance to the new three-step search (N3SS) in terms of motion compensation errors. In addition, the 4SS also reduces the worst-case computational requirement from 33 to 27 search points and the average computational requirement from 21 to 19 search points, as compared with N3SS

New three-step search algorithm for block motion estimation

Article

Sep 1994

The three-step search (TSS) algorithm has been widely used as the motion estimation technique in some low bit-rate video compression applications, owing to its simplicity and effectiveness. However, TSS uses a uniformly allocated checking point pattern in its first step, which becomes inefficient for the estimation of small motions. A new three-step search (NTSS) algorithm is proposed in the paper. The features of NTSS are that it employs a center-biased checking point pattern in the first step, which is derived by making the search adaptive to the motion vector distribution, and a halfway-stop technique to reduce the computation cost. Simulation results show that, as compared to TSS, NTSS is much more robust, produces smaller motion compensation errors, and has a very compatible computational complexity

Fobe Algorithm for Video Processing Applications

Abstract and Figures

Recommended publications

Fast motion estimation using modified diamond search patterns

Modified Diamond Search Sensitive to Block Matching Error Characteristics

A Fast Three Step Search Algorithm With Minimum Checking Points

A content adaptive fractional pixel motion estimation algorithm for H.264