Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

113 results about "Graph cut algorithm" patented technology

Segmentation method and system for abdomen soft tissue nuclear magnetism image

The invention discloses a segmentation method and system for an abdomen soft tissue nuclear magnetism image. The segmentation method comprises the steps that pre-segmentation is conducted on an area to be segmented through an area growing algorithm, then a morphological operator is adopted to conduct expansion and corrosion operations to carry out further processing on the pre-segmentation result, so that the pre-segmentation result forms an original segmentation outline. After rectification is conducted between a shape template set and the original segmentation outline, kernel principal component analysis is conducted, and prior shape information is obtained through a statistics model. The prior shape information is combined with data items of an energy function of a nuclear magnetism image segmentation model, and an energy function is built; a kernel graph cuts algorithm is used for carrying out segmentation on the original segmentation outline and an objective outline is obtained. The segmentation method and system can achieve semi-automatic segmentation, the system is simple, the robustness of the nuclear magnetism image segmentation algorithm is effectively improved so as to enable the segmentation result to be more accurate, and the segmentation method and system for the abdomen soft tissue nuclear magnetism image can be applied to nuclear magnetism image segmentation.
Owner:SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI

PET-CT lung tumor segmentation method combining three dimensional graph cut algorithm with random walk algorithm

The invention belongs to the field of biomedical image processing and specifically relates to a PET-CT lung tumor segmentation method combining a three dimensional graph cut algorithm with a random walk algorithm. The method comprises the following steps of: performing linear up-sampling on an original PET image and performing affine registration on PET and CT images; calibrating tumor seed points and non-tumor seed point; performing random walk algorithm segmentation on the PET image in combination with the tumor seed points; acquiring a foreground target area Ro completely including a target lung tumor area, using the areas, except the Ro, as a background area Rb of a non-lung tumor area; establishing gauss mixture models for the foreground area Ro and the background area Rb separately; computing energy items according to the gauss mixture models of the foreground area Ro and the background area Rb and obtaining a final segmentation result by using an graph cut algorithm. The method fully utilizes the function information and the PET image and the structure information of the CT image, enables complements between the random walk algorithm and the graph cut algorithm, and achieves an accurate lung tumor segmentation result.
Owner:SUZHOU BIGVISION MEDICAL TECH CO LTD

Intracranial hemorrhage area segmentation method based on three-dimensional super voxel and system thereof

The invention discloses an intracranial hemorrhage area segmentation method based on three-dimensional super voxel and a system thereof. The intracranial hemorrhage area segmentation method is characterized in that a CT image pre-processing phase and an intracranial hemorrhage area segmentation phase based on the three-dimensional super voxel can be provided; according to the CT image pre-processing phase, the format conversion of the two-dimensional CT image sequence can be carried out, the skull structure can be extracted, and the intracranial area can be found; according to the intracranial hemorrhage area segmentation phase, the two-dimensional local CT image can be reconstructed on the three-dimensional space, and the three-dimensional image can be divided into the super voxels having the similar sizes by adopting the super voxel algorithm, and the super voxels can be divided into the foreground part and the background part by adopting the graph cut algorithm. The intracranial structure can be extracted by adopting the pre-processing, and the segmentation can be refined step by step, and the super voxels can be used for the calculation by replacing the pixels, and then the hemorrhage area detection accuracy can be effectively improved. The method and the system provided by the invention are advantageous in that the hemorrhage areas having different reasons, different positions, and different sizes can be effectively detected, and the important function can be provided for the computer-aided medical application in the clinic.
Owner:ZHEJIANG UNIV

Rapid robustness auto-partitioning method for abdomen computed tomography (CT) sequence image of liver

