1. An image interpretation report creating apparatus to be used for creating an image interpretation report when connected directly or via a network to at least one terminal for displaying a medical image, an image server for storing image data of medical images, an image interpretation report server for storing image interpretation report database accumulating image interpretation report data of image interpretation reports created based on medical images, and at least one examination result server for storing examination result database accumulating examination result data of examination results obtained by examination using no medical image, said apparatus comprising:
a display unit for displaying an image interpretation report creation screen for creating an image interpretation report of a medical image obtained by examination using a medical image along with an examination result obtained by examination using no medical image;
input means to be used for inputting finding of the medical image and specifying first information and second information in the finding and an examination result displayed on said display unit, respectively;
search key generating means for generating at least one first search key for searching said image interpretation report database and at least one second search key for searching said examination result database, based on the first and second information, respectively;
search processing means for causing said image interpretation report server to obtain at least one case that matches said at least one first search key and causing said examination result server to obtain at least one case that matches said at least one second search key;
similarity degree determining means for determining a degree of similarity between (i) the first and second information specified in the finding and the examination result displayed on said display unit and (ii) the at least one case obtained by said image interpretation report server and said examination result server, and displaying the obtained at least one case in a list on said display unit in an order of the degree of similarity;
case display means for displaying contents of a case, which is selected by a user from among the at least one case displayed in the list, on said display unit; and
image interpretation report preservation means for causing said image interpretation report server to store image interpretation report data of the image interpretation report created based on the image interpretation report creation screen displayed on said display unit.
2. The image interpretation report creating apparatus according to claim 1, wherein said search processing means includes:
image interpretation report search processing means for causing said image interpretation report server to search said image interpretation report database for image interpretation report data representing a case that matches said at least one first search key to obtain the image interpretation report data, and outputting the obtained image interpretation report data; and
examination result search processing means for adding condition about examination information included in the image interpretation report data obtained by said image interpretation report search processing means to said at least one second search key to obtain a combined search key, and causing said examination result server to search said examination result server database for examination result data representing a case that matches the combined search key to obtain the examination result data, and outputting the obtained examination result data.
3. The image interpretation report creating apparatus according to claim 2, further comprising:
storage means for storing data of relationship that should be met between the examination using the medical image and the examination using no medical image;
wherein said examination result search processing means adds condition about the relationship, that should be met for the examination information included in the image interpretation report data obtained by said image interpretation report search processing means, to said at least one second search key, based on the relationship represented by the data stored in said storage means.
4. The image interpretation report creating apparatus according to claim 1, wherein said similarity degree determining means determines a comprehensive degree of similarity based on (i) a first degree of similarity between the first information specified in the finding displayed on said display unit and said at least one case obtained by said image interpretation report server and (ii) a second degree of similarity between the second information specified in the examination result displayed on said display unit and said at least one case obtained by said examination result server.
5. The image interpretation report creating apparatus according to claim 1, wherein, when the examination result of a patient as an object of image interpretation is not accumulated in said examination result database, said input means is used to input third information for searching said examination result database for at least one case, and said search key generating means generates said at least one first search key and said at least one second search key based on said first and third information, respectively.
6. The image interpretation report creating apparatus according to claim 5, wherein said similarity degree determining means determines a comprehensive degree of similarity based on (i) a first degree of similarity between the first information and said at least one case obtained by said image interpretation report server and (ii) a second degree of similarity between the third information and said at least one case obtained by said examination result server.
7. The image interpretation report creating apparatus according to claim 1, wherein, when examination result of a patient as an object of image interpretation is not accumulated in said examination result database, said input means is used to input at least one third search key for searching said examination result database for at least one case, said search key generating means generates at least one first search key for searching said image interpretation report database for at least one case based on the first information, said search processing means causes said image interpretation report server to obtain at least one case that matches said at least one first search key and causes said examination result server to obtain at least one case that matches said at least one third search key, and said similarity degree determining means determines a degree of similarity between the first information specified in the finding displayed on said display unit and each of the cases obtained by said image interpretation report server, and displays the obtained cases in a list on said display unit in an order of the degree of similarity.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. An encoding device for performing serial concatenated coding on k bit sequences of input data, said encoding device comprising:
first encoding means for encoding the input data with code rate kp to output p bit sequences of data;
permuting means for permuting the p bit sequences of data and outputting the permuted data; and
second encoding means for encoding the p bit sequences of data output from the permuting means with code rate pn to output n bit sequences of data,
wherein the second encoding means outputs the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data output from the permuting means are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting means permutes the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response by the second encoding means are not mixed with the other bit sequence or sequences, and outputs the permuted data.
2. An encoding device according to claim 1, further comprising mapping means for mapping the n bit sequences of data onto a transmission symbol according to a predetermined modulation scheme,
wherein serial concatenated trellis coded modulation is performed.
3. An encoding device according to claim 1, wherein the permuting means does not permute the other bit sequence or sequences, which are then output.
4. An encoding device according to claim 1, wherein the first encoding means outputs the bit sequences that are encoded so as to produce an infinite impulse response by the second encoding means via the permuting means with a minimum Hamming distance of 2 or more.
5. An encoding device according to claim 1, wherein the first encoding means outputs the bit sequences that are encoded so as to produce an infinite impulse response by the second encoding means via the permuting means with a minimum Hamming distance of 2.
6. An encoding device according to claim 1, wherein the number of bit sequences that are encoded so as to produce an infinite impulse response by the second encoding means is k or more.
7. An encoding device according to claim 1, wherein the number of bit sequences that are encoded so as to produce an infinite impulse response by the second encoding means is k.
8. An encoding device according to claim 1, wherein the first encoding means outputs the p bit sequences of data, consisting of k output bit sequences of catastrophic code whose code rate is kk and whose minimum output Hamming distance is 2, and (p\u2212k) bit sequences of the k bit sequences of input data.
9. An encoding device according to claim 1, wherein the second encoding means uses a catastrophic code with code rate 1 as a code for performing coding so as to produce an infinite impulse response.
10. An encoding device according to claim 1, wherein when the other bit sequence or sequences that are supplied to the second encoding means via the permuting means differ by 1-bit, the first encoding means performs coding so that the bit sequences that are encoded so as to produce an infinite impulse response and that are supplied to the second encoding means via the permuting means do not differ by a certain number of bits or more.
11. An encoding device according to claim 1, wherein the permuting means permutes the p bit sequences of data so that data belonging to the same sequence of input bits belongs to the same sequence of output bits.
12. An encoding device according to claim 11, wherein the permuting means permutes the p bit sequences of data in a different order from one sequence to another.
13. An encoding device according to claim 11, wherein the permuting means permutes the p bit sequences of data in the same order across all sequences.
14. An encoding device according to claim 11, wherein the permuting means permutes the p bit sequences of data in the same order across some of the sequences.
15. An encoding device according to claim 11, wherein the permuting means permutes the p bit sequences of data in a random order across each sequence.
16. An encoding device according to claim 11, wherein the permuting means permutes the p bit sequences of data so that data whose input order is within a predetermined range has an output order out of the predetermined range.
17. An encoding device according to claim 1, wherein the permuting means is formed of a plurality of circuit blocks each for permuting one or a plurality of the bit sequences.
18. An encoding device according to claim 1, wherein the permuting means is formed of a single circuit block.
19. An encoding device according to claim 1, wherein the first andor second encoding means comprises convolutional encoding means.
20. An encoding device according to claim 1, wherein the code rate kp is less than 1.
21. An encoding device according to claim 1, wherein p is (k+1).
22. An encoding device according to claim 1, wherein p is (k+a),
where a is an integer of 2 or more, and k is a multiple of a.
23. An encoding device according to claim 1, wherein the code rate pn is 1 or more.
24. An encoding device according to claim 1, wherein the code rate pn is 1.
25. An encoding device according to claim 2, wherein the mapping means maps n bits of the n bit sequences of data, which are output at one time, onto one transmission symbol in 2n-level modulation.
26. An encoding device according to claim 2, wherein the mapping means performs the mapping so that the Hamming distance between output codewords of the n bit sequences of data in which the Euclidean distance between transmission symbols is minimized is smaller than between other codewords, and
the first encoding means outputs the p bit sequences of data that is coded so that the minimum distance between output codewords is large.
27. An encoding device according to claim 2, wherein the mapping means performs the mapping so that the Hamming distance between output codewords of the n bit sequences of data in which the Euclidean distance between transmission symbols is minimized is larger than between other codewords, and
the first encoding means outputs the p bit sequences of data that is coded so that the minimum distance between output codewords is small.
28. An encoding method for performing serial concatenated coding on k bit sequences of input data, said encoding method comprising:
a first encoding step of encoding the input data with code rate kp and outputting p bit sequences of data;
a permuting step of permuting the order of the p bit sequences of data and outputting the permuted data; and
a second encoding step of encoding the p bit sequences of data permuted in the permuting step with code rate pn and outputting n bit sequences of data,
wherein the second encoding step includes outputting the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data permuted in the permuting step are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting step includes permuting the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response in the second encoding step are not mixed with the other bit sequence or sequences, and outputting the permuted data.
29. An encoding program that causes a computer to execute a predetermined procedure to perform serial concatenated coding on k bit sequences of input data, the procedure including:
a first encoding step of encoding the input data with code rate kp and outputting p bit sequences of data;
a permuting step of permuting the order of the p bit sequences of data and outputting the permuted data; and
a second encoding step of encoding the p bit sequences of data permuted in the permuting step with code rate pn and outputting n bit sequences of data,
wherein the second encoding step includes outputting the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data permuted in the permuting step are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting step includes permuting the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response in the second encoding step are not mixed with the other bit sequence or sequences, and outputting the permuted data.
30. A decoding device for decoding a code generated by a predetermined encoding method,
the encoding method including:
a first encoding step of encoding input data with code rate kp, and outputting p bit sequences of data;
a permuting step of permuting the order of the p bit sequences of data and outputting the permuted data; and
a second encoding step of encoding the p bit sequences of data permuted in the permuting step with code rate pn and outputting n bit sequences of data,
wherein the second encoding step includes outputting the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data permuted in the permuting step are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting step includes permuting the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response in the second encoding step are not mixed with the other bit sequence or sequences, and outputting the permuted data,
said decoding device comprising:
first soft-output decoding means for, correspondingly to the second encoding step, performing soft-output decoding on extrinsic information that corresponds to the p bit sequences of data based on a soft-input received word and a-priori probability information;
first permuting means serial concatenated with the first soft-output decoding means for, correspondingly to the permuting step, permuting the extrinsic information that corresponds to the p bit sequences of data and outputting the permuted data;
second soft-output decoding means serial concatenated with the first permuting means for, correspondingly to the first encoding step, performing soft-output decoding on extrinsic information that corresponds to the k bit sequences of input data and a-posteriori probability information based on the extrinsic information output from the first permuting means; and
second permuting means for permuting the a-posteriori probability information and outputting the a-priori probability information.
31. A decoding method for decoding a code generated by a predetermined encoding method,
the encoding method including:
a first encoding step of encoding input data with code rate kp and outputting p bit sequences of data;
a permuting step of permuting the order of the p bit sequences of data and outputting the permuted data; and
a second encoding step of encoding the p bit sequences of data permuted in the permuting step with code rate pn and outputting n bit sequences of data,
wherein the second encoding step includes outputting the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data permuted in the permuting step are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting step includes permuting the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response in the second encoding step are not mixed with the other bit sequence or sequences, and outputting the permuted data,
said decoding method comprising:
a first soft-output decoding step of, correspondingly to the second encoding step, performing soft-output decoding on extrinsic information that corresponds to the p bit sequences of data based on a soft-input received word and a-priori probability information;
a first permuting step serial concatenated with the first soft-output decoding step of, correspondingly to the permuting step, permuting the extrinsic information that corresponds to the p bit sequences of data and outputting the permuted data;
a second soft-output decoding step serial concatenated with the first permuting step of, correspondingly to the first encoding step, performing soft-output decoding on extrinsic information that corresponds to the k bit sequences of input data and a-posteriori probability information based on the extrinsic information permuted in the first permuting step; and
a second permuting step of permuting the a-posteriori probability information and outputting the a-priori probability information.
32. A decoding program that causes a computer to execute a predetermined procedure to decode a code generated by a predetermined encoding method,
the encoding method including:
a first encoding step of encoding input data with code rate kp and outputting p bit sequences of data;
a permuting step of permuting the order of the p bit sequences of data and outputting the permuted data; and
a second encoding step of encoding the p bit sequences of data permuted in the permuting step with code rate pn and outputting n bit sequences of data,
wherein the second encoding step includes outputting the n bit sequences of data, wherein one or more bit sequences of the p bit sequences of data permuted in the permuting step are not encoded or are encoded so as to produce a finite impulse response and the remaining bit sequences of data are encoded so as to produce an infinite impulse response, and
the permuting step includes permuting the p bit sequences of data so that the bit sequences that are encoded so as to produce an infinite impulse response in the second encoding step are not mixed with the other bit sequence or sequences, and outputting the permuted data,
the predetermined procedure including:
a first soft-output decoding step of, correspondingly to the second encoding step, performing soft-output decoding on extrinsic information that corresponds to the p bit sequences of data based on a soft-input received word and a-priori probability information;
a first permuting step serial concatenated with the first soft-output decoding step of, correspondingly to the permuting step, permuting the extrinsic information that corresponds to the p bit sequences of data and outputting the permuted data;
a second soft-output decoding step serial concatenated with the first permuting step of, correspondingly to the first encoding step, performing soft-output decoding on extrinsic information that corresponds to the k bit sequences of input data and a-posteriori probability information based on the extrinsic information permuted in the first permuting step; and
a second permuting step of permuting the a-posteriori probability information and outputting the a-priori probability information.