# Patent

## Title
Embedded interaction code enabled surface type identification

## Abstract

At least one image captured from a printed document and at least one image captured from a display surface other than a printed document are processed. A surface-type-identification module accepts as input both types of images and identifies, for a particular image, the type of surface from which the image was captured. A display-surface-preprocessing module preprocesses the at least one embedded-interaction-code image captured from a display surface other than a printed document. A printed-document-preprocessing module preprocesses the at least one embedded-interaction-code images captured from a printed document. An embedded-interaction-code-processing module outputs location information for at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document.

## Background
BACKGROUND
Computer users are accustomed to using a mouse and keyboard as a way of interacting with a personal computer. While personal computers provide a number of advantages over written documents, most users continue to perform certain functions using printed paper. Some of these functions include reading and annotating written documents. In the case of annotations, the printed document assumes a greater significance because of the annotations made on it by the user. One of the difficulties, however, with having a printed document with annotations is the need to have the annotations subsequently entered back into the electronic form of the document. This requires the original user or another user to wade through the annotations and enter them into a personal computer. In some cases, a user will scan in the annotations and the original text, thereby creating a new document. These multiple steps make the interaction between the printed document and the electronic version of the document difficult to handle on a repeated basis. Further, scanned-in images are frequently non-modifiable. There may be no way to separate the annotations from the original text. This makes using the annotations difficult. Accordingly, an improved way of handling annotations would be desirable.
One technique for capturing handwritten information is by using an image capturing pen whose location may be determined during writing. One image capturing pen that provides this capability is the Anoto pen by Anoto Inc. This pen functions by using a camera to capture an image of paper encoded with a predefined pattern. An example of the image pattern is shown in FIG. 11. This pattern is used by the Anoto pen to determine a location of the pen on a piece of paper (or other positionally encoded medium).
BRIEF SUMMARY
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
At least one image captured from a printed document and at least one image captured from a display surface other than a printed document are processed. A surface-type-identification module accepts as input both types of images and identifies, for a particular image, the type of surface from which the image was captured. A display-surface-preprocessing module preprocesses the at least one embedded-interaction-code image captured from a display surface other than a printed document. A printed-document-preprocessing module preprocesses the at least one embedded-interaction-code images captured from a printed document. An embedded-interaction-code-processing module outputs location information for at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document.



BRIEF DESCRIPTION OF THE DRAWINGS
The foregoing Summary, as well as the following Detailed Description, is better understood when read in conjunction with the accompanying drawings, which are included by way of example, and not by way of limitation, with regard to the claimed invention.
FIG. 1 shows a general description of a computer that may be used in conjunction with embodiments of the present invention.
FIGS. 2A and 2B show an image capture system and corresponding captured image in accordance with embodiments of the present invention.
FIGS. 3A through 3F show various sequences and folding techniques in accordance with embodiments of the present invention.
FIGS. 4A through 4E show various encoding systems in accordance with embodiments of the present invention.
FIGS. 5A through 5D show four possible resultant corners associated with the encoding system according to FIGS. 4A and 4B.
FIG. 6 shows rotation of a captured image portion in accordance with embodiments of the present invention.
FIG. 7 shows various angles of rotation used in conjunction with the coding system of FIGS. 4A through 4E.
FIG. 8 shows a process for determining the location of a captured array in accordance with embodiments of the present invention.
FIG. 9 shows a method for determining the location of a captured image in accordance with embodiments of the present invention.
FIG. 10 shows another method for determining the location of captured image in accordance with embodiments of the present invention.
FIG. 11 shows a representation of encoding space in a document according to prior art.
FIG. 12 shows a flow diagram for decoding extracted bits from a captured image in accordance with embodiments of the present invention.
FIG. 13 shows an inverted version of an image captured from a display screen.
FIG. 14 shows a typical image captured from a printed EIC document.
FIG. 15 illustrates an example of an image illumination normalization module that may be employed to normalize the illumination of an image according to various embodiments of the invention.
FIGS. 16A and 16B illustrate a flowchart describing the operation of the image illumination normalization module illustrated in FIG. 15.
FIG. 17 illustrates an example of an image that might be processed by the image illumination normalization module illustrated in FIG. 15.
FIG. 18 illustrates the segmentation of the image into blocks starting from the top of the image.
FIG. 19 illustrates the segmentation of the image into blocks starting from the bottom of the image.
FIG. 20 illustrates one example of a type of histogram that might be employed by various embodiments of the invention to estimate the illumination of a block.
FIG. 21 illustrates the illumination value information obtained using the operation described in FIGS. 16A and 16B.
FIGS. 22 and 23 illustrate the different regions for which interpolation is used to determine the illumination value information according to various embodiments of the invention.
FIGS. 24 illustrates the illumination distribution values obtained for the image shown in FIG. 6 using the operation described in FIGS. 16A and 16B.
FIG. 25 illustrates how the image shown in FIG. 6 appears after being processed using the operation described in FIGS. 16A and 16B.
FIG. 26 illustrates a pattern determination system for distinguishing a location pattern from content in a document image according to various embodiments of the invention.
FIGS. 27A and 27B illustrate a flowchart describing the operation of the pattern determination system illustrated in FIG. 26.
FIG. 28 illustrates the high-contrast areas identified using the operation described in FIGS. 27A and 27B.
FIG. 29 illustrate an example of a gray-level histogram used to determine a content illumination threshold according to various examples of the invention.
FIG. 30 illustrates a relationship between neighboring pixels.
FIG. 31 illustrates an image that has been processed using the operation described in FIGS. 16A, 16B, 27A and 27B.
FIG. 32 shows a system, in accordance with embodiments of the invention, for processing EIC images captured from printed documents and EIC images captured from display surfaces other than a printed document.
FIG. 33 shows an embodiment of the surface-type-identification module of FIG. 32.
FIG. 34 shows an alternate embodiment of the surface-type-identification module of FIG. 32.
FIG. 35 shows steps, in accordance with embodiments of the invention, for processing EIC images captured from printed documents and EIC images captured from display surfaces other than a printed document.
FIG. 36 shows an embodiment of the identify-surface-type step of FIG. 35.
FIG. 37 shows an alternate embodiment of the identify-surface-type step of FIG. 35.
FIG. 38 shows an embedded interaction code-enabled display in accordance with embodiments of the invention.



DETAILED DESCRIPTION
The following is separated by subheadings for the benefit of the reader. The subheadings include: terms, general-purpose computer, image capturing pen, encoding of array, decoding, error correction, location determination, and embedded interaction code enabled surface type identification.
Terms
Pen—any writing implement that may or may not include the ability to store ink. In some examples, a stylus with no ink capability may be used as a pen in accordance with embodiments of the present invention.
Camera—an image capture system that captures an image from paper or any other medium.
General Purpose Computer
FIG. 1 is a functional block diagram of an example of a conventional general-purpose digital computing environment that can be used to implement various aspects of the present invention. In FIG. 1, a computer 100 includes a processing unit 110, a system memory 120, and a system bus 130 that couples various system components including the system memory to the processing unit 110. The system bus 130 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory 120 includes read only memory (ROM) 140 and random access memory (RAM) 150.
A basic input/output system 160 (BIOS), containing the basic routines that help to transfer information between elements within the computer 100, such as during start-up, is stored in the ROM 140. The computer 100 also includes a hard disk drive 170 for reading from and writing to a hard disk (not shown), a magnetic disk drive 180 for reading from or writing to a removable magnetic disk 190, and an optical disk drive 191 for reading from or writing to a removable optical disk 192 such as a CD ROM or other optical media. The hard disk drive 170, magnetic disk drive 180, and optical disk drive 191 are connected to the system bus 130 by a hard disk drive interface 192, a magnetic disk drive interface 193, and an optical disk drive interface 194, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 100. It will be appreciated by those skilled in the art that other types of computer readable media that can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the example operating environment.
A number of program modules can be stored on the hard disk drive 170, magnetic disk 190, optical disk 192, ROM 140 or RAM 150, including an operating system 195, one or more application programs 196, other program modules 197, and program data 198. A user can enter commands and information into the computer 100 through input devices such as a keyboard 101 and pointing device 102. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner or the like. These and other input devices are often connected to the processing unit 110 through a serial port interface 106 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB). Further still, these devices may be coupled directly to the system bus 130 via an appropriate interface (not shown). A monitor 107 or other type of display device is also connected to the system bus 130 via an interface, such as a video adapter 108. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers. In a preferred embodiment, a pen digitizer 165 and accompanying pen or stylus 166 are provided in order to digitally capture freehand input. Although a direct connection between the pen digitizer 165 and the serial port is shown, in practice, the pen digitizer 165 may be coupled to the processing unit 110 directly, via a parallel port or other interface and the system bus 130 as known in the art. Furthermore, although the digitizer 165 is shown apart from the monitor 107, it is preferred that the usable input area of the digitizer 165 be co-extensive with the display area of the monitor 107. Further still, the digitizer 165 may be integrated in the monitor 107, or may exist as a separate device overlaying or otherwise appended to the monitor 107.
The computer 100 can operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 109. The remote computer 109 can be a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 100, although only a memory storage device 111 has been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 112 and a wide area network (WAN) 113. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 100 is connected to the local network 112 through a network interface or adapter 114. When used in a WAN networking environment, the personal computer 100 typically includes a modem 115 or other means for establishing a communications over the wide area network 113, such as the Internet. The modem 115, which may be internal or external, is connected to the system bus 130 via the serial port interface 106. In a networked environment, program modules depicted relative to the personal computer 100, or portions thereof, may be stored in the remote memory storage device.
It will be appreciated that the network connections shown are illustrative and other techniques for establishing a communications link between the computers can be used. The existence of any of various well-known protocols such as TCP/IP, Ethernet, FTP, HTTP, Bluetooth, IEEE 802.11x and the like is presumed, and the system can be operated in a client-server configuration to permit a user to retrieve web pages from a web-based server. Any of various conventional web browsers can be used to display and manipulate data on web pages.
Image Capturing Pen
Aspects of the present invention include placing an encoded data stream in a displayed form that represents the encoded data stream. (For example, as will be discussed with FIG. 4B, the encoded data stream is used to create a graphical pattern.) The displayed form may be printed paper (or other physical medium) or may be a display projecting the encoded data stream in conjunction with another image or set of images. For example, the encoded data stream may be represented as a physical graphical image on the paper or a graphical image overlying the displayed image (e.g., representing the text of a document) or may be a physical (non-modifiable) graphical image on a display screen (so any image portion captured by a pen is locatable on the display screen).
This determination of the location of a captured image may be used to determine the location of a user's interaction with the paper, medium, or display screen. In some aspects of the present invention, the pen may be an ink pen writing on paper. In other aspects, the pen may be a stylus with the user writing on the surface of a computer display. Any interaction may be provided back to the system with knowledge of the encoded image on the document or supporting the document displayed on the computer screen. By repeatedly capturing images with a camera in the pen or stylus as the pen or stylus traverses a document, the system can track movement of the stylus being controlled by the user. The displayed or printed image may be a watermark associated with the blank or content-rich paper or may be a watermark associated with a displayed image or a fixed coding overlying a screen or built into a screen.
FIGS. 2A and 2B show an illustrative example of pen 201 with a camera 203. Pen 201 includes a tip 202 that may or may not include an ink reservoir. Camera 203 captures an image 204 from surface 207. Pen 201 may further include additional sensors and/or processors as represented in broken box 206. These sensors and/or processors 206 may also include the ability to transmit information to another pen 201 and/or a personal computer (for example, via Bluetooth or other wireless protocols).
FIG. 2B represents an image as viewed by camera 203. In one illustrative example, the field of view of camera 203 (i.e., the resolution of the image sensor of the camera) is 32×32 pixels (where N=32). In the embodiment, a captured image (32 pixels by 32 pixels) corresponds to an area of approximately 5 mm by 5 mm of the surface plane captured by camera 203. Accordingly, FIG. 2B shows a field of view of 32 pixels long by 32 pixels wide. The size of N is adjustable, such that a larger N corresponds to a higher image resolution. Also, while the field of view of the camera 203 is shown as a square for illustrative purposes here, the field of view may include other shapes as is known in the art.
The images captured by camera 203 may be defined as a sequence of image frames {Ii}, where Ii is captured by the pen 201 at sampling time ti. The sampling rate may be large or small, depending on system configuration and performance requirement. The size of the captured image frame may be large or small, depending on system configuration and performance requirement.
The image captured by camera 203 may be used directly by the processing system or may undergo pre-filtering. This pre-filtering may occur in pen 201 or may occur outside of pen 201 (for example, in a personal computer).
The image size of FIG. 2B is 32×32 pixels. If each encoding unit size is 3×3 pixels, then the number of captured encoded units would be approximately 100 units. If the encoding unit size is 5×5 pixels, then the number of captured encoded units is approximately 36.
FIG. 2A also shows the image plane 209 on which an image 210 of the pattern from location 204 is formed. Light received from the pattern on the object plane 207 is focused by lens 208. Lens 208 may be a single lens or a multi-part lens system, but is represented here as a single lens for simplicity. Image capturing sensor 211 captures the image 210.
The image sensor 211 may be large enough to capture the image 210. Alternatively, the image sensor 211 may be large enough to capture an image of the pen tip 202 at location 212. For reference, the image at location 212 is referred to as the virtual pen tip. It is noted that the virtual pen tip location with respect to image sensor 211 is fixed because of the constant relationship between the pen tip, the lens 208, and the image sensor 211.
The following transformation FS→P transforms position coordinates in the image captured by camera to position coordinates in the real image on the paper:

