At Patents you can conduct a Patent Search, File a Patent Application, find a Patent Attorney, or search available technology through our Patent Exchange. Patents are available using simple keyword or date criteria. If you are looking to hire a patent attorney, you've come to the right place. Protect your idea and hire a patent lawyer.
|United States Patent||9,582,891|
|Geiger , et al.||February 28, 2017|
A method is disclosed to automatically segment 3D and higher-dimensional images into two subsets without user intervention, with no topological restriction on the solution, and in such a way that the solution is an optimal in a precisely defined optimization criterion, including an exactly defined degree of smoothness. A minimum-cut algorithm is used on a graph devised so that the optimization criterion translates into the minimization of the graph cut. The minimum cut thus found is interpreted as the segmentation with desired property.
|Inventors:||Geiger; Davi (New York, NY), Ishikawa; Hiroshi (New York, NY)|
New York University
|Filed:||October 6, 2014|
|Document Identifier||Publication Date|
|US 20150055877 A1||Feb 26, 2015|
|Application Number||Filing Date||Patent Number||Issue Date|
|13768917||Feb 15, 2013||8854363|
|13007449||Jan 14, 2011||8441481|
|11035711||Jan 14, 2005||7893939|
|09666371||Sep 20, 2000||7212201|
|60155494||Sep 23, 1999|
|Current U.S. Class:||1/1|
|Current CPC Class:||G06T 7/162 (20170101); G06K 9/342 (20130101); G06K 9/346 (20130101); G06K 9/6224 (20130101); G06T 7/11 (20170101); G06T 17/00 (20130101); G06T 2207/30004 (20130101); G06T 2200/04 (20130101); G06T 2207/10072 (20130101); G06T 2207/20072 (20130101)|
|Current International Class:||G06T 7/00 (20060101); G06K 9/34 (20060101); G06K 9/62 (20060101); G06T 17/00 (20060101)|
|5201035||April 1993||Stytz et al.|
|5583975||December 1996||Naka et al.|
|5790692||August 1998||Price et al.|
|5797012||August 1998||Blainey et al.|
|5835617||November 1998||Ohta et al.|
|5903664||May 1999||Hartley et al.|
|6278459||August 2001||Malzbender et al.|
|6301694||October 2001||Lee et al.|
|6323846||November 2001||Westerman et al.|
|6324678||November 2001||Dangelo et al.|
|6362821||March 2002||Gibson et al.|
|6373484||April 2002||Orell et al.|
|6373998||April 2002||Thirion et al.|
|6421809||July 2002||Wuytack et al.|
|6512993||January 2003||Kacyra et al.|
|6516277||February 2003||Edgecombe et al.|
|6577992||June 2003||Tcherniaev et al.|
|6744923||June 2004||Zabih et al.|
|7212201||May 2007||Geiger et al.|
|8441481||May 2013||Geiger et al.|
|2002/0048401||April 2002||Boykov et al.|
Amir A. Amini, Terry E. Weymouth, and Ramesh C. Jain, "Using dynamic programming for solving variational problems in vision," IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(9):855-867, Sep. 1990. cited by applicant .
Laurent D. Cohen, On active contour models and balloons. Computer Vision, Graphics and Image Processing: Image Understanding, 53(2): 211-218, 1991. cited by applicant .
Laurent D. Cohen and Isaac Cohen, "Finite element methods for active contour models and balloons for 2-d and 3-d images," IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(II): 1131-1147, Nov. 1993. cited by applicant .
Ingemar J. Cox, Satish B. Rao, and Yu Zhong, "ratio regions" a technique for image segmentation, in International Conference on Pattern Recognition, vol. II, pp. 557-564, 1996. cited by applicant .
Marie-Pierre Dubuisson-Jolly, Cheng-Chung Liang, and Alok Gupta, "Optimal polyline tracking for artery motion compensation in coronary angiography," In International Conference on Computer Vision, pp. 414-419. 1998. cited by applicant .
L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, 1962. cited by applicant .
Davi Geiger, Alok Gupta, Luiz A. Costa, and John Viontzos, "Dynamic programming for detecting, tracking, and matching deformable contours," IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(3): 294-402, Mar. 1995. cited by applicant .
A. Goldberg and R. Tarjan, A new approach to the maximum flow problem. Journal of the Association for Computing Machinery, 35(4):921-940, Oct. 1988. cited by applicant .
D. Greig, B. Porteo-ancl A. Seheult. Exact maximum a posterior estimation for binary images, Journal of the Royal Statistical Society, Series B, 51(2):271-279, 1989. cited by applicant .
Robert M. Haralick and Linda G. Shapiro, Computer and Robot Vision, Addison-Wesley Publishing Company, 1992. cited by applicant .
H. Islilkawa and D. Geiger, "Segmentation by grouping junctions," In IEEE Conference on Computer Vision and Pattern Recognition, pp. 125-131, 1998. cited by applicant .
Ian H. Jermyn and Hiroshi Ishikawa, "Globally optimal regions and boundaries," In International Conference on Computer Vision, vol. II, pp. 904-910, 1999. cited by applicant .
M. Kass, A. Witkin, and D. Terzolpoulos, Snakes: Active contour models. International Journal of Computer Vision, 2:321-331, 1988. cited by applicant .
Snow et al. "Exact voxel occupancy with graph cuts", Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, Jun. 2000, pp. 345-352. cited by applicant .
Bonneville et al. "Graph cut: application to Bayesian emission tomography reconstruction", Proceedings of the International Conference on Image Analysis and Processing, Sep. 1999, pp. 1184-1189. cited by applicant .
Prosecution history for U.S. Appl. No. 09/943,035 by Boykov, filed Aug. 30, 2001. cited by applicant.