Low-complexity block-based motion estimation via one-bit transforms

Natarajan, B. K.; Bhaskaran, Vasudev; Κωνσταντινίδης, Κωνσταντίνος

doi:10.1109/76.611181

Cited by 216 publications

(145 citation statements)

References 7 publications

Supporting

Mentioning

129

Contrasting

Unclassified

Order By: Relevance

“…In [4], 1BT-based ME where the reference frames and the current frames are transformed into one-bit representations by comparing the original image frame against a bandpass filtered output was proposed. Each frame I is filtered with a 17 × 17 kernel K which is given as (1).…”

Section: Introductionmentioning

confidence: 99%

“…The techniques that exploit different matching criteria instead of the classical sum of absolute differences (SAD) such as one-bit transform (1BT), multiplication-free 1BT, and 2BT were proposed to make the faster computation of the matching criteria using Boolean exclusive-OR (XOR) operations [4,5,6]. In [4], 1BT-based ME where the reference frames and the current frames are transformed into one-bit representations by comparing the original image frame against a bandpass filtered output was proposed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Successive elimination algorithm for two-bit transform-based motion estimation

Choi

2010

IEICE Electron. Express

View full text Add to dashboard Cite

A successive elimination algorithm for two-bit transform (2BT) based motion estimation (ME) is proposed. By mathematically deriving the lower bound for 2BT-based matching criterion, we can discard the impossible candidates earlier and save computations substantially. Experimental results show that although the performance of the proposed algorithm is the same as that of the full search 2BT (FS-2BT) based ME algorithm, the computational complexity has been reduced significantly.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Successive elimination algorithm for two-bit transform-based motion estimation

Choi

2010

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…Hence, they cannot be performed based on the proposed packing framework. However, previous research [4] [15] has shown that approximations of the highly-complex SAD-based full-search motion estimation using simpler bitwise criteria can derive block matching schemes with comparable matching accuracy but with much lower complexity. Since a bitwise distance criterion is a natural fit for the proposed bitplane-based computation, in this paper we focus on incremental approximations of full-search block matching under such frameworks.…”

mentioning

confidence: 99%

“…Since a bitwise distance criterion is a natural fit for the proposed bitplane-based computation, in this paper we focus on incremental approximations of full-search block matching under such frameworks. In particular, we consider here the popular one-bit motion estimation of Natarajan et al [4], where a binarization of the input image is performed prior to block matching and the exclusive-OR (XOR) function is used as a matching criterion.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Software designs of image processing tasks with incremental refinement of computation

Anastasia

Andreopoulos

2009

2009 IEEE Workshop on Signal Processing Systems

View full text Add to dashboard Cite

We propose software designs that perform incremental computation with monotonic distortion reduction for twodimensional convolution and frame-by-frame block-matching tasks. In order to reduce the run time of the proposed designs, we combine bitplane-based computation with a packing technique proposed recently. In the case of block matching, we also utilize previously-computed motion vectors to perform localized search when incrementing the precision of the input video frames. The applicability of the proposed approach is demonstrated by execution time measurements on the xo-laptop ("100$ laptop") and on a mainstream laptop; our software is also made available online. In comparison to the conventional (non-incremental) software realization, the proposed approach leads to scalable computation per input frame while producing identical (or comparable) precision for the output results of each operating point. In addition, the execution of the proposed designs can be arbitrarily terminated for each frame with the output being available at the already-computed precision.Index Terms-complexity-scalable image processing, incremental refinement of computation, programmable processors INTRODUCTIONSeveral popular applications, such as media players, image and video post-processing, and motion estimation and compensation, are being implemented today via software solutions in general-purpose processors. New generations of processors are increasingly powerful and enable more dedicated resource allocation to such real-time multimedia tasks due to multicore designs [1]. At the same time, new generations of software compilers now automatically generate platform-specific optimized assembly code from C++ code [2], thereby enabling platform-independent C++ software solutions to achieve high processor utilization factors. Existing algorithmic-oriented research focuses on complexity reduction [3]- [5] or complexity scalability for image processing tasks [6]-[8], where computational complexity is decreased and approximate results are produced. Implementation-oriented research focuses on multimediadriven energy scaling of processors via dynamic voltage scaling [9] [10] in an attempt to provide computational scalability with approximate results. However, previous approaches can only obtain one operational point in the complexity-distortion curve [3] [7], without being able to increment the quality of the output with increased computation. In addition, in practical image and video coding systems, complexity does not scale down significantly with decreased source precision (decreased bitrate) [7]. Finally, existing image processing realizations produce an "all or nothing" output: one cannot interrupt the computation when system resources suddenly become unavailable (or when delay constraints are about to be violated) and retrieve a meaningful approximation of the final result1 . An exception is found in proposals for incremental computation of transforms and salient point detection algorithms [11] [12], where the main principle is:...

show abstract

Monocular Snapshot-based Sensing and Control of Hover, Takeoff, and Landing for a Low-cost Quadrotor

Garratt

Lambert

2015

J. Field Robotics

View full text Add to dashboard Cite

Autonomous control of a low‐cost micro air vehicle (MAV) is considered, using a single camera and inertial measurement unit. Integration of loom is used to determine the approximate height during takeoff and landing, and to provide an initial height for hover. Contrary to most optic‐flow‐based approaches that lack positional feedback, a “snapshot” paradigm is utilized in this paper that takes and stores an image of the ground under the MAV as a reference image, and the position of the vehicle can then be estimated from the transformation of the following images with respect to the reference image so that long‐term drift can be contained. In this new work, the implementation of the snapshot algorithm is considered with a focus on real‐time performance on a slow processor and the difficulties posed by illumination change and external disturbance. We also extend earlier work with extensive flight experiments conducted in various situations to evaluate the closed‐loop performance of the proposed algorithm.

show abstract

Low-complexity block-based motion estimation via one-bit transforms

Cited by 216 publications

References 7 publications

Successive elimination algorithm for two-bit transform-based motion estimation

Successive elimination algorithm for two-bit transform-based motion estimation

Software designs of image processing tasks with incremental refinement of computation

Monocular Snapshot-based Sensing and Control of Hover, Takeoff, and Landing for a Low-cost Quadrotor

Contact Info

Product

Resources

About