Lpaper=FS→P(LSensor).

During writing, the pen tip and the paper are on the same plane. Accordingly, the transformation from the virtual pen tip to the real pen tip is also FS→P:

Lpentip=FS→P(Lvirtual-pentip).

The transformation FS→P may be estimated as an affine transform, which approximates FS→P as:




  
    
      F
      
        S
        ->
        P
      
      ′
    
    =
    
      [
      
        
          
            
              
                sin
                ⁢
                
                  
                
                ⁢
                
                  θ
                  y
                
              
              
                s
                x
              
            
          
          
            
              
                cos
                ⁢
                
                  
                
                ⁢
                
                  θ
                  y
                
              
              
                s
                x
              
            
          
          
            0
          
        
        
          
            
              
                
                  -
                  sin
                
                ⁢
                
                  
                
                ⁢
                
                  θ
                  x
                
              
              
                s
                y
              
            
          
          
            
              
                cos
                ⁢
                
                  
                
                ⁢
                
                  θ
                  x
                
              
              
                s
                y
              
            
          
          
            0
          
        
        
          
            0
          
          
            0
          
          
            1
          
        
      
      ]
    
  
  ,




in which θx, θy, sx, and sy are the rotation and scale of two orientations of the pattern captured at location 204. Further, one can refine F′S→P by matching the captured image with the corresponding real image on paper. “Refine” means to get a more precise estimation of the transformation FS→P by a type of optimization algorithm referred to as a recursive method. The recursive method treats the matrix F′S→P as the initial value. The refined estimation describes the transformation between S and P more precisely.

Next, one can determine the location of virtual pen tip by calibration.
One places the pen tip 202 on a fixed location Lpentip on paper. Next, one tilts the pen, allowing the camera 203 to capture a series of images with different pen poses. For each image captured, one may obtain the transformation FS→P. From this transformation, one can obtain the location of the virtual pen tip Lvirtual-pentip:

Lvirtual-pentip=FP→S(Lpentip),

where Lpentip is initialized as (0, 0) and

FP→S=(FS→P)−1.

By averaging the Lvirtual-pentip obtained from each image, a location of the virtual pen tip Lvirtual-pentip may be determined. With Lvirtual-pentip, one can get a more accurate estimation of Lpentip. After several times of iteration, an accurate location of virtual pen tip Lvirtual-pentip may be determined.
The location of the virtual pen tip Lvirtual-pentip is now known. One can also obtain the transformation FS→P from the images captured. Finally, one can use this information to determine the location of the real pen tip Lpentip:

Lpentip=FS→P(Lvirtual-pentip).

Encoding of Array

A two-dimensional array may be constructed by folding a one-dimensional sequence. Any portion of the two-dimensional array containing a large enough number of bits may be used to determine its location in the complete two-dimensional array. However, it may be necessary to determine the location from a captured image or a few captured images. So as to minimize the possibility of a captured image portion being associated with two or more locations in the two-dimensional array, a non-repeating sequence may be used to create the array. One property of a created sequence is that the sequence does not repeat over a particular length (or window size). The following describes the creation of the one-dimensional sequence then the folding of the sequence into an array.
Sequence Construction
A sequence of numbers may be used as the starting point of the encoding system. For example, a sequence (also referred to as an m-sequence) may be represented as a q-element set in field Fq. Here, q=pn, where n≧1 and p is a prime number. The sequence or m-sequence may be generated by a variety of different techniques including, but not limited to, polynomial division. Using polynomial division, the sequence may be defined as follows:




  
    
      
        R
        l
      
      ⁡
      
        (
        x
        )
      
    
    
      
        P
        n
      
      ⁡
      
        (
        x
        )
      
    
  
  ,




where Pn(x) is a primitive polynomial of degree n in field Fq[x] (having qn elements). Rl(x) is a nonzero polynomial of degree l (where l<n) in field Fq[x]. The sequence may be created using an iterative procedure with two steps: first, dividing the two polynomials (resulting in an element of field Fq) and, second, multiplying the remainder by x. The computation stops when the output begins to repeat. This process may be implemented using a linear feedback shift register as set forth in an article by Douglas W. Clark and Lih-Jyh Weng, “Maximal and Near-Maximal Shift Register Sequences: Efficient Event Counters and Easy Discrete Logarithms,” IEEE Transactions on Computers 43.5 (May 1994, pp 560-568). In this environment, a relationship is established between cyclical shifting of the sequence and polynomial Rl(x): changing Rl(x) only cyclically shifts the sequence and every cyclical shifting corresponds to a polynomial Rl(x). One of the properties of the resulting sequence is that, the sequence has a period of qn−1 and within a period, over a width (or length) n, any portion exists once and only once in the sequence. This is called the “window property”. Period qn−1 is also referred to as the length of the sequence and n as the order of the sequence. In our implementation, q is chosen as 2.

The process described above is but one of a variety of processes that may be used to create a sequence with the window property.
Array Construction
The array (or m-array) that may be used to create the image (of which a portion may be captured by the camera) is an extension of the one-dimensional sequence or m-sequence. Let A be an array of period (m1, m2), namely A(k+m1,l)=A(k,l+m2)=A(k,l). When an n1×n2 window shifts through a period of A, all the nonzero n1×n2 matrices over Fq appear once and only once. This property is also referred to as a “window property” in that each window is unique. A widow may then be expressed as an array of period (m1, m2) (with m1 and m2 being the horizontal and vertical number of bits present in the array) and order (n1, n2).
A binary array (or m-array) may be constructed by folding the sequence. One approach is to obtain a sequence then fold it to a size of m1×m2 where the length of the array is L=m1×m2=2n−1. Alternatively, one may start with a predetermined size of the space that one wants to cover (for example, one sheet of paper, 30 sheets of paper or the size of a computer monitor), determine the area (m1×m2), then use the size to let L≧m1×m2, where L=2n−1.
A variety of different folding techniques may be used. For example, FIGS. 3A through 3C show three different sequences. Each of these may be folded into the array shown as FIG. 3D. The three different folding methods are shown as the overlay in FIG. 3D and as the raster paths in FIGS. 3E and 3F. We adopt the folding method shown in FIG. 3D.
To create the folding method as shown in FIG. 3D, one creates a sequence {ai} of length L and order n. Next, an array {bkl} of size m1×m2, where gcd(m1, m2)=1 and L=m1×m2 is created from the sequence {ai} by letting each bit of the array be calculated as shown by equation 1:

bkl=ai, where k=imod(m1), l=imod(m2), i=0, . . . , L−1.  (1)

This folding approach may be alternatively expressed as laying the sequence on the diagonal of the array, then continuing from the opposite edge when an edge is reached.
FIG. 4A shows sample encoding techniques that may be used to encode the array of FIG. 3D. It is appreciated that other encoding techniques may be used. For example, an alternative coding technique is shown in FIG. 11.
Referring to FIG. 4A, a first bit 401 (for example, “1”) is represented by a column of dark ink. A second bit 402 (for example, “0”) is represented by a row of dark ink. It is appreciated that any color ink may be used to represent the various bits. The only requirement in the color of the ink chosen is that it provides a significant contrast with the background of the medium to be differentiable by an image capture system. The bits in FIG. 4A are represented by a 3×3 matrix of cells. The size of the matrix may be modified to be any size as based on the size and resolution of an image capture system. Alternative representation of bits 0 and 1 are shown in FIGS. 4C-4E. It is appreciated that the representation of a one or a zero for the sample encodings of FIGS. 4A-4E may be switched without effect. FIG. 4C shows bit representations occupying two rows or columns in an interleaved arrangement. FIG. 4D shows an alternative arrangement of the pixels in rows and columns in a dashed form. Finally FIG. 4E shows pixel representations in columns and rows in an irregular spacing format (e.g., two dark dots followed by a blank dot).
Referring back to FIG. 4A, if a bit is represented by a 3×3 matrix and an imaging system detects a dark row and two white rows in the 3×3 region, then a zero is detected (or one). If an image is detected with a dark column and two white columns, then a one is detected (or a zero).
Here, more than one pixel or dot is used to represent a bit. Using a single pixel (or bit) to represent a bit is fragile. Dust, creases in paper, non-planar surfaces, and the like create difficulties in reading single bit representations of data units. However, it is appreciated that different approaches may be used to graphically represent the array on a surface. Some approaches are shown in FIGS. 4C through 4E. It is appreciated that other approaches may be used as well. One approach is set forth in FIG. 11 using only space-shifted dots.
A bit stream is used to create the graphical pattern 403 of FIG. 4B. Graphical pattern 403 includes 12 rows and 18 columns. The rows and columns are formed by a bit stream that is converted into a graphical representation using bit representations 401 and 402. FIG. 4B may be viewed as having the following bit representation:




  
    [
    
      
        
          0
        
        
          1
        
        
          0
        
        
          1
        
        
          0
        
        
          1
        
        
          1
        
        
          1
        
        
          0
        
      
      
        
          1
        
        
          1
        
        
          0
        
        
          1
        
        
          1
        
        
          0
        
        
          0
        
        
          1
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          1
        
        
          0
        
        
          1
        
        
          0
        
        
          0
        
        
          1
        
        
          1
        
      
      
        
          1
        
        
          0
        
        
          1
        
        
          1
        
        
          0
        
        
          1
        
        
          1
        
        
          0
        
        
          0
        
      
    
    ]
  
   




Decoding

When a person writes with the pen of FIG. 2A or moves the pen close to the encoded pattern, the camera captures an image. For example, pen 201 may utilize a pressure sensor as pen 201 is pressed against paper and pen 201 traverses a document on the paper. The image is then processed to determine the orientation of the captured image with respect to the complete representation of the encoded image and extract the bits that make up the captured image.
For the determination of the orientation of the captured image relative to the whole encoded area, one may notice that not all the four conceivable corners shown in FIG. 5A-5D can present in the graphical pattern 403. In fact, with the correct orientation, the type of corner shown in FIG. 5A cannot exist in the graphical pattern 403. Therefore, the orientation in which the type of corner shown in FIG. 5A is missing is the right orientation.
Continuing to FIG. 6, the image captured by a camera 601 may be analyzed and its orientation determined so as to be interpretable as to the position actually represented by the image 601. First, image 601 is reviewed to determine the angle θ needed to rotate the image so that the pixels are horizontally and vertically aligned. It is noted that alternative grid alignments are possible including a rotation of the underlying grid to a non-horizontal and vertical arrangement (for example, 45 degrees). Using a non-horizontal and vertical arrangement may provide the probable benefit of eliminating visual distractions from the user, as users may tend to notice horizontal and vertical patterns before others. For purposes of simplicity, the orientation of the grid (horizontal and vertical and any other rotation of the underlying grid) is referred to collectively as the predefined grid orientation.
Next, image 601 is analyzed to determine which corner is missing. The rotation amount o needed to rotate image 601 to an image ready for decoding 603 is shown as o=(θ plus a rotation amount {defined by which corner missing}). The rotation amount is shown by the equation in FIG. 7. Referring back to FIG. 6, angle θ is first determined by the layout of the pixels to arrive at a horizontal and vertical (or other predefined grid orientation) arrangement of the pixels and the image is rotated as shown in 602. An analysis is then conducted to determine the missing corner and the image 602 rotated to the image 603 to set up the image for decoding. Here, the image is rotated 90 degrees counterclockwise so that image 603 has the correct orientation and can be used for decoding.
It is appreciated that the rotation angle θ may be applied before or after rotation of the image 601 to account for the missing corner. It is also appreciated that by considering noise in the captured image, all four types of corners may be present. We may count the number of corners of each type and choose the type that has the least number as the corner type that is missing.
Finally, the code in image 603 is read out and correlated with the original bit stream used to create image 403. The correlation may be performed in a number of ways. For example, it may be performed by a recursive approach in which a recovered bit stream is compared against all other bit stream fragments within the original bit stream. Second, a statistical analysis may be performed between the recovered bit stream and the original bit stream, for example, by using a Hamming distance between the two bit streams. It is appreciated that a variety of approaches may be used to determine the location of the recovered bit stream within the original bit stream.
As will be discussed, EIC pattern analysis obtains recovered bits from image 603. Once one has the recovered bits, one needs to locate the captured image within the original array (for example, the one shown in FIG. 4B). The process of determining the location of a segment of bits within the entire array is complicated by a number of items. First, the actual bits to be captured may be obscured (for example, the camera may capture an image with handwriting that obscures the original code). Second, dust, creases, reflections, and the like may also create errors in the captured image. These errors make the localization process more difficult. In this regard, the image capture system may need to function with non-sequential bits extracted from the image. The following represents a method for operating with non-sequential bits from the image.
Let the sequence (or m-sequence) I correspond to the power series I(x)=1/Pn(x), where n is the order of the m-sequence, and the captured image contains K bits of I b=(b0 b1 b2 . . . bk−1)t, where K≧n and the superscript t represents a transpose of the matrix or vector. The location s of the K bits is just the number of cyclic shifts of I so that b0 is shifted to the beginning of the sequence. Then this shifted sequence R corresponds to the power series xs/Pn(x), or R=Ts(I), where T is the cyclic shift operator. We find this s indirectly. The polynomials modulo Pn(x) form a field. It is guaranteed that xs≡r0+r1x+ . . . rn−1xn−1mod(Pn(x)). Therefore, we may find (r0,r1, . . . , rn−1) and then solve for s.
The relationship xs≡r0+r1x+ . . . rn−1xn−1mod(Pn(x)) implies that R=r0+r1T(I)+ . . . +rn−1Tn−1(I). Written in a binary linear equation, it becomes:

