scholarly journals Tracking of Blood Movement in the Heart using Elongated Horizontal Large Diamond Search Pattern and Optical Flow Technique for Enabling the Detection of Atrial Septal Defect

2019 ◽  
Vol 8 (6) ◽  
pp. 1862-1870
Keyword(s):  
Atrial Septal Defect ◽  
Optical Flow ◽  
Septal Defect ◽  
Motion Vector ◽  
Research Work ◽  
Ground Truth ◽  
Block Matching ◽  
Search Pattern ◽  
Diamond Search ◽  
Large Diamond

In major congenital heart ailments comes Atrial Septal Defect (ASD). Many techniques viz. ECG, MRI, Ultrasound etc., are in use to detect ASD. Performance of heart is analyzed by the Doctors through test results or observations of heart Ultrasound. In this research work it is proved that the disorder ASD is detected using the technique of block matching and optical flow. These algorithms enables the doctors or experts to detect ASD automatically and hence reduces the dependency on humans. This paper proposes a new Elongated Horizontal Large Diamond Search Pattern (EHLDSP) and Optical Flow algorithm for detection of ASD based on MV. Experimentation was carried out on A4C view of 2D Echo Cardiogram, collected form the hospitals as well as from open available database. Ground truth image is used by the cardiologist to compare the results. In this paper, performance of the proposed Elongated Horizontal Large Diamond Search Pattern (EHLDSP) method is compared with other techniques on the basis of cost functions like PSNR and computation complexity. EHLDSP algorithm is used to check the pixel movements and to calculate Motion Vector (MV), followed by the estimation of the displacement of blood cells from either right to left or vice versa. This will help in the reduction of dependency on specialized doctors or human factor can be reduced. For automatic detection of abnormality, research is going on in this area to make it fast and accurate. Proposed algorithm reduces the average computation by providing speed improvements of about 91% over FS/ES and about 6% over existing DS. Also, EHLDSP has shown improvements in the PSNR value in comparison with other methods.

scholarly journals Fast Motion Estimation Algorithm using Hybrid Search Patterns for Video Streaming Application

2017 ◽  
Vol 12 (5) ◽  
pp. 715
Author(s):  
Vani Rajamanickam ◽  
Ushabhanu Nageswaran ◽  
Sangeetha Marikkannan
Keyword(s):  
Motion Estimation ◽  
Motion Vector ◽  
Block Matching ◽  
Search Pattern ◽  
Live Streaming ◽  
Hybrid Search ◽  
Fast Motion Estimation ◽  
Streaming Application ◽  
Diamond Search ◽  
Search Patterns

The objective of the paper is to develop new block matching Motion Estimation (ME) algorithm using hybrid search patterns along the direction of best match. The search efficiency for sequences with fast motions and high resolutions is improved by proposing New Cross Diagonal-Hexagon Search (NCDHS) algorithm which involves a novel multi half-hexagon grid global search pattern and a cross diagonal-hexagon local search pattern. The new search pattern enables the proposed algorithm to perform better search using 9.068 search points on an average, to obtain optimal motion vector with slight improvement in quality. This inturn reduces ME Time upto 50.11%, 47.12%, 32.99% and 43.28% on average when compared to the existing Diamond Search (DS), Hexagon Search (HS), New Cross Hexagon Search (NHEXS) and Enhanced Diamond Search (EDS) algorithms respectively. The novelty of the algorithm is further achieved by applying the algorithm proposed for live streaming application. The NCDHS algorithm is run on two MATLAB sessions on the same computer by establishing the connection using Transmission Control Protocol (TCP) /Internet Protocol (IP) network. The ME Time obtained is 14.5986 seconds for a block size 16x16, is less when compared to existing algorithms and that makes the NCDHS algorithm suitable for real time streaming application.

PERFORMANCE EVALUATION OF ORTHOGONAL-DIAMOND SEARCH OF BLOCK MATCHING ALGORITHM FOR VIDEO CODING

2015 ◽  
Vol 76 (1) ◽  
Author(s):  
Nurul 'Atiqah Hamid ◽  
Abdul Majid Darsono ◽  
Nurulfajar Abdul Manap ◽  
Redzuan Abdul Manap
Keyword(s):  
Signal To Noise Ratio ◽  
Video Quality ◽  
Motion Vector ◽  
Computational Cost ◽  
Block Matching ◽  
Search Pattern ◽  
Matching Algorithm ◽  
Block Matching Algorithm ◽  
Diamond Search