The invention discloses a robustness auto-partitioning method for an abdomen computed tomography (CT) sequence image of a liver. The robustness auto-partitioning method comprises a data inputting step : in which a CT sequence to be partitioned is input and an initial slice is designated; a model building step in which a liver brightness model and an appearance model are built according to data characteristics of the input sequence,a complex background is suppressed and a liver region is highlighted; and an automatic partitioning step in which the initial slice is rapidly and automatically partitioned through combining the brightness model and the appearance model by a graph cut algorithm, and all slices in the liver CT sequence are iteratively partitioned upwards and downwards by taking the initial partition slice as a starting point according to spatial correlations between adjacent slices. According to the method, the corresponding brightness and appearance models are built with regards to the particular CT sequence, and thus, the liver with a low partitioning contrast ratio, boundary fuzziness and shape irregularity can be effectively and automatically partitioned. Moreover, the auto-partitioning method for the abdomen CT sequence image of the liver can be promoted to automatic partitioning of other abdominal organs, such as partitioning of the abdomen CT sequence image of a spleen and a kidney.
Owner:湖南提奥医疗科技有限公司

Manhattan structure building automatic modeling method based on cuboid fitting scanning three-dimensional point cloud

The invention provides a Manhattan structure building automatic modeling method based on cuboid fitting scanning three-dimensional point cloud. The method carried out modeling through plane extraction, cuboid-based space division and binary classification based on a graph-cut algorithm. The method enables modeling work to be converted into the binary classification problem based on a cuboid element structure; the method establishes coverage index for reflecting fitting efficiency and establishes a global optimization target energy equation by utilizing a point set on a plane and space relativeposition relation of each cuboid; the method solves the target equation through the graph-cut algorithm to obtain binary classification of the cuboids, and operation processing efficiency is high; each surface of the model is flat, the overall structure is compact and a comfortable visual effect is achieved; and since the model result only keeps cuboid vertexes and facet structure, compared withinput dense three-dimensional point cloud, data volume is compressed greatly, and model achieves obvious light weight, which has a good support function for modeling work in a large-scale building scene.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Unmanned aerial vehicle remote sensing image mosaic system based on adjacency relation model

The invention discloses an unmanned aerial vehicle remote sensing image mosaic system based on an adjacent relation model, belonging to the field of remote sensing image mosaic technology of unmannedaerial vehicle. The adjacent distance is taken as the weight of the edge, the minimum spanning tree is used to determine the mosaic order, which can maximize the use of the clustering of adjacent images; after the mosaic order is determined, the images can be incrementally mosaic onto the cumulative results in order to complete the mosaic; the mapping between images can be replaced by a similaritytransformation or affine transformation; after the mosaic images are transformed, the images are processed by a Graph-Cut algorithm to solve the overlapping seams, then put the images together directly, the invention realizes a multi-view remote sensing image mosaic system of an unmanned aerial vehicle, and the matching precision and the splicing time are balanced, which can not only ensure the extraction of enough features, but also reduce the amount of calculation, improve the calculation speed, and make the color more natural and uniform. The system is simple in operation, practical, easyto operate, easy to maintain, and the whole process does not need manual intervention.
Owner:长治学院

Parallax image splicing method based on multiple pairs of binocular cameras

The invention discloses a parallax image splicing method based on multiple pairs of binocular cameras, and belongs to the field of image processing and computer vision. The method comprises the following steps: firstly, solving a position relationship between binocular cameras by using a calibration algorithm, and solving a homography matrix between images by using prior information; transforminga camera coordinate system of the depth images by using the internal parameters and the external object parameters of a camera; calculating an overlapping region ROI of the images by using a homography matrix between the images, establishing an energy model, and solving by using a graph cut algorithm; the graph cut algorithm is high in time complexity and depends on the number of nodes of a graph,the image is layered, solved layer by layer and iterated, and a local optimal solution approximate to a global optimal solution is solved; and finally, performing image coordinate system transformation on the depth images by utilizing the homography matrix, and synthesizing splicing seams to realize seamless panoramic depth image splicing. Requirements on memory and hardware are low; the invention is simple in procedure and easy to implement, and reduces the image registration time.
Owner:DALIAN UNIV OF TECH

Digital biological organism modeling method based on three-dimensional super voxel description

