Digital pen calibration by local linearization

[0001] Embodiments of the invention relate to interaction between a positionally encoded medium and a digital pen. More particularly, embodiments of the invention relate to calibrating a digital pen by local linearization and mapping locations decoded from camera-captured images to corresponding locations of the tip of the pen.

[0002] 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 placed on it by the user. One of the difficulties, however, with having a printed document with annotations is the later need to have the annotations 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 is needed.

[0003] One technique of capturing handwritten information is by using a pen whose location may be determined during writing. One 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. 15. This pattern is used by the Anoto pen (by Anoto Inc.) to determine a location of a pen on a piece of paper. However, it is unclear how efficient the determination of the location is with the system used by the Anoto pen. To provide efficient determination of the location of the captured image, a system is needed that provides efficient decoding of the captured image.

[0004] When annotating a document, a user may mark the document by moving a pen tip with respect to the document. The path of the pen tip may comprise a plurality of strokes, where each stroke corresponds to a series of captured images. Hence, efficiently identifying the path of the pen in order to process the annotation on a document would be desirable.

[0005] Further, The x-y coordinates calculated from the center of the captured images may not represent the actual location of the tip of the pen. To map the center of the captured image to the pen tip, techniques for calibrating the relationship between the pen tip and the center of images captured by the camera would be desirable. Conventional calibration techniques, however, typically require complicated equipment and/or involved calibration procedures.

[0006] Each time a user changes a pen's ink cartridge, which may happen relatively frequently, calibration may be performed. Therefore, techniques for performing calibration should be simple, relatively quick, and accurate. And such techniques should not require complicated equipment of the type typically used in connection with conventional calibration techniques.

[0007] A calibration technique is disclosed by commonly owned U.S. patent application Ser. No. 10/753,023 filed by Jian Wang et al. on Jan. 6, 2004. The calibration technique disclosed in application Ser. No. 10/753,023 is directed to determining the virtual pen-tip's location as follows:

[0008] Given homographies

[0009] $H_i=\left(\begin{array}{ccc}{h}_{11}^{\left(i\right)}& h_{12}^{\left(i\right)}& h_{13}^{\left(i\right)}\\ h_{21}^{\left(i\right)}& h_{22}^{\left(i\right)}& h_{23}^{\left(i\right)}\\ h_{31}^{\left(i\right)}& h_{32}^{\left(i\right)}& h_{33}^{\left(i\right)}\end{array}\right)$
computed for each frame captured by an image-capturing pen, i=1,2, . . . ,n, find a fixed point
p=(p₁ p₂ 1)^t,
such that it minimizes:

[0010] $g\left(p\right)=\frac{1}{2n}\sum _{i=1}^n{{\lambda }_i{H}_{i}p-\stackrel{\_}{p}}^2,\mathrm{where}$ $\stackrel{\_}{p}=\frac{1}{n}\sum _{i=1}^n{\lambda }_i{H}_{i}p=\left(\frac{1}{n}\sum _{i=1}^n{\lambda }_i{H}_i\right)p\equiv \stackrel{\_}{H}p,\mathrm{and}$ ${\lambda }_i=\frac{1}{h_{31}^{\left(i\right)}{p}_1+h_{32}^{\left(i\right)}{p}_2+h_{33}^{\left(i\right)}}.$

[0011] The virtual pentip p is first initialized as p^(k)=(0 0 1)^t, k=0. Then the real pentip estimated in each frame is:
r_i^(k)=λ_i^(k)H_ip^(k),
where the scale λ_i^(k) is to make the third component of r_i^(k) equal to 1. These real-pentip estimates are updated as:

[0012] ${\stackrel{\_}{r}}^{\left(k\right)}=\frac{1}{n}\sum _{i=1}^n{r}_i^{\left(k\right)}.$

[0013] Next, the virtual pentip estimated in each frame becomes:
p_i^(k)=μ_i^(k)H_i⁻¹ r^(k),
where the scale μ_i^(k) is to make the third component of p_i^(k) equal to 1. Then the next estimate of virtual pentip is updated as:

[0014] $\begin{array}{cc}{p}^{\left(k+1\right)}=\frac{1}{n}\sum _{i=1}^n{p}_i^{\left(k\right)}.& \left(0\right)\end{array}$

[0015] This procedure continues until g(p^(k+1))>g(p^(k)).

[0016] A calibration technique that accurately estimates the virtual pen-tip's location more quickly than the calibration technique disclosed in application Ser. No. 10/753,023 would be desirable.

[0017] X-y positions of the pen tip may be determined by using a calibration parameter to map the x-y positions of the respective centers of images captured by the pen's camera to the x-y positions of the tip of the pen. The calibration parameter may be generated by iteratively calculating estimates of the calibration parameter.

[0018] A calibration module receives calibration input data, which may be produced by a user placing the pen tip at a fixed location on a surface, which may be a positionally encoded medium, such as paper, and then rotating the pen and/or moving the opposite end of the pen in various directions to capture multiple images for use in generating the calibration parameter. A user may perform such a calibration procedure without the need for complicated calibration equipment typically used in connection with conventional calibration techniques.

[0019] A mapping module may use the calibration parameter and recovered camera-captured-location information to generate recovered pen-tip-location information.

[0020] A virtual pen tip is used for mapping a recovered image-center location to a recovered pen-tip location. The location of the virtual pen-tip depends on a predetermined relationship between the actual pen-tip and the camera based on the configuration of the pen. The virtual pen-tip is the projected point of the pen-tip on an image sensor plane of the digital pen's camera.

[0021] Additional features and advantages of the invention will be apparent upon reviewing the following detailed description.

[0041] Aspects of the present invention relate to determining the location of a captured image in relation to a larger image. The location determination method and system described herein may be used in combination with a multi-function pen.

[0042] 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, and location determination.

I. Terms

[0043] 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.

[0044] Camera—an image capture system that may capture an image from paper or any other medium.

II. General Purpose Computer

[0045] 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.

[0046] 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.

[0047] 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.

[0048] 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.

[0049] 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.

[0050] 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.

III. Image Capturing Pen

[0051] 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).

[0052] 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.

[0053] 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).

[0054] 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.

[0055] The images captured by camera 203 may be defined as a sequence of image frames {I_i}, where I_i is captured by the pen 201 at sampling time t_i. 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.

[0056] 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).

[0057] 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.

[0058] 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.

[0059] 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.

[0060] The following transformation F_S→P transforms position coordinates in the image captured by camera to position coordinates in the real image on the paper:
L_paper=F_S→P(L_Sensor)

[0061] 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 F_S→P:
L_pentip=F_S→P(L_{virtual-pentip})

[0062] The transformation F_S→P may be estimated as an affine transform. This simplifies as:

[0063] $F_{S\to P}=\left[\begin{array}{ccc}\frac{\sin {\theta }_y}{s_x}& \frac{\cos {\theta }_y}{s_x}& 0\\ \frac{-\sin {\theta }_x}{s_y}& \frac{\cos {\theta }_x}{s_y}& 0\\ 0& 0& 1\end{array}\right]$
as the estimation of F_S→P, in which θ_x, θ_y, s_x, and s_y 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 F_S→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.

[0064] Next, one can determine the location of virtual pen tip by calibration.

[0065] One places the pen tip 202 on a fixed location L_pentip 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 F_S→P. From this transformation, one can obtain the location of the virtual pen tip L_{virtual-pentip}:
L_{virtual-pentip}=F_P→S(L_pentip)
where
F_P→S=(F_S→P)⁻¹

[0066] By analyzing the L_{virtual-pentip} obtained from these images, a location of the virtual pen tip L_{virtual-pentip} may be determined.

[0067] The location of the virtual pen tip L_{virtual-pentip} is now known. One can also obtain the transformation F_S→P from the images captured. Finally, one can use this information to determine the location of the real pen tip L_pentip:
L_pentip=F_S→P(L_{virtual-pentip})

[0068] Mapping the center of camera-captured image to a corresponding pen-tip location in paper coordinates and a calibration parameter that may be used in mapping of this type in accordance with embodiments of the invention are discussed below in sections VIII and IX.

IV. Encoding of Array

[0069] 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 length (or window) n. The following describes the creation of the one-dimensional sequence then the folding of the sequence into an array.

[0070] IV.A. Sequence Construction

[0071] 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 F_q. Here, q=pⁿ 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:

[0072] $\frac{R_l\left(x\right)}{P_n\left(x\right)}$
where P_n(x) is a primitive polynomial of degree n over field F_q. R_l(x) is a nonzero polynomial of degree l (where l<n) over field F_q. The sequence may be created using an iterative procedure with two steps: first, dividing the two polynomials (resulting in an element of field F_q) 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 R_l(x): changing R_l(x) only cyclically shifts the sequence and every cyclical shifting corresponds to a polynomial R_l(x). One of the properties of the resulting sequence is that, the sequence has a period of qⁿ−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 qⁿ−1 is also referred to as the length of the sequence and n as the order of the sequence.

[0073] The process described above is but one of a variety of processes that may be used to create a sequence with the window property.

[0074] IV.B. Array Construction

[0075] 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 (P₁, P₂), namely A(k+P₁,l)=A(k,l+P₂)=A(k,l). When an n₁×n₂ window shifts through a period of A, all the nonzero n₁×n₂ matrices over F_q 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 (P₁, P₂) (with P₁ and P₂ being the horizontal and vertical number of bits present in the array) and order (n₁, n₂).

[0076] 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 m₁×m₂ where the length of the array is L=m₁×m₂=2ⁿ−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 (m₁×m₂), then use the size to let L≧m₁×m₂, where L=2ⁿ−1.

[0077] 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.

[0078] To create the folding method as shown in FIG. 3D, one creates a sequence {a_i} of length L and order n. Next, an array {b_kl} of size m₁×m₂, where gcd(m₁, m₂)=1 and L=m₁×m₂, is created from the sequence {a_i} by letting each bit of the array be calculated as shown by equation 1:
b_kl=a_i, where k=i mod(m_l), l=i mod(m₂), i=0, . . . , L−1  (1)

[0079] 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.

[0080] 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.

[0081] 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).

[0082] 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).

[0083] 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.

[0084] 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:

[0085] $\left[\begin{array}{ccccccccc}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\end{array}\right]\hspace{1em}$
V. Decoding

[0086] 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.

[0087] 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.

[0088] 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.

[0089] 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.

[0090] 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.

[0091] 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.

[0092] As will be discussed, maze 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.

