CN102103652A - Space vector equation solving-based three-dimensional line of position calculation method - Google Patents
Space vector equation solving-based three-dimensional line of position calculation method Download PDFInfo
- Publication number
- CN102103652A CN102103652A CN2010101576424A CN201010157642A CN102103652A CN 102103652 A CN102103652 A CN 102103652A CN 2010101576424 A CN2010101576424 A CN 2010101576424A CN 201010157642 A CN201010157642 A CN 201010157642A CN 102103652 A CN102103652 A CN 102103652A
- Authority
- CN
- China
- Prior art keywords
- transect
- localizer
- point
- cos
- leftup
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Image Analysis (AREA)
Abstract
The invention relates to a space vector equation solving-based three-dimensional line of position calculation method, which is used for calculating lines of position of localizers and transects generated by tomography imaging equipment such as medical radiological imaging examination computed tomographic (CT) equipment, nuclear magnetic resonance examination equipment and the like. The method comprises the following steps of: reading corresponding TAG values by performing digital imaging and communication of medicine (DICOM) file resolution on x, y and z three-dimensional coordinates and three-dimensional angle direction values of planes of the localizer and the transect; judging whether the localizer and the transect can be calculated in a matching way or not according to an Image Type; calculating a plane normal vector equation parameter of a transect image to obtain a plane equation of the transect; calculating points of intersection between a plane Ax+By+Cz+D=0 of the transect image and side lines x-x1/l+y-y1/m+z-z1/n of the localizer respectively, wherein x1, y1 and z1 are the X, Y and Z coordinates of the upper left corner of the localizer respectively, and l, m and n are Cos direction values of direction values X, Y and Z of the first row of the localizer respectively; and if the plane of the transect image is judged to have two points of intersection with the four side lines of the localizer, calculating the points of intersection between a connecting line x-point[i].x]l=y-point[i].y/m=z-point[i].z/n=t of the points of intersection and the four side lines x-x2/A=y-y2/B=z-z2/C of the transect image as the coordinates of a starting point and an ending point of the line of position.
Description
Technical field
The present invention relates to a kind of three-dimensional localization line computation method, relate in particular at medical radioactive image check CT, the locating surface that tomoscan image documentation equipments such as nuclear-magnetism inspection are produced and the position line computing method in cross section based on the space vector equation solution.
Background technology
In medical radioactive image tomoscan checking process, can produce the DICOM form medical image of locating surface (Localizer) and a series of tangent plane (Transect) image at the patient position.
In the DICOM image format, can identify the direction of one group of scan-image by a series of TAG, coordinate position, pixel and physical size mapping ratio, pixel is wide, height, image type (locating surface or cross section etc.), these coordinates, the direction value is at the image locating surface, and the example on the tangent plane is respectively as Fig. 1, and is shown in Figure 2.
| The TAG label | The Tag title | The TAG implication | TAG value example |
| (0020，0032) | Image?Position?of Patient | The upper left corner X of specify image, Y, Z coordinate | -125.0\-132.0\3.5 |
| (0020，0037) | Image?Orientation | Specify image first row, the direction Cosine value of the relative patient's direction of first row | 1.0\0.0\0.0\0.0\1.0\0.0 |
| (0028，0030) | Pixel?Spacing | The engineer's scale mapping relations of the pairing physical size of pixel and image (millimeter) | 0.48828120.4882812 |
| (0028，0010) | Rows | The number of lines of pixels of image | 512 |
| (0028，0011) | Columns | The pixel columns of image | 512 |
| (0008，0008) | Image?Type | The type of image | Localizer，AXIAL |
Face the sequence multiple image that the CT computed tomography obtains, the CT scan image is read in the process of sheet the doctor, the doctor need know the exact position of understanding the inspection area correspondence of current observation image slices on locating surface, need find the solution the tangent plane picture location, then need to find the solution its space vector equation, calculate locating surface image and the mutual corresponding position of tangent plane picture, the position line that draws is with auxiliary doctor's diagnostic imaging.
Summary of the invention
The objective of the invention is to set up a kind of three-dimensional localization line computation method, calculate the method for DICOM tomoscan image three-dimensional position line based on the space vector equation solution.
A kind of three-dimensional localization line computation method based on the space vector equation solution comprises following treatment step:
The first step: resolve the DICOM file of input, read the numerical value of following TAG:
| The TAG label | The Tag title |
| (0020，0032) | Image?Position?of Patient |
| (0020，0037) | Image?Orientation |
| (0028，0030) | Pixel?Spacing |
| (0028，0010) | Rows |
| (0028，0011) | Columns |
| (0008，0008) | Image?Type |
And obtain the upper left corner X of current image, Y, Building Z mark by resolving Image Position Of Patient; Obtain current image first row, the direction Cosine value of the relative patient's direction of first row by resolving Image Orientation.
Second step: by judge Image Type judge current compute location face and cross section two DICOM images which be locating surface, which is the cross section, judges whether the mutual calculating of suitable locating surface.
The 3rd step: the plane equation that obtains tangent plane by the plane normal vector equation parameter of calculating the tangent plane image:
The 4th step: the plane Ax+By+Cz+D=0 that calculates tangent plane image place respectively and locating surface sideline x-x1/l=y-y1/m=z-z1/n (x1 wherein, y1, z1 are respectively the X in the locating surface upper left corner, Y, mark the Building Z; L, m, n are respectively the direction value X of locating surface first row, Y, the Cos direction value that Z is three) intersection point.
The 5th step:, then calculate intersection point line x-point[i if judge that the intersection point of the four edges of the plane at sectioning image place and spacer is 2] .x/l=y-point[i] .y/m=z-point[i] intersection point of four edges x-x2/A=y-y2/B=z-z2/C of .z/n=t and sectioning image determines the position line fragment position as the position line terminal.
Description of drawings
The present invention includes following accompanying drawing:
Fig. 1: locating surface x, y, z axle bed mark direction and locating surface upper left corner coordinate exemplary plot
Fig. 2: tangent plane x, y, z axle bed mark direction and locating surface upper left corner coordinate exemplary plot
Specific implementation method
Below in conjunction with accompanying drawing the present invention is described in further details.
The objective of the invention is to set up a kind of three-dimensional localization line computation method, calculate the method for DICOM tomoscan image three-dimensional position line based on the space vector equation solution.
A kind of three-dimensional localization line computation method based on the space vector equation solution comprises following treatment step:
The first step: resolve the DICOM file of input, read the numerical value of following TAG:
| The TAG label | The Tag title |
| (0020，0032) | Image?Position?of Patient |
| (0020，0037) | Image?Orientation |
| (0028，0030) | Pixel?Spacing |
| (0028，0010) | Rows |
| (0028，0011) | Columns |
| (0008，0008) | Image?Type |
And obtain the upper left corner X of current image, Y, Building Z mark by resolving Image Position Of Patient; Obtain current image first row, the direction Cosine value of the relative patient's direction of first row by resolving ImageOrientation.
Second step: by judge Image Type judge current compute location face and cross section two DICOM images which be locating surface, which is the cross section, judges whether the mutual calculating of suitable locating surface.
The 3rd step: the plane normal vector equation parameter of calculating the tangent plane image by the following method:
A＝Transect.RowDirection.Cos(Y)*Transect.ColumnDirection.Cos(Z)
-Transect.RowDirection.Cos(Z)*Transect.ColumnDirection.Cos(Y)
B＝Transect.RowDirection.Cos(Z)*Transect.ColumnDirection.Cos(X)
-Transect.RowDirection.Cos(X)*Transect.ColumnDirection.Cos(Z)
B＝Transect.RowDirection.Cos(X)*Transect.ColumnDirection.Cos(Y)
-Transect.RowDirection.Cos(Y)*Transect.ColumnDirection.Cos(Y)
D＝-1*(A*Transect.Leftup.X+B*Transect.Leftup.Y+C*Transect.Leftup.Z)
The 4th step: the plane Ax+By+Cz+D=0 that calculates tangent plane image place respectively and locating surface sideline x-x1/l=y-y1/m=z-z1/n (x1 wherein, y1, z1 are respectively the X in the locating surface upper left corner, Y, mark the Building Z; L, m, n are respectively the direction value X of locating surface first row, Y, the Cos direction value that Z is three) intersection point.
Plane space intersection point progressively computing method is as follows:
Calculate the 1st limit:
a＝(A*l+B*m+C*n)*Localizer.PixelSpace.Y
b＝A*x1+B*y1+C*z1+D
If judge a=0, b!=0 illustrates straight line and plane parallel, does not have intersection point,
The calculating that enters next bar limit is judged;
If perhaps a=0, b=0 then illustrates straight line in the plane, does not also have intersection point,
The calculating that enters next bar limit is judged;
So only under the condition of a＞0, carry out next step calculating again.
Calculate: t1=b/a
Judge the value of t1, should be greater than 0 pixel columns Localizer.Columns less than locating surface,
Otherwise restoring to normal position line computation failure;
The value of being calculated as follows (wherein i represents that current is the crossing calculating on which bar limit of tangent plane):
point[i][0]＝x1+l*k*t1；
point[i][1]＝y1+m*k*t1；
point[i][2]＝z1+n*k*t1；
point[i][0]＝0；
point[i][1]＝t1；
Calculate the 2nd, 3 according to as above similarity method successively then, the intersecting of 4 tangent plane limits;
The 2nd, 3, in the crossing calculating on 4 tangent plane limits, computing method are removed a, the computing method of b value and as above article one limit slightly different following outside, all the other computing method are all identical:
Article 2, limit:
x1＝Localizer.Leftup.X+
Localizer.Row*Localizer.PixelSpace.X*Localizer.RowDirection.Cos(X)；
y1＝Localizer.Leftup.Y+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Y)；
z1＝Localizer.Leftup.Z+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Z)；
b＝A*x1+B*y1+C*z1+D；
Article 3, limit:
x1＝Localizer.Leftup.X；
y1＝Localizer.Leftup.Y；
z1＝Localizer.Leftup.Z；
k＝Localizer.Leftup.PixelSpace.X；
l＝Localizer.ColumnDirection.Cos(X)；
m＝Localizer.ColumnDirection.Cos(Y)；
n＝Localizer.ColumnDirection.Cos(Z)；
a＝(A*l+B*m+C*n)*k；
b＝A*x1+B*y1+C*z1+D；
Article 4, limit:
x1＝Localizer.Leftup.X+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(X)
y1＝Localizer.Leftup.Y+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Y)
z1＝Localizer.Leftup.Z+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Z)
b＝A*x1+B*y1+C*z1+D
The 5th step:, then calculate intersection point line x-point[i if judge that the intersection point of the four edges of the plane at sectioning image place and spacer is 2] .x/l=y-point[i] .y/m=z-point[i] intersection point of four edges x-x2/A=y-y2/B=z-z2/C of .z/n=t and sectioning image determines the position line fragment position as the position line terminal.
Computing method are as follows:
l＝point[1][0]-point[0][0]；
m＝point[1][1]-point[0][1]；
n＝point[1][2]-point[0][2]；
a＝l*Transect.RowDirection.Cos[X]
+m*Transect.RowDirection.Cos[Y]
+n*Transect.RowDirection.Cos[Z]
b＝l*Transect.ColumnDirection.Cos[X]
+m*Transect.ColumnDirection.Cos[Y]
+n*Transect.ColumnDirection.Cos[Z]
Then by (a*a＜b*b) relatively judges which two parallel edges and point[1 of tangent plane picture], point[2] intersect;
If (a*a＜b*b) then explanation is tangent plane horizontal direction limit intersects then calculating with locating surface:
k＝Transect.Rows*Transect.PixelSpace.Y
x2＝Transect.Leftup.X+k*Transect.ColumnDirection[X]
y2＝Transect.Leftup.Y+k*Transect.ColumnDirection[Y]
z2＝Transect.Leftup.Z+k*Transect.ColumnDirection[Z]
If (a*a＞b*b) then explanation is tangent plane horizontal direction limit intersects then calculating with locating surface:
x2＝Transect.Leftup.X+k*Transect.RowDirection.Cos(X)
y2＝Transect.Leftup.Y+k*Transect.RowDirection.Cos(Y)
z2＝Transect.Leftup.Z+k*Transect.RowDirection.Cos(Z)
Calculate then:
t1＝((x1-point[0][0])*B+(point[0][1]-y1)*A)/a；
t2＝((x2-point[0][0])*B+(point[0][1]-y2)*A)/a；
Judge t1 then, the t2 two-value all between 0～1, is then calculated:
pointLine[0][0]＝point[0][0]*(1-t1)+point[1][0]*t1
pointLine[0][1]＝point[0][1]*(1-t1)+point[1][1]*t1
pointLine[1][0]＝point[0][0]*(1-t2)+point[1][0]*t2
pointLine[1][1]＝point[0][1]*(1-t2)+point[1][1]*t2
PointLine[0 wherein] [], pointLine[1] [] be respectively two end points of position line that locating surface and two faces of tangent plane intersect two coordinates on plane separately.
Claims (7)
1. three-dimensional localization line computation method based on the space vector equation solution by finding the solution its crossing position line of space vector Equation for Calculating, is characterized in that comprising following treatment step at locating surface (Localizer) and tangent plane (Transect):
(1) reads the x of locating surface and tangent plane, y, z axle three-dimensional coordinate and three-dimensional perspective direction value;
(2) judge locating surface (Localizer) and tangent plane (Transect);
(3) calculate tangent plane place plane equation parameter;
(4) intersection point in calculating tangent plane plane and locating surface sideline;
(5) intersection point in calculating intersection point line and tangent plane sideline calculates the position of three-dimensional localization line.
2. a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 1 is characterized in that the described plane normal vector equation parameter that tangent plane place plane equation parameter is calculated the tangent plane image by the following method that calculates:
A＝Transect.RowDirection.Cos(Y)*Transect.ColumnDirection.Cos(Z)
-Transect.RowDirection.Cos(Z)*Transect.ColumnDirection.Cos(Y)
B＝Transect.RowDirection.Cos(Z)*Transect.ColumnDirection.Cos(X)
-Transect.RowDirection.Cos(X)*Transect.ColumnDirection.Cos(Z)
B＝Transect.RowDirection.Cos(X)*Transect.ColumnDirection.Cos(Y)
-Transect.RowDirection.Cos(Y)*Transect.ColumnDirection.Cos(Y)
D＝-1*(A*Transect.Leftup.X+B*Transect.Leftup.Y+C*Transect.Leftup.Z)。
3. a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 1 is characterized in that the intersection point in described calculating tangent plane plane and locating surface sideline, and the computing method on every limit of four edges of tangent plane and locating surface are as follows:
Article 1, limit:
a＝(A*l+B*m+C*n)*Localizer.PixelSpace.Y
b＝A*x1+B*y1+C*z1+D
Article 2, limit:
x1＝Localizer.Leftup.X+
Localizer.Row*Localizer.PixelSpace.X*Localizer.RowDirection.Cos(X)；
y1＝Localizer.Leftup.Y+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Y)；
z1＝Localizer.Leftup.Z+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Z)；
b＝A*x1+B*y1+C*z1+D；
Article 3, limit:
x1＝Localizer.Leftup.X；
y1＝Localizer.Leftup.Y；
z1＝Localizer.Leftup.Z；
k＝Localizer.Leftup.PixelSpace.X；
l＝Localizer.ColumnDirection.Cos(X)；
m＝Localizer.ColumnDirection.Cos(Y)；
n＝Localizer.ColumnDirection.Cos(Z)；
a＝(A*l+B*m+C*n)*k；
b＝A*x1+B*y1+C*z1+D；
Article 4, limit:
x1＝Localizer.Leftup.X+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(X)
y1＝Localizer.Leftup.Y+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Y)
z1＝Localizer.Leftup.Z+
Localizer.Columns*Localizer.PixelSpace.Y*Localizer.RowDirection.Cos(Z)
b＝A*x1+B*y1+C*z1+D。
4. a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 3 is characterized in that the intersection point in described calculating tangent plane plane and locating surface sideline, and is as follows at the public crossing computing method in every sideline of tangent plane and locating surface:
point[i][0]＝x1+1*k*t1；
point[i][1]＝y1+m*k*t1；
point[i][2]＝z1+n*k*t1；
point[i][0]＝0；
point[i][1]＝t1。
5. it is as follows that a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 1, the intersection point that it is characterized in that described calculating intersection point line and tangent plane sideline calculate the location method of three-dimensional localization line:
l＝point[1][0]-point[0][0]；
m＝point[1][1]-point[0][1]；
n＝point[1][2]-point[0][2]；
a＝l*Transect.RowDirection.Cos[X]
+m*Transect.RowDirection.Cos[Y]
+n*Transect.RowDirection.Cos[Z]
b＝l*Transect.ColumnDirection.Cos[X]
+m*Transect.ColumnDirection.Cos[Y]
+n*Transect.ColumnDirection.Cos[Z]
Then by (a*a＜b*b) relatively judges which two parallel edges and point[1 of tangent plane picture], point[2] intersect; If (if a*a＜b*b) then explanation is tangent plane horizontal direction limit intersects with locating surface is (a*a＞b*b) then explanation is that tangent plane horizontal direction limit and locating surface are crossing.
6. a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 5 is characterized in that the intersection point in described calculating intersection point line and tangent plane sideline calculates the location method of three-dimensional localization line:
If (a*a＜b*b) then explanation is tangent plane horizontal direction limit intersects then calculating with locating surface:
k＝Transect.Rows*Transect.PixelSpace.Y
x2＝Transect.Leftup.X+k*Transect.ColumnDirection[X]
y2＝Transect.Leftup.Y+k*Transect.ColumnDirection[Y]
z2＝Transect.Leftup.Z+k*Transect.ColumnDirection[Z]
If (a*a＞b*b) then explanation is tangent plane horizontal direction limit intersects then calculating with locating surface:
x2＝Transect.Leftup.X+k*Transect.RowDirection.Cos(X)
y2＝Transect.Leftup.Y+k*Transect.RowDirection.Cos(Y)
z2＝Transect.Leftup.Z+k*Transect.RowDirection.Cos(Z)。
7. it is as follows that a kind of three-dimensional localization line computation method based on the space vector equation solution according to claim 5, the intersection point that it is characterized in that described calculating intersection point line and tangent plane sideline calculate the location method of three-dimensional localization line:
t1＝((x1-point[0][0])*B+(point[0][1]-y1)*A)/a；
t2＝((x2-point[0][0])*B+(point[0][1]-y2)*A)/a；
Judge t1 then, the t2 two-value all between 0～1, is then calculated:
pointLine[0][0]＝point[0][0]*(1-t1)+point[1][0]*t1
pointLine[0][1]＝point[0][1]*(1-t1)+point[1][1]*t1
pointLine[1][0]＝point[0][0]*(1-t2)+point[1][0]*t2
pointLine[1][1]＝point[0][1]*(1-t2)+point[1][1]*t2
PointLine[0 wherein] [], pointLine[1] [] be respectively two end points of position line that locating surface and two faces of tangent plane intersect two coordinates on plane separately.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101576424A CN102103652A (en) | 2010-04-28 | 2010-04-28 | Space vector equation solving-based three-dimensional line of position calculation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101576424A CN102103652A (en) | 2010-04-28 | 2010-04-28 | Space vector equation solving-based three-dimensional line of position calculation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102103652A true CN102103652A (en) | 2011-06-22 |
Family
ID=44156422
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101576424A Pending CN102103652A (en) | 2010-04-28 | 2010-04-28 | Space vector equation solving-based three-dimensional line of position calculation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102103652A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108766536A (en) * | 2018-05-28 | 2018-11-06 | 沈阳东软医疗系统有限公司 | Position line rendering, display methods and device, equipment and storage medium |
| CN110807755A (en) * | 2018-08-01 | 2020-02-18 | 通用电气公司 | Plane selection using localizer images |
| CN114334094A (en) * | 2021-12-27 | 2022-04-12 | 王兆河 | Novel three-dimensional model constructed through single medical image and rendering method |
| CN117116433A (en) * | 2023-10-24 | 2023-11-24 | 万里云医疗信息科技（北京）有限公司 | Labeling method and device for CT (computed tomography) slice images and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101021912A (en) * | 2006-02-13 | 2007-08-22 | 中山市人民医院 | Hospital information system |
| CN101266609A (en) * | 2008-04-30 | 2008-09-17 | 中山爱科数字科技有限公司 | Method for accomplishing medical data external inquiry for digital remote medical treatment |
-
2010
- 2010-04-28 CN CN2010101576424A patent/CN102103652A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101021912A (en) * | 2006-02-13 | 2007-08-22 | 中山市人民医院 | Hospital information system |
| CN101266609A (en) * | 2008-04-30 | 2008-09-17 | 中山爱科数字科技有限公司 | Method for accomplishing medical data external inquiry for digital remote medical treatment |
Non-Patent Citations (3)
| Title |
|---|
| 周军: "CT图像序列中定位线的绘制", 《科技信息》, no. 24, 31 December 2007 (2007-12-31) * |
| 孙曦: "计算机辅助手术系统及其关键技术的研究", 《南京航空航天大学 学位论文》, 31 December 2007 (2007-12-31) * |
| 王光飞等: "对DICOM 3.0标准下软件工程的研究", 《中国医学装备》, vol. 2, no. 7, 31 July 2005 (2005-07-31) * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108766536A (en) * | 2018-05-28 | 2018-11-06 | 沈阳东软医疗系统有限公司 | Position line rendering, display methods and device, equipment and storage medium |
| CN110807755A (en) * | 2018-08-01 | 2020-02-18 | 通用电气公司 | Plane selection using localizer images |
| CN110807755B (en) * | 2018-08-01 | 2023-11-07 | 通用电气公司 | Plane selection using locator images |
| CN114334094A (en) * | 2021-12-27 | 2022-04-12 | 王兆河 | Novel three-dimensional model constructed through single medical image and rendering method |
| CN117116433A (en) * | 2023-10-24 | 2023-11-24 | 万里云医疗信息科技（北京）有限公司 | Labeling method and device for CT (computed tomography) slice images and storage medium |
| CN117116433B (en) * | 2023-10-24 | 2024-02-09 | 万里云医疗信息科技（北京）有限公司 | Labeling method and device for CT (computed tomography) slice images and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9129362B2 (en) | Semantic navigation and lesion mapping from digital breast tomosynthesis | |
| US9218687B2 (en) | Display of medical device position information in a volumetric rendering | |
| CN101126725B (en) | Method for realizing image reconstruction by adopting X ray dimension photograph | |
| US10134125B2 (en) | Systems and methods for ultrasound imaging | |
| US9035941B2 (en) | Image processing apparatus and image processing method | |
| CN101133431B (en) | Method for registering biomedical images with reduced imaging artifacts caused by object movement | |
| Varnavas et al. | Fully automated 2D–3D registration and verification | |
| US20110262015A1 (en) | Image processing apparatus, image processing method, and storage medium | |
| Chiang et al. | Development of a stereo vision measurement system for a 3D three-axial pneumatic parallel mechanism robot arm | |
| EP2620911A1 (en) | Image processing apparatus, imaging system, and image processing method | |
| CN101855649A (en) | Automatically proofread and correct the method for the misorientation of medical image | |
| EP2624759A1 (en) | Apparatus and method for mapping a three-dimensional space in medical applications for diagnostic, surgical or interventional medicine purposes | |
| CN102727258A (en) | Image processing apparatus, ultrasonic photographing system, and image processing method | |
| CN102842141A (en) | Rotary X-ray contrastographic picture iteration reconstruction method | |
| Zhang et al. | 3-D reconstruction of the spine from biplanar radiographs based on contour matching using the hough transform | |
| CN103106653A (en) | Method and device for visualizing the registration quality of medical image datasets | |
| CN106846492B (en) | Processing method and system of a kind of medical image under VR environment | |
| CN102103652A (en) | Space vector equation solving-based three-dimensional line of position calculation method | |
| CN105339983A (en) | Linking breast lesion locations across imaging studies | |
| CN101315700A (en) | Fast automatic positioning method for multi-sequence image | |
| Wang et al. | Coarse-to-fine dot array marker detection with accurate edge localization for stereo visual tracking | |
| CN101958006B (en) | X-ray image-based three-dimensional object imaging method | |
| Banerjee et al. | Point landmarks for registration of CT and MR images | |
| CN116703882A (en) | Non-contact type heart three-dimensional mapping method and system | |
| CN103745467B (en) | A kind of three-dimensional image registration method based on digital volume correlation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| DD01 | Delivery of document by public notice |
Addressee: Changsha Bowei Software Technology Co., Ltd. Tan Xuan Document name: the First Notification of an Office Action |
|
| DD01 | Delivery of document by public notice |
Addressee: Changsha Bowei Software Technology Co., Ltd. Document name: Notification that Application Deemed to be Withdrawn |
|
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110622 |