R=rtA  (2)

where r=(r0 r1 r2 . . . rn−1)t, and A=(I T(I) . . . Tn−1(I)t which consists of the cyclic shifts of I from 0-shift to (n−1)-shift. Now only sparse K bits are available in R to solve r. Let the index differences between bi and b0 in R be ki, i=1, 2, . . . , k−1, then the 1st and (ki+1)-th elements of R, i=1, 2, . . . , k−1, are exactly b0, b1, . . . , bk−1. By selecting the 1st and (ki+1)-th columns of A, i=1, 2, . . . , k−1, the following binary linear equation is formed:

bt=rtM  (3)

    
    
        where M is an n×K sub-matrix of A.
    
    


If b is error-free, the solution of r may be expressed as:

rt={tilde over (b)}t{tilde over (M)}−1  (4)

where {tilde over (M)} is any non-degenerate n×n sub-matrix of M and {tilde over (b)} is the corresponding sub-vector of b.
With known r, we may use the Pohlig-Hellman-Silver algorithm as noted by Douglas W. Clark and Lih-Jyh Weng, “Maximal and Near-Maximal Shift Register Sequences: Efficient Event Counters and Easy Discrete Logorithms,” IEEE Transactions on Computers 43.5 (May 1994, pp 560-568) to find s so that xs≡r0+r1x+ . . . rn−1xn−1mod(Pn(x)).
As matrix A (with the size of n by L, where L=2n−1) may be huge, we should avoid storing the entire matrix A. In fact, as we have seen in the above process, given extracted bits with index difference ki, only the first and (ki+1)-th columns of A are relevant to the computation. Such choices of ki is quite limited, given the size of the captured image. Thus, only those columns that may be involved in computation need to saved. The total number of such columns is much smaller than L (where L=2n−1) is the length of the m-sequence).
Error Correction
If errors exist in b, then the solution of r becomes more complex. Traditional methods of decoding with error correction may not readily apply, because the matrix M associated with the captured bits may change from one captured image to another.
We adopt a stochastic approach. Assuming that the number of error bits in b, ne, is relatively small compared to K, then the probability of choosing correct n bits from the K bits of b and the corresponding sub-matrix {tilde over (M)} of M being non-degenerate is high.
When the n bits chosen are all correct, the Hamming distance between bt and rtM, or the number of error bits associated with r, should be minimal, where r is computed via equation (4). Repeating the process for several times, it is likely that the correct r that results in the minimal error bits can be identified.
If there is only one r that is associated with the minimum number of error bits, then it is regarded as the correct solution. Otherwise, if there is more than one r that is associated with the minimum number of error bits, the probability that ne exceeds the error correcting ability of the code generated by M is high and the decoding process fails. The system then may move on to process the next captured image. In another implementation, information about previous locations of the pen can be taken into consideration. That is, for each captured image, a destination area where the pen may be expected next can be identified. For example, if the user has not lifted the pen between two image captures by the camera, the location of the pen as determined by the second image capture should not be too far away from the first location. Each r that is associated with the minimum number of error bits can then be checked to see if the location s computed from r satisfies the local constraint, i.e., whether the location is within the destination area specified.
If the location s satisfies the local constraint, the X, Y positions of the extracted bits in the array are returned. If not, the decoding process fails.
FIG. 8 depicts a process that may be used to determine a location in a sequence (or m-sequence) of a captured image. First, in step 801, a data stream relating to a captured image is received. In step 802, corresponding columns are extracted from A and a matrix M is constructed.
In step 803, n independent column vectors are randomly selected from the matrix M and vector r is determined by solving equation (4). This process is performed Q times (for example, 100 times) in step 804. The determination of the number of loop times is discussed in the section Loop Times Calculation.
In step 805, r is sorted according to its associated number of error bits. The sorting can be done using a variety of sorting algorithms as known in the art. For example, a selection sorting algorithm may be used. The selection sorting algorithm is beneficial when the number Q is not large. However, if Q becomes large, other sorting algorithms (for example, a merge sort) that handle larger numbers of items more efficiently may be used.
The system then determines in step 806 whether error correction was performed successfully, by checking whether multiple r's are associated with the minimum number of error bits. If yes, an error is returned in step 809, indicating the decoding process failed. If not, the position s of the extracted bits in the sequence (or m-sequence) is calculated in step 807, for example, by using the Pohig-Hellman-Silver algorithm.
Next, the (X,Y) position in the array is calculated as: x=s mod m1 and y=s mod m2 and the results are returned in step 808.
Location Determination
FIG. 9 shows a process for determining the location of a pen tip. The input is an image captured by a camera and the output may be a position coordinates of the pen tip. Also, the output may include (or not) other information such as a rotation angle of the captured image.
In step 901, an image is received from a camera. Next, the received image may be optionally preprocessed in step 902 (as shown by the broken outline of step 902) to adjust the contrast between the light and dark pixels and the like.
Next, in step 903, the image is analyzed to determine the bit stream within it.
Next, in step 904, n bits are randomly selected from the bit stream for multiple times and the location of the received bit stream within the original sequence (or m-sequence) is determined.
Finally, once the location of the captured image is determined in step 904, the location of the pen tip may be determined in step 905.
FIG. 10 gives more details about 903 and 904 and shows the approach to extract the bit stream within a captured image. First, an image is received from the camera in step 1001. The image then may optionally undergo image preprocessing in step 1002 (as shown by the broken outline of step 1002). The pattern is extracted in step 1003. Here, pixels on the various lines may be extracted to find the orientation of the pattern and the angle θ.
Next, the received image is analyzed in step 1004 to determine the underlying grid lines. If grid lines are found in step 1005, then the code is extracted from the pattern in step 1006. The code is then decoded in step 1007 and the location of the pen tip is determined in step 1008. If no grid lines were found in step 1005, then an error is returned in step 1009.
Outline of Enhanced Decoding and Error Correction Algorithm
With an embodiment of the invention as shown in FIG. 12, given extracted bits 1201 from a captured image (corresponding to a captured array) and the destination area, a variation of an m-array decoding and error correction process decodes the X,Y position. FIG. 12 shows a flow diagram of process 1200 of this enhanced approach. Process 1200 comprises two components 1251 and 1253.
Decode Once. Component 1251 includes three parts.


    
    
        random bit selection: randomly selects a subset of the extracted bits 1201 (step 1203)
        decode the subset (step 1205)
        determine X,Y position with local constraint (step 1209)

Decoding with Smart Bit Selection. Component 1253 includes four parts.

        smart bit selection: selects another subset of the extracted bits (step 1217)
        decode the subset (step 1219)
        adjust the number of iterations (loop times) of step 1217 and step 1219 (step 1221)
        determine X,Y position with local constraint (step 1225)
    
    


The embodiment of the invention utilizes a discreet strategy to select bits, adjusts the number of loop iterations, and determines the X,Y position (location coordinates) in accordance with a local constraint, which is provided to process 1200. With both components 1251 and 1253, steps 1205 and 1219 (“Decode Once”) utilize equation (4) to compute r.
Let {circumflex over (b)} be decoded bits, that is:

{circumflex over (b)}t=rtM  (5)

The difference between b and {circumflex over (b)} are the error bits associated with r.
FIG. 12 shows a flow diagram of process 1200 for decoding extracted bits 1201 from a captured image in accordance with embodiments of the present invention. Process 1200 comprises components 1251 and 1253. Component 1251 obtains extracted bits 1201 (comprising K bits) associated with a captured image (corresponding to a captured array). In step 1203, n bits (where n is the order of the m-array) are randomly selected from extracted bits 1201. In step 1205, process 1200 decodes once and calculates r. In step 1207, process 1200 determines if error bits are detected for b. If step 1207 determines that there are no error bits, X,Y coordinates of the position of the captured array are determined in step 1209. With step 1211, if the X,Y coordinates satisfy the local constraint, i.e., coordinates that are within the destination area, process 1200 provides the X,Y position (such as to another process or user interface) in step 1213. Otherwise, step 1215 provides a failure indication.
If step 1207 detects error bits in b, component 1253 is executed in order to decode with error bits. Step 1217 selects another set of n bits (which differ by at least one bit from the n bits selected in step 1203) from extracted bits 1201. Steps 1221 and 1223 determine the number of iterations (loop times) that are necessary for decoding the extracted bits. Step 1225 determines the position of the captured array by testing which candidates obtained in step 1219 satisfy the local constraint. Steps 1217-1225 will be discussed in more details.
Smart Bit Selection
Step 1203 randomly selects n bits from extracted bits 1201 (having K bits), and solves for r1. Using equation (5), decoded bits can be calculated. Let I1={kε{1, 2, . . . , K}|bk={circumflex over (b)}k}, Ī1={kε{1, 2, . . . , K}|bk≠{circumflex over (b)}k}, where {circumflex over (b)}k is the kth bit of {circumflex over (b)}, B1={bk|kεI1} and B1={bk|kεĪ1}, that is, B1 are bits that the decoded results are the same as the original bits, and B1 are bits that the decoded results are different from the original bits, I1 and Ī1 are the corresponding indices of these bits. It is appreciated that the same r1 will be obtained when any n independent bits are selected from B1. Therefore, if the next n bits are not carefully chosen, it is possible that the selected bits are a subset of B1, thus resulting in the same r1 being obtained.
In order to avoid such a situation, step 1217 selects the next n bits according to the following procedure:

    
    
        Choose at least one bit from B1 1303 and the rest of the bits randomly from B1 1301 and B1 1303, as shown in FIG. 13 corresponding to bit arrangement 1351. Process 1200 then solves r2 and finds B2 1305, 1309 and B2 1307, 1311 by computing {circumflex over (b)}2t=r2tM2. Repeat step 1. When selecting the next n bits, for every Bi (i=1, 2, 3 . . . , x−1, where x is the current loop number), there is at least one bit selected from Bi. The iteration terminates when no such subset of bits can be selected or when the loop times are reached.

Loop Times Calculation

    
    


With the error correction component 1253, the number of required iterations (loop times) is adjusted after each loop. The loop times is determined by the expected error rate. The expected error rate pe in which not all the selected n bits are correct is:




  
    
      
        
          p
          e
        
        =
        
          
            
              (
              
                1
                -
                
                  
                    C
                    
                      K
                      -
                      
                        n
                        e
                      
                    
                    n
                  
                  
                    C
                    K
                    n
                  
                
              
              )
            
            lt
          
          ≈
          
            -
            
              e
              
                -
                
                  
                    lt
                    ⁡
                    
                      (
                      
                        
                          K
                          -
                          n
                        
                        K
                      
                      )
                    
                  
                  
                    n
                    e
                  
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




