Preprocessing for information pattern analysis

Information

  • Patent Grant
  • 7920753
  • Patent Number
    7,920,753
  • Date Filed
    Thursday, June 12, 2008
    16 years ago
  • Date Issued
    Tuesday, April 5, 2011
    13 years ago
Abstract
Pre-processing techniques for processing an image to improve the distinctiveness of an information pattern captured in the image before the information pattern is analyzed in a decoding process. The brightness of an image first is normalized by dividing the image into blocks of areas, such as pixels. A brightness distribution value then is determined for each area of the image by fitting the brightness of its surrounding blocks using bilinear interpolation and extrapolation, and a normalized brightness value for each area can then be obtained by dividing the original brightness value by the brightness distribution value. Next, masks are created to distinguish the information pattern from content captured in the image. The masks may be generated based upon contrast differences between the brightness of pixels representing the information pattern, the brightness of pixels representing content, and the brightness of pixels representing the background of the writing medium.
Description
FIELD OF THE INVENTION

The present invention relates to processing an image for subsequent visual analysis. Various aspects of the present invention are particularly applicable to preprocessing an image so that marks forming in information pattern in the image can be easily distinguished from other objects in the image in a later processing operation.


BACKGROUND OF THE INVENTION

While electronic documents stored on computers provide a number of advantages over written documents, many users continue to perform some tasks with printed versions of electronic documents. These tasks include, for example, reading and annotating the documents. With annotations, the paper version of the document assumes particular significance, because the annotations typically are written directly onto the printed document. One of the problems, however, with directly annotating a printed version of a document is the difficulty in later converting the annotations into electronic form. Ideally, electronically stored annotations should correspond with the electronic version of the document in the same way that the handwritten annotations correspond with the printed version of the document.


Storing handwritten annotations in electronic form typically requires a user to review each handwritten annotation and personally enter it into a computer. In some cases, a user may scan the annotations written on a printed document, but this technique creates a new electronic document. The user must then reconcile the original version of the electronic document with the version having the scanned annotations. Further, scanned images frequently cannot be edited. Thus, there may be no way to separate the annotations from the underlying text of the original document. This makes using the annotations difficult.


To address this problem, pens have been developed to capture annotations written onto printed documents. In addition to a marking instrument, this type of pen includes a camera. The camera captures images of the printed document as a user writes annotations with the marking instrument. In order to associate the images with the original electronic document, however, the position of the images relative to the document must be determined. Accordingly, this type of pen often is employed with specialized media having an information pattern printed on the writing surface. The information pattern represents a code that is generated such that the different sections of the pattern occurring around a location on the media will uniquely identify that location. By analyzing or “decoding” this information pattern, a computer receiving an image from the camera can thus determine what portions of the code (and thus what portion of a document printed on the paper) were captured in the image. One example of this type of information pattern is described in U.S. patent application Ser. No. 10/284,412, entitled “Active Embedded Interaction Code,” filed on Oct. 31, 2002, and naming Jian Wang et al. as inventors, which application is incorporated entirely herein by reference. In addition to providing location information, various implementations of this type of information pattern can alternately or additionally be used to represent other types of information as metadata, such as a document identification number.


While the use of such patterned paper or other media allows written annotations on a paper document to be converted into electronic form and properly associated with the electronic version of the document, this technique presents its own difficulties. For example, because the camera is mounted on the pen, both the pen and the writer's hand may affect the quality of the captured images. When writing with a pen, very few users will maintain the pen in a completely vertical direction. Instead, most users will tilt the pen toward their person, toward their person and to their left, or toward their person and to their right. A few users may even tilt the pen away from their person.


The various tilting angle between pen and paper will make the illumination of captured image varies correspondingly. For example, the gray level of an image captured from a blank area will be different from one area to another. Even if the pen includes a light, such as an infrared LED, mounted near the pen tip for illumination, when the pen is tilted the distance between the writing surface and the image sensor will not be uniform, resulting in a non-uniform illumination for the image.


In addition, the printed document itself may obscure areas of the pattern printed on the writing surface of the media. That is, the content making up the document, such as text and pictures, may obscure or occlude portions of the information pattern printed on the writing surface. If the pen captures an image of one of these areas, then the computer may not be able to use distinguish the information pattern from the content. Also, the computer may not accurately recognize the code from the image. For example, if the code is binary, then the computer may erroneously recognize a portion of the pattern representing a “0” value as a “1” value, or vice versa.


BRIEF SUMMARY OF THE INVENTION

Various aspects of the invention provide pre-processing techniques for processing an image to improve the distinctiveness of an information pattern captured in the image before the information pattern is analyzed in a decoding process. According to various implementations of the invention, the brightness of an image first is normalized. In particular, an image is divided into blocks of areas, such as pixels. A brightness distribution value then is determined for each area of the image by interpolating the brightness of its surrounding blocks. A normalized brightness value for each area can then be obtained by dividing the original brightness value for the area by the brightness distribution value.


Still other examples of the invention may alternately or additionally create masks for distinguishing an information pattern captured in the image from content captured in the image. For example, some implementations of the invention will create a mask corresponding to the content printed on the writing medium, so that this content can be excluded from analysis regarding the information pattern. Still other implementations of the invention will create a mask corresponding to the information pattern printed on the writing medium, so that the pattern can be distinctly identified. With various examples of the invention, these masks may be generated based upon contrast differences between the brightness of pixels representing the information pattern, the brightness of pixels representing content, and the brightness of pixels representing the background of the writing medium.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a general description of a computer that may be used in conjunction with embodiments of the present invention.



FIG. 2 illustrates an example of a computing system of the type that may be employed to implement various embodiments of the invention.



FIG. 3A illustrates an example of a pen/camera device that can be employed according to various embodiments of the invention, while FIG. 3B illustrates the resolution of an image that may be obtained by various embodiments of the invention. FIG. 3C then illustrates an example of a code symbol that can be employed to create an information pattern according to various examples of the invention.



