Patents by Inventor Herry Sutanto

Herry Sutanto has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20080260241
    Abstract: A method for grouping writing regions of digital ink receives processed digital ink that comprises writing regions. A relationship can be generated between a plurality of the writing regions. A feature set can be determined that is associated with the plurality of the writing regions. The plurality of the writing regions can be grouped based on the feature set.
    Type: Application
    Filed: April 20, 2007
    Publication date: October 23, 2008
    Applicant: Microsoft Corporation
    Inventors: Ming Ye, Herry Sutanto, Sashi Raghupathy
  • Publication number: 20080184173
    Abstract: A technology for controlling multiple map application operations with a single gesture is disclosed. In one method approach, data describing a single gesture that was inked on a map application output displayed on a device is received. The data is utilized to control multiple operations of the map application.
    Type: Application
    Filed: January 31, 2007
    Publication date: July 31, 2008
    Applicant: Microsoft Corporation
    Inventors: Herry Sutanto, Richard L. Spencer, Todd M. Landstad, Subha Bhattacharyay, Haiyong Wang, F. David Jones
  • Patent number: 7283670
    Abstract: A method of analyzing electronic ink, in which document data for a document containing electronic ink content is received from a software application running on a first processing thread. The first processing thread is employed to provide the document data to an electronic ink analysis process for analyzing on a second processing thread. Control of the first processing thread is then returned to the software application. After the results of the analysis are received, the results are reconciled with the current document data for the document.
    Type: Grant
    Filed: August 21, 2003
    Date of Patent: October 16, 2007
    Assignee: Microsoft Corporation
    Inventors: Jamie Wakeam, Richard Duncan, Bodin Dresevic, Herry Sutanto, Sashi Raghupathy, Timothy H. Kannapel, Zoltan Szilagyi, Michael Shilman
  • Publication number: 20060271580
    Abstract: Techniques for efficiently and accurately organizing freeform handwriting into lines. A global cost function is employed to find the simplest partitioning of electronic ink strokes into line groups that also maximize the “goodness” of the resulting lines and the consistency of their configuration. The “goodness” of a line may be based upon its linear regression error and the horizontal and vertical compactness of the strokes making up the line. The line consistency configuration for a grouping of strokes is measured by the angle difference between neighboring groups. The global cost function also takes into account the complexity of the stroke partitioning, measured by the number of lines into which the strokes are grouped. An initial grouping of strokes is made, and the cost for this initial grouping is determined. Alternate groupings of the initial stroke grouping are then generated.
    Type: Application
    Filed: May 30, 2005
    Publication date: November 30, 2006
    Applicant: Microsoft Corporation
    Inventors: Ming Ye, Herry Sutanto, Sashi Raghupathy, Chengyang Li, Michael Shilman
  • Publication number: 20060224610
    Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.
    Type: Application
    Filed: June 8, 2006
    Publication date: October 5, 2006
    Applicant: MICROSOFT CORPORATION
    Inventors: Jamie Wakeam, Richard Duncan, Herry Sutanto, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi
  • Publication number: 20060218171
    Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.
    Type: Application
    Filed: June 8, 2006
    Publication date: September 28, 2006
    Applicant: MICROSOFT CORPORATION
    Inventors: Jamie Wakeam, Richard Duncan, Herry Sutanto, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi
  • Publication number: 20060210172
    Abstract: Methods, systems, and computer-readable media for ascertaining neighborhood information in a dynamically changing environment, such as an electronic ink environment may include: (a) receiving data representing plural electronic ink strokes; (b) defining a first vertex associated with a first ink stroke; and (c) determining neighboring vertices to the first vertex, wherein the neighboring vertices are associated with ink stroke(s) other than the first ink stroke. Additional systems, methods, and computer-readable media may include: (a) receiving data representing plural electronic ink strokes; (b) defining plural vertices associated with the ink strokes; (c) receiving input indicating a selection of an ink component; and (d) determining at least one neighboring component by determining which ink component(s) located outside of the selection include one or more ink strokes having vertices that neighbor vertices included in the selection.
    Type: Application
    Filed: March 17, 2005
    Publication date: September 21, 2006
    Applicant: Microsoft Corporation
    Inventors: Herry Sutanto, Ming Ye, Sashi Raghupathy
  • Publication number: 20060210173
    Abstract: A system and method for assisting with analysis and recognition of ink is described. Analysis hints may be associated with a field. The field may receive electronic ink. Based on the identity of the field and the analysis hint associated with it, at least one of analysis and recognition of ink may be assisted.
    Type: Application
    Filed: March 18, 2005
    Publication date: September 21, 2006
    Applicant: Microsoft Corporation
    Inventors: Benoit Jurion, Gavin Gear, Jamie Wakeam, Timothy Kannapel, Todd Landstad, Sebastian Poulose, Zoltan Szilagyi, Lidia Schwarz, Roman Snytsar, Sashi Raghupathy, Subha Bhattacharyay, Richard Duncan, Terri Chudzik, Amber Race, Jerome Turner, Haiyong Wang, Herry Sutanto
  • Publication number: 20060184314
    Abstract: A multi-modal navigation system is presented. The navigation system is multi-modal as it provides navigation information (including routes, maps, directions, and navigation instructions) for a plurality of transportation modes including, but not limited to, automobiles, pedestrian walking, trains, subways, and the like. The multi-modal navigation system may be embodied in integrated navigation devices, as stand-alone navigation systems on a variety of computing devices, as a navigation service on a computing device or as a Web service, and the like. The multi-modal navigation system includes route data for a plurality of transportation modes. Route data for the plurality of transportation modes may be integrated, may be separately available, or any combination thereof.
    Type: Application
    Filed: February 14, 2005
    Publication date: August 17, 2006
    Applicant: Microsoft Corporation
    Inventors: Jeffrey Couckuyt, Timothy McGrath, Herry Sutanto
  • Publication number: 20050175245
    Abstract: Systems and methods for processing data transform a first data structure (e.g., a hierarchical data structure) into a second data structure (e.g., using a parsing system), wherein the second data structure includes a first set of leaf nodes under a first ancestor node (additional sets of leaf nodes and/or ancestor nodes also may be defined in the second data structure). One or more potential candidate nodes for the ancestor nodes may be identified based, at least in part, on the ancestor nodes from the first data structure associated with the leaf nodes grouped under the new ancestor nodes. In at least some examples, the leaf nodes grouped under a new ancestor node will “vote” for their original ancestor node, and the node receiving the most “votes,” in at least some instances, will be reused as the corresponding ancestor node in the second data structure.
    Type: Application
    Filed: February 10, 2004
    Publication date: August 11, 2005
    Applicant: Microsoft Corporation
    Inventors: Herry Sutanto, Jamie Wakeam, Jerome Turner, Richard Duncan, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi
  • Publication number: 20050053283
    Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.
    Type: Application
    Filed: August 21, 2003
    Publication date: March 10, 2005
    Applicant: Microsoft Corporation
    Inventors: Jamie Wakeam, Richard Duncan, Herry Sutanto, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi
  • Publication number: 20050044295
    Abstract: An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.
    Type: Application
    Filed: August 21, 2003
    Publication date: February 24, 2005
    Applicant: Microsoft Corporation
    Inventors: Jamie Wakeam, Richard Duncan, Bodin Dresevic, Herry Sutanto, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi, Jerome Turner, Todd Landstad, Haiyong Wang, Roman Snytsar
  • Publication number: 20050041834
    Abstract: A method of analyzing electronic ink, in which document data for a document containing electronic ink content is received from a software application running on a first processing thread. The first processing thread is employed to provide the document data to an electronic ink analysis process for analyzing on a second processing thread. Control of the first processing thread is then returned to the software application. After the results of the analysis are received, the results are reconciled with the current document data for the document.
    Type: Application
    Filed: August 21, 2003
    Publication date: February 24, 2005
    Applicant: Microsoft Corporation
    Inventors: Jamie Wakeam, Richard Duncan, Bodin Dresevic, Herry Sutanto, Sashi Raghupathy, Timothy Kannapel, Zoltan Szilagyi, Michael Shilman
  • Publication number: 20050044106
    Abstract: Systems, methods, and computer-readable media for making rich, flexible, and more natural electronic ink annotations in an electronic document include creating a first context node associated with a first portion of a base portion of an electronic document; creating a second context node associated with an annotation to the base portion; and linking the second context node with the first context node.
    Type: Application
    Filed: August 21, 2003
    Publication date: February 24, 2005
    Applicant: Microsoft Corporation
    Inventors: Richard Duncan, Bodin Dresevic, Jamie Wakeam, Herry Sutanto, Sashi Reghupathy, Timothy Kannapel, Zoltan Szilagyi, Jerome Turner, Todd Landstad, Thomas Wick, Alex Simmons, Peter Engrav, Kevin Paulson, Kentaro Urata, Steve Dodge, David Bargeron, Michael Shilman
  • Patent number: 6668226
    Abstract: The present invention utilizes a novel polar coordinate grid to improve the processes of calculating and generating isochrones. Isochrones are lines on a map connecting places of equal travel time from a particular departure point. Calculating accurate isochrones is time consuming especially for large maps, because of the large number of data points to be processed. Data sampling is used to expedite the generation of isochrones, while maintaining acceptable accuracy. The present invention uses polar coordinate grid sampling for data sampling. Advantageously, polar coordinate grids have higher granularity at the center of a mapped region and lower granularity in regions farther away from the center in radial direction. Polar coordinate sampling reduces the amount of memory used and decreases the isochrone calculation time without perceptible degradation in isochrone accuracy.
    Type: Grant
    Filed: October 11, 2001
    Date of Patent: December 23, 2003
    Assignee: Microsoft Corporation
    Inventor: Herry Sutanto
  • Publication number: 20030074132
    Abstract: The present invention utilizes a novel polar coordinate grid to improve the processes of calculating and generating isochrones. Isochrones are lines on a map connecting places of equal travel time from a particular departure point. Calculating accurate isochrones is time consuming especially for large maps, because of the large number of data points to be processed. Data sampling is used to expedite the generation of isochrones, while maintaining acceptable accuracy. The present invention uses polar coordinate grid sampling for data sampling. Advantageously, polar coordinate grids have higher granularity at the center of a mapped region and lower granularity in regions farther away from the center in radial direction. Polar coordinate sampling reduces the amount of memory used and decreases the isochrone calculation time without perceptible degradation in isochrone accuracy.
    Type: Application
    Filed: October 11, 2001
    Publication date: April 17, 2003
    Applicant: Microsoft Corporation
    Inventor: Herry Sutanto