Chroma-Key Algorithm Based on Combination of K-Means and Confident Coefficients
Keywords:
Chroma-key, K-means algorithm, FPGA, confident coefficient, hardware architecture.Abstract
Chroma-key is an application which is used many
in video industries, TV programs. In this paper, we present an
efficient
algorithm for Chroma-key and its FPGA
implementation. In the proposed method, we firstly employ
K-means to segment input frames in to a trimap including
background, foreground, and unknown regions. In the next
stage, we utilize comparison of confident neighborhood pixels to
refine unknown region to separate background and foreground
regions. In order to apply the proposed algorithm for real-time
chroma-key effect, we implement its VLSI architecture on Bitec
Cyclone III development board. Our design is able to perform
Chroma-key process with pleasing quality HD video in
real-time.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