FIG. 4 illustrates an example of an image brightness normalization module that may be employed to normalize the brightness of an image according to various embodiments of the invention.



FIGS. 5A and 5B illustrate a flowchart describing the operation of the image brightness normalization module illustrated in FIG. 4.



FIG. 6 illustrates an example of an image that might be processed by the image brightness normalization module illustrated in FIG. 4.



FIG. 7 illustrates the segmentation of the image into blocks starting from the top of the image.



FIG. 8 illustrates the segmentation of the image into blocks starting from the bottom of the image.



FIG. 9 illustrates one example of a type of histogram that might be employed by various embodiments of the invention to estimate the brightness of a block.



FIG. 10 illustrates the gray level information obtained using the operation described in FIGS. 5A and 5B.



FIGS. 11 and 12 illustrate the different regions for which interpolation is used to determine the brightness value information according to various embodiments of the invention.



FIG. 13 illustrates the brightness distribution values obtained for the image shown in FIG. 6 using the operation described in FIGS. 5A and 5B.



FIG. 14 illustrates how the image shown in FIG. 6 appears after being processed using the operation described in FIGS. 5A and 5B.



FIG. 15 illustrates a pattern determination system for distinguishing an information pattern from content in a document image according to various embodiments of the invention.



FIGS. 16A and 16B illustrate a flowchart describing the operation of the pattern determination system illustrated in FIG. 15.



FIG. 17 illustrates the high-contrast areas identified using the operation described in FIGS. 16A and 16B.



FIG. 18 illustrate an example of a gray-level histogram used to determine a content brightness threshold according to various examples of the invention.



FIG. 19 illustrates a relationship between neighboring pixels.



FIG. 20 illustrates an image that has been processed using the operation described in FIGS. 5A, 5B, 16A and 16B.





DETAILED DESCRIPTION OF THE INVENTION

Overview



FIG. 1 illustrates an example of a preprocessing system that may be implemented according to various examples of the invention. As seen in this figure, a pen/camera device 101 provides a captured image to the image preprocessing system 103. More particularly, the pen/camera device 101 provides a captured image to the image brightness normalization module 105. As will be explained in greater detail below, the image brightness normalization module 105 normalizes the brightness of the different areas in the image, in order to mitigate the affects of inconsistent illumination during the operation of the pen/camera device 101.


Once the brightness of the captured image has been normalized, the image brightness normalization module 105 provides the normalized image to the pattern determination module 109. As will also be described in more detail below, the pattern determination module 109 analyzes the normalized image to identify areas having differences in brightness above a threshold level, in order to distinguish those areas in the normalized image that represent content from those areas in the normalized image that represent the information pattern. In this manner, the information pattern can be more accurately distinguished from the remainder of the captured image. The preprocessed image is then provided to the pattern analysis module 111 for further processing to determine the portion of the information pattern captured in the image, and thus the location of the pen/camera device 101 when the image was obtained.


Operating Environment


While some embodiments of the invention may be implemented using analog circuits, various embodiments of the invention will typically be implemented by executing software instructions on a programmable computer system. Accordingly, FIG. 2 shows 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. 2, a computer 200 includes a processing unit 210, a system memory 220, and a system bus 230 that couples various system components including the system memory to the processing unit 210. The system bus 230 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 220 includes read only memory (ROM) 240 and random access memory (RAM) 250.


A basic input/output system 260 (BIOS), containing the basic routines that help to transfer information between elements within the computer 200, such as during start-up, is stored in the ROM 240. The computer 200 also includes a hard disk drive 270 for reading from and writing to a hard disk (not shown), a magnetic disk drive 280 for reading from or writing to a removable magnetic disk 290, and an optical disk drive 291 for reading from or writing to a removable optical disk 292 such as a CD ROM or other optical media. The hard disk drive 270, magnetic disk drive 280, and optical disk drive 291 are connected to the system bus 230 by a hard disk drive interface 293, a magnetic disk drive interface 294, and an optical disk drive interface 295, 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 200. 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 270, magnetic disk 290, optical disk 292, ROM 240 or RAM 250, including an operating system 296, one or more application programs 297, other program modules 298, and program data 299. A user can enter commands and information into the computer 200 through input devices such as a keyboard 201 and pointing device 202. 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 210 through a serial port interface 206 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 230 via an appropriate interface (not shown). A monitor 207 or other type of display device is also connected to the system bus 230 via an interface, such as a video adapter 208. 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 265 and accompanying pen or stylus 266 are provided in order to digitally capture freehand input. Although a direct connection between the pen digitizer 265 and the serial port is shown, in practice, the pen digitizer 265 may be coupled to the processing unit 210 directly, via a parallel port or other interface and the system bus 230 as known in the art. Furthermore, although the digitizer 265 is shown apart from the monitor 207, it is preferred that the usable input area of the digitizer 265 be co-extensive with the display area of the monitor 207. Further still, the digitizer 265 may be integrated in the monitor 207, or may exist as a separate device overlaying or otherwise appended to the monitor 207.


The computer 200 can operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 209. The remote computer 209 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 200, although only a memory storage device 211 has been illustrated in FIG. 2. The logical connections depicted in FIG. 2 include a local area network (LAN) 212 and a wide area network (WAN) 213. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the computer 200 is connected to the local network 212 through a network interface or adapter 214. When used in a WAN networking environment, the personal computer 200 typically includes a modem 215 or other means for establishing a communications over the wide area network 213, such as the Internet. The modem 215, which may be internal or external, is connected to the system bus 230 via the serial port interface 206. In a networked environment, program modules depicted relative to the personal computer 200, 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 Device


As previously noted, various embodiments of the invention may be employed to determine the locations of portions of a document captured by a series of images. The determination of the location of a portion of a document captured in an image may be used to ascertain the location of a user's interaction with paper, a display screen, or other medium displaying the document. According to some implementations of the invention, the images may be obtained by an ink pen used to write ink on paper. With other embodiments of the invention, the pen may be a stylus used to “write” electronic ink on the surface of a digitizer displaying the document.



