Ultraschallbildbverarbeitung
    12.
    发明专利

    公开(公告)号:DE112012002337B4

    公开(公告)日:2017-07-06

    申请号:DE112012002337

    申请日:2012-05-01

    Applicant: IBM

    Abstract: Computerrealisiertes Verfahren zum Verarbeiten eines Ultraschallbilds durch eine computerunterstützte Einheit, aufweisend: Segmentieren von Gewebe in einem empfangenen Ultraschallbild; Erzeugen einer Maske von Bildpunkten, die zentral auf einen Bildpunkt in einem Gewebebereich ausgerichtet sind, wobei sich die Bildpunkte in der Maske innerhalb eines festgelegten Dezibelbereich des Werts des zentralen Bildpunkts und innerhalb einer Segmentierungsgrenze der Segmentierung befinden; und Zuweisen einer Dämpfung für den zentralen Bildpunkt durch Schätzen der Dämpfung der Bildpunkte in der Maske.

    Ultrasound image processing
    14.
    发明专利

    公开(公告)号:GB2504631A

    公开(公告)日:2014-02-05

    申请号:GB201318423

    申请日:2012-05-01

    Applicant: IBM

    Abstract: Method, system, and computer program product are provided for processing an ultrasound image, in particular an image of inhomogeneous tissue. The method includes: segmenting tissue in a received ultrasound image; creating a mask of pixels centred on a pixel in a tissue area, wherein the pixels in the mask are within a given decibel range of the central pixel and within a segmentation boundary; and assigning an attenuation to the central pixel by estimating the attenuation of the pixels in the mask. The received ultrasound image may be a raw image the method may include creating an image of an attenuation mapping of attenuations for each pixel in a tissue area. Alternatively, the received ultrasound image may be a time gain compensated image the method may include determining areas of relatively high or low attenuation.

    METHOD FOR HIGH QUALITY COMPRESSION OF BINARY TEXT IMAGES

    公开(公告)号:CA2019133C

    公开(公告)日:1995-05-30

    申请号:CA2019133

    申请日:1990-06-15

    Applicant: IBM

    Abstract: The invention relates to a method for the compression and decompression of binary text images. The method distinguishes between large low-frequency areas and small high-frequency areas in the original frame. For the low-frequency areas, a scheme for lossy compression is used, whereas for the high-frequency areas, a scheme permitting lossless compression is applied. The compression/ decompression process involves the following five stages - (1) prefiltering to remove all black patches (e.g. by removing all black pixels, except where they belong to a large black segment; (2) fast evaluation of compressibility by partitioning the images into mutually exclusive segments and applying different compression modes to each segment; (3) connectivity oriented subsampling to reduce the resolution in horizontal and vertical directions (the image is segmented into blocks, and a 1-pixel representation for each block is determined); (4) lossless compression and decompression where the reduced file is compressed by conventional techniques; and (5) reconstruction by sequence reversal (lossless decompression will retrieve the subsampled file, expansion of the subsampled file through replacement of each pixel by a block having equal value, postfiltering).

    A method of generating a compressed representation of a source data string

    公开(公告)号:SG45378A1

    公开(公告)日:1998-01-16

    申请号:SG1996005250

    申请日:1989-06-08

    Applicant: IBM

    Abstract: An improved method is disclosed for generating a compressed representation of a source data string each symbol of which is taken from a finite set of m + 1 symbols, a0 to am . 'The method is based on an arithmetic coding procedure wherein the compressed representation is recursively generated as successive sub-intervals within a predetermined interval. The width of each sub-interval is theoretically equal to the width of the previous sub-interval multiplied by the probability of the current symbol. The improvement is achieved by approximating the width of the previous sub-interval so that the approximation can be obtained by a single shift and add operation using a suitable shift register.

    18.
    发明专利
    未知

    公开(公告)号:DE68926270D1

    公开(公告)日:1996-05-23

    申请号:DE68926270

    申请日:1989-06-08

    Applicant: IBM

    Abstract: An improved method is disclosed for generating a compressed representation of a source data string each symbol of which is taken from a finite set of m + 1 symbols, a0 to am . 'The method is based on an arithmetic coding procedure wherein the compressed representation is recursively generated as successive sub-intervals within a predetermined interval. The width of each sub-interval is theoretically equal to the width of the previous sub-interval multiplied by the probability of the current symbol. The improvement is achieved by approximating the width of the previous sub-interval so that the approximation can be obtained by a single shift and add operation using a suitable shift register.

    METHOD FOR COMPRESSING AND DECOMPRESSING FORMS BY MEANS OF VERY LARGE SYMBOL MATCHING

    公开(公告)号:CA2019134C

    公开(公告)日:1996-04-09

    申请号:CA2019134

    申请日:1990-06-15

    Applicant: IBM

    Abstract: This method relates to the compression of information contained in filled-in forms (O) by separate handling of the corresponding empty forms (CP) and of the information written into them (VP). Samples of the empty forms are prescanned, the data obtained digitized and stored in a computer memory to create a forms library. The original, filled-in form (O) to be compressed is then scanned, the data obtained digitized and the retrieved representation of the empty form (CP) is then subtracted, the difference being the digital representation of the filled-in information (VP), which may now be compressed by conventional methods or, preferably, by an adaptive compression scheme using at least two compression ratios depending on the relative content of black pixels in the data to be compressed.

Patent Agency Ranking