CN108182266A - A kind of method that crystal number is determined using look-up table based on FPGA - Google Patents
A kind of method that crystal number is determined using look-up table based on FPGA Download PDFInfo
- Publication number
- CN108182266A CN108182266A CN201810024672.4A CN201810024672A CN108182266A CN 108182266 A CN108182266 A CN 108182266A CN 201810024672 A CN201810024672 A CN 201810024672A CN 108182266 A CN108182266 A CN 108182266A
- Authority
- CN
- China
- Prior art keywords
- crystal
- look
- address
- dimensional
- crystal number
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Abstract
Present disclose provides a kind of methods that crystal number is determined using look-up table based on FPGA, are two dimensional crystal number look-up table by one-dimensional crystal number look-up table conversion；Perform generation step：Two dimensional crystal number look-up table is split into the plane covered using crystal array both direction (x, y) coordinate value as the border searching table of address；It performs and uses step：One-dimensional number is further converted to according to the location information calculated by detector output signal, the two dimensional crystal number for middle crystal of launching an attack using border searching table search during lookup.
Description
Technical field
This disclosure relates to PET medical imaging fields more particularly to a kind of utilization look-up table based on FPGA determine that crystal is compiled
Number method.
Background technology
Positron emission computerized tomography imaging (Positron Emission Tomography, PET) is a kind of non-intruding
The medical imaging technology of property.It can be to feelings such as metaboilic level, biochemical reaction, the functional activities of various organs in animal or human body
Condition carries out noninvasive, quantitative, dynamic assessment, and has unique application value in the prevention and treatment of major disease.It is
One of nuclear medicine diagnostic and investigative technique of current highest level.PET imaging basic process approximately as：It is injected into biology
Substance necessary to detected part metabolism with the radioisotope labeling compared with short-half-life, which can be whithin a period of time
To the enrichment of detection position.Radionuclide decay generates positive electron.Positive electron is after the free path of millimeter magnitude, with biology
Stop normal electronics in vivo to bury in oblivion, generate two 511keV gammaphotons reversely to fly.Then, gammaphoton is by vitro
Portion is into the detector array capture of the annular of 360 degree of placements, and pet detector is to this two gamma rays progress coincidence measurements, warp
It crosses image reconstruction and obtains probe portion bit image.Each detector is mainly made of SiPM detectors and LYSO crystal two-dimensional arrays,
The signal of detector is read by two-sided resistor network, each resistor network output A, B, C, tetra- signals of D, each
Block exports eight road signals (A1, B1, C1, D1, A2, B2, C2, D2) altogether, as shown in Figure 1.
The position that operation can obtain photon and hit detector is carried out with gravity model appoach to eight road signals, with x, y two-dimensional coordinate
In addition DOI hits depth representing.And it requires in the data that output represents location information, to need to correspond to x, y-coordinate value and hit
Crystal, output hits the number of crystal.
Crystal number look-up table covers two dimensional crystal array surface, stores position coordinates (x, y) and crystalline substance on this surface
The correspondence of body number.The storage form that traditional crystal ID look-up tables generally use is：One memory space of exampleization is used as
Look-up table stores, and for look-up table using the both direction coordinate value of pixel as address, the content of each address storage is respective pixel
The crystal number of crystal where point.It is numbered when look-up table uses using coordinate as the crystal stored under the address search address.It crosses
Journey is as shown in Figure 2.
The look-up table occupancy storage resource of this form is larger, because in a panel region (such as No. 3 shown in Fig. 2
In the corresponding region of crystal), the crystal number stored under the corresponding address of pixel is identical, this causes to deposit in look-up table
The redundancy of a large amount of repetitions is stored up.Assuming that the quantified precision of location information x, y are 8bit, then store such tradition and search
Table needs the memory space that address size is 16bit.Assuming that crystal array is the specification of 23*23 (needing 10bit to store), then
2 are needed altogether16The space of × 10bit ≈ 0.6Mb.And in actual design, in addition to crystal ID look-up tables, energy correction, time repair
Just and online flood map and power spectrum count etc. be also required to corresponding memory space store a large amount of correction factor or
Person's statistical result.The method generally used be outside FPGA pieces attached lacing film external memory (such as EEPROM or FLASH) to look-up table
It is stored, when powering on, fpga logic can read in example inside FPGA there will be each look-up table among chip external memory
RAM, then carry out data processing.FPGA have powerful data processing function, but internal RAM resource be it is limited (such as
The Artix-7 Series FPGA chip Block RAM resources of Xilinx companies are about 13Mb), if the storage money that look-up table occupies
Source is excessive, is difficult to integrate more On-line funchon, such as also need largely to occupy using the FPGA of the limited model of storage resource
The online power spectrum statistics and Flood statistical functions of storage resource, it is also difficult to realize multiple crystal array outputs using one piece
The high integration operating mode of FPGA processing.
Invention content
(1) technical problems to be solved
The disclosure aims to overcome that disadvantages mentioned above of the existing technology, provides a kind of utilizing based on FPGA and searches
The method that table determines crystal number, and then crystal number look-up table is realized with smaller memory space and relatively simple logic
Storage and use, and be the logical design of other functions and signal processing the setting in same FPGA of integrated multiple crystal
The reserved resource of meter.
(2) technical solution
Present disclose provides a kind of method that crystal number is determined using look-up table based on FPGA, this method includes：It will
One-dimensional crystal number look-up table conversion is two dimensional crystal number look-up table；Generation step：Two dimensional crystal number look-up table is split
Into the border searching table using both direction coordinate value as address；Use step：Go out two dimensional crystal using border searching table search to compile
Number, then one-dimensional crystal number is converted to by two dimensional crystal number.
It is described to search one-dimensional crystal number look-up table conversion for two dimensional crystal number in some embodiments of the present disclosure
Table includes：The one-dimensional crystal number of one-dimensional crystal number look-up table is converted into two dimensional crystal number, so as to obtain two dimensional crystal
Number look-up table.
In some embodiments of the present disclosure, the generation step includes：By second party in two dimensional crystal number look-up table
Identical crystal is numbered to crystal to merge, forms k strip crystalline region, and k is the crystal number in each direction；Along
It is 2 that two dimensional crystal number look-up table is evenly dividing by one directionnA slice crystalline region is shared in each slice crystalline region
(k-1) a boundary, n are the quantified precision of two-dimensional position coordinate；The border searching table that first direction coordinate value is address is extracted,
The border searching table stores (k-1) a boundary value using the first direction coordinate value of pixel as address under each address.
In some embodiments of the present disclosure, the generation step further includes：It will be first in two dimensional crystal number look-up table
Direction crystal is numbered identical crystal and is merged, and forms k strip crystalline region；Two dimensional crystal is numbered in a second direction
It is 2 that look-up table, which is evenly dividing,nA slice crystalline region shares (k-1) a boundary in each slice crystalline region；Extract second
Direction coordinate value is the border searching table of address, and the border searching table is using the second direction coordinate value of pixel as address, each
(k-1) a boundary value is stored under address.
It is described to be included using step in some embodiments of the present disclosure：It is found out respectively using two border searching tables
First direction and second direction crystal number, then corresponding one-dimensional crystal is found out by first direction and second direction crystal number and is compiled
Number.
In some embodiments of the present disclosure, the utilization border searching table search goes out second direction crystal number and includes：
First direction coordinate value is recalled as ground according to by the first direction coordinate value for hitting pixel that detector output signal calculates
The boundary group stored under the corresponding address of border searching table of location, common (k-1) a boundary；By the second direction coordinate of the pixel
The value lower boundary value stored corresponding with the address is compared respectively, according to the section that second direction coordinate value is fallen into, obtains the
The crystal number in two directions.
In some embodiments of the present disclosure, the utilization border searching table search goes out first direction crystal number and includes：
Second direction coordinate value is recalled as ground according to by the second direction coordinate value for hitting pixel that detector output signal calculates
The boundary group stored under the corresponding address of border searching table of location, common (k-1) a boundary；By the first direction coordinate of the pixel
The value lower boundary value stored corresponding with the address is compared respectively, according to the section that first direction coordinate value is fallen into, obtains the
The crystal number in one direction.
In some embodiments of the present disclosure, it is described by first direction and second direction crystal number find out it is corresponding one-dimensional
Crystal number includes：According to one-dimensional crystal number with two dimensional crystal number correspondence, by first direction crystal number and
The crystal of second direction numbers to obtain one-dimensional crystal number.
It is described to go out second direction crystal number using border searching table search and utilize in some embodiments of the present disclosure
Border searching table search goes out the step of first direction crystal number and performs parallel.
(3) advantageous effect
It can be seen from the above technical proposal that the disclosure has the advantages that：
The disclosure is numbered using border searching table search crystal, and the memory space occupied has larger compared with traditional look-up table
Compression, the sequential of search procedure saves the storage resource of FPGA, and will not increase and look into compared with traditional look-up table and indifference
Look for the time.
Description of the drawings
Fig. 1 is the structure diagram of single detector；
Fig. 2 is the schematic diagram of one-dimensional crystal number look-up table；
Fig. 3 is the generating process schematic diagram of the border searching table of the embodiment of the present disclosure, wherein, (a) is numbered for one-dimensional crystal
Look-up table, (b) are two dimensional crystal number look-up table, and (c) is that a (first) direction crystal numbers the lookup after identical crystal merges
Table, (d) are that b (second) direction crystal numbers the look-up table after identical crystal merges, and (e) is the border searching that x values are address
Table, (f) are the border searching table that y values are address；
Fig. 4 is the process schematic of the determining b directions crystal number of the embodiment of the present disclosure；
Fig. 5 is the process schematic of the determining a directions crystal number of the embodiment of the present disclosure.
Specific embodiment
Purpose, technical scheme and advantage to make the disclosure are more clearly understood, below in conjunction with specific embodiment, and reference
The disclosure is further described in attached drawing.It should be noted that in attached drawing or specification description, similar or identical portion
Divide and all use identical figure number.The realization method for not being painted or describing in attached drawing is those of ordinary skill in technical field
Known mode.In addition, though the demonstration of the parameter comprising particular value can be provided herein, it is to be understood that parameter is without definite
Equal to corresponding value, but can be similar to be worth accordingly in acceptable error margin or design constraint.
The embodiment of the present disclosure provides a kind of side that lookup table search crystal number is numbered using PET crystal based on FPGA
Method, this method include generation PET crystal number (ID) look-up table and using PET crystal number (ID) look-up table two parts, technologies
Key be by conventional two-dimensional crystal number look-up table conversion for both direction one-dimensional border searching table store, and search when
Both direction carries out obtaining crystal number respectively.
The method of the present embodiment specifically includes following steps：
Step S101：It is two dimensional crystal ID look-up tables by one-dimensional crystal ID look-up table conversions.
Crystal ID look-up tables cover two dimensional crystal array surface, store the position coordinates in the two dimensional crystal array surface
The correspondence of (x, y) and crystal ID.In one-dimensional crystal ID look-up tables, crystal ID is one-dimensional number, which numbers
Look-up table uses traditional one-dimensional crystal number look-up table, as shown in Figure 2.In the disclosure, one-dimensional crystal number look-up table is not
It needs to be stored in inside FPGA.
(a) in this step, the one-dimensional crystal ID of one-dimensional crystal ID look-up tables is turned with shown in (b) in Fig. 3 in Fig. 3
Two dimensional crystal ID is changed to, so as to obtain two dimensional crystal ID look-up tables.For two dimensional crystal array, (a, b in a, b both direction
Direction is identical with x, y direction in two-dimensional position coordinate respectively, this is defined herein as a, b both direction, is in order to defining before
X, y-coordinate direction is distinguish to avoid causing and obscure), the crystal number in each direction is k, then one-dimensional crystal ID look-up tables
One-dimensional crystal ID is respectively 1,2 ..., (k-1) * (k-1), k*k, after being converted to two dimensional crystal ID look-up tables, ID points of two dimensional crystal
Not Wei (1,1), (2,1) ..., (k, 1)；(1,2), (2,2) ..., (k, 2)；…；(1, k), (2, k) ..., (k, k).
Step S201：Generation step：It is in different directions the boundary of address that two dimensional crystal ID look-up tables are split into two
Look-up table.
As shown in figure 3, the border searching table for how generating that x values are address is introduced first.This step passes through to two dimensional crystal
ID look-up tables are merged and are divided, so as to extract the border searching table that x values are address.
In Fig. 3 shown in (c), the identical crystal of two dimensional crystal ID look-up table b direction crystal ID is merged first, shape
Into k strip crystalline region, strip crystalline region extends along a directions.
Then two dimensional crystal ID look-up tables are divided into multiple slice crystalline regions, each slice along a directions (i.e. x directions)
Crystalline region is along b to (i.e. y to) extension, when the quantified precision of two-dimensional position coordinate (x, y) is n bit, slice crystalline region
Quantity is 2n.The width of each slice crystalline region is the width of one pixel in a directions, is shared in each slice crystalline region
(k-1) a boundary.
In Fig. 3 shown in (e), the border searching table that x values are address is finally extracted, the border searching table is with pixel
X coordinate is address, and (k-1) a boundary value is stored under each address.Each boundary value be exactly b directions crystal ID change pair
The y-coordinate value for the pixel answered.
It can be seen that this x value shares 2 for the border searching table one of addressnA address has corresponded to pixel x coordinate value
Range, store (k-1) a boundary value under each address.
Similar for the border searching table of address with generation x values, this step is by merging two dimensional crystal ID look-up tables
And division, so as to extract the border searching table that y values are address.Specifically,
In Fig. 3 shown in (d), the identical crystal of two dimensional crystal ID look-up table a direction crystal ID is merged first, shape
Into k strip crystalline region, strip crystalline region extends along b directions.
Then two dimensional crystal ID look-up tables are divided into multiple slice crystalline regions, each slice along b directions (i.e. y directions)
Crystalline region is along a to (i.e. x to) extension, when the quantified precision of two-dimensional position coordinate (x, y) is n bit, slice crystalline region
Quantity is 2n.The width of each slice crystalline region is the width of one pixel in b directions, is shared in each slice crystalline region
(k-1) a boundary.
In Fig. 3 shown in (f), the border searching table that y values are address is finally extracted, the border searching table is with pixel
Y-coordinate is address, and (k-1) a boundary value is stored under each address.Each boundary value be exactly a directions crystal ID change pair
The x coordinate value for the pixel answered.
It can be seen that this y value shares 2 for the border searching table one of addressnA address has corresponded to pixel y-coordinate value
Range, store (k-1) a boundary value under each address.
Step S301：Use step：Go out one-dimensional crystal ID using border searching table search.
This step finds out a directions and b directions crystal ID respectively using two border searching tables, then by a directions and b directions
Crystal ID finds out corresponding one-dimensional crystal ID.
Determining for b directions crystal ID is introduced first.First pixel is hit according to by what detector output signal calculated
X coordinate value recall the boundary group that stores under the corresponding address of border searching table that x values are address and be total to (k-1) a boundary.Then
The y-coordinate value of the pixel is compared respectively with the boundary value stored under the address, the section fallen into according to y-coordinate value,
It can be obtained by the crystal ID in b directions.
Determining for a directions crystal ID is determining similar with b directions crystal ID.Basis is calculated by detector output signal first
The y-coordinate value for hitting pixel gone out recalls the boundary group stored under the corresponding address of border searching table that y values are address and is total to (k-
1) a boundary.Then the x coordinate value of the pixel is compared respectively with the boundary value stored under the address, according to x coordinate
The section that value is fallen into, it is possible to obtain the crystal ID in a directions.
The determination process with b directions crystal ID that determines of a directions crystal ID performs parallel in FPGA.
The correspondence of one-dimensional crystal ID and two dimensional crystal ID can be obtained in step S101, according to the correspondence, by a side
To the crystal ID in crystal ID and b directions obtain one-dimensional crystal ID.
The method for searching table search crystal number of being numbered using PET crystal of the disclosure has significant advantageous effect.It is false
If the quantified precision of two-dimensional position coordinate (x, y) is n bit, two dimensional crystal array is k per side crystal number.
For traditional look-up table, 2 are needed altogether2nAddress space, the data length stored under each address are：
[log2k2]+1=[2log2k]+1
2 are then needed altogether2n×([2log2K]+1) bit memory spaces.
For the border searching table of the disclosure, one of dimension needs 2nAddress space stores (k-1) under each address
A binary system precision is the boundary of n bit, then the data length stored under each address is (k-1) × n bit, then needs altogether
2n(k-1) × n bit memory spaces, then two dimensions need altogether 2n+1(k-1) × n bit memory spaces.
Two formulas are made into ratio：
The distribution situation of crystal in entire plane is described due under actual conditions, needing (x, y) with pixelation, so
General 2n＞ ＞ k, such as k=23 in above-described embodiment, 2n=256, bringing formula above into can obtain：
It can be seen that the memory space that the border searching table of the disclosure occupies has larger compression compared with traditional look-up table.If it protects
It is constant to hold crystal number, then：
For higher positioning accuracy, in the case of further promoting quantified precision n, the border searching table of the disclosure it is excellent
Gesture will be more significant.
In terms of search procedure sequential, traditional look-up table needs a clock cycle one search cycle, a clock week
Addressing is found the information stored in RAM and then is exported in phase.The look-up table of the disclosure equally only needs a cycle to be used for addressing,
The process compared may be used combinational logic, and the lookup of both direction and compares and can be carried out at the same time.So two in sequential
The use of kind look-up table and indifference.
The search procedure and advantageous effect of the disclosure are further illustrated with an example below.
The first step is that one-dimensional crystal number is converted into two dimensional crystal number.
In this example, two dimensional crystal array size is 23*23, and original one-dimensional crystal number is：1、2、3、4、…、
529, the two dimensional crystal after converting, which is numbered, is：(1,1), (2,1), (3,1) ..., (23,1), (1,2), (2,2), (3,
2) ..., (23,2) ..., (1,23), (2,23), (3,23) ..., (23,23).
Second step is to split into the border searching table that x values are address and y values are address.
For the border searching table that x values are address, which is that a directions crystal is numbered identical crystal to merge
Together, foring multiple strip crystalline regions.Assuming that quantified precision is 8bit when x directions position calculates.From x (or
Say a) direction, which shares 256 vertical slice crystalline regions, and the width of each slice crystalline region is one
The pixel in x directions.22 boundaries are shared in each slice crystalline region, corresponding each boundary is exactly that b directions crystal is compiled
The y values of number that changed pixel.In Fig. 3 (c), such as x=1 that row, in Fig. 3 in grid chart shown in (c)
First row grid, it can be seen that count from top to bottom, boundary 1 is between the 6th lattice and the 7th lattice, and boundary 2 is in the 12nd lattice and the 13rd
Between lattice, boundary 3 is between the 19th lattice in the 18th lattice ....Therefore the boundary value of first row is (6,12,18 ...).To sum up institute
It states, in Fig. 3 (e), which shares 256 addresses for the border searching table one of address, has corresponded to the range of x；Each address
Under store 22 boundary values.Y values are that the border searching table of address is similar with the border searching table that x values are address, referring in Fig. 3
(d), from y, (b) direction, the grid chart one share 256 lateral slice crystalline regions, the width of each transverse direction crystalline region in other words
Degree is a y directions pixel.In Fig. 3 shown in (f), which also has 256 addresses for the look-up table of address, has corresponded to y's
Range stores the boundary value in 22 x directions under each address.
Third step is found out one-dimensional crystal using above-mentioned border searching table and is numbered.Assuming that calculated by detector output signal
The two-dimensional position coordinate for hitting pixel is (20,6), first introduces determining for b directions crystal number.As shown in figure 4, x directions are sat
Scale value is 20, then a series of that boundary value (7,13,20 ...) that address is 20 are recalled in the border searching table that x values are address.
It is compared again with y directions coordinate value 6 with these boundary values, due to 6 ＜ 7, i.e., y directions coordinate value is fallen on first boundary
Within the scope of, then the crystal number in b directions is 1.
Determining for a directions crystal number is similar with b directions, as shown in figure 5, y directions coordinate value is 6, then it is address in y values
Border searching table in recall address be 6 a series of that boundary value (7,13,21 ...).Again with x directions coordinate value 20 and these
Boundary value is compared, and due to 13 ＜, 20 ＜ 21, i.e. x directions coordinate value is fallen within second boundary and third boundary,
Then the crystal number in a directions is 3.
In conclusion position (20,6) corresponding two dimensional crystal number is (3,1), corresponds to one-dimensional crystal number and search
Table, one-dimensional crystal number is 3.
Particular embodiments described above has carried out the purpose, technical solution and advantageous effect of the disclosure further in detail
It describes in detail bright, it should be understood that the foregoing is merely the specific embodiment of the disclosure, is not limited to the disclosure, it is all
Within the spirit and principle of the disclosure, any modification, equivalent substitution, improvement and etc. done should be included in the guarantor of the disclosure
Within the scope of shield.
Claims (9)
1. based on the method that crystal number is determined using look-up table of FPGA, this method includes：
It is two dimensional crystal number look-up table by one-dimensional crystal number look-up table conversion；
Generation step：Two dimensional crystal number look-up table is split into the border searching table using both direction coordinate value as address；
Use step：Go out two dimensional crystal using border searching table search to number, then one-dimensional crystal is converted to by two dimensional crystal number
Number.
2. the method as described in claim 1, described by one-dimensional crystal number look-up table conversion is two dimensional crystal number look-up table
Including：The one-dimensional crystal number of one-dimensional crystal number look-up table is converted into two dimensional crystal number, is compiled so as to obtain two dimensional crystal
Number look-up table.
3. the method as described in claim 1, the generation step includes：
Second direction crystal in two dimensional crystal number look-up table is numbered identical crystal to merge, it is brilliant to form k strip
Body region, k are the crystal number in each direction；
It is 2 that two dimensional crystal number look-up table, which is evenly dividing, along the first directionnA slice crystalline region, each slice crystalline region
Interior shared (k-1) a boundary, n are the quantified precision of two-dimensional position coordinate；
The border searching table that first direction coordinate value is address is extracted, the border searching table is with the first direction coordinate of pixel
It is worth for address, (k-1) a boundary value is stored under each address.
4. method as claimed in claim 3, the generation step further includes：
First direction crystal in two dimensional crystal number look-up table is numbered identical crystal to merge, it is brilliant to form k strip
Body region；
It is 2 that two dimensional crystal number look-up table, which is evenly dividing, in a second directionnA slice crystalline region, each slice crystalline region
Interior shared (k-1) a boundary；
The border searching table that second direction coordinate value is address is extracted, the border searching table is with the second direction coordinate of pixel
It is worth for address, (k-1) a boundary value is stored under each address.
5. the method as described in claim 1, described to be included using step：
First direction is found out respectively using two border searching tables and second direction crystal is numbered, then by first direction and second
Direction crystal number finds out corresponding one-dimensional crystal number.
6. method as claimed in claim 5, the utilization border searching table search goes out second direction crystal number and includes：
First direction coordinate value is recalled according to by the first direction coordinate value for hitting pixel that detector output signal calculates
For the boundary group stored under the corresponding address of border searching table of address, common (k-1) a boundary；
The second direction coordinate value of the pixel lower boundary value stored corresponding with the address is compared respectively, according to second
The section that direction coordinate value is fallen into obtains the crystal number of second direction.
7. such as method described in claim 5 or 6, the utilization border searching table search goes out first direction crystal number and includes：
Second direction coordinate value is recalled according to by the second direction coordinate value for hitting pixel that detector output signal calculates
For the boundary group stored under the corresponding address of border searching table of address, common (k-1) a boundary；
The first direction coordinate value of the pixel lower boundary value stored corresponding with the address is compared respectively, according to first
The section that direction coordinate value is fallen into obtains the crystal number of first direction.
8. method as claimed in claim 5, described to find out corresponding one-dimensional crystalline substance by first direction and second direction crystal number
Body number includes：
According to the correspondence that one-dimensional crystal number is numbered with two dimensional crystal, by crystal number and the second direction of first direction
Crystal numbers to obtain one-dimensional crystal number.
9. the method for claim 7, described go out second direction crystal number using border searching table search and utilize side
Boundary's look-up table finds out the step of first direction crystal number and performs parallel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810024672.4A CN108182266B (en) | 2018-01-10 | 2018-01-10 | Method for determining crystal number by using lookup table based on FPGA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810024672.4A CN108182266B (en) | 2018-01-10 | 2018-01-10 | Method for determining crystal number by using lookup table based on FPGA |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108182266A true CN108182266A (en) | 2018-06-19 |
| CN108182266B CN108182266B (en) | 2020-05-12 |
Family
ID=62550212
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810024672.4A Active CN108182266B (en) | 2018-01-10 | 2018-01-10 | Method for determining crystal number by using lookup table based on FPGA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108182266B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110680369A (en) * | 2019-09-18 | 2020-01-14 | 东软医疗系统股份有限公司 | Energy coding table compression method, query method and device and PET system |
| CN111624644A (en) * | 2020-06-11 | 2020-09-04 | 北京卫星环境工程研究所 | Three-dimensional position sensitive detector and energy correction method thereof |
| CN111665535A (en) * | 2020-05-14 | 2020-09-15 | 东软医疗系统股份有限公司 | Compression and query method of energy coding table and related device |
| CN112907664A (en) * | 2021-02-08 | 2021-06-04 | 明峰医疗系统股份有限公司 | Image pixel position searching method and system for PET detector based on FPGA module and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090327889A1 (en) * | 2008-06-30 | 2009-12-31 | Jeong Eui-Heon | Matrix blogging system and service supporting method thereof |
| CN103309974A (en) * | 2013-06-08 | 2013-09-18 | 沈阳东软派斯通医疗系统有限公司 | Method and device for inquiring energy code |
| CN103914860A (en) * | 2013-01-05 | 2014-07-09 | 苏州瑞派宁科技有限公司 | Crystal bar position look-up table generation method and device |
| CN104700366A (en) * | 2015-03-03 | 2015-06-10 | 上海联影医疗科技有限公司 | Generating method for crystal pixel lookup table |
| CN104732541A (en) * | 2015-03-27 | 2015-06-24 | 北京永新医疗设备有限公司 | Method and device for acquiring PET crystal position lookup table |
| CN106547014A (en) * | 2016-11-02 | 2017-03-29 | 上海联影医疗科技有限公司 | The generation method of crystal localization method and look-up table |
-
2018
- 2018-01-10 CN CN201810024672.4A patent/CN108182266B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090327889A1 (en) * | 2008-06-30 | 2009-12-31 | Jeong Eui-Heon | Matrix blogging system and service supporting method thereof |
| CN103914860A (en) * | 2013-01-05 | 2014-07-09 | 苏州瑞派宁科技有限公司 | Crystal bar position look-up table generation method and device |
| CN103309974A (en) * | 2013-06-08 | 2013-09-18 | 沈阳东软派斯通医疗系统有限公司 | Method and device for inquiring energy code |
| CN104700366A (en) * | 2015-03-03 | 2015-06-10 | 上海联影医疗科技有限公司 | Generating method for crystal pixel lookup table |
| CN104732541A (en) * | 2015-03-27 | 2015-06-24 | 北京永新医疗设备有限公司 | Method and device for acquiring PET crystal position lookup table |
| CN106547014A (en) * | 2016-11-02 | 2017-03-29 | 上海联影医疗科技有限公司 | The generation method of crystal localization method and look-up table |
Non-Patent Citations (1)
| Title |
|---|
| 陈忻 等: "PET探测器晶体位置快速在线辨识算法", 《中国科技论文》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110680369A (en) * | 2019-09-18 | 2020-01-14 | 东软医疗系统股份有限公司 | Energy coding table compression method, query method and device and PET system |
| CN111665535A (en) * | 2020-05-14 | 2020-09-15 | 东软医疗系统股份有限公司 | Compression and query method of energy coding table and related device |
| CN111624644A (en) * | 2020-06-11 | 2020-09-04 | 北京卫星环境工程研究所 | Three-dimensional position sensitive detector and energy correction method thereof |
| CN112907664A (en) * | 2021-02-08 | 2021-06-04 | 明峰医疗系统股份有限公司 | Image pixel position searching method and system for PET detector based on FPGA module and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108182266B (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108182266A (en) | A kind of method that crystal number is determined using look-up table based on FPGA | |
| Li et al. | Model‐based image reconstruction for four‐dimensional PET | |
| Jan et al. | Monte Carlo simulation for the ECAT EXACT HR+ system using GATE | |
| Tashima et al. | 3D Compton image reconstruction method for whole gamma imaging | |
| EP2875489B1 (en) | Method, computer readable medium and system for tomographic reconstruction | |
| US11054534B1 (en) | Time-resolved positron emission tomography encoder system for producing real-time, high resolution, three dimensional positron emission tomographic image without the necessity of performing image reconstruction | |
| US9851456B2 (en) | TOF-PET tomograph and a method of imaging using a TOF-PET tomograph, based on a probability of production and lifetime of a positronium | |
| Zeng et al. | A GPU-accelerated fully 3D OSEM image reconstruction for a high-resolution small animal PET scanner using dual-ended readout detectors | |
| CN107970037A (en) | Imaging method and imaging system | |
| US20200132867A1 (en) | Pet system with a positron lifetime measurement function and positron lifetime measurement method in a pet system | |
| Lin et al. | Efficient simulation of voxelized phantom in GATE with embedded SimSET multiple photon history generator | |
| CN113420491A (en) | Method for evaluating organ radiation dose of experimental animal irradiated outside particles | |
| Townsend | From 3-D positron emission tomography to 3-D positron emission tomography/computed tomography: what did we learn? | |
| Guo et al. | Memory‐efficient algorithm for stored projection and backprojection matrix in helical CT | |
| Cheng et al. | Maximum likelihood activity and attenuation estimation using both emission and transmission data with application to utilization of Lu‐176 background radiation in TOF PET | |
| Zheng et al. | GPU accelerated stochastic origin ensemble method with list-mode data for compton camera imaging in proton therapy | |
| Janecek et al. | A simulation study for the design of a prototype insert for whole-body PET scanners | |
| Shi et al. | GPU-based real-time software coincidence processing for digital PET system | |
| Mandelkern | Nuclear techniques for medical imaging: positron emission tomography | |
| Hentschel | A periodization of research technologies and of the emergency of genericity | |
| Sajedi et al. | Development and preliminary results of Xtrim-PET, a modular cost-effective preclinical scanner | |
| Soluri et al. | New device based on the super spatial resolution (SSR) method | |
| CN110755100A (en) | Correction method, correction device, console equipment and PET system | |
| Guo | The Principle and State-of-Art Facilities for PET | |
| Deng et al. | Research on system response matrix modelling method of rectangular PET scanner based on Monte Carlo simulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |