Mr. Somphob Soongsathitanon Profile

Somphob Soongsathitanon

at Univ of Newcastle upon Tyne

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 7 May 2003 Paper

A novel orthogonal logarithmic search algorithm for low-bit-rate video coding

Somphob Soongsathitanon, Satnam Dlay

Proceedings Volume 5022, (2003) https://doi.org/10.1117/12.479749

KEYWORDS: Video, Motion estimation, Detection and tracking algorithms, Video coding, Standards development, Distortion, Video compression, Computer programming, Image compression, Signal to noise ratio

Read Abstract +

The paper presents a novel Orthogonal Logarithmic Search (OLS) method for block base motion compensation. The performance of the algorithm is evaluated by using standard QCIF benchmark video sequences and the results are compared to a traditional well-known full search algorithm (FSA) and a sub-optimal method called the Three Step Search (3SS). The evaluation considers the three important metrics, time, entropy and PSNR (Peak Signal to Noise Ratio). The paper also shows that the strength of the algorithm lies in its speed of operation as it is 95% faster than the FSA and over 60% faster than the 3SS. Investigation into motion estimation algorithms is one of the important issues in the video coding standards such as ISO MPEG-1/2 and ITU-T H.263. These international standards regularly use a conventional FSA to estimate the motion of pixels between pairs of image block matching algorithms. Since a full search requires intensive computations and the distortion function needs to be evaluated many times for each target block to be matched, the process is very time consuming. Therefore, the main aim of this investigation has been to alleviate this acute problem of search speed and accuracy.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years