[0093] Let the sequence (or m-sequence) I correspond to the power series I(x)=1/P_n(x), where n is the order of the m-sequence, and the captured image contains K bits of I: b=(b₀ b₁ b₂ . . . b_K−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 b₀ is shifted to the beginning of the sequence. Then this shifted sequence R corresponds to the power series x^s/P_n(x), or R=T^s(I), where T is the cyclic shift operator. We find this s indirectly. The polynomials modulo P_n(x) form a field. It is guaranteed that x^s≡r₀+r₁x+ . . . r_n-1x^n-1 mod(P_n(x)). Therefore, we may find (r₀, r₁, . . . , r_n-1) and then solve for s.

[0094] The relationship x^s=r₀+r₁x+ . . . r_n-1x^n-1 mod(P_n(x)) implies that R=r₀+r₁T(I)+ . . . +r_n-1T^n-1(I). Written in a binary linear equation, it becomes:
R=r^tA  (2)
where r=(r₀ r₁ r₂ . . . r_n-1)^t, and A=(I T(I) . . . T^n-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 b_i and b₀ in R be k_i, i=1,2, . . . ,k−1, then the 1^st and (k_i+1)-th elements of R, i=1,2, . . . ,k−1, are exactly b₀, b₁, . . . , b_k−1. By selecting the 1^st and (k_i+1)-th columns of A, i=1,2, . . . ,k−1, the following binary linear equation is formed:
b^t=r^tM  (3)

• • [0095] where M is an n×K sub-matrix of A.

[0096] If b is error-free, the solution of r may be expressed as:
r^t={tilde over (b)}^t{tilde over (M)}⁻¹  (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.

[0097] 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 x^s≡r₀+r₁x+ . . . r_n-1x^n-1 mod(P_n(x)).

[0098] As matrix A (with the size of n by L, where L=2ⁿ−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 k_i, only the first and (k_i+1)-th columns of A are relevant to the computation. Such choices of k_i 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=2ⁿ−1 is the length of the m-sequence).

VI. Error Correction

[0099] 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.

[0100] We adopt a stochastic approach. Assuming that the number of error bits in b, n_e, 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.

[0101] When the n bits chosen are all correct, the Hamming distance between b^t and r^tM, 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.

[0102] 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 n_e 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.

[0103] 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.

[0104] 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.

[0105] 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.

[0106] 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.

[0107] 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.

[0108] Next, the (X,Y) position in the array is calculated as: x=s mod m₁ and y=s mod m₂ and the results are returned in step 808.

VII. Location Determination

[0109] 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 position coordinates of the pen tip. Also, the output may include (or not) other information such as a rotation angle of the captured image.

[0110] 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.

[0111] Next, in step 903, the image is analyzed to determine the bit stream within it.

[0112] 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.

[0113] 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.

[0114] 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 θ.

[0115] 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.

VIII. Mapping Camera-Captured-Image Strokes to Corresponding Pen-Tip Strokes

[0116] In accordance with embodiments of the invention, x-y positions of the pen tip 202 may be determined by using a calibration parameter to map the x-y positions of the respective centers of images captured by the pen's camera 210 to the x-y positions of the tip of the pen.

[0117] FIG. 11 depicts a calibration module 1102 and a mapping module 1106 in accordance with various embodiments of the invention. The calibration module 1102 receives calibration input data 1100, which may be produced by a user placing the pen tip 202 in a fixed location on surface 207, which may be a positionally encoded medium, such as paper, and then rotating the pen and/or moving the opposite end of the pen in various directions to capture multiple images for use in generating a calibration parameter 1104.

[0118] The mapping module 1106 uses the calibration parameter 1104 and recovered camera-captured-location information 1110 to generate recovered pen-tip-location information 1108.

[0119] FIG. 13 depicts a scanned copy of positionally encoded paper including text overlaid on a positionally encoded maze pattern. FIG. 13 shows a real ink stroke 1301 as written on the paper by a pen tip 202.

[0120] FIG. 12 is a screen shot of a portion of an electronic copy of the positionally encoded paper corresponding to the scanned image of FIG. 13. In FIG. 12, a captured-image stroke 1203 has been recovered from the respective centers of images captured by the pen's camera 203 by determining the locations within the document of points along the captured-image stroke 1203.

[0121] FIG. 12 also depicts a recovered pen-tip stroke 1201 of the pen tip 202. The recovered pen-tip stroke 1201 may be obtained by applying a calibration parameter 1104 to the recovered captured-image stroke 1203.

[0122] In accordance with embodiments of the invention, the virtual pen tip 212 is used for mapping the recovered image-center stroke 1203 to the recovered pen-tip stroke 1201. The location of the virtual pen-tip depends on a predetermined relationship between the actual pen-tip 202 and the camera 203 based on the configuration of the pen. The virtual pen tip 212 is the projected point of the pen-tip 202 on the image sensor plane 209. The location of the virtual pen-tip 212 on the image sensor plane 209 is unknown but fixed.

[0123] One way to map the location of the center of an image to the location of the pen tip is to identify the spatial relationship between the pen tip and the body of the pen, the spatial relationship between the body of the pen, the lens, and the image sensor, optical characteristics such as the focal length of the lens, the physical size of a pixel of the image sensor, the distance between the image center and the optical axis of the lens, and so on. These measurements typically require special equipment. Moreover, every time the configuration of the pen changes, such as when the ink cartridge is changed, this process may need to be repeated. The concept of the virtual pen tip renders these complicated steps unnecessary. The perspective transform is applied to the location of the virtual pen tip to get the location of the pen tip, that is:
L_pentip=F_S→P(L_{virtual-pentip})  (5)
IX. Calibration

[0124] The calibration parameter 1104 may be estimated in accordance with embodiments of the invention in the manner described below. A user places the real-pen-tip 202 at a fixed location L_pentip on surface 207. Referring to FIG. 14, a portion 1400 of a positionally encoded surface 207 is shown on which L_pentip is shown at 1402. The user keeps the pen tip in the location L_pentip and captures a series of images with different pen orientations (i.e., the pen may be rotated and/or the end of the pen that is opposite the pen tip 202 may be moved in various directions while the pen tip 202 remains in the fixed location L_pentip). Referring to FIG. 14, for L_pentip 1402, images with centers along the path 1404 may be captured.

[0125] As discussed above, the virtual pen tip 212, may be used, in accordance with embodiments of the invention, for mapping the recovered image-center stroke 1203 to the recovered pen-tip stroke 1201. The virtual pen tip 212 is the projected point of the pen-tip 202 on the image sensor plane 209. The location of the virtual pen-tip 212 on the image sensor plane 209 is unknown but fixed. Once the location of the virtual pen-tip 212 is determined, the location of the real pen-tip can be determined by mapping the virtual pentip via the homography between the image and the paper. This can be formulated into the following mathematical optimization problem:

[0126] Given homographies

[0127] $H_i=\left(\begin{array}{ccc}{h}_{11}^{\left(i\right)}& h_{12}^{\left(i\right)}& h_{13}^{\left(i\right)}\\ h_{21}^{\left(i\right)}& h_{22}^{\left(i\right)}& h_{23}^{\left(i\right)}\\ h_{31}^{\left(i\right)}& h_{32}^{\left(i\right)}& h_{33}^{\left(i\right)}\end{array}\right),$
i=1,2, . . . ,n, find a fixed point
p=(p₁ p₂ 1)^t,
such that it minimizes:

[0128] $g\left(p\right)=\frac{1}{2n}\sum _{i=1}^n{{\lambda }_i{H}_{i}p-\stackrel{\_}{p}}^2,\mathrm{where}$ $\stackrel{\_}{p}=\frac{1}{n}\sum _{i=1}^n{\lambda }_i{H}_{i}p=\left(\frac{1}{n}\sum _{i=1}^n{\lambda }_i{H}_i\right)p\equiv \stackrel{\_}{H}p,\mathrm{and}$ ${\lambda }_i=\frac{1}{h_{31}^{\left(i\right)}{p}_1+h_{32}^{\left(i\right)}{p}_2+h_{33}^{\left(i\right)}}$
where p is the coordinate of the virtual pentip in the captured image. g(p) is an objective function that measures the diversity of the estimated real pentips on the paper. λ_i is a scale that makes the third component of the estimated real pentip H_ip equal to 1. H_i is the homography (i.e., the matrix for the transform F_S→P) for the i-th captured image, p is the average of the estimated real pentips, and H is the average of the homographies.

[0129] The location of the virtual pen-tip 212 is initialized. Let p minimize:

[0130] $\tilde{g}\left(p\right)=\frac{1}{2}\sum _{i=1}^n{{\tilde{H}}_{i}p-\tilde{p}}^2=\frac{1}{2}\sum _{i=1}^n{\left({\tilde{H}}_i-\tilde{H}\right)p}^2,\mathrm{where}$ ${\tilde{H}}_i=\left(\begin{array}{ccc}{h}_{11}^{\left(i\right)}& h_{12}^{\left(i\right)}& h_{13}^{\left(i\right)}\\ h_{21}^{\left(i\right)}& h_{22}^{\left(i\right)}& h_{23}^{\left(i\right)}\\ 0& 0& 1\end{array}\right),\tilde{p}=\frac{1}{n}\sum _{i=1}^n{\tilde{H}}_{i}p=\left(\frac{1}{n}\sum _{i=1}^n{\tilde{H}}_i\right)p\equiv \tilde{H}p$
where {tilde over (H)}_i is the affine approximation of the homography H_i, {tilde over (p)} is the average of the estimated real pentips under affine transform {tilde over (H)}_i, and {tilde over (H)} is the average of the affine transforms.

[0131] Namely, p is initialized by approximating the homographies with affine transforms. As the third component of p is always 1, and the third row of {tilde over (H)}_i is always (0, 0, 1), we need not take them into consideration. Therefore, we define:

[0132] $\begin{array}{ccc}\hat{p}=\left(\begin{array}{c}{p}_1\\ p_2\end{array}\right),& {\hat{H}}_i=\left(\begin{array}{cc}{h}_{11}^{\left(i\right)}& h_{12}^{\left(i\right)}\\ h_{21}^{\left(i\right)}& h_{22}^{\left(i\right)}\end{array}\right),& h_3^{\left(i\right)}=\left(\begin{array}{c}{h}_{13}^{\left(i\right)}\\ h_{23}^{\left(i\right)}\end{array}\right),\end{array}$

[0133] where {circumflex over (p)} is the first two component of p, Ĥ_i and h₃⁽ⁱ⁾ are the sub-matrices of {tilde over (H)}_i, respectively.

[0134] then {tilde over (g)}(p) becomes

[0135] $\begin{array}{c}\tilde{g}\left(\hat{p}\right)=\frac{1}{2}\sum _{i=1}^n{{\hat{H}}_i\hat{p}+h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\hat{p}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(j\right)}\right)}^2\\ =\frac{1}{2}\sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]\hat{p}+h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(j\right)}\right)}^2.\end{array}$

