Mercurial > hg > orthanc-wsi
annotate Framework/Inputs/DicomPyramidLevel.cpp @ 334:f011fc199b6a default tip
back to mainline
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Fri, 18 Oct 2024 15:44:18 +0200 |
parents | 0683312e21ba |
children |
rev | line source |
---|---|
0 | 1 /** |
2 * Orthanc - A Lightweight, RESTful DICOM Store | |
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
4 * Department, University Hospital of Liege, Belgium | |
312
0683312e21ba
updated copyright, as Orthanc Team now replaces Osimis
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
309
diff
changeset
|
5 * Copyright (C) 2017-2023 Osimis S.A., Belgium |
0683312e21ba
updated copyright, as Orthanc Team now replaces Osimis
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
309
diff
changeset
|
6 * Copyright (C) 2024-2024 Orthanc Team SRL, Belgium |
309
7020852a8fa9
updated year to 2024
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
254
diff
changeset
|
7 * Copyright (C) 2021-2024 Sebastien Jodogne, ICTEAM UCLouvain, Belgium |
0 | 8 * |
9 * This program is free software: you can redistribute it and/or | |
10 * modify it under the terms of the GNU Affero General Public License | |
11 * as published by the Free Software Foundation, either version 3 of | |
12 * the License, or (at your option) any later version. | |
13 * | |
14 * This program is distributed in the hope that it will be useful, but | |
15 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
17 * Affero General Public License for more details. | |
18 * | |
19 * You should have received a copy of the GNU Affero General Public License | |
20 * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
21 **/ | |
22 | |
23 | |
16
7a88c614be04
preparing for precompiled headers
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
0
diff
changeset
|
24 #include "../PrecompiledHeadersWSI.h" |
0 | 25 #include "DicomPyramidLevel.h" |
26 | |
192 | 27 #include <Logging.h> |
28 #include <OrthancException.h> | |
0 | 29 |
30 #include <boost/lexical_cast.hpp> | |
31 | |
32 namespace OrthancWSI | |
33 { | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
34 DicomPyramidLevel::TileContent& DicomPyramidLevel::GetTileContent(unsigned int tileX, |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
35 unsigned int tileY) |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
36 { |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
37 if (tileX >= countTilesX_ || |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
38 tileY >= countTilesY_) |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
39 { |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
40 LOG(ERROR) << "Tile location (" << tileX << "," << tileY << ") is outside the image"; |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
41 throw Orthanc::OrthancException(Orthanc::ErrorCode_BadFileFormat); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
42 } |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
43 |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
44 return tiles_[tileY * countTilesX_ + tileX]; |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
45 } |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
46 |
56
83cd735c885d
speedup the loading of DICOM sources
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
55
diff
changeset
|
47 void DicomPyramidLevel::RegisterFrame(DicomPyramidInstance& instance, |
0 | 48 unsigned int frame) |
49 { | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
50 unsigned int tileX = instance.GetFrameLocationX(frame); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
51 unsigned int tileY = instance.GetFrameLocationY(frame); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
52 TileContent& tile = GetTileContent(tileX, tileY); |
0 | 53 |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
54 if (tile.instance_ != NULL) |
0 | 55 { |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
56 LOG(ERROR) << "Tile with location (" << tileX << "," |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
57 << tileY << ") is indexed twice in level of size " |
0 | 58 << totalWidth_ << "x" << totalHeight_; |
59 throw Orthanc::OrthancException(Orthanc::ErrorCode_BadFileFormat); | |
60 } | |
61 | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
62 tile.instance_ = &instance; |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
63 tile.frame_ = frame; |
0 | 64 } |
65 | |
66 | |
67 bool DicomPyramidLevel::LookupTile(TileContent& tile, | |
68 unsigned int tileX, | |
69 unsigned int tileY) const | |
70 { | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
71 const TileContent& tmp = const_cast<DicomPyramidLevel&>(*this).GetTileContent(tileX, tileY); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
72 |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
73 if (tmp.instance_ == NULL) |
0 | 74 { |
75 return false; | |
76 } | |
77 else | |
78 { | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
79 tile = tmp; |
0 | 80 return true; |
81 } | |
82 } | |
83 | |
84 | |
56
83cd735c885d
speedup the loading of DICOM sources
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
55
diff
changeset
|
85 DicomPyramidLevel::DicomPyramidLevel(DicomPyramidInstance& instance) : |
0 | 86 totalWidth_(instance.GetTotalWidth()), |
87 totalHeight_(instance.GetTotalHeight()), | |
88 tileWidth_(instance.GetTileWidth()), | |
89 tileHeight_(instance.GetTileHeight()) | |
90 { | |
91 if (totalWidth_ == 0 || | |
92 totalHeight_ == 0) | |
93 { | |
94 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
95 } | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
96 |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
97 countTilesX_ = CeilingDivision(totalWidth_, tileWidth_); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
98 countTilesY_ = CeilingDivision(totalHeight_, tileHeight_); |
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
99 tiles_.resize(countTilesX_ * countTilesY_); |
0 | 100 |
101 AddInstance(instance); | |
102 } | |
103 | |
104 | |
56
83cd735c885d
speedup the loading of DICOM sources
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
55
diff
changeset
|
105 void DicomPyramidLevel::AddInstance(DicomPyramidInstance& instance) |
0 | 106 { |
107 if (instance.GetTotalWidth() != totalWidth_ || | |
108 instance.GetTotalHeight() != totalHeight_ || | |
109 instance.GetTileWidth() != tileWidth_ || | |
110 instance.GetTileHeight() != tileHeight_) | |
111 { | |
112 throw Orthanc::OrthancException(Orthanc::ErrorCode_IncompatibleImageSize); | |
113 } | |
114 | |
115 for (size_t frame = 0; frame < instance.GetFrameCount(); frame++) | |
116 { | |
117 RegisterFrame(instance, frame); | |
118 } | |
119 } | |
120 | |
121 | |
57
91fc9583b2de
big refactoring to support sparse tiling
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
56
diff
changeset
|
122 bool DicomPyramidLevel::DownloadRawTile(std::string& raw /* out */, |
0 | 123 Orthanc::PixelFormat& format /* out */, |
57
91fc9583b2de
big refactoring to support sparse tiling
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
56
diff
changeset
|
124 ImageCompression& compression /* out */, |
196
b0bd22077cd8
sharing code with orthanc-stone
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
192
diff
changeset
|
125 OrthancStone::IOrthancConnection& orthanc, |
0 | 126 unsigned int tileX, |
127 unsigned int tileY) const | |
128 { | |
129 TileContent tile; | |
130 if (LookupTile(tile, tileX, tileY)) | |
131 { | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
132 assert(tile.instance_ != NULL); |
56
83cd735c885d
speedup the loading of DICOM sources
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
55
diff
changeset
|
133 DicomPyramidInstance& instance = *tile.instance_; |
0 | 134 |
135 std::string uri = ("/instances/" + instance.GetInstanceId() + | |
55
b6432a00b103
use of simpler data structures
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
136 "/frames/" + boost::lexical_cast<std::string>(tile.frame_) + "/raw"); |
0 | 137 |
138 orthanc.RestApiGet(raw, uri); | |
139 | |
56
83cd735c885d
speedup the loading of DICOM sources
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
55
diff
changeset
|
140 compression = instance.GetImageCompression(orthanc); |
0 | 141 format = instance.GetPixelFormat(); |
142 | |
143 return true; | |
144 } | |
145 else | |
146 { | |
147 return false; | |
148 } | |
149 } | |
150 } |