Patents by Inventor Yuri Boykov
Yuri Boykov 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).
-
Patent number: 7844113Abstract: A region-based push-relabel formulation is disclosed that removes the requirement that the entire graph should fit into the computer memory and yields an implementation that can reduce the required size and redundancy of accesses to the data memory, thus improving speed performance, while allowing for an efficient parallel processing implementation. The algorithm assigns all vertices that are not part of the sources or sinks with a value of 1. Sinks are assigned with zeros and sources are assigned a label equal to the number of their vertices. The preflow is then pushed from the sources to their neighbors, if any. When the preflow has all reached the boundaries, an adjacent region of the neighboring set is selected and preflow is pushed within this region. When the values of the preflow have been exhausted, region relabeling is done to update the label values. This is repeated within the region until all preflow has exited to the boundary of this region.Type: GrantFiled: March 14, 2007Date of Patent: November 30, 2010Assignees: Siemens Medical Solutions USA, Inc., The University of Western OntarioInventors: Andrew Delong, Yuri Boykov, Daphne Yu
-
Patent number: 7634123Abstract: A method and related system for automatically and efficiently isolating the heart in Computer Tomography (CT) or Magnetic Resonance Imaging cardiac scans is disclosed. The method involves segmenting a heart within a set of volumetric data. In accordance with one aspect of the present invention, the set of volumetric data is processed to determine the minimum value of an energy function having a first term, a second term and a third term. The heart is segmented based on the processing of the set of volumetric data.Type: GrantFiled: March 8, 2006Date of Patent: December 15, 2009Assignee: Siemens Medical Solutions USA, Inc.Inventors: Charles Florin, Romain Moreau-Gobard, Yuri Boykov, Gareth Funka-Lea
-
Patent number: 7536050Abstract: An image editing system comprises an input device for inputting an image, a graphical user interface for selecting background and object seeds for the image, and an image processor for editing the image. The image processor has various editing routines, including a segmentation routine that builds a graph associated with the image and uses a graph cut algorithm to cut the graph into segments. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and regional information. Graph cuts are used to find the globally optimal segementation of the image. The obtained solution gives the best balance of boundary and region properties satisfying the constraints.Type: GrantFiled: July 3, 2007Date of Patent: May 19, 2009Assignee: Siemens Corporate Research, Inc.Inventors: Yuri Boykov, Marie-Pierre Jolly
-
Patent number: 7444019Abstract: A method of segmenting an image includes representing an image by a grid with a plurality of nodes, terminals, and edges, the terminals including a source and a sink. The edges include n-links and t-links, where each n-link connects a pair of nodes, and the t-links connect a node to a terminal, and each t-link and n-link has an associated cost. The method includes initializing a node height table, a flow excess table, a t-link capacity table, and an n-link capacity table based on the t-link and n-link costs, and updating the node height table, the flow excess table, the t-link capacity table, the said n-link capacity table in parallel for all nodes until the flow excess table is zero for all nodes. The method steps are performed in parallel for all nodes on a graphics processing unit.Type: GrantFiled: February 15, 2005Date of Patent: October 28, 2008Assignee: Siemens Medical Solutions USA, Inc.Inventors: Yuri Boykov, Gianluca Paladini
-
Publication number: 20070292025Abstract: An image editing system comprises an input device for inputting an image, a graphical user interface for selecting background and object seeds for the image, and an image processor for editing the image. The image processor has various editing routines, including a segmentation routine that builds a graph associated with the image and uses a graph cut algorithm to cut the graph into segments. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and regional information. Graph cuts are used to find the globally optimal segementation of the image. The obtained solution gives the best balance of boundary and region properties satisfying the constraints.Type: ApplicationFiled: July 3, 2007Publication date: December 20, 2007Applicant: Siemens Corporate Research, Inc.Inventors: Yuri Boykov, Marie-Pierre Jolly
-
Publication number: 20070286483Abstract: A region-based push-relabel formulation is disclosed that removes the requirement that the entire graph should fit into the computer memory and yields an implementation that can reduce the required size and redundancy of accesses to the data memory, thus improving speed performance, while allowing for an efficient parallel processing implementation. The algorithm assigns all vertices that are not part of the sources or sinks with a value of 1. Sinks are assigned with zeros and sources are assigned a label equal to the number of their vertices. The preflow is then pushed from the sources to their neighbors, if any. When the preflow has all reached the boundaries, an adjacent region of the neighboring set is selected and preflow is pushed within this region. When the values of the preflow have been exhausted, region relabeling is done to update the label values. This is repeated within the region until all preflow has exited to the boundary of this region.Type: ApplicationFiled: March 14, 2007Publication date: December 13, 2007Applicant: Siemens Corporate Research, Inc.Inventors: Andrew Delong, Yuri Boykov, Daphne Yu
-
Publication number: 20060239553Abstract: A method and related system for automatically and efficiently isolating the heart in Computer Tomography (CT) or Magnetic Resonance Imaging cardiac scans is disclosed. The method involves segmenting a heart within a set of volumetric data. In accordance with one aspect of the present invention, the set of volumetric data is processed to determine the minimum value of an energy function having a first term, a second term and a third term. The heart is segmented based on the processing of the set of volumetric data.Type: ApplicationFiled: March 8, 2006Publication date: October 26, 2006Inventors: Charles Florin, Romain Moreau-Gobard, Yuri Boykov, Gareth Funka-Lea
-
Patent number: 6973212Abstract: Disclosed is a method of segmenting one or more objects from one or more backgrounds in an image, the method comprising defining a plurality of image nodes, each said image node corresponding to one or more pixels of said image, connecting pairs of adjacent nodes with n-links, each said n-link weighted with an n-link cost, defining a source node, defining a sink node, defining one or more object seeds, said object seeds corresponding to image nodes within said objects, defining one or more background seeds, said background seeds corresponding to image nodes within said backgrounds, connecting said source node with each said object seed with a plurality of t-links, connecting said sink node with each said background seed with a plurality of t-links, wherein each said t-links is weighted with a t-link cost, and calculating a segmentation cut having the smallest total cost of all cuts separating said source from said sink, wherein said total cost of each said cut is defined as the sum of the costs of all said n-Type: GrantFiled: August 30, 2001Date of Patent: December 6, 2005Assignee: Siemens Corporate Research, Inc.Inventors: Yuri Boykov, Marie-Pierre Jolly
-
Publication number: 20050213837Abstract: A method of segmenting an image includes representing an image by a grid with a plurality of nodes, terminals, and edges, the terminals including a source and a sink. The edges include n-links and t-links, where each n-link connects a pair of nodes, and the t-links connect a node to a terminal, and each t-link and n-link has an associated cost. The method includes initializing a node height table, a flow excess table, a t-link capacity table, and an n-link capacity table based on the t-link and n-link costs, and updating the node height table, the flow excess table, the t-link capacity table, the said n-link capacity table in parallel for all nodes until the flow excess table is zero for all nodes. The method steps are performed in parallel for all nodes on a graphics processing unit.Type: ApplicationFiled: February 15, 2005Publication date: September 29, 2005Inventors: Yuri Boykov, Gianluca Paladini
-
Patent number: 6744923Abstract: Many tasks in computer vision involve assigning a label, such as disparity for depth of field data to every pixel. Energy minimization may be used to accomplish this labeling. The present invention provides an efficient way of minimizing energy functions in assigning labels to pixels. Two methods of using graph cuts to compute a local minimum are described. The first move is an &agr;&bgr; swap. For a pair of labels, &agr;, &bgr;, this move swaps the labels between an arbitrary set of pixels labeled a and another arbitrary set of pixels labeled &bgr;. The first method generates a labeling such that there is no swap move that decreases the energy. The second move is the &agr;-expansion. For a label &agr;, this move assigns an arbitrary set of pixels with the label &agr;.Type: GrantFiled: August 30, 2000Date of Patent: June 1, 2004Assignee: Cornell Research Foundation, Inc.Inventors: Ramin D. Zabih, Olga Veksler, Yuri Boykov
-
Publication number: 20040008886Abstract: An image editing system comprises an input device for inputting an image, a graphical user interface for selecting background and object seeds for the image, and an image processor for editing the image. The image processor has various editing routines, including a segmentation routine that builds a graph associated with the image and uses a graph cut algorithm to cut the graph into segments. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and regional information. Graph cuts are used to find the globally optimal segementation of the image. The obtained solution gives the best balance of boundary and region properties satisfying the constraints.Type: ApplicationFiled: April 15, 2003Publication date: January 15, 2004Inventor: Yuri Boykov
-
Publication number: 20020048401Abstract: Disclosed is a method of segmenting one or more objects from one or more backgrounds in an image, the method comprising defining a plurality of image nodes, each said image node corresponding to one or more pixels of said image, connecting pairs of adjacent nodes with n-links, each said n-link weighted with an n-link cost, defining a source node, defining a sink node, defining one or more object seeds, said object seeds corresponding to image nodes within said objects, defining one or more background seeds, said background seeds corresponding to image nodes within said backgrounds, connecting said source node with each said object seed with a plurality of t-links, connecting said sink node with each said background seed with a plurality of t-links, wherein each said t-links is weighted with a t-link cost, and calculating a segmentation cut having the smallest total cost of all cuts separating said source from said sink, wherein said total cost of each said cut is defined as the sum of the costs of all said n-Type: ApplicationFiled: August 30, 2001Publication date: April 25, 2002Inventors: Yuri Boykov, Marie-Pierre Jolly