where lt represents the loop times and is initialized by a constant, K is the number of extracted bits from the captured array, ne represents the minimum number of error bits incurred during the iteration of process 1200, n is the order of the m-array, and CKn is the number of combinations in which n bits are selected from K bits.

In the embodiment, we want pe to be less than e−5=0.0067. In combination with (6), we have:




  
    
      
        
          lt
          i
        
        =
        
          min
          (
          
            
              lt
              
                i
                -
                1
              
            
            ,
            
              
                5
                
                  
                    (
                    
                      
                        K
                        -
                        n
                      
                      K
                    
                    )
                  
                  
                    n
                    e
                  
                
              
              +
              1
            
          
          )
        
      
    
    
      
        (
        7
        )
      
    
  




Adjusting the loop times may significantly reduce the number of iterations of process 1253 that are required for error correction.

Determine X, Y Position with Local Constraint

In steps 1209 and 1225, the decoded position should be within the destination area. The destination area is an input to the algorithm, and it may be of various sizes and places or simply the whole m-array depending on different applications. Usually it can be predicted by the application. For example, if the previous position is determined, considering the writing speed, the destination area of the current pen tip should be close to the previous position. However, if the pen is lifted, then its next position can be anywhere. Therefore, in this case, the destination area should be the whole m-array. The correct X,Y position is determined by the following steps.
In step 1224 process 1200 selects ri whose corresponding number of error bits is less than:




  
    
      
        
          N
          e
        
        =
        
          
            
              log
              10
            
            ⁡
            
              (
              
                3
                lt
              
              )
            
          
          
            
              
                log
                10
              
              ⁡
              
                (
                
                  
                    K
                    -
                    n
                  
                  K
                
                )
              
            
            ×
            
              
                log
                10
              
              ⁡
              
                (
                
                  10
                  lr
                
                )
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




where lt is the actual loop times and lr represents the Local Constraint Rate calculated by:





  
    
      
        lr
        =
        
          
            area
            ⁢
            
              
            
            ⁢
            of
            ⁢
            
              
            
            ⁢
            the
            ⁢
            
              
            
            ⁢
            destination
            ⁢
            
              
            
            ⁢
            area
          
          L
        
      
    
    
      
        (
        9
        )
      
    
  




where L is the length of the m-array.

Step 1224 sorts ri in ascending order of the number of error bits. Steps 1225, 1211 and 1212 then finds the first ri in which the corresponding X,Y position is within the destination area. Steps 1225, 1211 and 1212 finally returns the X,Y position as the result (through step 1213), or an indication that the decoding procedure failed (through step 1215).
Illustrative Example of Enhanced Decoding and Error Correction Process
An illustrative example demonstrates process 1200 as performed by components 1251 and 1253. Suppose n=3, K=5, I=(I0 I1 . . . I6)t is the m-sequence of order n=3. Then




  
    
      
        A
        =
        
          (
          
            
              
                
                  I
                  0
                
              
              
                
                  I
                  1
                
              
              
                
                  I
                  2
                
              
              
                
                  I
                  3
                
              
              
                
                  I
                  4
                
              
              
                
                  I
                  5
                
              
              
                
                  I
                  6
                
              
            
            
              
                
                  I
                  6
                
              
              
                
                  I
                  0
                
              
              
                
                  I
                  1
                
              
              
                
                  I
                  2
                
              
              
                
                  I
                  3
                
              
              
                
                  I
                  4
                
              
              
                
                  I
                  5
                
              
            
            
              
                
                  I
                  5
                
              
              
                
                  I
                  6
                
              
              
                
                  I
                  0
                
              
              
                
                  I
                  1
                
              
              
                
                  I
                  2
                
              
              
                
                  I
                  3
                
              
              
                
                  I
                  4
                
              
            
          
          )
        
      
    
    
      
        (
        10
        )
      
    
  




Also suppose that the extracted bits b=(b0 b1 b2 b3 b4)t, where K=5, are actually the sth, (S+1)th, (s+3)th, (s+4)th, and (s+6)th bits of the m-sequence (these numbers are actually modulus of the m-array length L=2n−1=23−1=7). Therefore





  
    
      
        M
        =
        
          (
          
            
              
                
                  I
                  0
                
              
              
                
                  I
                  1
                
              
              
                
                  I
                  3
                
              
              
                
                  I
                  4
                
              
              
                
                  I
                  6
                
              
            
            
              
                
                  I
                  6
                
              
              
                
                  I
                  0
                
              
              
                
                  I
                  2
                
              
              
                
                  I
                  3
                
              
              
                
                  I
                  5
                
              
            
            
              
                
                  I
                  5
                
              
              
                
                  I
                  6
                
              
              
                
                  I
                  1
                
              
              
                
                  I
                  2
                
              
              
                
                  I
                  4
                
              
            
          
          )
        
      
    
    
      
        (
        11
        )
      
    
  




which consists of the 0th, 1st, 3rd, 4th, and 6th, columns of A. The number s, which uniquely determines the X,Y position of b0 in the m-array, can be computed after solving r=(r0 r1 r2)t that are expected to fulfill bt=rtM. Due to possible error bits in b bt=rtM may not be completely fulfilled.

Process 1200 utilizes the following procedure. Randomly select n=3 bits, say {tilde over (b)}1t=(b0 b1 b2), from b. Solving for r1:

{tilde over (b)}1t=r1t{tilde over (M)}1  (12)

where {tilde over (M)}1 consists of the 0th, 1st, and 2nd columns of M. (Note that {tilde over (M)}1 is an n×n matrix and r1t is a 1×n vector so that {tilde over (b)}1t is a 1×n vector of selected bits.)

Next, decoded bits are computed:

{circumflex over (b)}1t=r1tM  (13)

where M is an n×K matrix and r1t is a 1×n vector so that {circumflex over (b)}1t is a 1×K vector. If {circumflex over (b)}1 is identical to b, i.e., no error bits are detected, then step 1209 determines the X,Y position and step 1211 determines whether the decoded position is inside the destination area. If so, the decoding is successful, and step 1213 is performed. Otherwise, the decoding fails as indicated by step 1215. If {circumflex over (b)}1 is different from b, then error bits in b are detected and component 1253 is performed. Step 1217 determines the set B1, say {b0 b1 b2 b3}, where the decoded bits are the same as the original bits. Thus, B1={b4} (corresponding to bit arrangement 1351 in FIG. 13). Loop times (lt) is initialized to a constant, e.g., 100, which may be variable depending on the application. Note that the number of error bits corresponding to r1 is equal to 1. Then step 1221 updates the loop time (lt) according to equation (7), lt1=min(lt,13)=13.

Step 1217 next chooses another n=3 bits from b. If the bits all belong to B1, say {b0 b2 b3}, then step 1219 will determine r1 again. In order to avoid such repetition, step 1217 may select, for example, one bit {b4} from B1, and the remaining two bits {b0 b1} from B1.
The selected three bits form {tilde over (b)}2t=(b0 b1 b4). Step 1219 solves for r2:

{tilde over (b)}2t=r2t{tilde over (M)}2  (14)

where {tilde over (M)}2 consists of the 0th, 1st, and 4th columns of M.

Step 1219 computes {circumflex over (b)}2t=r2tM. Find the set B2, e.g., {b0 b1 b4}, such that {circumflex over (b)}2 and b are the same. Then B2={b2 b3} (corresponding to bit arrangement 1353 in FIG. 13). Step 1221 updates the loop times (lt) according to equation (7). Note that the number of error bits associated with r2 is equal to 2. Substituting into (7), lt2=min(lt1, 32)=13.
Because another iteration needs to be performed, step 1217 chooses another n=3 bits from b. The selected bits shall not all belong to either B1 or B2. So step 1217 may select, for example, one bit {b4} from B1, one bit {b2} from B2, and the remaining one bit {b0}.
The solution of r, bit selection, and loop times adjustment continues until we cannot select any new n=3 bits such that they do not all belong to any previous Bi's, or the maximum loop times lt is reached.
Suppose that process 1200 calculates five ri (i=1, 2, 3, 4, 5), with the number of error bits corresponding to 1, 2, 4, 3, 2, respectively. (Actually, for this example, the number of error bits cannot exceed 2, but the illustrative example shows a larger number of error bits to illustrate the algorithm.) Step 1224 selects ri's, for example, r1,r2,r4,r5, whose corresponding numbers of error bits are less than Ne shown in (8).
Step 1224 sorts the selected vectors r1,r2,r4,r5 in ascending order of their error bit numbers: r1,r2,r5,r4. From the sorted candidate list, steps 1225, 1211 and 1212 find the first vector r, for example, r5, whose corresponding position is within the destination area. Step 1213 then outputs the corresponding position. If none of the positions is within the destination area, the decoding process fails as indicated by step 1215.
Embedded Interaction Code Enabled Surface Type Identification
Embedded Interaction Code (EIC) technology refers to a kind of data embedding and encoding technology that enables embedding both x-y position data and metadata to various surfaces, including, but not limited to, paper, a whiteboard, a display screen, and the like. A display screen may be a liquid crystal display (LCD), an organic light-emitting device (OLED), a plasma display, or the like.
LCD is a display technology that uses rod-shaped molecules (liquid crystals) that flow like liquid and bend light. Unenergized, the crystals direct light through two polarizing filters, allowing a natural background color to show. When energized, they redirect the light to be absorbed in one of the polarizers, causing the dark appearance of crossed polarizers to show.
An OLED is (also referred to as an Organic Light Emitting Diode) is a thin-film, light-emitting device that typically consists of a series of organic layers between two electrical contacts (electrodes). OLEDs can be made using small-molecular weight organic materials or polymer-based materials. Unlike LCDs and field emission displays, which are constructed of layered materials, OLtDs are monolithic devices, because each layer is deposited on the other, creating a single unit.
Plasma display (also called “gas discharge display”) is a flat-screen technology that uses small cells lined with phosphor that are full of inert ionized gas (typically a mix of xenon and neon). Three cells make up one pixel (one cell has red phosphor, one green, one blue). The cells are sandwiched between x- and y-axis panels, and a cell is selected by charging the appropriate x and y electrodes. The charge causes the gas in the cell to emit ultraviolet light, which causes the phosphor to emit color. The amount of charge determines the intensity, and the combination of the different intensities of red, green and blue produce all the colors required.
A camera-equipped digital pen may be used to read EIC pattern information. Due to the different hardware implementations associated with embedding EIC-pattem information within various types of surfaces, the captured images from a particular type of surface may look significantly different than images captured from one or more other types of surfaces.
A digital pen user may switch from working on one surface to another at an arbitrary time. A straightforward way to support this scenario is to design different algorithms for different types of surfaces and let the user manually switch the digital pen's operating mode from a mode for one surface to a different mode for a different type of surface. However, a better way is to avoid requiring the user to switch the operating mode of pen manually based on the type of surface on which the pen is being used. A multi-mode algorithm, which decodes the embedded information from images captured from different types of surfaces, may be used. The multi-mode algorithm enables a single digital pen to work on both printed documents and different types of display surfaces without the user having to switch pen operating modes manually. In this way, the multi-mode algorithm advantageously provides an enhanced and more consistent user experience.
Despite the differences in appearance between the images of FIGS. 13 and 14, the EIC pattern texture itself within both images retains some common characteristics. For example, EIC patterns in both images are formed by two groups of equally spaced parallel lines.
An embodiment of the multi-mode algorithm uses a feature from the images to determine whether a particular image was captured from a display surface or from a printed document. Based on this determination, an image is then preprocessed to get illumination-compensated images and effective EIC patterns. The type of preprocessing performed depends on whether the image was captured from a display surface or from a printed document. The preprocessing results for an image captured from a display surface and for an image captured from a printed document retain common characteristics and may, therefore, advantageously be processed by the same core decoding algorithms.
FIG. 32 shows a system, in accordance with embodiments of the invention, for processing EIC images captured from printed documents and EIC images captured from display surfaces other than a printed document. A surface-type-identification module 3204 takes as input one or more EIC images captured from printed documents 3203 and one or more EIC images captured from a display surface other than a printed document 3202. The surface-type-identification module identifies the type of surface (i.e., printed document versus a display surface other than a printed document) from which a particular image was captured. Although EIC images captured from a display surface other than a printed document 3202 and EIC images captured from a printed document 3203 are shown separately in FIG. 32, before being processed by the surface-type-identification module 3204, the type of surface (i.e., printed document versus other than a printed document) from which a particular image was captured is unknown. On the other hand, EIC images captured from display surface 3206 have been identified by the surface-type-identification module 3204 as having been captured from a display surface other than a printed document. Similarly, EIC images captured from a printed document 3208 have been identified by the surface-type-identification module 3204 as having been captured from a printed document.
FIG. 33 shows an embodiment of the surface-type-identification module 3204. In the embodiment of FIG. 33, a feature-vector generation module 3302 generates a feature vector 3304, which is used by a feature-based surface-type-identification module 3306.
FIG. 34 shows an alternate embodiment of the surface-type-identification module 3204. In the embodiment of FIG. 34, a LaPlacian-filter module 3402 generates a filtered image 3404, which is used by a LaPlacian-fileter-based surface-type-identification module 3406.
Ways in which the surface-type-identification module 3204 may distinguish between the different types of surfaces from which images have been captured are discussed in more detail below.
A display-surface-preprocessing module 3210 preprocesses EIC images captured from display surfaces other than printed documents (as identified by the surface-type-identification module 3204). A printed-document-preprocessing module 3212 preprocesses EIC images captured from printed documents (as identified by the surface-type-identification module 3204). The preprocessing performed by the display-surface-preprocessing module 3210 and the printed-document-preprocessing module 3212 are similar to one another and are discussed in more detail below.
Preprocessed images are passed from the display-surface-preprocessing module 3210 and from the printed-document-preprocessing module 3212 to the EIC-processing module, which performs EIC pattern analysis, EIC symbol recognition, and EIC decoding, which are discussed above in more detail. Location information 3216, which is output by the EIC-processing module 3214, may be input to a surface-information-mapping module 3218 for images captured from a display surface other than a printed document or may be input to an EIC document mapping module 3220 for images captured from a printed document.
The surface-information-mapping module 3218 outputs surface metadata and x-y position 3222. Referring to FIG. 38, in accordance with embodiments of the invention, an embedded interaction code-enabled display 3800 includes: an outer transparency layer 3808, an optional inner transparency layer 3804, an optional infrared-reflection layer 3802 between the outer transparency layer 3808 and the inner transparency layer 3804, an EIC dot pattern 3806 between the outer transparency layer 3808 and the infrared-reflection layer 3802, and, optionally, transparency glue 3810 between the outer transparency layer 3808 and the infrared-reflection layer 3802 or the inner transparency layer 3804. The outer transparency layer 3808 and the inner transparency layer 3804 may be glass, plastic, or a film. The EIC dot pattern 3806 may be printed on, or pressed onto, the inner side of the outer transparency layer 3808. The EIC dot pattern 3806 may include an encoded surface identifier that identifies the embedded interaction code-enabled display 3800. The encoded surface identifier may uniquely identify the embedded interaction code-enabled display 3800.
The EIC-document-mapping module 3220 outputs document metadata and x-y position 3224. As discussed above, to determine the location of a digital pen during interaction with one or more surfaces, images are captured by the digital pen. To recover ink strokes written with a digital pen on a printed document, an EIC system locates the position of the pen in relation to the document. To do this, X, Y position and metadata are encoded and embedded into a digital document. An m-array may be used to represent X, Y position and multiple m-arrays may be used to represent metadata. These multiple m-arrays may be encoded in EIC symbols. In each EIC symbol, one bit from each m-array may be encoded. EIC symbols in place of the bits of the m-array representing X, Y position form an EIC symbol array (visually, the tiling of EIC symbols forms an EIC pattern).
An EIC symbol array may be thought of as being a big map, covering the pages of a digital document. When a digital pen is used to write on these pages, a small segment of the EIC symbol array is captured in an image taken by the digital pen. Locating the position of the pen thus becomes finding the position of the segment (of the EIC symbol array) captured in the image within the EIC symbol array. This may be done by analyzing the obtained images.
Images may be normalized for illumination. Then, images of EIC dots, referred to as an effective EIC pattern, and images of document content are identified. An effective EIC pattern mask and a document content mask specify which regions of a normalized image are effective EIC pattern and which regions are document content.
Features of effective EIC pattern in the image are then analyzed. In accordance with embodiments of the invention, we assume a digital pen is used on a plane (such as a paper plane on which the EIC pattern is printed) and the spatial transformation from the plane to image (also assumed a plane) is a perspective transform. That is, effective EIC pattern in image should lie on grid lines that are a perspective transform of the grid lines in EIC symbol array. The perspective transform is first assumed to be an affine transform, i.e. evenly spaced parallel lines are kept evenly spaced and parallel, but perpendicular lines may not be perpendicular anymore. Rotation, scale and translation of the affine transform are estimated from analyzing effective EIC pattern in image. The perspective transform is then obtained by fitting effective EIC pattern to affine transformed grid lines. A homography matrix that describes the perspective transform from grid lines in EIC symbol array to image, HGrid→Image, is obtained.
Once the grid lines are determined, black dots on the grid lines are identified. Positions of the black dots help to determine which grid cells correspond to EIC symbols and which direction is the correct orientation of EIC symbols.
EIC symbols captured in image may be rotated due to pen rotation. When EIC symbols are at the correct orientation (i.e. oriented the same as EIC symbols in EIC symbol array), the segment of EIC symbols captured in image can be matched against EIC symbol array, i.e. bits extracted from EIC symbols can be matched against the m-array. Once we know which grid cells correspond to EIC symbols and the correct orientation of the symbols, the EIC symbols captured in an image are recognized. We now imagine a large enough section of EIC symbol array that encompasses the grid lines and corresponding EIC symbols of the image.
Given a particular EIC symbol design, and the identified correct orientation of EIC symbols in an image, a transformation from the section of EIC symbol array (that encompasses the grid lines and corresponding EIC symbols of the image) to grid can be obtained. From a previous step, a homography matrix describing the perspective transform from grid to image HGrid→Image, is known.
Thus, a homography matrix, HSymbol→Image, describing the transformation from can be obtained as:

