Patents by Inventor Mithun Das Gupta
Mithun Das Gupta 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: 20140233818Abstract: Methods and systems for segmentation in echocardiography are provided. One method includes obtaining echocardiographic images and defining a search space within the echocardiographic images using a pair of one-dimensional (1D) profiles. The method also includes using an energy based function constrained by non-local temporal priors within the defined search space to automatically segment a contour of a cardiac structure with the 1D profiles.Type: ApplicationFiled: February 26, 2013Publication date: August 21, 2014Applicant: General Electric CompanyInventors: Sheshadri Thiruvenkadam, Navneeth Subamanian, Mithun Das Gupta
-
Patent number: 8805653Abstract: Graph embedding is incorporated into nonnegative matrix factorization, NMF, while using the original formulation of graph embedding. Negative values are permitted in the definition of graph embedding without violating the nonnegative requirement of NMF. The factorized matrices of NMF are found by an iterative process.Type: GrantFiled: August 11, 2010Date of Patent: August 12, 2014Assignee: Seiko Epson CorporationInventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Patent number: 8515879Abstract: Supervised kernel nonnegative matrix factorization generates a descriptive part-based representation of data, based on the concept of kernel nonnegative matrix factorization (kernel NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes.Type: GrantFiled: August 11, 2010Date of Patent: August 20, 2013Assignee: Seiko Epson CorporationInventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Patent number: 8498949Abstract: Supervised nonnegative matrix factorization (SNMF) generates a descriptive part-based representation of data, based on the concept of nonnegative matrix factorization (NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes. Analytical and empirical evidence is presented to show that SNMF has advantages over popular subspace learning techniques as well as current state-of-the-art techniques.Type: GrantFiled: August 11, 2010Date of Patent: July 30, 2013Assignee: Seiko Epson CorporationInventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Publication number: 20130190600Abstract: A method for identifying an optimal image frame is presented. The method includes receiving a selection of an anatomical region of interest in an object of interest. Furthermore, the method includes obtaining a plurality of image frames corresponding to the selected anatomical region of interest. The method also includes determining a real-time indicator corresponding to the plurality of acquired image frames, wherein the real-time indicator is representative of quality of an image frame. In addition, the method includes communicating the real-time indicator to aid in selecting an optimal image frame. Systems and non-transitory computer readable medium configured to perform the method for identifying an optimal image frame are also presented.Type: ApplicationFiled: January 25, 2012Publication date: July 25, 2013Applicant: GENERAL ELECTRIC COMPANYInventors: Mithun Das Gupta, Kajoli Banerjee Krishnan, Pavan Kumar Veerabhadra Annangi, Xiaoming Liu, Sri Kaushik Pavani, Navneeth Subramanian, Jyotirmoy Banerjee
-
Patent number: 8412757Abstract: Non-negative matrix factorization, NMF, is combined with identification of a maximum margin classifier by minimizing a cost function that contains a generative component and the discriminative component. The relative weighting between the generative component and the discriminative component are adjusting during subsequent iterations such that initially, when confidence is low, the generative model is favored. But as the iterations proceed, confidence increases and the weight of the discriminative component is steadily increased until it is of equal weight as the generative model. Preferably, the cost function to be minimized is: min F , G ? 0 ? ? X - FG ? 2 + ? ? ( ? w ? 2 + C ? ? i = 1 n ? L ? ( y i , w ยท g i + b ) ) .Type: GrantFiled: December 9, 2009Date of Patent: April 2, 2013Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8407171Abstract: Similarities between simplex projection with upper bounds and L1 projection are explored. Criteria for a-priori determination of sequence in which various constraints become active are derived, and this sequence is used to develop efficient algorithms for projecting a vector onto the L1-ball while observing box constraints. Three projection methods are presented. The first projection method performs exact projection in O(n2) worst case complexity, where n is the space dimension. Using a novel criteria for ordering constraints, the second projection method has a worst case complexity of O(n log n). The third projection method is a worst case linear time algorithm having O(n) complexity. The upper bounds defined for the projected entries guide the L1-ball projection to more meaningful predictions.Type: GrantFiled: August 10, 2010Date of Patent: March 26, 2013Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao, Sanjeev Kumar
-
Patent number: 8300882Abstract: A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.Type: GrantFiled: February 5, 2010Date of Patent: October 30, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8285033Abstract: An edge preserving filter that works on the principle of matting affinity allows a better representation of the range filter term in bilateral class filters. The definition of the affinity term can be relaxed to suit different applications. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space. This is a big benefit over the traditional bilateral filter, which needs conversion to perception based spaces, such as CIELAB, to generate results close to the present invention. The full bi-affinity filter preserves very minute details of the input image, and thus permits an enhanced zooming functionality.Type: GrantFiled: April 1, 2010Date of Patent: October 9, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8243985Abstract: A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.Type: GrantFiled: February 5, 2010Date of Patent: August 14, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8194918Abstract: A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.Type: GrantFiled: February 5, 2010Date of Patent: June 5, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8160380Abstract: Application of an image filtering algorithm, which defines an algorithm window within which a center pixel is processed relative to the other pixels within the algorithm window, is improved by use of an extended window larger than and encompassing the algorithm window. This approached is applied with an edge preserving filter that works on the principle of matting affinity and allows a better representation of the range filter term in bilateral class filters. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space.Type: GrantFiled: July 8, 2010Date of Patent: April 17, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Patent number: 8144925Abstract: A watermarking system uses two distinct bit patterns to identify three distinct bits, a logic 0 bit, a logic 1 bit, and a marker bit that demarcates message block boundaries. A correct orientation is determining by rotating the input image by 90 degrees and determining which orientation renders the greatest number of valid bits. Bit mapping is used from block to block to predefine a shifting starting position for a watermark message within consecutive message blocks.Type: GrantFiled: August 24, 2010Date of Patent: March 27, 2012Assignee: Seiko Epson CorporationInventors: Mithun Das Gupta, Jing Xiao
-
Publication number: 20120051582Abstract: A watermarking system uses two distinct bit patterns to identify three distinct bits, a logic 0 bit, a logic 1 bit, and a marker bit that demarcates message block boundaries. A correct orientation is determining by rotating the input image by 90 degrees and determining which orientation renders the greatest number of valid bits. Bit mapping is used from block to block to predefine a shifting starting position for a watermark message within consecutive message blocks.Type: ApplicationFiled: August 24, 2010Publication date: March 1, 2012Inventors: Mithun Das Gupta, Jing Xiao
-
Publication number: 20120041906Abstract: Supervised kernel nonnegative matrix factorization generates a descriptive part-based representation of data, based on the concept of kernel nonnegative matrix factorization (kernel NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes.Type: ApplicationFiled: August 11, 2010Publication date: February 16, 2012Inventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Publication number: 20120041725Abstract: Graph embedding is incorporated into nonnegative matrix factorization, NMF, while using the original formulation of graph embedding. Negative values are permitted in the definition of graph embedding without violating the nonnegative requirement of NMF. The factorized matrices of NMF are found by an iterative process.Type: ApplicationFiled: August 11, 2010Publication date: February 16, 2012Inventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Publication number: 20120041905Abstract: Supervised nonnegative matrix factorization (SNMF) generates a descriptive part-based representation of data, based on the concept of nonnegative matrix factorization (NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes. Analytical and empirical evidence is presented to show that SNMF has advantages over popular subspace learning techniques as well as current state-of-the-art techniques.Type: ApplicationFiled: August 11, 2010Publication date: February 16, 2012Inventors: Seung-il Huh, Mithun Das Gupta, Jing Xiao
-
Publication number: 20120008862Abstract: Application of an image filtering algorithm, which defines an algorithm window within which a center pixel is processed relative to the other pixels within the algorithm window, is improved by use of an extended window larger than and encompassing the algorithm window. This approached is applied with an edge preserving filter that works on the principle of matting affinity and allows a better representation of the range filter term in bilateral class filters. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space.Type: ApplicationFiled: July 8, 2010Publication date: January 12, 2012Inventors: Mithun Das Gupta, Jing Xiao
-
Publication number: 20110243428Abstract: An edge preserving filter that works on the principle of matting affinity allows a better representation of the range filter term in bilateral class filters. The definition of the affinity term can be relaxed to suit different applications. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space. This is a big benefit over the traditional bilateral filter, which needs conversion to perception based spaces, such as CIELAB, to generate results close to the present invention. The full bi-affinity filter preserves very minute details of the input image, and thus permits an enhanced zooming functionality.Type: ApplicationFiled: April 1, 2010Publication date: October 6, 2011Inventors: Mithun Das Gupta, Jing Xiao
-
Publication number: 20110200269Abstract: Multiple filters of a bilateral filter are decoupled to form into multple linear filtering operations, which permits faster processing. The bilateral filter is re-presented as an approximate bilateral filter, and subjected to a logarithm whose resultant components are further subjected to a series of Jensen approximations. The errors resulting from each Jensen approximation are collected into a single cumulative error factor, and it is then shown that the cumulative error may be ignored without adversed affect to the result. Thus, the original bilateral filter may be implemented as log(y0)=log(2??gjKj)+log(?Kjfj)+log(?Kjgj).Type: ApplicationFiled: February 18, 2010Publication date: August 18, 2011Inventors: Mithun Das Gupta, Jing Xiao