Several drawbacks of established fast Block Matching Algorithm (BMA) are the reasons why new fast BMAs are being developed and proposed in these recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new algorithm is proposed, namely Orthogonal-Diamond Search (ODS) which employs an orthogonal-shaped search pattern in the first step and then is switched into diamond-shaped search pattern for the next step. Few established algorithm, namely Orthogonal Search (OS), Full Search (FS), Diamond Search (DS) and Hexagon-Diamond Search (HDS) are implemented using MATLAB along with the ODS and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.  

scholarly journals A New Pentagon Search Algorithm for Fast Block-Matching Motion Estimation

2019 ◽  
Vol 8 (10) ◽  
pp. 4125-4130
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Motion Vector ◽  
Performance Measure ◽  
Block Matching ◽  
Search Pattern ◽  
Error Performance ◽  
Improvement Rate ◽  
Diamond Search ◽  
The Impact

The impact of search pattern is a crucial part in the block-based motion estimation for finding the motion vector. An issue of distortion performance and search speed heavily depends upon the size and shape of search strategy applied. Performing the deep analysis for motion vector distribution on standard test videos, it is desirable to have such type of algorithm that meets the requirement of searching motion vector in less time. Hence, a new kind of Pentagon algorithm is proposed in this paper for fast block-matching motion estimation (BMME). It is an easy and efficient technique for finding motion vector. Experimental results expose the proposed Pentagon algorithm sparsely surpass the noted Diamond search (DS) algorithm. The new Pentagon search algorithm is examined with the previously proposed Diamond search algorithm in terms of performance measure; the proposed algorithm attains better performance with the less complexity. The experimental examination also depicts that the pentagon algorithm is better than the previously proposed Diamond search (DS) in terms of mean-square error performance and required the number of search points. The overall speed improvement rate (SIR) is about 31% with respect to the DS.

scholarly journals A low-cost solution for unmanned aerial vehicle navigation in a global positioning system–denied environment

2018 ◽  
Vol 14 (6) ◽  
pp. 155014771878175 ◽  
Author(s):  
Shahrukh Ashraf ◽  
Priyanka Aggarwal ◽  
Praveen Damacharla ◽  
Hong Wang ◽  
Ahmad Y Javaid ◽  
...  
Keyword(s):  
Optical Flow ◽  
Unmanned Aerial Vehicle ◽  
Global Positioning System ◽  
Motion Vector ◽  
Block Matching ◽  
Positioning System ◽  
Simulation Studies ◽  
Flow Measurements ◽  
Global Positioning ◽  
Aerial Vehicle

The ability of an autonomous unmanned aerial vehicle to navigate and fly precisely determines its utility and performance. The current navigation systems are highly dependent on the global positioning system and are prone to error because of global positioning system signal outages. However, advancements in onboard processing have enabled inertial navigation algorithms to perform well during short global positioning system outages. In this article, we propose an intelligent optical flow–based algorithm combined with Kalman filters to provide the navigation capability during global positioning system outages and global positioning system–denied environments. Traditional optical flow measurement uses block matching for motion vector calculation that makes the measurement task computationally expensive and slow. We propose the application of an artificial bee colony–based block matching technique for faster optical flow measurements. To effectively fuse optical flow data with inertial sensors output, we employ a modified form of extended Kalman filter. The modifications make the filter less noisy by utilizing the redundancy of sensors. We have achieved an accuracy of ~95% for all non-global positioning system navigation during our simulation studies. Our real-world experiments are in agreement with the simulation studies when effects of wind are taken into consideration.

scholarly journals An Adaptive Motion Estimation Scheme for Video Coding

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Pengyu Liu ◽  
Yuan Gao ◽  
Kebin Jia
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Motion Vector ◽  
Rate Distortion ◽  
Block Matching ◽  
Search Pattern ◽  
Fast Motion Estimation ◽  
Search Patterns ◽  
Adaptive Motion ◽  
Estimation Scheme

The unsymmetrical-cross multihexagon-grid search (UMHexagonS) is one of the best fast Motion Estimation (ME) algorithms in video encoding software. It achieves an excellent coding performance by using hybrid block matching search pattern and multiple initial search point predictors at the cost of the computational complexity of ME increased. Reducing time consuming of ME is one of the key factors to improve video coding efficiency. In this paper, we propose an adaptive motion estimation scheme to further reduce the calculation redundancy of UMHexagonS. Firstly, new motion estimation search patterns have been designed according to the statistical results of motion vector (MV) distribution information. Then, design a MV distribution prediction method, including prediction of the size of MV and the direction of MV. At last, according to the MV distribution prediction results, achieve self-adaptive subregional searching by the new estimation search patterns. Experimental results show that more than 50% of total search points are dramatically reduced compared to the UMHexagonS algorithm in JM 18.4 of H.264/AVC. As a result, the proposed algorithm scheme can save the ME time up to 20.86% while the rate-distortion performance is not compromised.

