1. Problem Many archived two-sided manuscript documents suffer from bleed-through; Bleed-through can be effectively removed offline using image-processing.

Slides:



Advertisements
Similar presentations
Patient information extraction in digitized X-ray imagery Hsien-Huang P. Wu Department of Electrical Engineering, National Yunlin University of Science.
Advertisements

Alignment Visual Recognition “Straighten your paths” Isaiah.
Announcements. Structure-from-Motion Determining the 3-D structure of the world, and/or the motion of a camera using a sequence of images taken by a moving.
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
Document Image Processing
I Images as graphs Fully-connected graph – node for every pixel – link between every pair of pixels, p,q – similarity w ij for each link j w ij c Source:
Generation of Virtual Image from Multiple View Point Image Database Haruki Kawanaka, Nobuaki Sado and Yuji Iwahori Nagoya Institute of Technology, Japan.
Different Tracking Techniques  1.Gaussian Mixture Model:  1.Construct the model of the Background.  2.Given sequence of background images find the.
Morphological Image Processing Md. Rokanujjaman Assistant Professor Dept of Computer Science and Engineering Rajshahi University.
Quadtrees, Octrees and their Applications in Digital Image Processing
Probabilistic video stabilization using Kalman filtering and mosaicking.
Background Estimation with Gaussian Distribution for Image Segmentation, a fast approach Gianluca Bailo, Massimo Bariani, Paivi Ijas, Marco Raggio IEEE.
Quadtrees, Octrees and their Applications in Digital Image Processing
Computing motion between images
 Image Search Engine Results now  Focus on GIS image registration  The Technique and its advantages  Internal working  Sample Results  Applicable.