HSymbol→Image=HGrid→Image·HSymbol→Grid 

The homography matrix HSymbol→Image, specifies the transformation of every point in the section of EIC symbol array encompassing the image to a point in the image coordinate system. The homography matrix HSymbol→Image−1, specifies the transformation of every point in the image coordinate system to a point in the section of EIC symbol array encompassing the image.
From recognized EIC symbols in the section of EIC symbol array encompassing the image, EIC bits are extracted. For each m-array, a stream of bits is extracted. Any bit can be chosen as the bit whose position in m-array is decoded. In accordance with an embodiment of the invention, for convenience, we choose the top-left corner of the section of EIC symbol array encompassing the image, as the position to decode. Some of the bits are known (bits extracted from recognized symbols), and some are unknown (bits that can't be extracted or EIC symbols are not captured in image). As long as the number of extracted bits is more than the order of the m-array, decoding can be done.
EIC decoding obtains a location vector r by solving bt=rtM, where b is a vector of extracted bits, and M is a coefficient matrix obtained by cyclically shifting the m-sequence. Note that t in the equation stands for transpose. Location of extracted bits in m-sequence can be obtained from r by discrete logarithm. Position of extracted bits in m-array is then obtained based on how m-array is generated from m-sequence.
The position obtained from an m-array representing metadata is used to calculate the metadata. Metadata may be encoded using the same m-array as the one representing X, Y position, but shifted according to the value of the metadata. Therefore, positions obtained from the two m-arrays representing X, Y position and metadata, respectively, are different. The difference (or distance) between the two positions, however, is the same, and is the value of the metadata. If multiple m-arrays are used to encode global metadata such as a document ID, values of metadata from each of the multiple m-arrays may be combined to get the document ID.
The position obtained from the m-array representing X, Y position is the coordinates in EIC symbol array.
To recover ink stroke, we find the position of the pen tip in EIC symbol array. To do this, we use the concept of a “virtual pen tip,” which is the image of the real pen tip on the image sensor plane. Location of virtual pen tip on the image sensor plane can be obtained through calibration. Location of virtual pen tip on the image sensor plane is position of the pen tip in the image coordinate system. Therefore, using the homography matrix HSymbol→Image−1, we can obtain position of the pen tip in X′, Y′ coordinate system.
Given position of the pen tip in X′Y′ coordinate system and coordinates of CX′, Y′ in EIC symbol array, position of the pen tip in EIC symbol array can be obtained by summing the two. With a series of images captured for an ink stroke, from each image successfully decoded, position of the pen tip in EIC symbol array is obtained. These positions are filtered, interpolated and smoothed to generate the ink stroke.
With the document ID, the corresponding digital document can be found. How EIC symbol array is allocated to each page of the document is known. Therefore, position of the pen tip in a document page can be obtained by subtracting position of the top-left corner of the page in EIC symbol array from position of the pen tip in EIC symbol array. Thus, the ink stroke is bound to a document page. Ink strokes written with digital pen on printed document are now recovered in the corresponding electronic document.
An embedded interaction code pattern may be embedded within the surface of a display screen. And common InkJet/LaserJet printers may be used to embed an EIC pattern on printed documents. FIG. 13 is an inverted version of an image captured from a display screen. The inverted version is shown, instead of the original image, in order to comply with Patent Office rules prohibiting the use of black shading in drawings. Also, in order to comply with this rule, an overexposed (i.e., white) area in the original captured image, which would show up as a black area in FIG. 13, has been redacted (via white oval 1300). FIG. 14 represents a typical image captured from a printed EIC document. The original captured image from the display screen and FIG. 14 look significantly different: there is an over-exposure area in the original image captured from the display screen; the gray level of the background of the original image captured from the display screen is less than the gray level of EIC-pattern pixels, and the opposite is true for the inverted image shown in FIG. 13.
A feature may be extracted from the captured images and a linear classifier may be used for making a determination with respect to the image type (i.e., the surface type from which the image was captured).
Surface Type Identification
Feature Definition
It is apparent that the gray level distribution of the image in FIG. 14 is more even than the gray level distribution of the image in FIG. 13. We define a vector [vx vy] to represent this feature. The calculation of [vx vy] involves two steps.
The first step is to generate horizontal and vertical projections of the image. We calculate the horizontal and vertical projection vector Phorizontal and Pvertical of an image I as




  
    
      
        P
        horizontal
      
      ⁡
      
        [
        i
        ]
      
    
    =
    
      
        
          ∑
          
            k
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
            I
            ⁡
            
              (
              
                k
                ,
                i
              
              )
            
          
          ⁢
          
            
          
          ⁢
          and
          ⁢
          
            
          
          ⁢
          
            
              P
              vertical
            
            ⁡
            
              [
              j
              ]
            
          
        
      
      =
      
        
          ∑
          
            k
            =
            0
          
          
            h
            -
            1
          
        
        ⁢
        
          I
          ⁡
          
            (
            
              j
              ,
              k
            
            )
          
        
      
    
  
  ,




where I(x,y) is the gray level of pixel (x,y) in the image; w and h are the width and height, respectively, of the image.

Second, determine the projection peak “width” for [vx vy]. We define [vx vy] as the peak “width” of two types of images in the horizontal and the vertical projection vector. i.e. find [vx vy] to satisfy the following equation:




  
    
      
        ∑
        
          k
          =
          
            
              y
              center
            
            -
            
              
                v
                y
              
              2
            
          
        
        
          
            y
            center
          
          -
          
            
              v
              y
            
            2
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          P
          horizontal
        
        ⁡
        
          [
          k
          ]
        
      
    
    =
    
      μ
      ⁢
      
        
      
      ⁢
      S
    
  
  ,
  
    

  
  ⁢
  
    
      
        ∑
        
          k
          =
          
            
              x
              center
            
            -
            
              
                v
                x
              
              2
            
          
        
        
          
            x
            center
          
          -
          
            
              v
              x
            
            2
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          P
          vertical
        
        ⁡
        
          [
          k
          ]
        
      
    
    =
    
      μ
      ⁢
      
        
      
      ⁢
      S
    
  




Where




  S
  =
  
    
      ∑
      
        i
        =
        0
      
      
        h
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          j
          =
          0
        
        
          w
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        I
        ⁡
        
          (
          
            i
            ,
            j
          
          )
        
      
    
  




is the gray level summation of the whole image; μ is a constant value, in one implementation μ=0.75; Xcenter and ycenter is the center of the vertical and horizontal projection vector, which is defined as:





  
    
      x
      center
    
    =
    
      
        
          ∑
          
            i
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
        
        ⁢
        
          
            iP
            vertical
          
          ⁡
          
            (
            i
            )
          
        
      
      
        
          ∑
          
            i
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
        
        ⁢
        
          
            P
            vertical
          
          ⁡
          
            (
            i
            )
          
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      y
      center
    
    =
    
      
        
          ∑
          
            i
            =
            0
          
          
            h
            -
            1
          
        
        ⁢
        
          
        
        ⁢
        
          
            iP
            horizontal
          
          ⁡
          
            (
            i
            )
          
        
      
      
        
          ∑
          
            i
            =
            0
          
          
            h
            -
            1
          
        
        ⁢
        
          
        
        ⁢
        
          
            P
            horizontal
          
          ⁡
          
            (
            i
            )
          
        
      
    
  




Linear Classifier

Given 2×N images with known type (N should be a relatively large number, such as N>1000), N images captured from paper, the other N from a display surface. Assume {V1,i, i=1, 2, . . . N} are the feature vectors of images captured from paper; {V2,i, i=1, 2, . . . N} are the feature vectors of images captured from the display surface. A linear classifier, such as a Fisher linear classifier, can be used for separating the two types of vectors, i.e., an optimal weight W and a threshold δ can be calculated based on V1,i and V2,i. W and δ can be used for determining the type of the captured images in real time.
For an image with unknown type, with feature vector V, it will be identified as an image captured from paper if WTV>δ, otherwise it will be identified as an image captured from a display surface.
For more information about suitable linear classifiers, see R. O. Duda and P. E. Hart, “Pattern Classification and Scene Analysis,” New York: Wiley-Interscience, 1973. and b: R. A. Fisher, “The Use of Multiple Measurements in Taxonomic Problems,” Annals of Eugenics, vol. 7, part II, pp. 179-188, 1936.
According to an embodiment of the invention, surface type may be determined in an alternate way that uses a Laplacian directive filter to process an image.
A suitable Laplacian operator is:














−1
−1
−1


−1
8
−1


−1
−1
−1









Suppose the image I is filtered by this Laplacian operator shown above, the filtered image I1 is:

I1(x,y)=0 if x=0 or x=w−1 or y=0 or y=h−1, otherwise, I1(x,y)=−I(x−1,y−1)−I(x−1,y)−I(x−1,y+1)−I(x,y−1)+8I(x,y)−I(x,y+1)−I(x+1,y−1)−I(x+1,y)−I(x+1,y+1)

We count two numbers N+ and N− from the image I1. N+ is the number of positive pixels in I1, and N− is the number of negative pixels in I1.
For images like the inverse of FIG. 13 (i.e., for images captured from a display surface): N+<N−; whereas, for images like FIG. 14, which are captured from a printed document: N+>N−. Based on this information, we can determine whether the image was captured from a display surface or from a printed document.
Preprocessing of Images Captured from Display Surface
An image captured from a display surface is first reversed (i.e., gray-level values of pixels are inverted). Assume image I is reversed to I′, then I′(x,y)=255−I(x,y).
The reversed image is then further processed in three steps which are similar to the preprocessing algorithm for an image captured from printed paper document, which is discussed in more detail below.
Illumination Normalization
FIG. 15 illustrates an example of an image illumination normalization module 1500 in accordance with embodiments of the invention. The image illumination normalization module 1500 includes an image segmentation module 1501 that segments an image into blocks of smaller areas, such as pixels, and a block illumination estimation module 1503 that estimates the illumination of each block. The image illumination normalization module 1500 also has an area illumination distribution determination module 1505. This module performs a bilinear fitting of the illumination distribution for each area, as will be explained in more detail below. Still further, the image illumination normalization module 1500 includes an area illumination normalization module 1507, which normalizes the illumination of each area in the image. The operation of each of these modules will be discussed in greater detail with reference FIGS. 16A-25.
Turning now to FIG. 16A, in step 1601 the image segmentation module 1501 receives an image from the camera/pen device. FIG. 17 illustrates one example of a raw image 1701 that might be received from the camera/pen device. As seen in this figure, the image 1701 has regions that are relatively dark and regions that are relatively light, making it difficult to distinguish features in the image. In the illustrated embodiment, the image is 100×128 pixels (i.e., 100 pixels in the vertical direction and 128 pixels in the horizontal direction). It should be appreciated, however, that the image size will be determined by the camera employed by the camera/pen device 101, and various embodiments of the invention may be employed with images of any size.
Next, in step 1603, the image segmentation module 1501 segments the image 1701 into blocks of areas. In the illustrated example, the image illumination normalization module 1500 uses pixels as the areas upon which operations are performed. It should be appreciated, however, that alternate embodiments of the invention may use other units for the area. For example, with larger images, some embodiments of the invention may use groups of four adjacent pixels as the areas upon which operations are performed, while still other embodiments of the invention may use groups of six, eight, nine, sixteen, or any other number of pixels as the areas upon which operations are performed.
More particularly, the image segmentation module 1501 segments the image into blocks starting from the top of the image 1701, as shown in FIG. 18. The blocks 1801 may conveniently be identified hereafter by coordinate values on indices m, n, as shown in this figure. In the illustrated embodiment, image segmentation module 1501 segments the image 1701 into blocks 1801 of 16 pixels by 16 pixels. It should be appreciated, however, that alternate embodiments of the invention may form the blocks from smaller or larger groups of pixels as desired.
Because the image 1701 in the illustrated example has a height of 100 pixels and the blocks 1801 are formed from 16×16 groups of pixels, there is a small region 1803 at the bottom of the image 1701 in which the pixels are not segmented into blocks 1801. As will be apparent from the detailed explanation provided below, this discrepancy may skew the accuracy of the illumination normalization process. Accordingly, as shown in FIG. 19, the image segmentation module 1501 forms a second segment of blocks 1901 starting from the bottom of the image 1701. The blocks 1901 may conveniently be identified hereafter by coordinate values on indices m1, n1, as shown in FIG. 19. As with blocks 1801, the blocks 1901 are formed from 16×16 groups of pixels.
Next, in step 1605, the block illumination estimation module 1503 estimates the illumination value for each block 1801 and 1901. That is, the block illumination estimation module 1503 estimates an overall representative illumination value for each block 1801 and 1901 based upon the illumination value of each individual pixel making up the block. The image 1701 is a black-and-white image, so the illumination value for each pixel is a gray level value. In the illustrated example, the block illumination estimation module 1503 estimates the illumination value of a block 1801 or 1901 by creating a histogram of the number of pixels in the block at each gray-level.
FIG. 20 illustrates one example of a type of histogram that might be employed by various embodiments of the invention to estimate the illumination of a block 1801 or 1901. As seen in this figure, the X-axis corresponds to the gray levels of the pixels making up the block. The Y-axis then corresponds to the number of pixels that have the gray-level. Using this histogram, the block illumination estimation module 1503 estimates a representative illumination value for the block. In the illustrated example, the block illumination estimation module 1503 identifies the 90th percentile illumination value to be the estimated illumination value of the block. That is, the block illumination estimation module 1503 identifies the gray level G90th at which 90% of the pixels in the block are darter than G90th, and employs this value as the illumination value of the block. Of course, other embodiments of the invention may employ alternate percentile criteria for estimating the illumination value of a block as desired. Still further, some embodiments of the invention may employ alternate techniques for determining the overall illumination of each block.
It also should be appreciated that, while the illustrated example relates to a black-and-white image, various embodiments of the invention may be used to process color images. With these embodiments, the block illumination estimation module 1503 may operate based upon the brightness level of each pixel in the image.
After the block illumination estimation module 1503 has estimated the illumination value for each block 1801 and 1901, the area illumination distribution determination module 1505 performs a bilinear fitting of the illumination distribution for each area in step 1607. That is, the area illumination distribution determination module 1505 determines an illumination distribution value for an area by averaging the estimated illumination values of the blocks surrounding the area. In the illustrated embodiment, the area illumination distribution determination module 1505 averages the estimated illumination values of the four blocks surrounding the area, but other embodiments of the invention may average the estimated illumination values of other groups of blocks surrounding the area.
As previously noted, there is a region 1803 at the bottom of image 1701 that has not been segmented into any of the blocks 1801. Accordingly, an average illumination value of the surrounding blocks would not accurately relate to the illumination values of these unsegmented areas. The illumination distribution values for the pixels in these regions thus are determined using the blocks 1901 rather than the blocks 1801. Accordingly, the illumination distribution values are determined in a two-step process. The pixels that are primarily within blocks 1801 (i.e., the pixels having a y coordinate value of 0-87 are determined using the estimated illumination values of the blocks 1801, while the pixels that are primarily within blocks 1901 (i.e., the pixels having a y coordinate value of 88-99) are determined using the estimated illumination values of the blocks 1901.
With the illustrated embodiment, for each pixel (x,y), where y=0, 1, . . . 87, the illumination distribution value of that pixel D(x,y) is estimated as:

D(x,y)=(1−ηy)·[(1−ηx)·IB(m,n)+ηx·IB(m+1,n)]+ηy·[(1−ηx)·IB(m,n+1)+ηx·IB(m+1,n+1)]

where IB(m,n)=G90th(m,n), s is the size of a block (in the illustrated example, s=16),




  
    
      m
      =
      
        min
        ⁡
        
          (
          
            
              max
              ⁡
              
                [
                
                  
                    int
                    ⁡
                    
                      (
                      
                        
                          x
                          -
                          
                            s
                            /
                            2
                          
                        
                        s
                      
                      )
                    
                  
                  ,
                  0
                
                ]
              
            
            ,
            6
          
          )
        
      
    
    ,
    
      

    
    ⁢
    
      n
      =
      
        min
        ⁡
        
          (
          
            
              max
              ⁡
              
                [
                
                  
                    int
                    ⁡
                    
                      (
                      
                        
                          y
                          -
                          
                            s
                            /
                            2
                          
                        
                        s
                      
                      )
                    
                  
                  ,
                  0
                
                ]
              
            
            ,
            4
          
          )
        
      
    
    ,
    
      

    
    ⁢
    
      
        x
        1
      
      =
      
        
          m
          ⁢
          
            
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        x
        2
      
      =
      
        
          
            (
            
              m
              +
              1
            
            )
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        y
        1
      
      =
      
        
          n
          ⁢
          
            
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        y
        2
      
      =
      
        
          
            (
            
              n
              +
              1
            
            )
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        η
        x
      
      =
      
        
          x
          -
          
            x
            1
          
        
        
          
            x
            2
          
          -
          
            x
            1
          
        
      
    
    ,
    
      

    
    ⁢
    and
  




  
    
      η
      y
    
    =
    
      
        
          y
          -
          
            y
            1
          
        
        
          
            y
            2
          
          -
          
            y
            1
          
        
      
      .
    
  



It should be noted that int(x) is a function that returns the largest integer less than or equal to x. For example, int(1.8)=1, int(−1.8)=−2.

The illumination value information employed to determine the illumination distribution value of a pixel using this process is graphically illustrated in FIG. 21. As will be appreciated from this image, some pixels will fall outside of any region 2101 that can be equally distributed among four adjacent blocks 1801. For example, in the illustrated example, pixels having an x coordinate value of 0-7 or 120-127 and pixels having a y coordinate value of 0-7 will fall outside of any region 2101 that can be equally distributed among four adjacent blocks 1801. For these pixels in border regions, the above equations may still be applied to determine their illumination distribution values, except that extrapolation will be used instead of interpolation. The different regions are graphically illustrated in FIG. 22.
Similarly, for each pixel (x,y), where y=88, 89, . . . 99, the illumination distribution value of that pixel D(x,y) is estimated as:

D(x,y)=(1−ηy)·[(1−ηx)·IB(m1,n1)+ηx·IB(m1+1,n1)]+ηy·[(1−ηx)·IB(m1,n1+1)+ηx·IB(m1+1,n1+1)]

where IB(m1,n1)=G90 th(m1,n1) s is the size of a block (in one implementation, s=16),




  
    
      
        m
        1
      
      =
      
        min
        ⁡
        
          (
          
            
              max
              ⁡
              
                [
                
                  
                    int
                    ⁡
                    
                      (
                      
                        
                          x
                          -
                          
                            s
                            /
                            2
                          
                        
                        s
                      
                      )
                    
                  
                  ,
                  0
                
                ]
              
            
            ,
            6
          
          )
        
      
    
    ,
    
      

    
    ⁢
    
      
        n
        1
      
      =
      0
    
    ,
    
      
    
    ⁢
    
      

    
    ⁢
    
      
        x
        1
      
      =
      
        
          
            m
            1
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        x
        2
      
      =
      
        
          
            (
            
              
                m
                1
              
              +
              1
            
            )
          
          ⁢
          s
        
        +
        
          s
          2
        
      
    
    ,
    
      

    
    ⁢
    
      
        y
        1
      
      =
      
        height
        -
        s
        -
        
          s
          2
        
        -
        1
      
    
    ,
    
      

    
    ⁢
    
      
        y
        2
      
      =
      
        height
        -
        
          s
          2
        
        -
        1
      
    
    ,
    
      

    
    ⁢
    
      
        η
        x
      
      =
      
        
          x
          -
          
            x
            1
          
        
        
          
            x
            2
          
          -
          
            x
            1
          
        
      
    
    ,
    
      

    
    ⁢
    and
  




  
    
      η
      y
    
    =
    
      
        
          y
          -
          
            y
            1
          
        
        
          
            y
            2
          
          -
          
            y
            1
          
        
      
      .
    
  



height is the height of the image sensor. In the illustrated example, height=100.

Again, some pixels will fall along the image border outside of any region that can be equally distributed among four adjacent blocks 1901. For these pixels in border regions, the above equations may still be applied to determine their illumination distribution values, except that extrapolation will be used instead of interpolation. The different regions are graphically illustrated in FIG. 23. The illumination distribution values 2401 for the entire image 1701 are then shown in FIG. 24.
Once the area illumination distribution determination module 1505 has determined the illumination distribution value for each area, the area illumination normalization module 1507 determines the normalized illumination value for each area in step 1609. More particularly, the area illumination normalization module 1507 determines the normalized illumination value for each area by dividing the area's original illumination value for the illumination distribution value for that area. Next, in step 1611, the area illumination normalization module 1507 obtains an adjusted normalized illumination value for each area by multiplying the normalized illumination value for each area by a uniform illumination level G0. In the illustrated example, the value of uniform illumination level G0 is 200, but alternate embodiments of the invention may employ different values for the uniform illumination level G0. The uniform illumination level G0 represents the supposed gray level of the captured image in a blank area for an ideal case (i.e., uniform illumination with an ideal image sensor). Thus, in an ideal case, the gray level of all pixels of a captured image from a blank area should be equal to the uniform illumination level G0.
Lastly in step 1613, the area illumination normalization module 1507 selects a final normalized illumination value for each pixel by assigning each pixel a new illumination value that is the lesser of its adjusted normalized illumination value and the maximum illumination value. Thus, with the illustrated example, the final normalized illumination value for each pixel is determined as a gray level G(x,y) where:




  
    G
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    min
    ⁡
    
      (
      
        
          
            G
            0
          
          ·
          
            
              G
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            
              D
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
        ,
        255
      
      )
    
  




where G0=200 and 255 is the maximum gray level (i.e., white). Then, in step 515, area illumination normalization module 1507 outputs a normalized image using the final normalized illumination value for each pixel. FIG. 25 illustrates how the image 1701 appears as image 2501 after being processed in the manner described in detail above.

As is apparent from FIG. 13 and the comments above regarding FIG. 13, there are no EIC patterns visible in the over-exposure area of the image. After the original captured image has been reversed, the overexposure area is changed to a darker area, which is covered with a white oval in FIG. 14 to comply with Patent Office rules that prohibit black shading in drawings. Separating this area in FIG. 13 is similar to the separation of the document's content area in the images captured from a printed document. An implementation uses an overexposure-area-separation algorithm to separate the overexposed area from the areas where the EIC pattern is visible. The overexposure-area-separation algorithm is substantially the same as the following document-content-separation algorithm used for separating document content from areas where the EIC pattern is visible in images captured from a printed document. Similarly, an implementation uses an EIC-pattern-separation algorithm to separate effective EIC-pattern pixels from the rest of a captured image. The EIC-pattern-separation algorithm is substantially the same as the following algorithm used for separating EIC-pattern pixels from other areas in images captured from a printed document.
Pattern Determination
After the image illumination normalization module 1500 normalizes the image captured by the pen/camera device, the pattern determination module 2600 distinguishes the areas of the normalized image that represent content in a document from the areas of the normalized image that represent the location (also referred to as the EIC) pattern. FIG. 26 illustrates a pattern determination system for distinguishing a location pattern from content in a document image. As seen in this figure, the pattern determination module 2600 includes an area average filtering module 2601 and a high-contrast region determination module 2603. As will be discussed in greater detail below, the area average filtering module 2601 applies an averaging filter to the illumination value of each area in the image. The high-contrast region determination module 2603 then identifies high-contrast regions in the image.
The pattern determination module 2600 also includes a content illumination threshold determination module 2605, a content identification module 2607, a pattern illumination threshold determination module 2609, and a pattern identification module 2611. As will be discussed in greater detail below, the content illumination threshold determination module 2605 determines a first illumination value threshold that the content identification module 2607 then uses to identify areas of the image representing content. Similarly, the pattern illumination threshold determination module 2609 determines a second illumination value threshold that the pattern identification module 2611 uses to identify areas of the image that represent a location pattern.
The pattern determination module 2600 takes advantage of the fact that, in an image of a document containing both content (e.g., printed text, pictures, etc.) and a location pattern, the location pattern, document content and document background tend to have different brightness levels. Thus, with a black-and-white image, the areas representing the location pattern, document content and document background will typically have different gray levels, with the areas representing the document content being the darkest, the areas representing the location pattern being the second darkest, and the areas representing the document background being the least dark. Thus, the pattern determination module 2600 can distinguish the three different areas by thresholding.
In order to more efficiently determine the appropriate thresholds to separate the three brightness levels, the pattern determination module 2600 first identifies high-contrast regions. For black-and-white images, these are regions that have a relatively large difference in gray levels between adjacent image areas (e.g., such as pixels). Thus, the threshold for segmenting the areas representing document content from other areas in the image can be more effectively identified in the high-contrast areas. Once the threshold is found, regions that are darker than the threshold are identified as representing document content. These regions can then be marked as being made up of areas representing content. For example, the areas in a content region may be assigned a value of 1 in a document content mask.
After the regions representing document content have been identified, the brightness values of the remaining areas can then be analyzed. Those regions having an illumination value above a second threshold are then identified as representing the location pattern. These regions can then be marked as being made up of areas representing the location pattern. For example, the areas in a pattern region may be assigned a value of 1 in a location pattern mask. Thus distinguished from the rest of the image, the areas representing the location pattern can then be more accurately analyzed.
The operation of the pattern determination module 2600 will now be described with reference to FIGS. 27A-31. More particularly, the operation of the pattern determination module 2600 will be discussed as applied to the normalized image 2501. Thus, in this example, the image is a black-and-white image. It should be appreciated, however, that various embodiments of the invention may be employed to process color images. As previously noted with respect to the image illumination normalization module 1500, if the image is a color image, then the pattern determination module 1500 will operate using brightness levels rather than gray levels. Also, the illustrated example of the pattern determination module 2600 uses pixels as the area unit on which it performs operations. It should be noted, however, that other examples of the invention may operate on other areas, such as groups of multiple pixels, as previously described with respect to the image illumination normalization module 1500.
Initially, high contrast areas are identified to more efficiently locate regions that represent content, as previously noted. Because regions containing the location pattern may also have a large difference illumination levels, however, the image areas are first filtered to reduce the illumination value difference in the regions surrounding the location pattern. More particularly, in step 2701, the area average filtering module 2601 applies an averaging filter to each area in the image. For black-and-white images, this filtering operation replaces the gray level of each pixel by an average of the gray levels of the surrounding eight pixels and the gray level of the pixel itself. That is, for every pixel (x,y)




  
    
      G
      average
    
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    
      1
      9
    
    ⁢
    
      
        ∑
        
          i
          =
          
            -
            1
          
        
        1
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            j
            =
            
              -
              1
            
          
          1
        
        ⁢
        
          
        
        ⁢
        
          G
          ⁡
          
            (
            
              
                x
                +
                i
              
              ,
              
                y
                +
                j
              
            
            )
          
        
      
    
  




where G(x,y) is the gray level of pixel (x,y). It should be note that G(x,y) is the illumination-normalized gray level.

Next, in step 2703, the high-contrast region determination module 2603 identifies the high-contrast regions in the image using the averaged illumination level of each pixel. In particular, for each pixel, the high-contrast region determination module 2603 identifies the maximum and the minimum averaged gray level values in the 17×17 pixel neighborhood surrounding the pixel. That is, for every pixel (x,y),

Gmax(x,y)=max(Gaverage(p,q)|max(x−8, 0)≦p≦min(x+8, 127), max(y−8, 0)≦q≦min(y+8, 127))

Gmin(x,y)=min(Gaverage(p,q)|max(x−8, 0)≦p≦min(x+8, 127), max(y−8, 0)≦q≦min(y+8, 127))

It should be appreciated that the determination described above is based upon the specific number of pixels of the image used in the illustrated example. A similar determination, using different pixels coordinate values, would be employed for embodiments of the invention used to process images of different sizes. Next, the high-contrast region determination module 2603 defines a high-contrast region as

High Contrast Region={(x,y)|[Gmax(x,y)−Gmin(x,y)]>D0}

where D0 is a predetermined threshold. The value of D0 is determined empirically. In the illustrated example, D0=140, but it should be appreciated, however, that other embodiments of the invention may employ different threshold values depending, e.g., upon the contrast quality provided by the camera/pen device. FIG. 28 illustrates the high-contrast areas 2801 identified in image 2501 using the above-describe technique.

Next, in step 2705, the content illumination threshold determination module 2605 determines a threshold for separating areas representing document content from the other areas of the image. To determine the threshold, the content illumination threshold determination module 2605 creates a gray-level histogram for the high-contrast regions. An example of such a histogram 2901 is illustrated in FIG. 29. As seen in this figure, the X-axis of this histogram 2901 corresponds to the averaged gray levels of the pixels in the high-contrast regions. The Y-axis then corresponds to the number of pixels at that gray level. From the histogram, a threshold T0 for separating the darker pixels from gray and white pixels can be identified.
Any suitable technique for selecting a threshold to distinguish darker pixels from gray and white pixels may be employed. One suitable technique for obtaining the threshold T0 is described, for example, in N. Otsu, “A Threshold Selection Method from Gray-Level Histogram,” IEEE Transactions on Systems, Man, and Cybernetics, 9(1), (1979), pp. 62-66.
Once the threshold value T0 has been determined, the content identification module 2607 uses the threshold T0 to identify the areas of the image representing content in step 2707. First, given T0, pixels in the image that are darker than T0 are identified as images representing the document content and are assigned a value of 1 in a document content mask. Thus, for every pixel (x,y), if

Gaverage(x,y)≦T0,

then Document Content Mask (x,y)=1, else Document Content Mask (x,y)=0.

After the document content mask has been created, those regions Rt, are identified, where t=1, 2, . . . T, of pixels (xi,yi) as follows:

Rt={(xi,yi)|Document Content Mask (xi,yi)=1, (xi,yi) are neighbors}.

Two pixels are neighbors if they are directly below, above or next to each other, as shown in FIG. 30. Thus, the mask identifies regions Rt of neighboring areas that represent content. In the illustrated example, if a region Rt, contains fewer than 20 pixels, it is removed from the document content mask. That is, for each pixel (xi,yi)ε Rt, Document Content Mask (xi,yi)=0. This eliminates regions that are too small to actually represent document content.
Next, in step 2709, the pattern illumination threshold determination module 2609 determines a second threshold for separating the areas representing the location pattern from the remaining areas of the image (i.e., the non-content areas). Initially, the pattern illumination threshold determination module 2609 segments the image into 8×8 pixel blocks. For black-and-white images, the pattern illumination threshold determination module 2609 then creates a gray-level value histogram for each 8×8 pixel block, such as the histogram 2001 in FIG. 31. As seen in this figure, the X-axis corresponds to the illumination-normalized gray levels of non-document content pixels in the block, i.e. pixels for which Document Content Mask (x,y)=0. The Y-axis then corresponds to the number of non-document content pixels at that gray level.
From the histogram, a second threshold T0 is identified to distinguish location pattern areas from the remaining background areas. The second threshold T0 is determined empirically, based on the size of the camera sensor in the pen/camera device and the size of a code symbol, to be approximately equal to the ratio of black dots in the code symbol. In the illustrated example, the second threshold T0 is selected such that 11% of the pixels are darker than T0.
Once the second threshold T0 is determined, the pattern identification module 2611 identifies the areas of the image representing the location pattern in step 2711. More particularly, for every pixel (x,y) in a block, if Document Content Mask (x,y)=0 and G(x,y)≦T0, then the pattern identification module 2611 assigns Pattern Mask (x,y)=1, else, Pattern Mask (x,y)=0.
For the bottom pixels (i.e., the 4×128 pixel region along the bottom border of the image), the 4×128 pixel area directly above may be used to form 8×8 pixel blocks. Within each of these bottom blocks, the second threshold is determined using the same method described in detail above. Only those pixels in the bottom region are compared against the threshold, however, as the pixels “borrowed” from the region directly above will already have been analyzed using the second threshold established for their original blocks. Those bottom pixels that are darker than the threshold are identified as representing the location pattern.
After the pixels having a gray level below their respective second threshold values have been identified, those identified pixels that are adjacent to pixels representing document content are removed from the location pattern mask. That is, for each pixel (x,y), if Pattern Mask (x,y)=1 and a pixel among 8 neighbors of (x,y) has been identified as representing document content (i.e., there exists i, j, where i=−1, 0, 1, j=−1, 0, 1, such that Document Content Mask (x+i,y+j)=1), then Pattern Mask (x,y)=0. In this manner, the pixels making up the location pattern can be accurately distinguished from the other pixels in the image. Further, a new image can be generated that clearly distinguishes a location pattern from the remainder of the image.
FIG. 35 shows steps, in accordance with embodiments of the invention, for processing EIC images captured from printed documents and EIC images captured from display surfaces other than a printed document. An identify-surface-type step 3504 takes as input one or more EIC images captured from printed documents 3503 and one or more EIC images captured from a display surface other than a printed document 3502. The identify-surface-type step 3504 identifies the type of surface (i.e., printed document versus a display surface other than a printed document) from which a particular image was captured. Although EIC images captured from a display surface other than a printed document 3502 and EIC images captured from a printed document 3503 are shown separately in FIG. 35, before being processed by the identify-surface-type step 3504, the type of surface (i.e., printed document versus other than a printed document) from which a particular image was captured is unknown. On the other hand, EIC images captured from display surface 3506 have been identified by the identify-surface-type step 3504 as having been captured from a display surface other than a printed document. Similarly, EIC images captured from a printed document 3508 have been identified by the identify-surface-type step 3504 as having been captured from a printed document. Ways in which the identify surface type 3204 step may distinguish between the different types of surfaces from which images have been captured are discussed in more detail above.
FIG. 36 shows an embodiment of the identify-surface-type step 3504. In the embodiment of FIG. 36, a feature vector 3602 is generated at step 3602. The feature vector 3602 specifies how even the gray level distribution is for an EIC image. At step 3606, the feature vector 3602 is used for identifying the surface type from which the EIC document was captured.
FIG. 37 shows an alternate embodiment of the identify-surface-type step 3504. In the embodiment of FIG. 37, at step 3702, a LaPlacian operator is used to filter an EIC image. The filtered image 3704 is used, at step 3706, for identifying the surface type from which the EIC document was captured.
A preprocess display-surface images step 3510 preprocesses EIC images captured from display surfaces other than printed documents (as identified by the identify-surface-type step 3504). A preprocess printed-document images step 3512 preprocesses EIC images captured from printed documents (as identified by the identify-surface-type step 3504). The preprocessing performed by the preprocess display-surface images step 3510 and the preprocess printed-document images step 3212 are similar to one another and are discussed in more detail above.
Preprocessed images are passed from the preprocess display-surface images step 3510 and from the preprocess printed-document images step 3512 to the process EIC information step 3514, which perform EIC pattern analysis, EIC symbol recognition, and EIC decoding as discussed above in more detail. Location information 3516, which is output by the process EIC information step 3514, may be input to a map display-surface-information step 3518 for images captured from a display surface other than a printed document or may be input to a map EIC document information step 3520 for images captured from a printed document.
The map display-surface-information step 3518 outputs surface metadata and x-y position 3522, and the map EIC-document information step 3520 outputs document metadata and x-y position 3524.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

## Claims

1. A system having a memory and a processor that processes at least one image captured from a printed document and that processes at least one image captured from a display surface other than a printed document, the system comprising:
a surface-type-identification module that accepts as input the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document and that identifies, for a particular image, a type of surface from which the image was captured, wherein the type of surface is selected from a group consisting of: a printed document and a display surface other than a printed document, wherein the surface-type-identification module comprises a feature-based surface-type-identification module that identifies, based on a feature vector, the type of surface from which the particular image was captured and wherein the feature-based surface-type-identification module identifies the type of surface from which the particular image was captured using a linear classifier to distinguish between a feature vector of an image that was captured from a printed document and a feature vector of an image that was captured from a display surface other than a printed document;
a display-surface-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a first preprocessing algorithm when the particular image is identified as having been captured from a display surface other than a printed document;
a printed-document-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a second preprocessing algorithm when the particular image is identified as having been captured from a printed document; and
an embedded-interaction-code-processing module that outputs location information for at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document.

2. The system of claim 1, wherein the surface-type-identification module comprises a LaPlacian-filter module that uses a LaPlacian operator to filter the particular image.

3. The system of claim 1, wherein the location information specifies an m-array location for the at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document.

4. The system of claim 1, further comprising: a surface-information-mapping module that maps the location information to surface metadata and x-y position information for the at least one image captured from a display surface other than a printed document.

5. The system of claim 1, further comprising: an embedded-interaction -code-document-mapping module that maps the location information to document metadata and x-y position information for the at least one image captured from a printed document.

6. The system of claim 1, wherein the linear classifier is a Fisher linear classifier.

7. A system having a memory and a processor that processes at least one image captured from a printed document and that processes at least one image captured from a display surface other than a printed document, the system comprising:
a surface-type-identification module that accepts as input the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document and that identifies, for a particular image, a type of surface from which the image was captured, wherein the type of surface is selected from a group consisting of: a printed document and a display surface other than a printed document;
a display-surface-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a first preprocessing algorithm when the particular image is identified as having been captured from a display surface other than a printed document, wherein the first preprocessing algorithm includes reversing the particular image;
a printed-document-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a second preprocessing algorithm when the particular image is identified as having been captured from a printed document; and
an embedded-interaction-code-processing module that outputs location information for at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document
wherein the surface-type-identification module comprises a feature-vector generation module that generates a feature vector that specifies how even a gray level distribution is for the particular image
wherein generation of the feature vector by the feature-vector generation module includes calculating a horizontal projection vector and a vertical projection vector of the particular image and wherein the horizontal projection vector and the vertical projection vector are calculated as:





  
    
      P
      horizontal
    
    ⁡
    
      [
      i
      ]
    
  
  =
  
    
      ∑
      
        k
        =
        0
      
      
        w
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      I
      ⁡
      
        (
        
          k
          ,
          i
        
        )
      
    
  



 and





  
    
      
        P
        vertical
      
      ⁡
      
        [
        j
        ]
      
    
    =
    
      
        ∑
        
          k
          =
          0
        
        
          h
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        I
        ⁡
        
          (
          
            j
            ,
            k
          
          )
        
      
    
  
  ,



 wherein I(x,y) is the gray level of pixel (x,y) in the particular image I and wherein w and h are the width and height, respectively, of the particular image.

8. The system of claim 7, wherein generation of the feature vector by the feature-vector generation module includes defining a horizontal peak width in the horizontal projection vector and a vertical peak width in the vertical projection vector.

9. The system of claim 8, wherein the horizontal peak width and the vertical peak width are defined as: [vxvy)] that satisfies the following equations:



  
    
      
        
          ∑
          
            k
            =
            
              
                y
                center
              
              -
              
                
                  v
                  y
                
                2
              
            
          
          
            
              y
              center
            
            +
            
              
                v
                y
              
              2
            
          
        
        ⁢
        
          
        
        ⁢
        
          
            P
            horizontal
          
          ⁡
          
            [
            k
            ]
          
        
      
      =
      
        μ
        ⁢
        
          
        
        ⁢
        S
      
    
    ,
    
      

    
    ⁢
    
      
        
          ∑
          
            k
            =
            
              
                x
                center
              
              -
              
                
                  v
                  x
                
                2
              
            
          
          
            
              x
              center
            
            +
            
              
                v
                x
              
              2
            
          
        
        ⁢
        
          
        
        ⁢
        
          
            P
            vertical
          
          ⁡
          
            [
            k
            ]
          
        
      
      =
      
        μ
        ⁢
        
          
        
        ⁢
        S
      
    
    ,
    
      

    
    ⁢
    where
  




  
    S
    =
    
      
        ∑
        
          i
          =
          0
        
        
          h
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            j
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
        
        ⁢
        
          I
          ⁡
          
            (
            
              i
              ,
              j
            
            )
          
        
      
    
  


 is a gray level summation of the particular image, μ is a constant value, xcenter and ycenter are the center of the vertical and horizontal projection vector, which are defined as:





  
    
      x
      center
    
    =
    
      
        
          ∑
          
            i
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
            iP
            vertical
          
          ⁡
          
            (
            i
            )
          
        
      
      
        
          ∑
          
            i
            =
            0
          
          
            w
            -
            1
          
        
        ⁢
        
          
            P
            vertical
          
          ⁡
          
            (
            i
            )
          
        
      
    
  
  ,
  
    
  
  ⁢
  
    
      y
      center
    
    =
    
      
        
          
            ∑
            
              i
              =
              0
            
            
              w
              -
              1
            
          
          ⁢
          
            
              iP
              horizontal
            
            ⁡
            
              (
              i
              )
            
          
        
        
          
            ∑
            
              i
              =
              0
            
            
              w
              -
              1
            
          
          ⁢
          
            
              P
              horizontal
            
            ⁡
            
              (
              i
              )
            
          
        
      
      .

10. A system having a memory and a processor that processes at least one image captured from a printed document and that processes at least one image captured from a display surface other than a printed document, the system comprising:
a surface-type-identification module that accepts as input the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document and that identifies, for a particular image, a type of surface from which the image was captured, wherein the type of surface is selected from a group consisting of: a printed document and a display surface other than a printed document;
a display-surface-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a first preprocessing algorithm when the particular image is identified as having been captured from a display surface other than a printed document, wherein the first preprocessing algorithm includes reversing the particular image;
a printed-document-preprocessing module comprising computer-executable instructions stored in the memory that, when executed by the processor, preprocesses the particular image according to a second preprocessing algorithm when the particular image is identified as having been captured from a printed document; and
an embedded-interaction-code-processing module that outputs location information for at least one of the at least one image captured from a printed document and the at least one image captured from a display surface other than a printed document
wherein the surface-type-identification module comprises a LaPlacian-filter-based surface-type-identification module that identifies, based on a filtered image, the type of surface from which the particular image was captured, and
wherein I is the particular image and the filtered image, I1, is: I1(x,y)=0 if x=0 or x =w−1 or y=0 or y=h−1, otherwise, I1(x,y)=−I(x−1, y−1)−I(x−1,y)−I(x−1,y+1)−I(x,y−1)+8I(x,y)−I(x,y+1)−I(x+1,y−1)−I(x+1,y)−I(x+1,y+1).

11. The system of claim 10, wherein the LaPlacian-filter-based surface-type-identification module identifies the type of surface from which the particular image was captured based at least in part by counting a number of positive pixels in I1 and a number of negative pixels in I1.

12. The system of claim 11, wherein the LaPlacian-filter-based surface-type-identification module identifies the type of surface from which the particular image was captured as a printed document when the number of positive pixels in I1, is greater than the number of negative pixels in I1.

13. The system of claim 11, wherein the LaPlacian-filter-based surface-type-identification module identifies the type of surface from which the particular image was captured as a display surface other than a printed document when the number of positive pixels in I1, is less than the number of negative pixels in I1.

14. A method performed on a computer having a memory and a processor for preprocessing an image based on the type of surface from which the image was captured, the method comprising:
receiving a captured image;
identifying a type of surface from which the image was captured, wherein the identifying includes invoking a feature-based surface-type-identification module that identifies, based on a feature vector, the type of surface from which the particular image was captured, wherein the feature-based surface-type-identification module identifies the type of surface from which the particular image was captured using a linear classifier to distinguish between a feature vector of an image that was captured from a printed document and a feature vector of an image that was captured from a display surface other than a printed document;
when the type of surface from which the image was captured is a printed document, preprocessing, by executing on a processor instructions stored in memory, the captured image according to a first preprocessing algorithm;
when the type of surface from which the image was captured is identified as a display surface other than a printed document, preprocessing, by executing on a processor instructions stored in memory, the captured image according to a second preprocessing algorithm; and
outputting location information for the captured image.

15. The method of claim 14, wherein the linear classifier is a Fisher linear classifier.

16. A non-signal computer-readable storage medium storing instructions that when executed by a processor perform a method comprising:
receiving a captured image from an image-capturing pen; and
identifying a type of surface from which the image was captured, wherein the type of surface is selected from a group consisting of: a printed document and a display surface other than a printed document, wherein the identifying comprises invoking a feature-based surface-type-identification module that identifies, based on a feature vector, the type of surface from which the captured image was captured using a linear classifier to distinguish between a feature vector of an image that was captured from a printed document and a feature vector of an image that was captured from a display surface other than a printed document.

17. The computer-readable storage medium of claim 16, wherein the linear classifier is a Fisher linear classifier.