Mercurial > hg > orthanc-stone
annotate Framework/Volumes/VolumeImageProgressivePolicy.cpp @ 45:ecd96e563929 wasm
new wasm branch
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Wed, 19 Apr 2017 10:28:08 +0200 |
parents | 7207a407bcd8 |
children | 28956ed68280 |
rev | line source |
---|---|
0 | 1 /** |
2 * Stone of Orthanc | |
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
4 * Department, University Hospital of Liege, Belgium | |
40
7207a407bcd8
shared copyright with osimis
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
16
diff
changeset
|
5 * Copyright (C) 2017 Osimis, Belgium |
0 | 6 * |
7 * This program is free software: you can redistribute it and/or | |
8 * modify it under the terms of the GNU General Public License as | |
9 * published by the Free Software Foundation, either version 3 of the | |
10 * License, or (at your option) any later version. | |
11 * | |
12 * In addition, as a special exception, the copyright holders of this | |
13 * program give permission to link the code of its release with the | |
14 * OpenSSL project's "OpenSSL" library (or with modified versions of it | |
15 * that use the same license as the "OpenSSL" library), and distribute | |
16 * the linked executables. You must obey the GNU General Public License | |
17 * in all respects for all of the code used other than "OpenSSL". If you | |
18 * modify file(s) with this exception, you may extend this exception to | |
19 * your version of the file(s), but you are not obligated to do so. If | |
20 * you do not wish to do so, delete this exception statement from your | |
21 * version. If you delete this exception statement from all source files | |
22 * in the program, then also delete it here. | |
23 * | |
24 * This program is distributed in the hope that it will be useful, but | |
25 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
27 * General Public License for more details. | |
28 * | |
29 * You should have received a copy of the GNU General Public License | |
30 * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
31 **/ | |
32 | |
33 | |
34 #include "VolumeImageProgressivePolicy.h" | |
35 | |
36 #include "../Toolbox/DownloadStack.h" | |
16 | 37 #include "../../Resources/Orthanc/Core/Images/ImageProcessing.h" |
0 | 38 |
39 namespace OrthancStone | |
40 { | |
41 class VolumeImageProgressivePolicy::AxialSlicesScheduler | |
42 { | |
43 private: | |
44 size_t depth_; | |
45 DownloadStack stack_; | |
46 | |
47 public: | |
48 AxialSlicesScheduler(size_t depth) : | |
49 depth_(depth), | |
50 stack_(3 * depth) // "3" stands for the number of quality levels | |
51 { | |
52 assert(depth > 0); | |
53 } | |
54 | |
55 void TagFullPriority(int z, | |
56 int neighborhood) | |
57 { | |
58 DownloadStack::Writer writer(stack_); | |
59 | |
60 // Also schedule the neighboring slices for download in medium quality | |
61 for (int offset = neighborhood; offset >= 1; offset--) | |
62 { | |
63 writer.SetTopNodePermissive((z + offset) + depth_ * Quality_Medium); | |
64 writer.SetTopNodePermissive((z - offset) + depth_ * Quality_Medium); | |
65 } | |
66 | |
67 writer.SetTopNodePermissive(z + depth_ * Quality_Full); | |
68 } | |
69 | |
70 bool LookupSlice(unsigned int& z, | |
71 Quality& quality) | |
72 { | |
73 unsigned int value; | |
74 if (stack_.Pop(value)) | |
75 { | |
76 z = value % depth_; | |
77 | |
78 switch (value / depth_) | |
79 { | |
80 case 0: | |
81 quality = Quality_Low; | |
82 break; | |
83 | |
84 case 1: | |
85 quality = Quality_Medium; | |
86 break; | |
87 | |
88 case 2: | |
89 quality = Quality_Full; | |
90 break; | |
91 | |
92 default: | |
93 throw Orthanc::OrthancException(Orthanc::ErrorCode_InternalError); | |
94 } | |
95 | |
96 return true; | |
97 } | |
98 else | |
99 { | |
100 return false; | |
101 } | |
102 } | |
103 }; | |
104 | |
105 | |
106 bool VolumeImageProgressivePolicy::IsComplete() | |
107 { | |
108 boost::mutex::scoped_lock lock(qualityMutex_); | |
109 | |
110 for (size_t i = 0; i < axialSlicesQuality_.size(); i++) | |
111 { | |
112 if (axialSlicesQuality_[i] != Quality_Full) | |
113 { | |
114 return false; | |
115 } | |
116 } | |
117 | |
118 return true; | |
119 } | |
120 | |
121 | |
122 void VolumeImageProgressivePolicy::InitializeInternal(ImageBuffer3D& buffer, | |
123 ISeriesLoader& loader) | |
124 { | |
125 const size_t depth = loader.GetGeometry().GetSliceCount(); | |
126 | |
127 isJpegAvailable_ = loader.IsJpegAvailable(); | |
128 | |
129 axialSlicesQuality_.clear(); | |
130 axialSlicesQuality_.resize(depth, Quality_None); | |
131 scheduler_.reset(new AxialSlicesScheduler(depth)); | |
132 } | |
133 | |
134 | |
135 bool VolumeImageProgressivePolicy::DownloadStepInternal(bool& complete, | |
136 ImageBuffer3D& buffer, | |
137 ISeriesLoader& loader) | |
138 { | |
139 unsigned int z; | |
140 Quality quality; | |
141 | |
142 if (!scheduler_->LookupSlice(z, quality)) | |
143 { | |
144 // There is no more frame to be downloaded. Before stopping, | |
145 // each loader thread checks whether all the frames have been | |
146 // downloaded at maximum quality. | |
147 complete = IsComplete(); | |
148 return true; | |
149 } | |
150 | |
151 if (quality != Quality_Full && | |
152 !isJpegAvailable_) | |
153 { | |
154 // Cannot fulfill this command, as progressive JPEG download | |
155 // is unavailable (i.e. the Web viewer plugin is unavailable) | |
156 return false; | |
157 } | |
158 | |
159 std::auto_ptr<Orthanc::ImageAccessor> frame; | |
160 | |
161 try | |
162 { | |
163 switch (quality) | |
164 { | |
165 case Quality_Low: | |
166 frame.reset(loader.DownloadJpegFrame(z, 10)); | |
167 break; | |
168 | |
169 case Quality_Medium: | |
170 frame.reset(loader.DownloadJpegFrame(z, 90)); | |
171 break; | |
172 | |
173 case Quality_Full: | |
174 frame.reset(loader.DownloadFrame(z)); | |
175 break; | |
176 | |
177 default: | |
178 throw Orthanc::OrthancException(Orthanc::ErrorCode_InternalError); | |
179 } | |
180 } | |
181 catch (Orthanc::OrthancException&) | |
182 { | |
183 // The Orthanc server cannot decode this instance | |
184 return false; | |
185 } | |
186 | |
187 if (frame.get() != NULL) | |
188 { | |
189 boost::mutex::scoped_lock lock(qualityMutex_); | |
190 | |
191 if (axialSlicesQuality_[z] == Quality_None || | |
192 axialSlicesQuality_[z] < quality) | |
193 { | |
194 axialSlicesQuality_[z] = quality; | |
195 | |
196 ImageBuffer3D::SliceWriter writer(buffer, VolumeProjection_Axial, z); | |
197 Orthanc::ImageProcessing::Convert(writer.GetAccessor(), *frame); | |
198 } | |
199 } | |
200 | |
201 return false; | |
202 } | |
203 | |
204 | |
205 bool VolumeImageProgressivePolicy::IsFullQualityAxial(size_t slice) | |
206 { | |
207 scheduler_->TagFullPriority(slice, 3); | |
208 | |
209 { | |
210 boost::mutex::scoped_lock lock(qualityMutex_); | |
211 return (axialSlicesQuality_[slice] == Quality_Full); | |
212 } | |
213 } | |
214 } |