[0136] The optimal choice of {circumflex over (p)} should make the derivative with respective to {circumflex over (p)} equal to 0:

[0137] $\begin{array}{c}\frac{\partial \tilde{g}}{\partial \hat{p}}=\sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]}^t\{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]\hat{p}+\\ h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(j\right)}\right)\}\\ =\left\{\sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]}^t\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]\right\}\hat{p}+\\ \sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]}^t\left[h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(j\right)}\right)\right]\\ =0,\\ \mathrm{therefore}\\ \hat{p}=-{\left\{\sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]}^t\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]\right\}}^{-1}\\ \sum _{i=1}^n{\left[{\hat{H}}_i-\frac{1}{n}\left(\sum _{j=1}^n{\hat{H}}_j\right)\right]}^t\left[h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(j\right)}\right)\right]\\ =-{\left[\sum _{i=1}^n{\hat{H}}_i^t{\hat{H}}_i-\frac{1}{n}{\left(\sum _{i=1}^n{\hat{H}}_i\right)}^t\left(\sum _{i=1}^n{\hat{H}}_i\right)\right]}^{-1}\sum _{i=1}^n{\hat{H}}_i^t\left[h_3^{\left(i\right)}-\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(i\right)}\right)\right]\end{array}$

[0138] To write the above formula in a more compact form, define:

[0139] $\stackrel{\_}{\hat{H}}=\sum _{i=1}^n{\hat{H}}_i,{\stackrel{\_}{h}}_3=\frac{1}{n}\left(\sum _{j=1}^n{h}_3^{\left(i\right)}\right),\mathrm{then}$ $\hat{p}=-{\left(\sum _{i=1}^n{\hat{H}}_i^t{\hat{H}}_i-\frac{1}{n}{\stackrel{\_}{\hat{H}}}^t\stackrel{\_}{\hat{H}}\right)}^{-1}\sum _{i=1}^n{\hat{H}}_i^t\left(h_3^{\left(i\right)}-{\stackrel{\_}{h}}_3\right).$

[0140] Note that for an invertible 2×2 matrix

[0141] $A=\left(\begin{array}{cc}{a}_{11}& a_{12}\\ a_{21}& a_{22}\end{array}\right),A^{-1}=\frac{1}{a_{11}{a}_{22}-a_{21}{a}_{12}}\left(\begin{array}{cc}{a}_{22}& -a_{12}\\ -a_{21}& a_{11}\end{array}\right).$

[0142] Accordingly, the computation of {circumflex over (p)} is rather easy, and p can be initialized as

[0143] $\left(\begin{array}{c}\hat{p}\\ 1\end{array}\right).$

[0144] Next p is iteratively updated so that it becomes more and more accurate. To derive the update scheme, we define the error functions:

[0145] $g_i\left(p\right)={\lambda }_i{H}_{i}p-\stackrel{\_}{H}p=\left({\lambda }_i{H}_i-\stackrel{\_}{H}\right)p\equiv \left(\begin{array}{c}{g}_{i,1}\\ g_{i,2}\\ 0\end{array}\right).$

[0146] Then

[0147] $g\left(p\right)=\sum _{i=1}^n{g_i\left(p\right)}^2.$

[0148] To update p by δp, δp should minimize g(p+δp). In fact, (dropping the third dimension of p and g_i):

[0149] $\begin{array}{c}g\left(p+\delta p\right)=\frac{1}{2n}\sum _{i=1}^n{\left[g_i\left(p+\delta p\right)\right]}^t{g}_i\left(p+\delta p\right)\\ \approx \frac{1}{2n}\sum _{i=1}^n{\left[g_i\left(p\right)+\nabla g_i\delta p\right]}^t\left[g_i\left(p\right)+\nabla g_i\delta p\right]\\ =\frac{1}{2n}\sum _{i=1}^n{\left[g_i\left(p\right)\right]}^t\left[g_i\left(p\right)\right]+\frac{1}{n}\left\{\sum _{i=1}^n{\left[g_i\left(p\right)\right]}^t\nabla g_i\right\}\delta p+\\ \frac{1}{2n}{\left(\delta p\right)}^t\left[\sum _{i=1}^n{\left(\nabla g_i\right)}^t\nabla g_i\right]\delta p\end{array}$

[0150] where