FIGS. 3A and 3B show an illustrative example of a pen 301 that may be employed as the pen/camera device 101 according to various embodiments of the invention. The pen 301 includes a tip 302 and a camera 303. The tip 302 that may or may not include an ink reservoir. The camera 303 captures an image 304 from surface 307. The pen 301 may further include additional sensors and/or processors as represented in broken box 306. These sensors and/or processors 306 may also include the ability to transmit information to another pen 301 and/or a personal computer (for example, via Bluetooth or other wireless protocols).



FIG. 3B represents an image as viewed by the camera 303. In one illustrative example, the resolution of an image captured by the camera 303 is N×N pixels (where, in the illustrated example, N=32). Accordingly, FIG. 3B shows an example image 32 pixels long by 32 pixels wide. The size of N is adjustable, and a higher value of N will provide a higher image resolution. Also, while the image captured by the camera 303 is shown as a square for illustrative purposes here, the field of view of the camera may include other shapes as is known in the art. The images captured by camera 303 may be defined as a sequence of image frames {Ii}, where Ii is captured by the pen 301 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.



FIG. 3A also shows the image plane 309 on which an image 310 of the pattern from location 304 is formed. Light received from the pattern on the object plane 307 is focused by lens 308. According to various embodiments of the invention, the lens 308 may be a single lens or a multi-part lens system, but is represented here as a single lens for simplicity. Image capturing sensor 311 captures the image 310.


The image sensor 311 may be large enough to capture the image 310. Alternatively, the image sensor 311 may be large enough to capture an image of the pen tip 303 at location 313. For reference, the image at location 313 will be referred to as the virtual pen tip. It should be noted that the virtual pen tip location with respect to image sensor 311 is fixed because of the constant relationship between the pen tip, the lens 308, and the image sensor 311.



FIG. 3C illustrates an example of a code symbol that can be used to represent one or more bits making up an information pattern. As seen in this figure, the code symbol has four black dark dots 315 that represent the border of the symbol 317. It also includes data dots 319 that can be either marked black or left white (or blank) to represent data bits. Still further, the illustrated code symbol includes orientation dots 321 that are always left white (or blank) to allow the decoding process to determine an orientation of the symbol.


As discussed herein, a code symbol is the smallest unit of visual representation of an information pattern. Generally, a code symbol will include the pattern data represented by the symbol. As shown in the illustrated example, one or more bits may be encoded in one code symbol. Thus, for a code symbol with 1 bit represented, the represented data may be “0” or “1”, for a code symbol representing 2 bits, the represented data may be “00”, “01”, “10” or “11.” Thus, a code symbol can represent any desired amount of data for the information pattern. The code symbol also will have a physical size. When the information pattern is, for example, printed on paper, the size of a code symbol can be measured by printed dots. For example, the illustrated code symbol is 16×16 printed dots. With a 600 dpi printer, the diameter of a printed dot will be about 0.04233 mm.


Still further, a code symbol will have a visual representation. For example, if a code symbol represents 2 bits, the visual representation refers to the number and position distribution of the black dots used to represent the data values “00”, “01”, “10” or “11”. Thus, the code symbol illustrated in FIG. 3C may be referred to as a “8-a-16” symbol, since it represents 8 data bits using a 16×16 array of discrete areas. Of course, symbols having a variety of different represented pattern data values, sizes, and visual representation configurations will be apparent to those of ordinary skill in the art upon consideration of this description.


Brightness Normalization



FIG. 4 illustrates one example of an image brightness normalization tool that may be employed for the image brightness normalization module 105 shown in FIG. 1. The image brightness normalization module 105 includes an image segmentation module 401 that segments an image into blocks of smaller areas, such as pixels, and a block brightness estimation module 403 that estimates the brightness of each block. The image brightness normalization module 105 also has an area brightness distribution determination module 405. This module performs a bilinear fitting of the brightness distribution for each area, as will be explained in more detail below. Still further, the image brightness normalization module 105 includes an area brightness normalization module 407, which normalizes the brightness of each area in the image. The operation of each of these modules will be discussed in greater detail with reference FIGS. 5A-14.


Turning now to FIG. 5A, in step 501 the image segmentation module 401 receives an image from the camera/pen device 101. FIG. 6 illustrates one example of a raw image 601 that might be received from the camera/pen device 101. As seen in this figure, the image 601 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 503, the image segmentation module 401 segments the image 601 into blocks of areas. In the illustrated example, the image brightness normalization module 105 uses pixels as the areas upon which operations are performed. It should be appreciated, however, that alternately 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 401 segments the image into blocks starting from the top of the image 601, as shown in FIG. 7. The blocks 701 may conveniently be identified hereafter by coordinate values on indices m, n, as shown in this figure. In the illustrated embodiment, image segmentation module 401 segments the image 601 into blocks 701 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 601 in the illustrated example has a height of 100 pixels and the blocks 701 are formed from 16×16 groups of pixels, there is a small region 703 at the bottom of the image 601 in which the pixels are not segmented into blocks 701. As will be apparent from the detailed explanation provided below, this discrepancy may skew the accuracy of the brightness normalization process. Accordingly, as shown in FIG. 8, the image segmentation module 401 forms a second segment of blocks 801 starting from the bottom of the image 601. The blocks 801 may conveniently be identified hereafter by coordinate values on indices m1, n1, as shown in FIG. 8. As with blocks 701, the blocks 801 are formed from 16×16 groups of pixels.


Next, in step 505, the block brightness estimation module 403 estimates the brightness value for each block 701 and 801. That is, the block brightness estimation module 403 estimates an overall representative brightness value for each block 701 and 801 based upon the gray level of each individual pixel making up the block. In the illustrated example, the block brightness estimation module 403 estimates the brightness value of a block 701 or 801 by creating a histogram of the number of pixels in the block at each gray-level.



