Skip to main content

Block Matching Algorithm

Project description

Block Matching Algorithm

Block Matching

According to CUEVAS et al. (2013) in a block matching (BM) approach:

"...image frames in a video sequence are divided into blocks. For each
block in the current frame, the best matching block is identified inside a
region of the previous frame, aiming to minimize the sum of absolute
differences..."

From the work of Perez et al. (2010):

"...pixel-specific motion vectors are determined by calculating the RMSE of
 the difference between two consecutive Kt*grids surrounding the considered
 pixel when the second grid is advected in the direction of a motion vector.
 The selected motion vector corresponds to the lowest RMSE. This process is
 repeated for each image pixel, and each pixel is assigned an individual
 motion vector. Future images are obtained by displacing the current image
 pixels in the direction of their motion vector. Future images are
 subsequently smoothed by averaging each pixel with its 8 surrounding
 neighbors..."

For example, considering a image, in t0 + k dt, with 9x9 pixels and a block grid with 3x3 pixels. The image bellow it is assumed that the central pixel C is surrounding by pixels A.

* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * A A A * * *
* * * A C A * * *
* * * A A A * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * * * *

Now, for a image in time t0 + (k+1)dt, the value of block with the pixel C, in the image in t0 +kdt, is compared with values of piexls in the 9x9 window of the image in t0+(k+1)dt.

The most probable direction of the moviment of the pixel C, at t0 + (k+1)dt, is given by the position of the corresponding block with the lowest square mean error -SME (subtraction of the 3x3 subgrid) (e.g. KHAWASE et al. (2017)).

In the following example, the 3x3 block was in the initial position i=4, j=4. The new initial subblock with lowest is in i=7, j=7.

Initial position of 3x3 block in t0 + kdt:

* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * A A A * * *
* * * A C A * * *
* * * A A A * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * * * *

The new position of 3x3 block in t0 + (i+1)dt:

* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * * * *
* * * * * * A A A
* * * * * * A C A
* * * * * * A A A

The size of search window depend of the expected velocity of the block. For slow moviment, a window with size of 3 times can be considered.

Background subtraction algorithm.

The background and foreground subtraction algorithm is based on the work of Yi and Fan (2010):

"...based on running average background modeling and temporal difference method.Firstly, we utilize the running average method to dynamically updating the background image. Through using background subtraction, we get a foreground image. Secondly, we use temporal difference method to get a difference image..."

License

Developed by: E. S. Pereira. e-mail: pereira.somoza@gmail.com

Copyright [2019] [E. S. Pereira]

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

   http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

Bibliography

CUEVAS, Erik et al. Block matching algorithm for motion estimation based on Artificial Bee Colony (ABC). Applied Soft Computing, v. 13, n. 6, p. 3047-3059, 2013.

KHAWASE, Sonam T. et al. An Overview of Block Matching Algorithms for Motion Vector Estimation. In: Proceedings of the Second International Conference on Research in Intelligent and Computing in Engineering, str. 2017. p. 217-222.

Perez, R. et al. Validation of short and medium term operational solar radiation forecasts in the US. Solar Energy, 84. 12. 2161-2172. 2010.

Yi, Zheng, and Fan Liangzhong. Moving object detection based on running average background and temporal difference. 2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering. IEEE, 2010.

Edit a file, create a new file, and clone from Bitbucket in under 2 minutes

When you're done, you can delete the content in this README and update the file with details for others getting started with your repository.

We recommend that you open this README in another tab as you perform the tasks below. You can watch our video for a full demo of all the steps in this tutorial. Open the video in a new tab to avoid leaving Bitbucket.


Edit a file

You’ll start by editing this README file to learn how to edit a file in Bitbucket.

  1. Click Source on the left side.
  2. Click the README.md link from the list of files.
  3. Click the Edit button.
  4. Delete the following text: Delete this line to make a change to the README from Bitbucket.
  5. After making your change, click Commit and then Commit again in the dialog. The commit page will open and you’ll see the change you just made.
  6. Go back to the Source page.

Create a file

Next, you’ll add a new file to this repository.

  1. Click the New file button at the top of the Source page.
  2. Give the file a filename of contributors.txt.Art. 19. Fica suspensa a exigibilidade do recolhimento do FGTS pelos empregadores, referenteàs competências de março, abril e maio de 2020, com vencimento em abril, maio e junho de 2020,respectivamente
  3. Enter your name in the empty file space.
  4. Click Commit and then Commit again in the dialog.
  5. Go back to the Source page.

Before you move on, go ahead and explore the repository. You've already seen the Source page, but check out the Commits, Branches, and Settings pages.


Clone a repository

Use these steps to clone from SourceTree, our client for using the repository command-line free. Cloning allows you to work on your files locally. If you don't yet have SourceTree, download and install first. If you prefer to clone from the command line, see Clone a repository.

  1. You’ll see the clone button under the Source heading. Click that button.
  2. Now click Check out in SourceTree. You may need to create a SourceTree account or log in.
  3. When you see the Clone New dialog in SourceTree, update the destination path and name if you’d like to and then click Clone.
  4. Open the directory you just created to see your repository’s files.

Now that you're more familiar with your Bitbucket repository, go ahead and add a new file locally. You can push your change back to Bitbucket with SourceTree, or you can add, commit, and push from the command line.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

blockmatching-1.2.1.tar.gz (16.0 kB view hashes)

Uploaded source

Built Distribution

blockmatching-1.2.1-py3-none-any.whl (21.3 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page