Object Recognition Using Geometric Hashing
1/20 Document Segmentation for Image Compression 27/10/2005 Emma Jonasson Supervisor: Dr. Peter Tischer.
Binary Image Analysis. YOU HAVE TO READ THE BOOK! reminder.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Statistical Shape Models Eigenpatches model regions –Assume shape is fixed –What if it isn’t? Faces with expression changes, organs in medical images etc.
SHIFTS: f ( x )  d ________________________ _______________________ Result for the whole graph _________________________.
Yuping Lin and Gérard Medioni.  Introduction  Method  Register UAV streams to a global reference image ▪ Consecutive UAV image registration ▪ UAV to.
Navigating and Browsing 3D Models in 3DLIB Hesham Anan, Kurt Maly, Mohammad Zubair Computer Science Dept. Old Dominion University, Norfolk, VA, (anan,
FEATURE EXTRACTION FOR JAVA CHARACTER RECOGNITION Rudy Adipranata, Liliana, Meiliana Indrawijaya, Gregorius Satia Budhi Informatics Department, Petra Christian.
XML modelling Adolf Knoll National Library of the Czech Republic
MPEG MPEG-VideoThis deals with the compression of video signals to about 1.5 Mbits/s; MPEG-AudioThis deals with the compression of digital audio signals.
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
Image Preprocessing: Geometric Correction Image Preprocessing: Geometric Correction Jensen, 2003 John R. Jensen Department of Geography University of South.
Plug-in and tutorial development for GIMP- Cathy Irwin, 2004 The Development of Image Completion and Tutorial Plug-ins for the GIMP By: Cathy Irwin Supervisors:
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
JPEG. The JPEG Standard JPEG is an image compression standard which was accepted as an international standard in  Developed by the Joint Photographic.
JPEG CIS 658 Fall 2005.
On the Use of Standards for Microarray Lossless Image Compression Author :Armando J. Pinho*, Antonio R. C.Paiva, and Antonio J. R. Neves Source :IEEE TRANSACTIONS.
Spatial Modeling – some fundamentals for Robot Kinematics ME 3230.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
1 University of Texas at Austin Machine Learning Group 图像与视频处理 计算机学院 Motion Detection and Estimation.
Eye regions localization Balázs Harangi – University of Debrecen Ciprian Pop – Technical University of Cluj-Napoca László Kovács – University of Debrecen.
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
Using Set Partitioning in Hierarchical Trees in the EZW Algorithm Yeon Hyang Kim William L’Huillier.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
PC-Trees & PQ-Trees. 2 Table of contents Review of PQ-trees –Template operations Introducing PC-trees The PC-tree algorithm –Terminal nodes –Splitting.
Presented by: Idan Aharoni
Nottingham Image Analysis School, 23 – 25 June NITS Image Segmentation Guoping Qiu School of Computer Science, University of Nottingham
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Morphological Image Processing (Chapter 9) CSC 446 Lecturer: Nada ALZaben.
Learning and Removing Cast Shadows through a Multidistribution Approach Nicolas Martel-Brisson, Andre Zaccarin IEEE TRANSACTIONS ON PATTERN ANALYSIS AND.
Image Mosaicing with Motion Segmentation from Video Augusto Roman, Taly Gilat EE392J Final Project 03/20/01.
Technological Uncanny K. S'hell, C Kurtz, N. Vincent et E. André et M. Beugnet 1.
3D Perception and Environment Map Generation for Humanoid Robot Navigation A DISCUSSION OF: -BY ANGELA FILLEY.
Content Based Coding of Face Images
EE368 Final Project Spring 2003
Fast Preprocessing for Robust Face Sketch Synthesis
Huffman Coding, Arithmetic Coding, and JBIG2
GAM 325/425: Applied 3D Geometry
Computer Vision Lecture 5: Binary Image Processing
Fitting Curve Models to Edges
A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers Weidong Min , Mengdan Fan, Xiaoguang Guo, and Qing.
Similarity Study Guide Name: _____________________________________
VMorph: Motion and Feature-Based Video Metamorphosis
Joint Compression and Restoration of Documents with Bleed-through
Image Coding and Compression
Grape Detection in Vineyards
Image and Video Processing
第 九 章 影像邊緣偵測 9-.
Presentation transcript:

1. Problem Many archived two-sided manuscript documents suffer from bleed-through; Bleed-through can be effectively removed offline using image-processing algorithms; A remotely located researcher may want to access both original and corrected versions of a document; We want to avoid sending the document twice, since both versions are very similar. RectoVerso

3. Algorithm Details We assume that the continuous recto and verso image coordinate frames are related by a six-parameter affine transformation We search for a parameter vector that gives the best match between the recto and the transformed flipped verso, in the least-squares sense We identify the registered verso image Registration

4. Joint Compression Based on existing standards Original, uncorrected image compressed with standard efficient compression scheme such as JPEG or JPEG 2000 Segmentation map compressed using efficient bilevel compression scheme, such as JBIG or JBIG2 Additional information for inpainting transmitted as side information ++  4.6Mbit131 kbit

2. Bleed-through Removal We assume the existence of underlying recto and verso images without bleed-though. These consist of the background, with the writing, superimposed. These ideal recto and verso images are combined in some way to produce the observed recto and verso images corrupted with bleed- through (see above). In general, the scanned recto and verso images (with bleed-through) will not be aligned. Recto and flipped verso images superimposed Model

Segmentation We segment each side of the document into the four regions R1-R4. However, it is most important to correctly identify region R2, ‘bleed-through only’. If we miss some parts of R2, bleed- through will remain. If the label R2 is incorrectly assigned to some parts of R1, ‘foreground only’ or R4 ‘foreground and bleed-through’, then parts of the desired writing will be erased. 1.We first identify points that can be considered to definitely be background (R3), because they are lighter than a certain threshold. 2.We then identify points that can be considered to foreground (R1), because they are darker than corresponding points on the other side. 3.Of the remaining points, those whose correlation between the two sides exceeds a correlation threshold are deemed to be bleedthrough (R2). The rest are assigned to R4.

Original with bleed-throughWith bleed-through removal

Algorithm Registration: Alignment of recto and flipped verso Segmentation: Four regions 1.R1: Foreground only 2.R2: Bleed-through only 3.R3: Background 4.R4: Foreground and bleedthrough overlap Inpainting: Region R2 filled in with estimate of background Recto and flipped verso images, superimposed after registration Illustration of four types of regions Inpainting applied to circled region

Inpainting Points labelled R2 ‘bleed-through’ are replaced by suitable nearby points from the background region R3. In the initial work, a fixed value was used.

5. Conclusion Bleed-through can be effectively removed by jointly processing recto and verso sides of document. More complex bleed-through removal algorithms can be used at the server side, with the result transmitted to the remote user. It is not necessary to separately transmit original and corrected versions to a user who wishes to see both. All elements can be incorporated into JPEG2000. More work needs to be done on the segmentation and inpainting aspects of the algorithm.