The invention discloses a digital biological organism modeling method based on three-dimensional super voxel description. The method comprises the following steps of firstly, carrying out format conversion, binaryzation and other preprocessing on an original medical image of an organism so as to acquire a physiological-structure peripheral region to be segmented; secondly, reconstructing a two-dimensional image sequence of the physiological-structure peripheral region to be segmented to a three-dimensional space, and using a super voxel algorithm to divide a three-dimensional image into super voxels whose sizes are similar to each other; and then, through a graph-cut algorithm based on a Gaussian mixture model, automatically segmenting the super voxels into two portions of a foreground and a background; and finally, using a surface rendering method to reconstruct the super voxels which belong to a foreground type in the three-dimensional space so as to acquire three-dimensional display of a physiological structure area to be segmented and three-dimensional display of the area in the whole organism. By using the method of the invention, a negative effect of other portions of the organism on a segmentation result is reduced; time is saved; robustness of the algorithm is increased and computation complexity of graph cut is reduced; and segmentation accuracy is increased.
Owner:OCEAN UNIV OF CHINA

Method for optimizing radar weak target detection based on constant side length gradient weighting graph cut

InactiveCN103383451ATest result optimization and improvementWave based measurement systemsFrame basedVideo sequence
The invention discloses a method for optimizing radar weak target detection based on a constant side length gradient weighting graph cut algorithm. The method comprises the specific steps that first, short-term unrelated accumulation is conducted on a distance-Doppler sequence after coherent integration; then a target model and a clutter model are used for conducting global optimization target detection on a distance-Doppler video frame based on the constant side length gradient weighting graph cut algorithm under a mixed Gaussian framework, and a target video sequence is obtained; the video frame is judged to be the last frame or not, if yes, detection is completed, if no, a kalman predication method is used for conducting target feature detection on the target video sequence and following and completing target model updating, and a mixed Gaussian updating model algorithm is used for achieving updating of a background model; at last, a just captured next frame video information is read, and the above steps are repeated until all the captured video information is detected. The method for optimizing the radar weak target detection based on the constant side length gradient weighting graph cut algorithm optimizes and improves the detecting results relative to radar weak targets.
Owner:HANGZHOU DIANZI UNIV

Stereo matching algorithm based on color information and graph-cut theory

The invention provides a stereo matching algorithm based on color information and graph-cut theory, and relates to the field of computer vision. The method comprises the following steps: to begin with, under an RGB color space model, carrying out matching by combining template weight and an SAD algorithm and judging an SAD optimal matching point by utilizing color difference constraint conditions, thereby enabling SAD initial matching accuracy to be improved, suppressing noise and meanwhile, keeping scene detail information; carrying out occlusion detection by utilizing left-right consistency check criteria, thereby improving matching precision of an initial matching occlusion region; and meanwhile, for the problem of not high matching precision of initial matching textureless regions and parallax discontinuous regions, constructing an energy gird chart and an energy function through a graph-cut algorithm and carrying out global optimization to obtain a high-precision parallax result. The method improves the situations of not high precision of a local stereo matching algorithm and weak real-time performance of a global stereo matching algorithm, improves matching precision of special regions of the discontinuous regions and the like, and reduces algorithm matching time.
Owner:HUNAN VISION SPLEND PHOTOELECTRIC TECH

Method for segmenting images by aid of automatic weight selection

The invention discloses a method for segmenting images by the aid of automatic weight selection, and belongs to crossing fields of computer vision, computer graphics, image processing and the like. The method includes that partial foreground and background pixels are interactively specified via a user interface of an application program; color models of specified partial foreground and background are established, and a graph and a corresponding energy function are constructed; the energy function comprises color constraints, gradient constraints and weights for adjusting the color constraints and the gradient constraints, and each color constraint is defined at a corresponding node in the graph; the nodes of the graph can be pixels of an image or super-pixels formed after the original image is segmented; the validity of each color constraint and the validity of the corresponding gradient constraint is evaluated at the corresponding node of the graph, so that the weight of each node can be determined; the minimum value of the function is solved by a graph-cut algorithm, so that a segmentation result is obtained. The method has the advantages that the method for segmenting the images by the aid of automatic weight selection is implemented for the first time, and a segmentation effect of the method is excellent as compared with the traditional method implemented by the aid of fixed weights on the premise of identical interaction.
Owner:BEIJING UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products