会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • System and method for signal reconstruction from incomplete data
    • 不完整数据信号重构的系统和方法
    • US08335955B2
    • 2012-12-18
    • US12487689
    • 2009-06-19
    • Ali Kemal SinopLeo Grady
    • Ali Kemal SinopLeo Grady
    • H03M13/00
    • G06K9/6247G06K9/6249G06T11/006G06T2210/41G06T2211/436
    • A method for reconstructing a signal from incomplete data in a signal processing device includes acquiring incomplete signal data. An initial reconstruction of the incomplete signal data is generated. A reconstruction is generated starting from the initial reconstruction by repeating the steps of: calculating a sparsity transform of the reconstruction, measuring an approximation of sparsity of the reconstruction by applying an m-estimator to the calculated sparsity transform, and iteratively optimizing the reconstruction to minimize output of the m-estimator thereby maximizing the approximation of sparsity for the reconstruction. The optimized reconstruction is provided as a representation of the incomplete data.
    • 用于在信号处理装置中重建来自不完整数据的信号的方法包括获取不完整的信号数据。 产生不完整信号数据的初始重建。 通过重复以下步骤产生从初始重构开始的重构:计算重建的稀疏变换,通过将m估计器应用于计算的稀疏变换来测量重建的稀疏度的近似,并且迭代地优化重建以最小化 m估计器的输出,从而最大化重建的稀疏度的近似。 优化重建是作为不完整数据的表示提供的。
    • 7. 发明申请
    • Seed segmentation using L-infinity minimization
    • 使用L-infinity最小化的种子分割
    • US20080056577A1
    • 2008-03-06
    • US11789747
    • 2007-04-25
    • Leo GradyAli Kemal Sinop
    • Leo GradyAli Kemal Sinop
    • G06K9/34
    • G06K9/469G06K9/6224G06T7/11G06T7/143G06T7/162G06T2207/30101
    • A computer readable medium embodying instructions executable by a processor to perform a method for seeded image segmentation using l∞ minimization, the method including providing an image comprising a set of pixels, wherein a foreground seed label is given for at least one pixel of the image and a background seed label is given for at least another pixel of the image, determining an affinity function for every pair of neighbor pixels, solving the l∞ minimization, which assigns a probability to each pixel, labeling each pixel as foreground pixel or background pixel according to a threshold of the probability, and outputting the image including the segmentation labels.
    • 一种计算机可读介质,其包含可由处理器执行的指令,以执行使用最小化的种子图像分割的方法,所述方法包括提供包括一组像素的图像,其中给出前景种子标签 为图像的至少另一像素给出图像的至少一个像素和背景种子标签,确定每对相邻像素的亲和度函数,求解最小化,其分配一个 每个像素的概率,根据概率的阈值将每个像素标记为前景像素或背景像素,并且输出包括分割标签的图像。
    • 8. 发明授权
    • Robust reconstruction method for parallel magnetic resonance images
    • 平行磁共振图像的鲁棒重建方法
    • US08055037B2
    • 2011-11-08
    • US11928121
    • 2007-10-30
    • Ali Kemal SinopLeo Grady
    • Ali Kemal SinopLeo Grady
    • G06K9/00
    • G01R33/5611
    • Methods and systems for reconstruction of an image from parallel Magnetic Resonance Image (pMRI) data are disclosed. A reconstructed pMRI image may suffer from noise and aliasing. A method for reducing aliasing by applying a bounded error function is disclosed. A method for reducing noise in a reconstruction by applying an error term is also disclosed. Error terms are included in an expression that can be solved as a minimization problem. Creating a solution in an iterative way is also disclosed. Examples of specific solutions are provided. A system applying the methods is also provided.
    • 公开了从平行重建图像的方法和系统。磁共振图像(pMRI)数据。 重建的pMRI图像可能遭受噪声和混叠。 公开了一种通过应用有限误差函数来减少混叠的方法。 还公开了一种通过应用误差项来减少重构中的噪声的方法。 错误项包含在可以作为最小化问题解决的表达式中。 还公开了以迭代方式创建解决方案。 提供具体解决方案的示例。 还提供了应用该方法的系统。
    • 10. 发明授权
    • Seed segmentation using l∞ minimization
    • 使用l∞最小化的种子分割
    • US07773807B2
    • 2010-08-10
    • US11789747
    • 2007-04-25
    • Leo GradyAli Kemal Sinop
    • Leo GradyAli Kemal Sinop
    • G06K9/00G06K9/34G06K9/36
    • G06K9/469G06K9/6224G06T7/11G06T7/143G06T7/162G06T2207/30101
    • A computer readable medium embodying instructions executable by a processor to perform a method for seeded image segmentation using l∞ minimization, the method including providing an image comprising a set of pixels, wherein a foreground seed label is given for at least one pixel of the image and a background seed label is given for at least another pixel of the image, determining an affinity function for every pair of neighbor pixels, solving the l∞ minimization, which assigns a probability to each pixel, labeling each pixel as foreground pixel or background pixel according to a threshold of the probability, and outputting the image including the segmentation labels.
    • 一种计算机可读介质,其包含可由处理器执行的指令,以执行使用l∞最小化的种子图像分割的方法,所述方法包括提供包括一组像素的图像,其中为所述图像的至少一个像素给出前景种子标签 并且为图像的至少另一个像素给出背景种子标签,确定每对相邻像素的亲和度函数,求解l∞最小化,其为每个像素分配概率,将每个像素标记为前景像素或背景像素 根据概率的阈值,并输出包括分割标签的图像。