The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 28, 2015
Filed:
Nov. 02, 2011
Zhou Yu, Waukesha, WI (US);
Evgeny Drapkin, Waukesha, WI (US);
Bruno Kristiaan Bernard DE Man, Clifton Park, NY (US);
Jean-baptiste Thibault, Waukesha, WI (US);
Kai Zeng, Rexford, NY (US);
Jiang Hsieh, Waukesha, WI (US);
Brian Edward Nett, Waukesha, WI (US);
Debashish Pal, Waukesha, WI (US);
Lin Fu, Niskayuna, NY (US);
Guangzhi Cao, Waukesha, WI (US);
Charles A. Bouman, Jr., Lafayette, IN (US);
Ken David Sauer, South Bend, IN (US);
Zhou Yu, Waukesha, WI (US);
Evgeny Drapkin, Waukesha, WI (US);
Bruno Kristiaan Bernard De Man, Clifton Park, NY (US);
Jean-Baptiste Thibault, Waukesha, WI (US);
Kai Zeng, Rexford, NY (US);
Jiang Hsieh, Waukesha, WI (US);
Brian Edward Nett, Waukesha, WI (US);
Debashish Pal, Waukesha, WI (US);
Lin Fu, Niskayuna, NY (US);
Guangzhi Cao, Waukesha, WI (US);
Charles A. Bouman, Jr., Lafayette, IN (US);
Ken David Sauer, South Bend, IN (US);
General Electric Company, Schenectady, NY (US);
The University of Notre Dame Du Lac, Notre Dame, IN (US);
Purdue Research Foundation, West Lafayette, IN (US);
Abstract
A method for reconstructing an image of an object that includes a plurality of image elements. The method includes accessing image data associated with a plurality of image elements, and reconstructing an image of the object by optimizing an objective function, where the objective function is optimized by iteratively solving a nested sequence of approximate optimization problems. The algorithm is composed of nested iterative loops, in which an inner loop iteratively optimizes an objective function approximating the outer loop objective function, and an outer loop that utilizes the solution of the inner loop to optimize the original objective function.