[0151] $\nabla g_i=\left(\begin{array}{cc}\frac{\partial g_{i,1}}{\partial p_1}& \frac{\partial g_{i,1}}{\partial p_2}\\ \frac{\partial g_{i,2}}{\partial p_1}& \frac{\partial g_{i,2}}{\partial p_2}\end{array}\right),$
is the gradient of the vector function g_i

[0152] The minimization of g(p+δp) implies:

[0153] $\begin{array}{cc}\frac{\partial g\left(p+\delta p\right)}{\partial \left(\delta p\right)}=\frac{1}{n}\sum _{i=1}^n{\left(\nabla g_i\right)}^t{g}_i\left(p\right)+\frac{1}{n}\left[\sum _{i=1}^n{\left(\nabla g_i\right)}^t\nabla g_i\right]\delta p=0.\mathrm{Therefore},\text{}\delta p=-{\left[\sum _{i=1}^n{\left(\nabla g_i\right)}^t\nabla g_i\right]}^{-1}\left[\sum _{i=1}^n{\left(\nabla g_i\right)}^t{g}_i\left(p\right)\right].& \left(6\right)\end{array}$

[0154] Solving equation (6), then p can be updated via: p^(k+1)=p^(k)+δp. The update may end when p converges such that ∥δp∥ becomes smaller than a threshold, such as 0.0005. Alternatively, the iteration may stop once g(p^(k+1))>g(p^(k)).

[0155] The final value of p may then be used as the calibration parameter L_{virtual-pentip} in equation (5) for mapping the recovered image-center stroke 1203 to the recovered pen-tip stroke 1201.

[0156] The calibration technique in accordance with embodiments of the present invention provides significant functional advantages over the calibration technique disclosed by commonly owned U.S. patent application Ser. No. 10/753,023 filed by Jian Wang et al. on Jan. 6, 2004. Relative to the calibration technique disclosed in application Ser. No. 10/753,023, the calibration technique disclosed in accordance with embodiments of the present invention provides a more accurate initial estimate of the virtual pen-tip and provides a substantially accurate estimate of the virtual pen-tip's location more quickly.

[0157] FIG. 16 is a table that shows an example of the improved efficiency of the calibration technique in accordance with embodiments of the present invention relative to the calibration technique disclosed in application Ser. No. 10/753,023.

[0158] FIGS. 17 and 18 are graphs that show the estimated virtual-pen-tip locations, p, contained in the table of FIG. 16. FIG. 18 is a zoomed in version of FIG. 17. In FIGS. 17 and 18, series 2, which has data points represented by squares, represents the data points generated by the technique disclosed in application Ser. No. 10/753,023, and series 1, which has data points represented by diamonds (i.e., squares rotated 45 degrees), represents the data points generated by the technique disclosed in accordance with embodiments of the present invention.

[0159] As indicated in FIGS. 16-18, the calibration technique disclosed in accordance with embodiments of the present invention converges to a substantially accurate estimate in three iterations (i.e., K=2). The technique disclosed in application Ser. No. 10/753,023, on the other hand, takes 7 iterations (i.e., K=6) to converge to a substantially accurate estimate. The calibration technique disclosed in accordance with embodiments of the present invention uses the gradient of the error function g, i.e., by computing δp in equation (6), for updating the location estimate, p, of the virtual pen-tip. The technique disclosed in application Ser. No. 10/753,023 uses a calculated average, i.e., by computing equation (0), rather than the gradient of the error function, to update the location estimate of the virtual pen-tip.

[0160] As can also be seen from FIGS. 16 and 17, on the first iteration (i.e., K=0), the technique in accordance with embodiments of the present invention provides a significantly more accurate initial estimate (i.e., (−1.51326, 60.55272)) as compared to the initial estimate (i.e., (0, 0)) generated by the technique disclosed in application Ser. No. 10/753,023.

X. Concluding Remarks

[0161] As can be appreciated by one skilled in the art, a computer system with an associated computer-readable medium containing instructions for controlling the computer system can be utilized to implement the embodiments that are disclosed herein. The computer system may include at least one computer such as a microprocessor, digital signal processor, and associated peripheral electronic circuitry.

[0162] Although the invention has been defined using the appended claims, these claims are illustrative in that the invention is intended to include the elements and steps described herein in any combination or sub combination. Accordingly, there are any number of alternative combinations for defining the invention, which incorporate one or more elements from the specification, including the description, claims, and drawings, in various combinations or sub combinations.