scholarly journals Experimental Analysis of Performance Comparison on Both Linear Filter and Bidirectional Condential Technique for Spatial Domain Optical Flow Algorithm

1970 ◽  
Vol 7 (2) ◽  
pp. 156-167
Author(s):  
Darun Kesrarat ◽  
Vorapoj Patanavijit
Keyword(s):  
Optical Flow ◽  
Signal To Noise Ratio ◽  
Additive White Gaussian Noise ◽  
Motion Vector ◽  
Research Work ◽  
Spatial Domain ◽  
Performance Comparison ◽  
Video Sequences ◽  
Linear Filter ◽  
Analysis Of Performance

Optical flow is a method for classifying the density velocity or motion vector (MV) in a degree of pixel basis for motion classification of image in video sequences. In actual situation, many unpleasant situations usually generate noises over the video sequences. These unpleasant situations corrupt the performance in efficiency of optical flow. In turn to increase the efficiency of the MV, this research work proposes the performance comparison on linear filter and bidirectional confidential technique for spatial domain optical flow algorithms. Our experiment concentrates on the 3 classical spatial based optical flow algorithms (such as spatial correlation-based optical flow (SCOF), Horn-Schunk algorithm (HS) and Lucas-Kanade algorithm (LK)). Different standard video sequences such as AKIYO, CONTAINER, COASTGUARD, and FOREMAN are comprehensively evaluated to demonstrate the effectiveness results. These video sequences have differences in aspect of action and speed in foreground and background. These video sequences are also debased by the Additive White Gaussian Noise (AWGN) at different noise degree (such as AWGN at 25 dB, 20 dB, and 15 dB consequently). Peak Signal to Noise Ratio (PSNR) is utilized as the performance index in our observation.

scholarly journals A Three-Point Directional Search Block Matching Algorithm

2017 ◽  
Vol 7 (1) ◽  
pp. 230 ◽  
Author(s):  
A.V. Paramkusam ◽  
D. Laxma Reddy
Keyword(s):  
Motion Estimation ◽  
Motion Vector ◽  
Block Matching ◽  
Search Pattern ◽  
Fast Search ◽  
Block Matching Algorithm ◽  
Estimation Algorithms ◽  
Search Patterns ◽  
Search Speed ◽  
Minimum Block

<p>This paper proposes compact directional asymmetric search patterns, which we have named as three-point directional search (TDS). In most fast search motion estimation algorithms, a symmetric search pattern is usually set at the minimum block distortion point at each step of the search. The design of the symmetrical pattern in these algorithms relies primarily on the assumption that the direction of convergence is equally alike in each direction with respect to the search center. Therefore, the monotonic property of real-world video sequences is not properly used by these algorithms. The strategy of TDS is to keep searching for the minimum block distortion point in the most probable directions, unlike the previous fast search motion estimation algorithms where all the directions are checked. Therefore, the proposed method significantly reduces the number of search points for locating a motion vector. Compared to conventional fast algorithms, the proposed method has the fastest search speed and most satisfactory PSNR values for all test sequences.</p>

scholarly journals AN EFFICIENT BLOCK MATCHING ALGORITHM FOR FAST MOTION ESTIMATION USING COMBINED THREE STEP SEARCH AND DIAMOND SEARCH ALGORITHM

2016 ◽  
pp. 291-294
Author(s):  
SANTOSH KU. CHHOTRAY ◽  
DHEERAJ KANNOUJIA ◽  
SAMIR KU JHA
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Estimation Algorithm ◽  
Search Space ◽  
Block Matching ◽  
Search Pattern ◽  
Dead Cell ◽  
Fast Motion Estimation ◽  
Diamond Search ◽  
Fast Motion

Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. So many researches are going on the field of motion estimation to achieve the requirement of recent day technology. Block matching algorithms are very useful in achieving the efficient and acceptable motion estimation. Total computation cost and bit budgeting can be efficiently controlled by properly modifying block matching algorithms. Video coding using Orthogonal Logarithmic Search Algorithm (OSA) is one of the best block matching algorithms used now days. Motion estimation is the most time consuming operation in a typical video encoder. This paper presents a novel method by combining modified three step (M3SS) algorithm with a different search pattern and diamond search (DS) based on dead cell for the block based motion estimation. Result shows that from the original Three step Search (3SS/TSS ) method, the PSNR value has increased and the computations time has been reduced effectively by modified 3SS and again to increase the search space we combined diamond search(DS) algorithm. The experimental results based on different video frames were compared to demonstrate the advantages of proposed fast motion estimation algorithm.

Sign in / Sign up

Export Citation Format

Share Document