The present application is related to the following copending U.S. patent applications, assigned to the assignee of the present application, filed concurrently herewith and hereby incorporated by reference: “Integrated Platform for User Input of Digital Ink,” U.S. patent application Ser. No. 11/821,870, and “Unified Digital Ink Recognition,” U.S. patent application Ser. No. 11/821,858.
Digital ink is becoming an important media for users to interact with computer applications. However, traditional search technologies are usually based on text, not on digital ink.
While text-based searching is often valuable, there are many kinds of data and information that cannot be described accurately and/or easily by text, such as shapes and sketches. For example, consider a user that wants to find a certain shape from a program's shape repository. The user may not know the program's text name for the shape, and thus may have trouble finding that shape, even though the user can easily sketch a similar shape easily with digital ink. Similarly, a sketch or other image/picture (e.g., a Word Art item) may be found via a text search with the appropriate text, but if the needed text is not known or intuitive to a user, a text search is not an effective way to find what the user wants.
This Summary is provided to introduce a selection of representative concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used in any way that would limit the scope of the claimed subject matter.
Briefly, various aspects of the subject matter described herein are directed towards a technology by which digital ink received as input is used to search for non-character items (e.g., shapes) corresponding to the digital ink. Digital ink is sent to a unified digital ink recognizer that returns a recognition result as a character or another type of digital ink. When the recognition result is a character, the character is used in a keyword search to find one or more corresponding non-character items, e.g., from a data store. When the recognition result is a non-character item, the non-character item is provided as the search result, without keyword searching. In addition to shapes, other non-character items include handwritten gestures or drawn pictures.
For example, if the recognizer returns a character, the keyword search may return any item in which that character appears. Alternatively, the character can be used to build the keyword for a search. If instead the recognizer returns a non-character item such as a shape, the item may be used as the search result. The search result may appear as one or more visible representations of the corresponding item or items, such as in a result panel associated with a user interface into which the digital ink was input. Alternatively, the search result may be provided as corresponding information to a software program for which the item is being searched.
Other advantages may become apparent from the following detailed description when taken in conjunction with the drawings.
The present invention is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
Various aspects of the technology described herein are generally directed towards digital ink based search technology that can be used to find items such as shapes, sketches and so forth efficiently and naturally. In one aspect, digital ink is used as input to search information directly. For example, as is known, digital ink is input naturally by user's handwriting, and can be used to represent different kinds of information intuitively and effectively. As will be understood, the advantages of digital ink input are leveraged herein to make digital ink-based searching more intuitive, natural, effective and efficient in certain areas relative to text based searching.
While various examples herein are primarily directed to differentiating between characters and shapes to search for shapes, such as with respect to a diagramming program such as Microsoft® Visio®, any handwritten input may be differentiated and/or benefit from the search technology described herein, including handwritten characters, sketched shapes, handwritten gestures and/or drawn pictures or the like. Further, while an example implementation of a unified digital ink recognizer is described herein that can among other aspects differentiate between characters and shapes, other implementations of a unified digital ink recognizer may be used.
As such, the present invention is not limited to any particular embodiments, aspects, concepts, structures, functionalities or examples described herein. Rather, any of the embodiments, aspects, concepts, structures, functionalities or examples described herein are non-limiting, and the present invention may be used various ways that provide benefits and advantages in computing, and digital ink in general.
Example Unified Digital Ink Recognizer
As described below with reference to
For the shape set, the private use area of Unicode that can be customized, ranging from Unicode 0xF000 to 0xF0FF, is used. For building a unified digital ink recognizer, any item to be recognized can be assigned with a Unicode value from the private use area of Unicode, although an item with an already-assigned Unicode values (e.g., a character) can use that value.
To build the unified digital ink recognizer 102, a learning based pattern recognition approach is used, as generally represented by the example components shown in
With the classifier, given a new item to be recognized, the features of the item are matched with the feature of an existing class, which means the new item is recognized as belonging to that class.
One aspect of building a digital ink recognizer 102 with this approach is data collection of digital ink samples for each item in the defined dataset to be recognized by the digital ink recognizer 102. In the implementation represented in
Based on the digital ink samples 104, a first mechanism (process step) 114 develops and/or selects a set of one or more core algorithms 116 for use in extracting the features of the training set 106 to build the digital ink recognizer model 112 according to the extracted features. The developed core algorithms are performed on the training set 106 to build the digital ink recognizer model 112.
More particularly, a recognition algorithm is used to build the recognizer model (classifier) 112 for the items to be recognized. As represented in
As is known, there are many existing and possible recognition algorithms which may be used to build a recognition system, including nearest neighbor classification (sometimes referred to as k-nearest neighbor, or KNN), Gaussian Mixture Model (GMM), Hidden Markov Model (HMM), and so forth. In one implementation of the unified digital ink recognition system, nearest neighbor classification is used to recognize digital ink.
A primary concept in nearest neighbor classification is to use one point in multi-dimensional space to represent each class of samples, such as classes A-C as generally represented in
After the recognizer model 112 is built, when a new item “New Item” is to be recognized, that item is also represented by a point in this space. As represented in
Returning to
When complete, a unified digital ink recognizer 102 is provided, comprising the core algorithm or algorithms and the recognizer model 112. In one implementation, the unified digital ink recognizer can recognize digital ink of handwriting (e.g., Chinese characters) and sketching shapes (including sketched graphs). As a result, whether the user inputs a Chinese character by handwriting or inputs a shape by sketching, the unified digital ink recognizer correctly interprets the digital ink of the user's input as a character or as a shape.
Step 408 represents using a feature extraction algorithm to extract the features from each selected item in the training set, with step 410 representing the feature selection algorithm, and step 412 representing the building of the recognizer model, e.g., processing the feature data of each selected item as needed to adjusting the feature data for the class [the class is identified by the Unicode value, the selected item is belonging to the class] in the recognizer model (such as representing multi-dimensional coordinates).
Step 414 represents the evaluation of the accuracy and/or efficiency using the testing set of digital ink samples. Based on an error analysis at step 416 as to how accurate and/or efficient the model is, samples from the tuning set may be applied at step 416 in an attempt to better optimize the recognizer. Step 418 represents repeating any or all of steps 406, 408,410, 412, 414 and 416 for further optimization. Note that the evaluation at step 414 may be used to determine whether further optimization is necessary. Further, note that a model that is less accurate and/or efficient than another model may be discarded until the best model of those evaluated is determined.
Digital Ink-Based Search
Turning to
As described above, the unified digital ink recognizer 102 is built to recognize a user's input as a character (e.g., a Chinese character) or a custom item, which in this example corresponds to a Visio® shape. If as in the representations 1500 and 1600 of
The search results are returned in the panel 1504 in
If instead as represented in the representations 1700 and 1800 of
In general, the user may then drag a result from the results panel 1504 to the program into which the custom item (e.g., shape) is being input. However, other ways to handle the data are feasible. For example, note that in
Search logic 1906 (such as the logic exemplified in
If an item was recognized at step 2004, step 2004 branches to step 2014 where the item (e.g., shape) is used directly as output. As described above, the direct use may be an output to an output panel to present the item to the user, or into the program itself for which the item is desired; this may also include mapping the recognizer's returned value to another identifier.
If a character was recognized at step 2004, step 2004 branches to step 2006 where the character is used as a keyword (or to build a keyword) for searching, as described above. Step 2008 represents searching and obtaining the search results, with step 2012 representing presenting the found item or items to the user. Note that step 2010 is an optional step (as indicated by the dashed block and line) as described above, e.g., a single returned item found via a keyword search may be used directly such as by inserting it into the underlying program for which the search was requested and performed.
Exemplary Operating Environment
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to: personal computers, server computers, hand-held or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.
With reference to
The computer 2110 typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer 2110 and includes both volatile and nonvolatile media, and removable and non-removable media. By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by the computer 2110. Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer-readable media.
The system memory 2130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 2131 and random access memory (RAM) 2132. A basic input/output system 2133 (BIOS), containing the basic routines that help to transfer information between elements within computer 2110, such as during start-up, is typically stored in ROM 2131. RAM 2132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 2120. By way of example, and not limitation,
The computer 2110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media, described above and illustrated in
The computer 2110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 2180. The remote computer 2180 may be a personal computer, 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 2110, although only a memory storage device 2181 has been illustrated in
When used in a LAN networking environment, the computer 2110 is connected to the LAN 2171 through a network interface or adapter 2170. When used in a WAN networking environment, the computer 2110 typically includes a modem 2172 or other means for establishing communications over the WAN 2173, such as the Internet. The modem 2172, which may be internal or external, may be connected to the system bus 2121 via the user input interface 2160 or other appropriate mechanism. A wireless networking component 2174 such as comprising an interface and antenna may be coupled through a suitable device such as an access point or peer computer to a WAN or LAN. In a networked environment, program modules depicted relative to the computer 2110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
An auxiliary subsystem 2199 (e.g., for auxiliary display of content) may be connected via the user interface 2160 to allow data such as program content, system status and event notifications to be provided to the user, even if the main portions of the computer system are in a low power state. The auxiliary subsystem 2199 may be connected to the modem 2172 and/or network interface 2170 to allow communication between these systems while the main processing unit 2120 is in a low power state.
While the invention is susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
5445901 | Korall et al. | Aug 1995 | A |
5500937 | Thompson-Rohrlich | Mar 1996 | A |
5613019 | Altman | Mar 1997 | A |
5666438 | Beernink et al. | Sep 1997 | A |
5680480 | Beernink et al. | Oct 1997 | A |
5687254 | Poon et al. | Nov 1997 | A |
5742705 | Parthasarathy | Apr 1998 | A |
5784504 | Anderson et al. | Jul 1998 | A |
5796867 | Chen | Aug 1998 | A |
5832474 | Lopresti et al. | Nov 1998 | A |
6173253 | Abe et al. | Jan 2001 | B1 |
6240424 | Hirata | May 2001 | B1 |
6263113 | Abdel-Mottaleb et al. | Jul 2001 | B1 |
6333995 | Perrone | Dec 2001 | B1 |
6389435 | Golovchinsky et al. | May 2002 | B1 |
6415256 | Ditzik | Jul 2002 | B1 |
6512995 | Murao | Jan 2003 | B2 |
6549675 | Chatterjee | Apr 2003 | B2 |
6552719 | Lui et al. | Apr 2003 | B2 |
6625335 | Kanai | Sep 2003 | B1 |
6681044 | Ma et al. | Jan 2004 | B1 |
6813395 | Kinjo | Nov 2004 | B1 |
6965384 | Lui | Nov 2005 | B2 |
7031555 | Troyanker | Apr 2006 | B2 |
7050632 | Shilman | May 2006 | B2 |
7123770 | Raghupathy et al. | Oct 2006 | B2 |
7136082 | Saund | Nov 2006 | B2 |
7167585 | Gounares et al. | Jan 2007 | B2 |
7171060 | Park et al. | Jan 2007 | B2 |
7302099 | Zhang et al. | Nov 2007 | B2 |
7369702 | Abdulkader et al. | May 2008 | B2 |
7526129 | Bargeron | Apr 2009 | B2 |
7630554 | Napper et al. | Dec 2009 | B2 |
7756755 | Ghosh et al. | Jul 2010 | B2 |
20020087426 | Shiitani et al. | Jul 2002 | A1 |
20020090148 | Pass et al. | Jul 2002 | A1 |
20020150297 | Gorbatov et al. | Oct 2002 | A1 |
20030007683 | Wang et al. | Jan 2003 | A1 |
20030086627 | Berriss et al. | May 2003 | A1 |
20030123733 | Keskar et al. | Jul 2003 | A1 |
20030167274 | Dettinger et al. | Sep 2003 | A1 |
20040017946 | Longe et al. | Jan 2004 | A1 |
20040073572 | Jiang | Apr 2004 | A1 |
20040252888 | Bargeron et al. | Dec 2004 | A1 |
20050060324 | Johnson et al. | Mar 2005 | A1 |
20050091576 | Relyea et al. | Apr 2005 | A1 |
20050100214 | Zhang et al. | May 2005 | A1 |
20050102620 | Seto | May 2005 | A1 |
20050201620 | Kanamoto et al. | Sep 2005 | A1 |
20050222848 | Mapper et al. | Oct 2005 | A1 |
20050281467 | Stahovich | Dec 2005 | A1 |
20060001667 | LaViola | Jan 2006 | A1 |
20060007188 | Reiner | Jan 2006 | A1 |
20060031755 | Kashi | Feb 2006 | A1 |
20060036577 | Knighton et al. | Feb 2006 | A1 |
20060045337 | Shilman et al. | Mar 2006 | A1 |
20060050969 | Shilman et al. | Mar 2006 | A1 |
20060062461 | Longe et al. | Mar 2006 | A1 |
20060110040 | Simard et al. | May 2006 | A1 |
20060126936 | Bhaskarabhatla | Jun 2006 | A1 |
20060149549 | Napper | Jul 2006 | A1 |
20060197763 | Harrison et al. | Sep 2006 | A1 |
20060209040 | Garside | Sep 2006 | A1 |
20060277159 | Napper et al. | Dec 2006 | A1 |
20070003142 | Simard et al. | Jan 2007 | A1 |
20090002392 | Hou | Jan 2009 | A1 |
20090003703 | Zhang | Jan 2009 | A1 |
20090007272 | Huang et al. | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
10-1993-0001471 | Feb 1993 | KR |
WO 03034276 | Apr 2003 | WO |
WO 03034276 | Apr 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20090003658 A1 | Jan 2009 | US |