FIG. 9 illustrates one example of a type of histogram that might be employed by various embodiments of the invention to estimate the brightness of a block 701 or 801. 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 brightness estimation module 403 estimates a representative brightness value for the block. In the illustrated example, the block brightness estimation module 403 identifies the 90th percentile gray level to be the estimated brightness value of the block. That is, the block brightness estimation module 403 identifies the gray level G90th at which 90% of the pixels in the block are darter than G90th, and employs this value as the brightness value of the block. Of course, other embodiments of the invention may employ alternate percentile criteria for estimating the brightness value of a block as desired. Still further, some embodiments of the invention may employ alternate techniques for determining the overall brightness of each block.


It also should be noted that the illustrated example relates to a black-and-white image. Accordingly, the brightness level corresponds to a gray scale level Various embodiments of the invention alternately may be used to process color images. With these embodiments, the block brightness estimation module 403 will operate based upon the color brightness level of each pixel in the image.


After the block brightness estimation module 403 has estimated the brightness value for each block 701 and 801, the area brightness distribution determination module 405 performs a bilinear fitting of the brightness distribution for each area in step 507. As previously noted, there is a region 703 at the bottom of image 601 that has not been segmented into any of the blocks 701. The brightness distribution values for the pixels in these regions thus are determined using the blocks 801 rather than the blocks 701. Accordingly, the brightness distribution values are determined in a two-step process. The pixels that are primarily within blocks 701 (i.e., the pixels having a y coordinate value of 0-87 are determined using the estimated brightness values of the blocks 701, while the pixels that are primarily within blocks 801 (i.e., the pixels having a y coordinate value of 88-99) are determined using the estimated brightness values of the blocks 801.


With the illustrated embodiment, for each pixel (x, y), where y=0, 1, . . . 87, the brightness distribution value of that pixel D(x,y) is estimated by using bilinear fitting method as:

D(x,y)=(1−ηy)·[(1−ηxIB(m,n)x·IB(m+1,n)]+ηy·[(1−ηxIB(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

=

ms
+

s
2



,


x
2

=



(

m
+
1

)


s

+

s
2



,


y
1

=

ns
+

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 brightness value information employed to determine the brightness distribution value of a pixel using this process is graphically illustrated in FIG. 10. As will be appreciated from this image, some pixels will fall outside of any region 1001 that can be equally distributed among four adjacent blocks 701. 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 1001 that can be equally distributed among four adjacent blocks 701. For these pixels in border regions, the above equations may still be applied to determine their brightness distribution values, except that extrapolation will be used instead of interpolation. The different regions are graphically illustrated in FIG. 11.


Similarly, for each pixel (x,y), where y=88, 89, . . . 99, the brightness distribution value of that pixel D(x,y) is estimated as:

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

where IB(m1,n1)=G90th (m1, n1) s is the size of a block (in our 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 801. For these pixels in border regions, the above equations may still be applied to determine their brightness distribution values, except that extrapolation will be used instead of interpolation. The different regions are graphically illustrated in FIG. 12. The brightness distribution values 1301 for the entire image 601 are then shown in FIG. 13.


Once the area brightness distribution determination module 405 has determined the brightness distribution value for each area, the area brightness normalization module 407 determines the normalized gray level value for each area in step 509. More particularly, the area brightness normalization module 407 determines the normalized gray level value for each area by dividing the area's original gray level value for the brightness distribution value for that area. Next, in step 511, the area brightness normalization module 407 obtains an adjusted normalized gray level value for each area by multiplying the normalized gray level value for each area by a uniform brightness level G0. In the illustrated example, the value of uniform brightness level G0 is 200, but alternate embodiments of the invention may employ different values for the uniform brightness level G0. The uniform brightness level G0 represents the supposed gray level of the captured image in a blank area for an ideal situation (i.e., a 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 brightness level G0.


Lastly in step 513, the area brightness normalization module 407 selects a final normalized gray level value for each pixel by assigning each pixel a new gray level value that is the lesser of its adjusted normalized gray level value and the maximum gray level value. Thus, with the illustrated example, the final normalized gray level 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 brightness normalization module 407 outputs a normalized image using the final normalized gray level value for each pixel. FIG. 14 illustrates how the image 601 appears as image 1401 after being processed in the manner described in detail above.


Pattern Determination


After the image brightness normalization module 105 normalizes the image captured by the pen/camera device 101, the pattern determination module 109 distinguishes the areas of the normalized image that represent content in a document from the areas of the normalized image that represent the information pattern. FIG. 15 illustrates a pattern determination system for distinguishing an information pattern from content in a document image. As seen in this figure, the pattern determination module 109 includes an area average filtering module 1501 and a high-contrast region determination module 1503. As will be discussed in greater detail below, the area average filtering module 1501 applies an averaging filter to the brightness value of each area in the image. The high-contrast region determination module 1503 then identifies high-contrast regions in the image.


The pattern determination module 109 also includes a content brightness threshold determination module 1505, a content identification module 1507, a pattern brightness threshold determination module 1509, and a pattern identification module 1511. As will be discussed in greater detail below, for a black-and-white image, the content brightness threshold determination module 1505 determines a first gray level value threshold that the content identification module 1507 then uses to identify areas of the image representing content. Similarly, for a black-and-white image, the pattern brightness threshold determination module 1509 determines a second gray level value threshold that the pattern identification module 1511 uses to identify areas of the image that represent an information pattern.


The pattern determination module 109 takes advantage of the fact that, in an image of a document containing both content (e.g., printed text, pictures, etc.) and an information pattern, the information pattern, document content and document background tend to have different brightness levels. Thus, with a black-and-white image, the areas representing the information 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 information pattern being the second darkest, and the areas representing the document background being the least dark. Thus, the pattern determination module 109 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 109 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 gray level value above a second threshold are then identified as representing the information pattern. These regions can then be marked as being made up of areas representing the information pattern. For example, the areas in a pattern region may be assigned a value of 1 in an information pattern mask. Thus distinguished from the rest of the image, the areas representing the information pattern can be more accurately analyzed by the pattern analysis module 111.


The operation of the pattern determination module 109 will now be described with reference to FIGS. 16A-20. More particularly, the operation of the pattern determination module 109 will be discussed as applied to the normalized image 1401. 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 brightness normalization module 105, if the image is a color image, then the pattern determination module 105 will operate using color brightness levels rather than gray levels. Also, the illustrated example of the pattern determination module 109 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 brightness normalization module 105.


Initially, high contrast areas are identified to more efficiently locate regions that represent content, as previously noted. Because the regions representing the information pattern may also have a large difference in brightness levels, however, the image areas are first filtered to reduce the brightness level value difference in the regions surrounding the information pattern. More particularly, in step 1601, the area average filtering module 1501 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 brightness-normalized gray level.


Next, in step 1603, the high-contrast region determination module 1503 identifies the high-contrast regions in the image using the averaged gray level of each pixel. In particular, for each pixel, the high-contrast region determination module 1503 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 1503 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 101. FIG. 17 illustrates the high-contrast areas 1701 identified in image 1401 using the above-described technique.


Next, in step 1605, the content brightness threshold determination module 1505 determines a threshold for separating areas representing document content from the other areas of the image. To determine the threshold, the content brightness threshold determination module 1505 creates a gray-level histogram for the high-contrast regions. An example of such a histogram 1801 is illustrated in FIG. 18. As seen in this figure, the X-axis of this histogram 1801 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 such 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, which is incorporated entirely herein by reference.


Once the threshold value T0 has been determined, the content identification module 1507 uses the threshold T0 identify the areas of the image representing content in step 1607. 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={(x,y)|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. 19. 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 (xt,yt)εRt, Document Content Mask (xi,yi)=0. This eliminates regions that are too small to actually represent document content.


Next, in step 1609, the pattern brightness threshold determination module 1509 determines a second threshold for separating the areas representing the information pattern from the remaining areas of the image (i.e., the non-content areas). Initially, the pattern brightness threshold determination module 1509 segments the image into 8×8 pixel blocks. For black-and-white images, the pattern brightness threshold determination module 1509 then creates a gray-level value histogram for each 8×8 pixel block, such as the histogram 2001 in FIG. 20. As seen in this figure, the X-axis corresponds to the brightness-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 information pattern areas from the remaining background areas. The second threshold T0 is empirically chosen, based on the size of the camera sensor in the pen/camera device 101 and the size of code symbol, to be approximately equal to the ratio of black dots in the code symbol. In the illustrated example, the code symbol is the 8-a-16 code symbol illustrated in FIG. 3C. Thus, 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 1511 identifies the areas of the image representing the information pattern in step 1611. 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 1511 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 information pattern.


After all of 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 information pattern mask. That is, for every 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 information pattern can be accurately distinguished from the other pixels in the image. Further, the image preprocessing system 103 according to various examples of the invention can output a new image that clearly distinguishes an information pattern from the remainder of the image.


Conclusion


While the invention has been described with respect to specific examples including presently preferred modes of carrying out the invention, those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques that fall within the spirit and scope of the invention as set forth in the appended claims.

Claims
  • 1. A method performed by a computing device having a memory and a processor for identifying an information pattern containing embedded position information in an image of a document, the method comprising: identifying high-contrast regions in an image of a document;obtaining a first threshold brightness value for distinguishing areas of the image that represent content;analyzing each area in the image to determine if a brightness value for the area is below the first threshold;designating areas in the high-contrast regions having a brightness value below the first threshold as areas representing content so as to identify content areas and non-content areas;obtaining a second threshold brightness value for distinguishing areas of the image that represent an information pattern;analyzing each non-content area in the image to determine if a brightness value for the area is below the second threshold; anddesignating non-content areas having a brightness value below the second threshold as pattern areas representing the information patternwherein the information pattern contains embedded position information and is used to determine the position of the image relative to the document andwherein the identifying, analyzing, and designating are performed by the processor executing instructions stored in the memory.
  • 2. The method recited in claim 1, further comprising applying an average filter to each area of the image before identifying high-contrast areas in the image.
  • 3. The method recited in claim 1, further comprising organizing neighboring content areas into regions, andif a region has fewer than a specified number of areas, designating each of the areas in the region as non-content areas.
  • 4. The method recited in claim 1, further comprising: analyzing each pattern area to determine if the pattern area is adjacent to a content area; andif the pattern area is adjacent to a content area, changing the designation of the pattern area to a blank area.
  • 5. The method recited in claim 1, wherein the image is a black-and-white image; andthe brightness values are gray level values
  • 6. The method recited in claim 1, wherein the image is a color image, andthe brightness level values are color brightness values.
  • 7. A system, having a memory and a processor, comprising: a module that identifies high-contrast regions in an image of a document;a module that obtains a first threshold brightness value for distinguishing areas of the image that represent content;a module that analyzes each area in the image to determine if a brightness value for the area is below the first threshold;a module that designates areas in the high-contrast regions having a brightness value below the first threshold as areas representing content so as to identify content areas and non-content areas;a module that obtains a second threshold brightness value for distinguishing areas of the image that represent an information pattern;a module that analyzes each non-content area in the image to determine if a brightness value for the area is below the second threshold; anda module that designates non-content areas having a brightness value below the second threshold as pattern areas representing the information patternwherein at least one of the modules comprises computer-executable instructions stored in the memory for execution by the computer.
  • 8. The system of claim 7, further comprising: a module that applies an average filter to each area of the image before the high-contrast areas in the image are identified.
  • 9. The system of claim 7, further comprising: a module that organizes neighboring content areas into regions and, if a region has fewer than a specified number of areas, designates each of the areas in the region as non-content areas.
  • 10. The system of claim 7, further comprising: a module that analyzes each pattern area to determine if the pattern area is adjacent to a content area; anda module that, if the pattern area is adjacent to a content area, changes the designation of the pattern area to a blank area.
  • 11. The system of claim 7, wherein the image is a black-and-white image; andthe brightness values are gray level values
  • 12. The system of claim 7, wherein the image is a color image, andthe brightness level values are color brightness values.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a divisional of U.S. patent application Ser. No. 11/138,959 entitled “PREPROCESSING FOR INFORMATION PATTERN ANALYSIS,” filed May 25, 2005, now U.S. Pat. No. 7,400,777 issued Jul. 15, 2008, which application is hereby incorporated by reference in its entirety.

US Referenced Citations (309)
Number Name Date Kind
4686329 Joyce Aug 1987 A
4742558 Ishibashi et al. May 1988 A
4745269 Van Gils et al. May 1988 A
4829583 Monroe et al. May 1989 A
4941124 Skinner, Jr. Jul 1990 A
5032924 Brown et al. Jul 1991 A
5051736 Bennett et al. Sep 1991 A
5073966 Sato et al. Dec 1991 A
5146552 Cassorla et al. Sep 1992 A
5153928 Iizuka Oct 1992 A
5181257 Steiner et al. Jan 1993 A
5196875 Stuckler Mar 1993 A
5235654 Anderson et al. Aug 1993 A
5243149 Comerford et al. Sep 1993 A
5247137 Epperson Sep 1993 A
5253336 Yamada Oct 1993 A
5280289 Root Jan 1994 A
5288986 Pine et al. Feb 1994 A
5294792 Lewis et al. Mar 1994 A
5335150 Huang Aug 1994 A
5365598 Sklarew Nov 1994 A
5394487 Burger et al. Feb 1995 A
5398082 Henderson et al. Mar 1995 A
5414227 Schubert et al. May 1995 A
5414538 Eschbach May 1995 A
5442147 Burns et al. Aug 1995 A
5448372 Axman et al. Sep 1995 A
5450603 Davies Sep 1995 A
5454054 Iizuka Sep 1995 A
5471533 Wang et al. Nov 1995 A
5477012 Sekendur Dec 1995 A
5511156 Nagasaka Apr 1996 A
5546515 Mochizuki et al. Aug 1996 A
5581637 Cass et al. Dec 1996 A
5581682 Anderson et al. Dec 1996 A
5587558 Matsushima et al. Dec 1996 A
5612524 Sant'Anselmo et al. Mar 1997 A
5626620 Kieval et al. May 1997 A
5629499 Flickinger et al. May 1997 A
5635697 Shellhammer et al. Jun 1997 A
5644652 Bellegarda et al. Jul 1997 A
5652412 Lazzouni et al. Jul 1997 A
5661291 Ahearn et al. Aug 1997 A
5661506 Lazzouni et al. Aug 1997 A
5670897 Kean Sep 1997 A
5686718 Iwai et al. Nov 1997 A
5692073 Cass Nov 1997 A
5719884 Roth et al. Feb 1998 A
5721940 Luther et al. Feb 1998 A
5726435 Hara et al. Mar 1998 A
5727098 Jacobson Mar 1998 A
5748808 Taguchi et al. May 1998 A
5754280 Kato et al. May 1998 A
5756981 Roustaei et al. May 1998 A
5765176 Bloomberg Jun 1998 A
5774602 Taguchi et al. Jun 1998 A
5817992 D'Antonio Oct 1998 A
5818436 Imai et al. Oct 1998 A
5822436 Rhoads Oct 1998 A
5822465 Normile et al. Oct 1998 A
5825015 Chan et al. Oct 1998 A
5825892 Braudaway et al. Oct 1998 A
5850058 Tano et al. Dec 1998 A
5852434 Sekendur Dec 1998 A
5855483 Collins et al. Jan 1999 A
5855594 Olive et al. Jan 1999 A
5875264 Carlstrom Feb 1999 A
5890177 Moody et al. Mar 1999 A
5897648 Henderson Apr 1999 A
5898166 Fukuda et al. Apr 1999 A
5902968 Sato et al. May 1999 A
5937110 Petrie et al. Aug 1999 A
5939703 Hecht et al. Aug 1999 A
5960124 Taguchi et al. Sep 1999 A
5961571 Gorr et al. Oct 1999 A
5995084 Chan et al. Nov 1999 A
6000614 Yang et al. Dec 1999 A
6000621 Hecht et al. Dec 1999 A
6000946 Snyders et al. Dec 1999 A
6005973 Seybold et al. Dec 1999 A
6014462 Yamakawa Jan 2000 A
6041335 Merritt et al. Mar 2000 A
6044165 Perona et al. Mar 2000 A
6044301 Hartlaub et al. Mar 2000 A
6052481 Grajski et al. Apr 2000 A
6054990 Tran Apr 2000 A
6076734 Dougherty et al. Jun 2000 A
6081261 Wolff et al. Jun 2000 A
6108453 Acharya Aug 2000 A
6141014 Endo et al. Oct 2000 A
6151424 Hsu Nov 2000 A
6157935 Tran et al. Dec 2000 A
6173084 Aach et al. Jan 2001 B1
6181329 Stork et al. Jan 2001 B1
6186405 Yoshioka Feb 2001 B1
6188392 O'Connor et al. Feb 2001 B1
6192380 Light et al. Feb 2001 B1
6202060 Tran Mar 2001 B1
6208771 Jared et al. Mar 2001 B1
6208894 Schulman et al. Mar 2001 B1
6219149 Kawata et al. Apr 2001 B1
6226636 Abdel-Mottaleb et al. May 2001 B1
6230304 Groeneveld et al. May 2001 B1
6243071 Shwarts et al. Jun 2001 B1
6249614 Kolesnik et al. Jun 2001 B1
6254253 Daum et al. Jul 2001 B1
6256398 Chang Jul 2001 B1
6259827 Nichani Jul 2001 B1
6278968 Franz et al. Aug 2001 B1
6294775 Seibel et al. Sep 2001 B1
6310988 Flores et al. Oct 2001 B1
6327395 Hecht et al. Dec 2001 B1
6330976 Dymetman et al. Dec 2001 B1
6335727 Morishita et al. Jan 2002 B1
6340119 He et al. Jan 2002 B2
6396598 Kashiwagi et al. May 2002 B1
6408330 DeLaHuerga Jun 2002 B1
6441920 Smith Aug 2002 B1
6479768 How Nov 2002 B1
6492981 Stork et al. Dec 2002 B1
6517266 Saund Feb 2003 B2
6522928 Whitehurst et al. Feb 2003 B2
6529638 Westerman Mar 2003 B1
6532152 White et al. Mar 2003 B1
6538187 Beigi Mar 2003 B2
6546136 Hull Apr 2003 B1
6551357 Madduri Apr 2003 B1
6558006 Ioka May 2003 B2
6560741 Gerety et al. May 2003 B1
6570104 Ericson et al. May 2003 B1
6570997 Noguchi May 2003 B2
6573887 O'Donnell, Jr. Jun 2003 B1
6577299 Schiller et al. Jun 2003 B1
6580424 Krumm Jun 2003 B1
6584052 Phillips et al. Jun 2003 B1
6585154 Ostrover et al. Jul 2003 B1
6592039 Smith et al. Jul 2003 B1
6603464 Rabin Aug 2003 B1
6625313 Morita et al. Sep 2003 B1
6628267 Karidis et al. Sep 2003 B2
6650320 Zimmerman Nov 2003 B1
6651894 Nimura et al. Nov 2003 B2
6655597 Swartz et al. Dec 2003 B1
6661920 Skinner Dec 2003 B1
6663008 Pettersson et al. Dec 2003 B1
6671386 Shimizu et al. Dec 2003 B1
6674427 Pettersson et al. Jan 2004 B1
6681045 Lapstun et al. Jan 2004 B1
6686910 O'Donnell, Jr. Feb 2004 B2
6689966 Wiebe Feb 2004 B2
6693615 Hill et al. Feb 2004 B2
6697056 Bergelson et al. Feb 2004 B1
6728000 Lapstun et al. Apr 2004 B1
6729543 Arons et al. May 2004 B1
6731271 Tanaka et al. May 2004 B1
6732927 Olsson et al. May 2004 B2
6738053 Borgstrom et al. May 2004 B1
6744967 Kaminski et al. Jun 2004 B2
6752317 Dymetman et al. Jun 2004 B2
6760009 Omura et al. Jul 2004 B2
6783069 Hecht et al. Aug 2004 B1
6819776 Chang Nov 2004 B2
6831273 Jenkins et al. Dec 2004 B2
6832724 Yavid et al. Dec 2004 B2
6834081 Kim et al. Dec 2004 B2
6834195 Brandenberg et al. Dec 2004 B2
6834337 Mitchell et al. Dec 2004 B1
6847356 Hasegawa et al. Jan 2005 B1
6856712 Fauver et al. Feb 2005 B2
6862371 Mukherjee Mar 2005 B2
6864880 Hugosson et al. Mar 2005 B2
6865325 Ide et al. Mar 2005 B2
6870966 Silverbrook et al. Mar 2005 B1
6874420 Lewis et al. Apr 2005 B2
6879731 Kang et al. Apr 2005 B2
6880124 Moore Apr 2005 B1
6880755 Gorbet et al. Apr 2005 B2
6897854 Cho et al. May 2005 B2
6898297 Katsura et al. May 2005 B2
6919892 Cheiky et al. Jul 2005 B1
6929183 Pettersson Aug 2005 B2
6933933 Fleming Aug 2005 B2
6935562 Hecht et al. Aug 2005 B2
6938222 Hullender et al. Aug 2005 B2
6956968 O'Dell et al. Oct 2005 B1
6960777 Soar Nov 2005 B2
6964483 Wang et al. Nov 2005 B2
6968083 Williams et al. Nov 2005 B2
6970183 Monroe Nov 2005 B1
6975334 Barrus Dec 2005 B1
6976220 Lapstun et al. Dec 2005 B1
6987534 Seta Jan 2006 B1
6992655 Ericson et al. Jan 2006 B2
6993185 Guo et al. Jan 2006 B2
6999622 Komatsu Feb 2006 B2
7003150 Trajkovi Feb 2006 B2
7009594 Wang et al. Mar 2006 B2
7012621 Crosby et al. Mar 2006 B2
7024429 Ngo et al. Apr 2006 B2
7036938 Wang et al. May 2006 B2
7048198 Ladas et al. May 2006 B2
7092122 Iwaki et al. Aug 2006 B2
7110604 Olsson et al. Sep 2006 B2
7111230 Euchner et al. Sep 2006 B2
7116840 Wang et al. Oct 2006 B2
7119816 Zhang et al. Oct 2006 B2
7123742 Chang Oct 2006 B2
7133031 Wang et al. Nov 2006 B2
7133563 Wang et al. Nov 2006 B2
7136054 Wang et al. Nov 2006 B2
7139740 Ayala Nov 2006 B2
7142197 Wang et al. Nov 2006 B2
7142257 Callison et al. Nov 2006 B2
7145556 Pettersson Dec 2006 B2
7167164 Ericson et al. Jan 2007 B2
7176906 Williams et al. Feb 2007 B2
7190843 Wei et al. Mar 2007 B2
7222799 Silverbrook May 2007 B2
7225979 Silverbrook et al. Jun 2007 B2
7262764 Wang et al. Aug 2007 B2
7263224 Wang et al. Aug 2007 B2
7289103 Lapstun et al. Oct 2007 B2
7292370 Iwaki et al. Nov 2007 B2
7293240 Lapstun et al. Nov 2007 B2
7295193 Fahraeus Nov 2007 B2
7330605 Wang et al. Feb 2008 B2
7359094 Sayuda Apr 2008 B1
7386191 Wang et al. Jun 2008 B2
7400777 Wang et al. Jul 2008 B2
7403658 Lin et al. Jul 2008 B2
7421439 Wang et al. Sep 2008 B2
7430497 Wang et al. Sep 2008 B2
7440134 Natori Oct 2008 B2
7440583 Tohne et al. Oct 2008 B2
7463784 Kugo Dec 2008 B2
7486822 Wang et al. Feb 2009 B2
7486823 Wang et al. Feb 2009 B2
7502508 Wang et al. Mar 2009 B2
7505982 Wang et al. Mar 2009 B2
7528848 Xu et al. May 2009 B2
7532366 Yang et al. May 2009 B1
7536051 Lin et al. May 2009 B2
7542976 Wang et al. Jun 2009 B2
7570813 Wang et al. Aug 2009 B2
7580576 Wang et al. Aug 2009 B2
7583842 Lin et al. Sep 2009 B2
20010024193 Fahraeus Sep 2001 A1
20010038383 Ericson et al. Nov 2001 A1
20010053238 Katsura et al. Dec 2001 A1
20020028018 Hawkins et al. Mar 2002 A1
20020031622 Ippel et al. Mar 2002 A1
20020048404 Fahraeus et al. Apr 2002 A1
20020050982 Ericson May 2002 A1
20020069220 Tran Jun 2002 A1
20020163511 Sekendur Nov 2002 A1
20020179717 Cummings et al. Dec 2002 A1
20030001020 Kardach Jan 2003 A1
20030009725 Reichenbach Jan 2003 A1
20030030638 Astrom et al. Feb 2003 A1
20030034961 Kao Feb 2003 A1
20030050803 Marchosky Mar 2003 A1
20030081000 Watanabe et al. May 2003 A1
20030088781 ShamRao May 2003 A1
20030090475 Paul et al. May 2003 A1
20030117378 Carro Jun 2003 A1
20030118233 Olsson Jun 2003 A1
20030128194 Pettersson Jul 2003 A1
20030146883 Zelitt Aug 2003 A1
20030159044 Doyle et al. Aug 2003 A1
20030179906 Baker et al. Sep 2003 A1
20030214553 Dodge Nov 2003 A1
20030214669 Saitoh Nov 2003 A1
20040032393 Brandenberg et al. Feb 2004 A1
20040085286 Wang et al. May 2004 A1
20040085302 Wang et al. May 2004 A1
20040086181 Wang et al. May 2004 A1
20040090429 Geaghan et al. May 2004 A1
20040128264 Leung et al. Jul 2004 A1
20040128511 Sun et al. Jul 2004 A1
20040153649 Rhoads et al. Aug 2004 A1
20040233163 Lapstun et al. Nov 2004 A1
20050044164 O'Farrell et al. Feb 2005 A1
20050052700 Mackenzie et al. Mar 2005 A1
20050104909 Okamura et al. May 2005 A1
20050106365 Palmer et al. May 2005 A1
20050138541 Euchner et al. Jun 2005 A1
20050146518 Wang et al. Jul 2005 A1
20050147281 Wang et al. Jul 2005 A1
20050193292 Lin et al. Sep 2005 A1
20060082557 Ericson et al. Apr 2006 A1
20060109263 Wang et al. May 2006 A1
20060123049 Wang et al. Jun 2006 A1
20060125805 Marggraff Jun 2006 A1
20060182309 Wang et al. Aug 2006 A1
20060182343 Lin et al. Aug 2006 A1
20060190818 Wang et al. Aug 2006 A1
20060204101 Wang et al. Sep 2006 A1
20060242560 Wang et al. Oct 2006 A1
20060242562 Wang et al. Oct 2006 A1
20060242622 Wang et al. Oct 2006 A1
20060267965 Clary Nov 2006 A1
20060274948 Wang et al. Dec 2006 A1
20070001950 Zhang et al. Jan 2007 A1
20070003150 Xu et al. Jan 2007 A1
20070041654 Wang et al. Feb 2007 A1
20070042165 Wang et al. Feb 2007 A1
20080025612 Wang et al. Jan 2008 A1
20090110308 Wang et al. Apr 2009 A1
20090119573 Wang et al. May 2009 A1
Foreign Referenced Citations (43)
Number Date Country
1303494 Jul 2001 CN
1352778 Jun 2002 CN
3143455 Sep 2003 CN
200610092487 Sep 2003 CN
0407734 Jan 1991 EP
0439682 Aug 1991 EP
0564708 Oct 1993 EP
0670555 Sep 1995 EP
0694870 Jan 1996 EP
0717368 Jun 1996 EP
0732666 Sep 1996 EP
0865166 Sep 1998 EP
1154377 Nov 2001 EP
1158456 Nov 2001 EP
1168231 Jan 2002 EP
1276073 Jan 2003 EP
1416435 May 2004 EP
2393149 Mar 2004 GB
63165584 Jul 1988 JP
04253087 Sep 1992 JP
06006316 Jan 1994 JP
06209482 Jul 1994 JP
06230886 Aug 1994 JP
07020812 Jan 1995 JP
07225564 Aug 1995 JP
10215450 Aug 1998 JP
11308112 Nov 1999 JP
2000131640 May 2000 JP
2002529796 Sep 2000 JP
2002082763 Mar 2002 JP
2002108551 Apr 2002 JP
WO-9630217 Oct 1996 WO
WO-9960469 Nov 1999 WO
WO-9965568 Dec 1999 WO
WO-0025293 May 2000 WO
WO-0072247 Nov 2000 WO
WO-0073983 Dec 2000 WO
WO-0126032 Apr 2001 WO
WO-0148685 Jul 2001 WO
WO-0171654 Sep 2001 WO
WO-02077870 Oct 2002 WO
WO-03038741 May 2003 WO
WO-2005106638 Oct 2005 WO
Related Publications (1)
Number Date Country
20090067743 A1 Mar 2009 US
Divisions (1)
Number Date Country
Parent 11138959 May 2005 US
Child 12138339 US