EI 2006 - San Jose, CA Slide No. 1 Nearest-neighbor and Bilinear Resampling Factor Estimation to Detect Blockiness or Blurriness of an Image* Ariawan Suwendi.

Slides:



Advertisements
Similar presentations
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Advertisements

S INGLE -I MAGE R EFOCUSING AND D EFOCUSING Wei Zhang, Nember, IEEE, and Wai-Kuen Cham, Senior Member, IEEE.
CS & CS Multimedia Processing Lecture 2. Intensity Transformation and Spatial Filtering Spring 2009.
Wen-Hung Liao Department of Computer Science National Chengchi University November 27, 2008 Estimation of Skin Color Range Using Achromatic Features.
Digital Image Processing
Chapter 4: Image Enhancement
EI San Jose, CA Slide No. 1 Measurement of Ringing Artifacts in JPEG Images* Xiaojun Feng Jan P. Allebach Purdue University - West Lafayette, IN.
Facial feature localization Presented by: Harvest Jang Spring 2002.
A Comprehensive Study on Third Order Statistical Features for Image Splicing Detection Xudong Zhao, Shilin Wang, Shenghong Li and Jianhua Li Shanghai Jiao.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
6/9/2015Digital Image Processing1. 2 Example Histogram.
Digital Image Processing
Robust Object Segmentation Using Adaptive Thresholding Xiaxi Huang and Nikolaos V. Boulgouris International Conference on Image Processing 2007.
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
CS443: Digital Imaging and Multimedia Filters Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Spring 2008 Ahmed Elgammal Dept.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Image Enhancement.
1 A Unified Rate-Distortion Analysis Framework for Transform Coding Student : Ho-Chang Wu Student : Ho-Chang Wu Advisor : Prof. David W. Lin Advisor :
Lecture 2. Intensity Transformation and Spatial Filtering
A REAL-TIME VIDEO OBJECT SEGMENTATION ALGORITHM BASED ON CHANGE DETECTION AND BACKGROUND UPDATING 楊靜杰 95/5/18.
Despeckle Filtering in Medical Ultrasound Imaging
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
CSC589 Introduction to Computer Vision Lecture 3 Gaussian Filter, Histogram Equalization Bei Xiao.
Median Filtering Detection Using Edge Based Prediction Matrix The 10th IWDW, Atlantic City, New Jersey, USA 23~26 October 2011 School of Information Science.
Medical Image Analysis Image Enhancement Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Introduction to Visible Watermarking IPR Course: TA Lecture 2002/12/18 NTU CSIE R105.
Robust Motion Watermarking based on Multiresolution Analysis Tae-hoon Kim Jehee Lee Sung Yong Shin Korea Advanced Institute of Science and Technology.
Image Processing Xuejin Chen Ref:
Joon Hyung Shim, Jinkyu Yang, and Inseong Kim
CSCE 643 Computer Vision: Extractions of Image Features Jinxiang Chai.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Image Processing Part II. 2 Classes of Digital Filters global filters transform each pixel uniformly according to the function regardless of its location.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
1 Statistics, Data Analysis and Image Processing Lectures Vlad Stolojan Advanced Technology Institute University of Surrey.
Exposing Digital Forgeries in Color Filter Array Interpolated Images By Alin C. Popescu and Hany Farid Presenting - Anat Kaspi.
11/29/ Image Processing. 11/29/ Systems and Software Image file formats Image processing applications.
Detection of Image Alterations Using Semi-fragile Watermarks
An Improved Method Of Content Based Image Watermarking Arvind Kumar Parthasarathy and Subhash Kak 黃阡廷 2008/12/3.
Autonomous Robots Vision © Manfred Huber 2014.
Image Segmentation by Histogram Thresholding Venugopal Rajagopal CIS 581 Instructor: Longin Jan Latecki.
Secure Spread Spectrum Watermarking for Multimedia Young K Hwang.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Demosaicking for Multispectral Filter Array (MSFA)
By Pushpita Biswas Under the guidance of Prof. S.Mukhopadhyay and Prof. P.K.Biswas.
Research Methods Lecturer: Steve Maybank
 Forensics of image re-sampling (such as image resizing) is an important issue,which can be used for tampering detection, steganography, etc.  Most of.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
MMC LAB Secure Spread Spectrum Watermarking for Multimedia KAIST MMC LAB Seung jin Ryu 1MMC LAB.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
RECONSTRUCTION OF MULTI- SPECTRAL IMAGES USING MAP Gaurav.
Motion tracking TEAM D, Project 11: Laura Gui - Timisoara Calin Garboni - Timisoara Peter Horvath - Szeged Peter Kovacs - Debrecen.
Bayer Color Filter Array Demosaicing
Date of download: 7/2/2016 Copyright © 2016 SPIE. All rights reserved. Illustration of quantities in Eq. : Ath is the ratio of the striped area under the.
Medical Image Analysis
Chapter 10 Image Segmentation
Face Detection EE368 Final Project Group 14 Ping Hsin Lee
Reverse-Projection Method for Measuring Camera MTF
PLIP BASED UNSHARP MASKING FOR MEDICAL IMAGE ENHANCEMENT
Robustness Evaluation of Perceptual Watermarks
Exposing Digital Forgeries by Detecting Traces of Resampling Alin C
Lecture 10 Image sharpening.
Lecture 3 (2.5.07) Image Enhancement in Spatial Domain
CS654: Digital Image Analysis
Spread Spectrum Watermarking
Reduction of blocking artifacts in DCT-coded images
Chair Professor Chin-Chen Chang Feng Chia University
Author: Minoru Kuribayashi, Hatsukazu Tanaka
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Source: Circuits and Systems for Video Technology,
Presentation transcript:

EI San Jose, CA Slide No. 1 Nearest-neighbor and Bilinear Resampling Factor Estimation to Detect Blockiness or Blurriness of an Image* Ariawan Suwendi Prof. Jan P. Allebach Purdue University - West Lafayette, IN *Research supported by the Hewlett-Packard Company

EI San Jose, CA Slide No. 2 Outline Introduction 1-D Nearest-neighbor and bilinear interpolation The basis for interpolation detection (RF>1) Step-by-step illustration of the resampling factor estimation algorithm Robustness evaluation Conclusions

EI San Jose, CA Slide No. 3 Introduction Nearest-neighbor and bilinear interpolation are widely used Popescu and Farid (IEEE T-SP, 2005): Detect resampled images by analyzing statistical correlations  Not able to detect the resampling amount  Ineffective to some common post-processings Original Low-Res Image NN interpolationBilinear interpolation

EI San Jose, CA Slide No. 4 Introduction (cont.) How to detect and estimate resampling factor (RF) for nearest-neighbor and bilinear interpolation Since both interpolations are separable, most of the things will be explained in 1-D space

EI San Jose, CA Slide No. 5 1-D Nearest-neighbor and bilinear interpolation Rational resampling factor ( ) InterpolationDefinitionInterpolation filter Nearest-neighbor interpolation Bilinear interpolation

EI San Jose, CA Slide No. 6 Basis for nearest-neighbor interpolation detection (RF=5) Periodic peaks in first-order difference image Peak intervals contain information about the RF applied Nearest-neighbor interpolated imagePeriodic peaks in |First-order difference| peak interval

EI San Jose, CA Slide No. 7 Basis for bilinear interpolation detection (RF=5) Bilinear interpolated image First-order difference Periodic peaks in |Second-order difference| peak interval

EI San Jose, CA Slide No. 8 Basis for interpolation detection In nearest-neighbor interpolated images, the first-order difference image should contain peaks with peak intervals equal floor(RF) or ceil(RF) In bilinear interpolated images, the second-order difference image should contain peaks with peak intervals equal floor(RF) or ceil(RF) Resampling factor RF can be estimated as the average of the detected peak intervals Smooth regions in the difference image do not provide a reliable reading of peak intervals and, hence, should be ignored

EI San Jose, CA Slide No. 9 Model for peak intervals in bilinear interpolation (RF=2.5) Uninterpolated pixel values: Interpolated pixel values: Assume that the increment term (Δn) is uniformly distributed in [-255,255] Periodic second-order difference coefficient sequence: 0,1,1,0,2,0,1,1,0,2,0,1,1,0,2,… one period

EI San Jose, CA Slide No. 10 Peak detection (RF=2.5) Assignment of peak location for 4 possible peaks: Peak intervals for the second-order diff. coeff. sequence:  0,1,1,0,2, 0,1,1,0,2, 0,1,1,0,2,0,… RF est = Average of detected peak intervals = Peak location Interpolated pixel Legend Second-order difference Peak APeak B 1 Peak B 2 Peak B 3

EI San Jose, CA Slide No. 11 Step-by-step illustration of vertical RF estimation for bilinear interpolation (RF=4.5) ? Image Interpolate by RF=4.5 JPEG-compression 90% quality Bilinear RF Estimation algorithm RF est

EI San Jose, CA Slide No. 12 Step-by-step illustration (cont.) Step 1: Compute luminance plane using YCbCr model Step 2: Compute |second difference image| Step 3: Scale the difference image to [0,255] Step 4: Apply the horizontal Sobel edge detection filter

EI San Jose, CA Slide No. 13 Step-by-step illustration (cont.) Step 5: Dilate the edge map to get a mask  Smooth regions do not provide a reliable reading of peak intervals

EI San Jose, CA Slide No. 14 Step-by-step illustration (cont.) Step 6: Mask the difference image, project, and average to get a 1-D projection array Step 7: Detect peaks and measure peak intervals Step 8: Use histogram to extract resampling factor Step 9: Detect possible false alarms RF est =4.46 Histogram of detected peak intervals

EI San Jose, CA Slide No. 15 Robustness evaluation (30 Images, 26 resampling factors) Test description Parameters for NN tests Parameters for BI tests No post-processing-- JPEG compression70% quality90% quality Sharpening (Unsharp Masking) same Digimarc’s watermarking (Level 4 is strongest) Level 3Level 1 Spread spectrum watermarking α=0.3 (not tested) Adobe Photoshop interpolaton + JPEG (not tested)10/12 quality

EI San Jose, CA Slide No. 16 Test results (NN) Tolerance for estimation accuracy: 15% Reliable estimation for RF>1.5

EI San Jose, CA Slide No. 17 Test results (NN with post-processing) Reliable estimation for RF>2

EI San Jose, CA Slide No. 18 Test results (BI) Reliable estimation for RF>2

EI San Jose, CA Slide No. 19 Test results (BI with post-processing) For (BI, JPEG): Reliable estimation for RF>2

EI San Jose, CA Slide No. 20 Conclusions The NN resampling factor estimation algorithm works well for RF>2  It can withstand significant post-processing The bilinear resampling factor estimation algorithm works well for RF>2 except in sharpening and watermarking tests  It can only withstand mild post-processing One weakness is that bilinear interpolation with 1<RF<2 tends to be overestimated with 2<RF est ≤3

EI San Jose, CA Slide No. 21 Thank you for listening