Endless-Iterations
commited on
Commit
•
492f4c3
1
Parent(s):
839b23f
Delete ultimate-upscale-for-automatic1111
Browse files- ultimate-upscale-for-automatic1111/.gitignore +0 -1
- ultimate-upscale-for-automatic1111/LICENSE +0 -674
- ultimate-upscale-for-automatic1111/README.md +0 -119
- ultimate-upscale-for-automatic1111/scripts/__pycache__/ultimate-upscale.cpython-310.pyc +0 -0
- ultimate-upscale-for-automatic1111/scripts/ultimate-upscale.py +0 -559
ultimate-upscale-for-automatic1111/.gitignore
DELETED
@@ -1 +0,0 @@
|
|
1 |
-
.vscode
|
|
|
|
ultimate-upscale-for-automatic1111/LICENSE
DELETED
@@ -1,674 +0,0 @@
|
|
1 |
-
GNU GENERAL PUBLIC LICENSE
|
2 |
-
Version 3, 29 June 2007
|
3 |
-
|
4 |
-
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
5 |
-
Everyone is permitted to copy and distribute verbatim copies
|
6 |
-
of this license document, but changing it is not allowed.
|
7 |
-
|
8 |
-
Preamble
|
9 |
-
|
10 |
-
The GNU General Public License is a free, copyleft license for
|
11 |
-
software and other kinds of works.
|
12 |
-
|
13 |
-
The licenses for most software and other practical works are designed
|
14 |
-
to take away your freedom to share and change the works. By contrast,
|
15 |
-
the GNU General Public License is intended to guarantee your freedom to
|
16 |
-
share and change all versions of a program--to make sure it remains free
|
17 |
-
software for all its users. We, the Free Software Foundation, use the
|
18 |
-
GNU General Public License for most of our software; it applies also to
|
19 |
-
any other work released this way by its authors. You can apply it to
|
20 |
-
your programs, too.
|
21 |
-
|
22 |
-
When we speak of free software, we are referring to freedom, not
|
23 |
-
price. Our General Public Licenses are designed to make sure that you
|
24 |
-
have the freedom to distribute copies of free software (and charge for
|
25 |
-
them if you wish), that you receive source code or can get it if you
|
26 |
-
want it, that you can change the software or use pieces of it in new
|
27 |
-
free programs, and that you know you can do these things.
|
28 |
-
|
29 |
-
To protect your rights, we need to prevent others from denying you
|
30 |
-
these rights or asking you to surrender the rights. Therefore, you have
|
31 |
-
certain responsibilities if you distribute copies of the software, or if
|
32 |
-
you modify it: responsibilities to respect the freedom of others.
|
33 |
-
|
34 |
-
For example, if you distribute copies of such a program, whether
|
35 |
-
gratis or for a fee, you must pass on to the recipients the same
|
36 |
-
freedoms that you received. You must make sure that they, too, receive
|
37 |
-
or can get the source code. And you must show them these terms so they
|
38 |
-
know their rights.
|
39 |
-
|
40 |
-
Developers that use the GNU GPL protect your rights with two steps:
|
41 |
-
(1) assert copyright on the software, and (2) offer you this License
|
42 |
-
giving you legal permission to copy, distribute and/or modify it.
|
43 |
-
|
44 |
-
For the developers' and authors' protection, the GPL clearly explains
|
45 |
-
that there is no warranty for this free software. For both users' and
|
46 |
-
authors' sake, the GPL requires that modified versions be marked as
|
47 |
-
changed, so that their problems will not be attributed erroneously to
|
48 |
-
authors of previous versions.
|
49 |
-
|
50 |
-
Some devices are designed to deny users access to install or run
|
51 |
-
modified versions of the software inside them, although the manufacturer
|
52 |
-
can do so. This is fundamentally incompatible with the aim of
|
53 |
-
protecting users' freedom to change the software. The systematic
|
54 |
-
pattern of such abuse occurs in the area of products for individuals to
|
55 |
-
use, which is precisely where it is most unacceptable. Therefore, we
|
56 |
-
have designed this version of the GPL to prohibit the practice for those
|
57 |
-
products. If such problems arise substantially in other domains, we
|
58 |
-
stand ready to extend this provision to those domains in future versions
|
59 |
-
of the GPL, as needed to protect the freedom of users.
|
60 |
-
|
61 |
-
Finally, every program is threatened constantly by software patents.
|
62 |
-
States should not allow patents to restrict development and use of
|
63 |
-
software on general-purpose computers, but in those that do, we wish to
|
64 |
-
avoid the special danger that patents applied to a free program could
|
65 |
-
make it effectively proprietary. To prevent this, the GPL assures that
|
66 |
-
patents cannot be used to render the program non-free.
|
67 |
-
|
68 |
-
The precise terms and conditions for copying, distribution and
|
69 |
-
modification follow.
|
70 |
-
|
71 |
-
TERMS AND CONDITIONS
|
72 |
-
|
73 |
-
0. Definitions.
|
74 |
-
|
75 |
-
"This License" refers to version 3 of the GNU General Public License.
|
76 |
-
|
77 |
-
"Copyright" also means copyright-like laws that apply to other kinds of
|
78 |
-
works, such as semiconductor masks.
|
79 |
-
|
80 |
-
"The Program" refers to any copyrightable work licensed under this
|
81 |
-
License. Each licensee is addressed as "you". "Licensees" and
|
82 |
-
"recipients" may be individuals or organizations.
|
83 |
-
|
84 |
-
To "modify" a work means to copy from or adapt all or part of the work
|
85 |
-
in a fashion requiring copyright permission, other than the making of an
|
86 |
-
exact copy. The resulting work is called a "modified version" of the
|
87 |
-
earlier work or a work "based on" the earlier work.
|
88 |
-
|
89 |
-
A "covered work" means either the unmodified Program or a work based
|
90 |
-
on the Program.
|
91 |
-
|
92 |
-
To "propagate" a work means to do anything with it that, without
|
93 |
-
permission, would make you directly or secondarily liable for
|
94 |
-
infringement under applicable copyright law, except executing it on a
|
95 |
-
computer or modifying a private copy. Propagation includes copying,
|
96 |
-
distribution (with or without modification), making available to the
|
97 |
-
public, and in some countries other activities as well.
|
98 |
-
|
99 |
-
To "convey" a work means any kind of propagation that enables other
|
100 |
-
parties to make or receive copies. Mere interaction with a user through
|
101 |
-
a computer network, with no transfer of a copy, is not conveying.
|
102 |
-
|
103 |
-
An interactive user interface displays "Appropriate Legal Notices"
|
104 |
-
to the extent that it includes a convenient and prominently visible
|
105 |
-
feature that (1) displays an appropriate copyright notice, and (2)
|
106 |
-
tells the user that there is no warranty for the work (except to the
|
107 |
-
extent that warranties are provided), that licensees may convey the
|
108 |
-
work under this License, and how to view a copy of this License. If
|
109 |
-
the interface presents a list of user commands or options, such as a
|
110 |
-
menu, a prominent item in the list meets this criterion.
|
111 |
-
|
112 |
-
1. Source Code.
|
113 |
-
|
114 |
-
The "source code" for a work means the preferred form of the work
|
115 |
-
for making modifications to it. "Object code" means any non-source
|
116 |
-
form of a work.
|
117 |
-
|
118 |
-
A "Standard Interface" means an interface that either is an official
|
119 |
-
standard defined by a recognized standards body, or, in the case of
|
120 |
-
interfaces specified for a particular programming language, one that
|
121 |
-
is widely used among developers working in that language.
|
122 |
-
|
123 |
-
The "System Libraries" of an executable work include anything, other
|
124 |
-
than the work as a whole, that (a) is included in the normal form of
|
125 |
-
packaging a Major Component, but which is not part of that Major
|
126 |
-
Component, and (b) serves only to enable use of the work with that
|
127 |
-
Major Component, or to implement a Standard Interface for which an
|
128 |
-
implementation is available to the public in source code form. A
|
129 |
-
"Major Component", in this context, means a major essential component
|
130 |
-
(kernel, window system, and so on) of the specific operating system
|
131 |
-
(if any) on which the executable work runs, or a compiler used to
|
132 |
-
produce the work, or an object code interpreter used to run it.
|
133 |
-
|
134 |
-
The "Corresponding Source" for a work in object code form means all
|
135 |
-
the source code needed to generate, install, and (for an executable
|
136 |
-
work) run the object code and to modify the work, including scripts to
|
137 |
-
control those activities. However, it does not include the work's
|
138 |
-
System Libraries, or general-purpose tools or generally available free
|
139 |
-
programs which are used unmodified in performing those activities but
|
140 |
-
which are not part of the work. For example, Corresponding Source
|
141 |
-
includes interface definition files associated with source files for
|
142 |
-
the work, and the source code for shared libraries and dynamically
|
143 |
-
linked subprograms that the work is specifically designed to require,
|
144 |
-
such as by intimate data communication or control flow between those
|
145 |
-
subprograms and other parts of the work.
|
146 |
-
|
147 |
-
The Corresponding Source need not include anything that users
|
148 |
-
can regenerate automatically from other parts of the Corresponding
|
149 |
-
Source.
|
150 |
-
|
151 |
-
The Corresponding Source for a work in source code form is that
|
152 |
-
same work.
|
153 |
-
|
154 |
-
2. Basic Permissions.
|
155 |
-
|
156 |
-
All rights granted under this License are granted for the term of
|
157 |
-
copyright on the Program, and are irrevocable provided the stated
|
158 |
-
conditions are met. This License explicitly affirms your unlimited
|
159 |
-
permission to run the unmodified Program. The output from running a
|
160 |
-
covered work is covered by this License only if the output, given its
|
161 |
-
content, constitutes a covered work. This License acknowledges your
|
162 |
-
rights of fair use or other equivalent, as provided by copyright law.
|
163 |
-
|
164 |
-
You may make, run and propagate covered works that you do not
|
165 |
-
convey, without conditions so long as your license otherwise remains
|
166 |
-
in force. You may convey covered works to others for the sole purpose
|
167 |
-
of having them make modifications exclusively for you, or provide you
|
168 |
-
with facilities for running those works, provided that you comply with
|
169 |
-
the terms of this License in conveying all material for which you do
|
170 |
-
not control copyright. Those thus making or running the covered works
|
171 |
-
for you must do so exclusively on your behalf, under your direction
|
172 |
-
and control, on terms that prohibit them from making any copies of
|
173 |
-
your copyrighted material outside their relationship with you.
|
174 |
-
|
175 |
-
Conveying under any other circumstances is permitted solely under
|
176 |
-
the conditions stated below. Sublicensing is not allowed; section 10
|
177 |
-
makes it unnecessary.
|
178 |
-
|
179 |
-
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
180 |
-
|
181 |
-
No covered work shall be deemed part of an effective technological
|
182 |
-
measure under any applicable law fulfilling obligations under article
|
183 |
-
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
184 |
-
similar laws prohibiting or restricting circumvention of such
|
185 |
-
measures.
|
186 |
-
|
187 |
-
When you convey a covered work, you waive any legal power to forbid
|
188 |
-
circumvention of technological measures to the extent such circumvention
|
189 |
-
is effected by exercising rights under this License with respect to
|
190 |
-
the covered work, and you disclaim any intention to limit operation or
|
191 |
-
modification of the work as a means of enforcing, against the work's
|
192 |
-
users, your or third parties' legal rights to forbid circumvention of
|
193 |
-
technological measures.
|
194 |
-
|
195 |
-
4. Conveying Verbatim Copies.
|
196 |
-
|
197 |
-
You may convey verbatim copies of the Program's source code as you
|
198 |
-
receive it, in any medium, provided that you conspicuously and
|
199 |
-
appropriately publish on each copy an appropriate copyright notice;
|
200 |
-
keep intact all notices stating that this License and any
|
201 |
-
non-permissive terms added in accord with section 7 apply to the code;
|
202 |
-
keep intact all notices of the absence of any warranty; and give all
|
203 |
-
recipients a copy of this License along with the Program.
|
204 |
-
|
205 |
-
You may charge any price or no price for each copy that you convey,
|
206 |
-
and you may offer support or warranty protection for a fee.
|
207 |
-
|
208 |
-
5. Conveying Modified Source Versions.
|
209 |
-
|
210 |
-
You may convey a work based on the Program, or the modifications to
|
211 |
-
produce it from the Program, in the form of source code under the
|
212 |
-
terms of section 4, provided that you also meet all of these conditions:
|
213 |
-
|
214 |
-
a) The work must carry prominent notices stating that you modified
|
215 |
-
it, and giving a relevant date.
|
216 |
-
|
217 |
-
b) The work must carry prominent notices stating that it is
|
218 |
-
released under this License and any conditions added under section
|
219 |
-
7. This requirement modifies the requirement in section 4 to
|
220 |
-
"keep intact all notices".
|
221 |
-
|
222 |
-
c) You must license the entire work, as a whole, under this
|
223 |
-
License to anyone who comes into possession of a copy. This
|
224 |
-
License will therefore apply, along with any applicable section 7
|
225 |
-
additional terms, to the whole of the work, and all its parts,
|
226 |
-
regardless of how they are packaged. This License gives no
|
227 |
-
permission to license the work in any other way, but it does not
|
228 |
-
invalidate such permission if you have separately received it.
|
229 |
-
|
230 |
-
d) If the work has interactive user interfaces, each must display
|
231 |
-
Appropriate Legal Notices; however, if the Program has interactive
|
232 |
-
interfaces that do not display Appropriate Legal Notices, your
|
233 |
-
work need not make them do so.
|
234 |
-
|
235 |
-
A compilation of a covered work with other separate and independent
|
236 |
-
works, which are not by their nature extensions of the covered work,
|
237 |
-
and which are not combined with it such as to form a larger program,
|
238 |
-
in or on a volume of a storage or distribution medium, is called an
|
239 |
-
"aggregate" if the compilation and its resulting copyright are not
|
240 |
-
used to limit the access or legal rights of the compilation's users
|
241 |
-
beyond what the individual works permit. Inclusion of a covered work
|
242 |
-
in an aggregate does not cause this License to apply to the other
|
243 |
-
parts of the aggregate.
|
244 |
-
|
245 |
-
6. Conveying Non-Source Forms.
|
246 |
-
|
247 |
-
You may convey a covered work in object code form under the terms
|
248 |
-
of sections 4 and 5, provided that you also convey the
|
249 |
-
machine-readable Corresponding Source under the terms of this License,
|
250 |
-
in one of these ways:
|
251 |
-
|
252 |
-
a) Convey the object code in, or embodied in, a physical product
|
253 |
-
(including a physical distribution medium), accompanied by the
|
254 |
-
Corresponding Source fixed on a durable physical medium
|
255 |
-
customarily used for software interchange.
|
256 |
-
|
257 |
-
b) Convey the object code in, or embodied in, a physical product
|
258 |
-
(including a physical distribution medium), accompanied by a
|
259 |
-
written offer, valid for at least three years and valid for as
|
260 |
-
long as you offer spare parts or customer support for that product
|
261 |
-
model, to give anyone who possesses the object code either (1) a
|
262 |
-
copy of the Corresponding Source for all the software in the
|
263 |
-
product that is covered by this License, on a durable physical
|
264 |
-
medium customarily used for software interchange, for a price no
|
265 |
-
more than your reasonable cost of physically performing this
|
266 |
-
conveying of source, or (2) access to copy the
|
267 |
-
Corresponding Source from a network server at no charge.
|
268 |
-
|
269 |
-
c) Convey individual copies of the object code with a copy of the
|
270 |
-
written offer to provide the Corresponding Source. This
|
271 |
-
alternative is allowed only occasionally and noncommercially, and
|
272 |
-
only if you received the object code with such an offer, in accord
|
273 |
-
with subsection 6b.
|
274 |
-
|
275 |
-
d) Convey the object code by offering access from a designated
|
276 |
-
place (gratis or for a charge), and offer equivalent access to the
|
277 |
-
Corresponding Source in the same way through the same place at no
|
278 |
-
further charge. You need not require recipients to copy the
|
279 |
-
Corresponding Source along with the object code. If the place to
|
280 |
-
copy the object code is a network server, the Corresponding Source
|
281 |
-
may be on a different server (operated by you or a third party)
|
282 |
-
that supports equivalent copying facilities, provided you maintain
|
283 |
-
clear directions next to the object code saying where to find the
|
284 |
-
Corresponding Source. Regardless of what server hosts the
|
285 |
-
Corresponding Source, you remain obligated to ensure that it is
|
286 |
-
available for as long as needed to satisfy these requirements.
|
287 |
-
|
288 |
-
e) Convey the object code using peer-to-peer transmission, provided
|
289 |
-
you inform other peers where the object code and Corresponding
|
290 |
-
Source of the work are being offered to the general public at no
|
291 |
-
charge under subsection 6d.
|
292 |
-
|
293 |
-
A separable portion of the object code, whose source code is excluded
|
294 |
-
from the Corresponding Source as a System Library, need not be
|
295 |
-
included in conveying the object code work.
|
296 |
-
|
297 |
-
A "User Product" is either (1) a "consumer product", which means any
|
298 |
-
tangible personal property which is normally used for personal, family,
|
299 |
-
or household purposes, or (2) anything designed or sold for incorporation
|
300 |
-
into a dwelling. In determining whether a product is a consumer product,
|
301 |
-
doubtful cases shall be resolved in favor of coverage. For a particular
|
302 |
-
product received by a particular user, "normally used" refers to a
|
303 |
-
typical or common use of that class of product, regardless of the status
|
304 |
-
of the particular user or of the way in which the particular user
|
305 |
-
actually uses, or expects or is expected to use, the product. A product
|
306 |
-
is a consumer product regardless of whether the product has substantial
|
307 |
-
commercial, industrial or non-consumer uses, unless such uses represent
|
308 |
-
the only significant mode of use of the product.
|
309 |
-
|
310 |
-
"Installation Information" for a User Product means any methods,
|
311 |
-
procedures, authorization keys, or other information required to install
|
312 |
-
and execute modified versions of a covered work in that User Product from
|
313 |
-
a modified version of its Corresponding Source. The information must
|
314 |
-
suffice to ensure that the continued functioning of the modified object
|
315 |
-
code is in no case prevented or interfered with solely because
|
316 |
-
modification has been made.
|
317 |
-
|
318 |
-
If you convey an object code work under this section in, or with, or
|
319 |
-
specifically for use in, a User Product, and the conveying occurs as
|
320 |
-
part of a transaction in which the right of possession and use of the
|
321 |
-
User Product is transferred to the recipient in perpetuity or for a
|
322 |
-
fixed term (regardless of how the transaction is characterized), the
|
323 |
-
Corresponding Source conveyed under this section must be accompanied
|
324 |
-
by the Installation Information. But this requirement does not apply
|
325 |
-
if neither you nor any third party retains the ability to install
|
326 |
-
modified object code on the User Product (for example, the work has
|
327 |
-
been installed in ROM).
|
328 |
-
|
329 |
-
The requirement to provide Installation Information does not include a
|
330 |
-
requirement to continue to provide support service, warranty, or updates
|
331 |
-
for a work that has been modified or installed by the recipient, or for
|
332 |
-
the User Product in which it has been modified or installed. Access to a
|
333 |
-
network may be denied when the modification itself materially and
|
334 |
-
adversely affects the operation of the network or violates the rules and
|
335 |
-
protocols for communication across the network.
|
336 |
-
|
337 |
-
Corresponding Source conveyed, and Installation Information provided,
|
338 |
-
in accord with this section must be in a format that is publicly
|
339 |
-
documented (and with an implementation available to the public in
|
340 |
-
source code form), and must require no special password or key for
|
341 |
-
unpacking, reading or copying.
|
342 |
-
|
343 |
-
7. Additional Terms.
|
344 |
-
|
345 |
-
"Additional permissions" are terms that supplement the terms of this
|
346 |
-
License by making exceptions from one or more of its conditions.
|
347 |
-
Additional permissions that are applicable to the entire Program shall
|
348 |
-
be treated as though they were included in this License, to the extent
|
349 |
-
that they are valid under applicable law. If additional permissions
|
350 |
-
apply only to part of the Program, that part may be used separately
|
351 |
-
under those permissions, but the entire Program remains governed by
|
352 |
-
this License without regard to the additional permissions.
|
353 |
-
|
354 |
-
When you convey a copy of a covered work, you may at your option
|
355 |
-
remove any additional permissions from that copy, or from any part of
|
356 |
-
it. (Additional permissions may be written to require their own
|
357 |
-
removal in certain cases when you modify the work.) You may place
|
358 |
-
additional permissions on material, added by you to a covered work,
|
359 |
-
for which you have or can give appropriate copyright permission.
|
360 |
-
|
361 |
-
Notwithstanding any other provision of this License, for material you
|
362 |
-
add to a covered work, you may (if authorized by the copyright holders of
|
363 |
-
that material) supplement the terms of this License with terms:
|
364 |
-
|
365 |
-
a) Disclaiming warranty or limiting liability differently from the
|
366 |
-
terms of sections 15 and 16 of this License; or
|
367 |
-
|
368 |
-
b) Requiring preservation of specified reasonable legal notices or
|
369 |
-
author attributions in that material or in the Appropriate Legal
|
370 |
-
Notices displayed by works containing it; or
|
371 |
-
|
372 |
-
c) Prohibiting misrepresentation of the origin of that material, or
|
373 |
-
requiring that modified versions of such material be marked in
|
374 |
-
reasonable ways as different from the original version; or
|
375 |
-
|
376 |
-
d) Limiting the use for publicity purposes of names of licensors or
|
377 |
-
authors of the material; or
|
378 |
-
|
379 |
-
e) Declining to grant rights under trademark law for use of some
|
380 |
-
trade names, trademarks, or service marks; or
|
381 |
-
|
382 |
-
f) Requiring indemnification of licensors and authors of that
|
383 |
-
material by anyone who conveys the material (or modified versions of
|
384 |
-
it) with contractual assumptions of liability to the recipient, for
|
385 |
-
any liability that these contractual assumptions directly impose on
|
386 |
-
those licensors and authors.
|
387 |
-
|
388 |
-
All other non-permissive additional terms are considered "further
|
389 |
-
restrictions" within the meaning of section 10. If the Program as you
|
390 |
-
received it, or any part of it, contains a notice stating that it is
|
391 |
-
governed by this License along with a term that is a further
|
392 |
-
restriction, you may remove that term. If a license document contains
|
393 |
-
a further restriction but permits relicensing or conveying under this
|
394 |
-
License, you may add to a covered work material governed by the terms
|
395 |
-
of that license document, provided that the further restriction does
|
396 |
-
not survive such relicensing or conveying.
|
397 |
-
|
398 |
-
If you add terms to a covered work in accord with this section, you
|
399 |
-
must place, in the relevant source files, a statement of the
|
400 |
-
additional terms that apply to those files, or a notice indicating
|
401 |
-
where to find the applicable terms.
|
402 |
-
|
403 |
-
Additional terms, permissive or non-permissive, may be stated in the
|
404 |
-
form of a separately written license, or stated as exceptions;
|
405 |
-
the above requirements apply either way.
|
406 |
-
|
407 |
-
8. Termination.
|
408 |
-
|
409 |
-
You may not propagate or modify a covered work except as expressly
|
410 |
-
provided under this License. Any attempt otherwise to propagate or
|
411 |
-
modify it is void, and will automatically terminate your rights under
|
412 |
-
this License (including any patent licenses granted under the third
|
413 |
-
paragraph of section 11).
|
414 |
-
|
415 |
-
However, if you cease all violation of this License, then your
|
416 |
-
license from a particular copyright holder is reinstated (a)
|
417 |
-
provisionally, unless and until the copyright holder explicitly and
|
418 |
-
finally terminates your license, and (b) permanently, if the copyright
|
419 |
-
holder fails to notify you of the violation by some reasonable means
|
420 |
-
prior to 60 days after the cessation.
|
421 |
-
|
422 |
-
Moreover, your license from a particular copyright holder is
|
423 |
-
reinstated permanently if the copyright holder notifies you of the
|
424 |
-
violation by some reasonable means, this is the first time you have
|
425 |
-
received notice of violation of this License (for any work) from that
|
426 |
-
copyright holder, and you cure the violation prior to 30 days after
|
427 |
-
your receipt of the notice.
|
428 |
-
|
429 |
-
Termination of your rights under this section does not terminate the
|
430 |
-
licenses of parties who have received copies or rights from you under
|
431 |
-
this License. If your rights have been terminated and not permanently
|
432 |
-
reinstated, you do not qualify to receive new licenses for the same
|
433 |
-
material under section 10.
|
434 |
-
|
435 |
-
9. Acceptance Not Required for Having Copies.
|
436 |
-
|
437 |
-
You are not required to accept this License in order to receive or
|
438 |
-
run a copy of the Program. Ancillary propagation of a covered work
|
439 |
-
occurring solely as a consequence of using peer-to-peer transmission
|
440 |
-
to receive a copy likewise does not require acceptance. However,
|
441 |
-
nothing other than this License grants you permission to propagate or
|
442 |
-
modify any covered work. These actions infringe copyright if you do
|
443 |
-
not accept this License. Therefore, by modifying or propagating a
|
444 |
-
covered work, you indicate your acceptance of this License to do so.
|
445 |
-
|
446 |
-
10. Automatic Licensing of Downstream Recipients.
|
447 |
-
|
448 |
-
Each time you convey a covered work, the recipient automatically
|
449 |
-
receives a license from the original licensors, to run, modify and
|
450 |
-
propagate that work, subject to this License. You are not responsible
|
451 |
-
for enforcing compliance by third parties with this License.
|
452 |
-
|
453 |
-
An "entity transaction" is a transaction transferring control of an
|
454 |
-
organization, or substantially all assets of one, or subdividing an
|
455 |
-
organization, or merging organizations. If propagation of a covered
|
456 |
-
work results from an entity transaction, each party to that
|
457 |
-
transaction who receives a copy of the work also receives whatever
|
458 |
-
licenses to the work the party's predecessor in interest had or could
|
459 |
-
give under the previous paragraph, plus a right to possession of the
|
460 |
-
Corresponding Source of the work from the predecessor in interest, if
|
461 |
-
the predecessor has it or can get it with reasonable efforts.
|
462 |
-
|
463 |
-
You may not impose any further restrictions on the exercise of the
|
464 |
-
rights granted or affirmed under this License. For example, you may
|
465 |
-
not impose a license fee, royalty, or other charge for exercise of
|
466 |
-
rights granted under this License, and you may not initiate litigation
|
467 |
-
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
468 |
-
any patent claim is infringed by making, using, selling, offering for
|
469 |
-
sale, or importing the Program or any portion of it.
|
470 |
-
|
471 |
-
11. Patents.
|
472 |
-
|
473 |
-
A "contributor" is a copyright holder who authorizes use under this
|
474 |
-
License of the Program or a work on which the Program is based. The
|
475 |
-
work thus licensed is called the contributor's "contributor version".
|
476 |
-
|
477 |
-
A contributor's "essential patent claims" are all patent claims
|
478 |
-
owned or controlled by the contributor, whether already acquired or
|
479 |
-
hereafter acquired, that would be infringed by some manner, permitted
|
480 |
-
by this License, of making, using, or selling its contributor version,
|
481 |
-
but do not include claims that would be infringed only as a
|
482 |
-
consequence of further modification of the contributor version. For
|
483 |
-
purposes of this definition, "control" includes the right to grant
|
484 |
-
patent sublicenses in a manner consistent with the requirements of
|
485 |
-
this License.
|
486 |
-
|
487 |
-
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
488 |
-
patent license under the contributor's essential patent claims, to
|
489 |
-
make, use, sell, offer for sale, import and otherwise run, modify and
|
490 |
-
propagate the contents of its contributor version.
|
491 |
-
|
492 |
-
In the following three paragraphs, a "patent license" is any express
|
493 |
-
agreement or commitment, however denominated, not to enforce a patent
|
494 |
-
(such as an express permission to practice a patent or covenant not to
|
495 |
-
sue for patent infringement). To "grant" such a patent license to a
|
496 |
-
party means to make such an agreement or commitment not to enforce a
|
497 |
-
patent against the party.
|
498 |
-
|
499 |
-
If you convey a covered work, knowingly relying on a patent license,
|
500 |
-
and the Corresponding Source of the work is not available for anyone
|
501 |
-
to copy, free of charge and under the terms of this License, through a
|
502 |
-
publicly available network server or other readily accessible means,
|
503 |
-
then you must either (1) cause the Corresponding Source to be so
|
504 |
-
available, or (2) arrange to deprive yourself of the benefit of the
|
505 |
-
patent license for this particular work, or (3) arrange, in a manner
|
506 |
-
consistent with the requirements of this License, to extend the patent
|
507 |
-
license to downstream recipients. "Knowingly relying" means you have
|
508 |
-
actual knowledge that, but for the patent license, your conveying the
|
509 |
-
covered work in a country, or your recipient's use of the covered work
|
510 |
-
in a country, would infringe one or more identifiable patents in that
|
511 |
-
country that you have reason to believe are valid.
|
512 |
-
|
513 |
-
If, pursuant to or in connection with a single transaction or
|
514 |
-
arrangement, you convey, or propagate by procuring conveyance of, a
|
515 |
-
covered work, and grant a patent license to some of the parties
|
516 |
-
receiving the covered work authorizing them to use, propagate, modify
|
517 |
-
or convey a specific copy of the covered work, then the patent license
|
518 |
-
you grant is automatically extended to all recipients of the covered
|
519 |
-
work and works based on it.
|
520 |
-
|
521 |
-
A patent license is "discriminatory" if it does not include within
|
522 |
-
the scope of its coverage, prohibits the exercise of, or is
|
523 |
-
conditioned on the non-exercise of one or more of the rights that are
|
524 |
-
specifically granted under this License. You may not convey a covered
|
525 |
-
work if you are a party to an arrangement with a third party that is
|
526 |
-
in the business of distributing software, under which you make payment
|
527 |
-
to the third party based on the extent of your activity of conveying
|
528 |
-
the work, and under which the third party grants, to any of the
|
529 |
-
parties who would receive the covered work from you, a discriminatory
|
530 |
-
patent license (a) in connection with copies of the covered work
|
531 |
-
conveyed by you (or copies made from those copies), or (b) primarily
|
532 |
-
for and in connection with specific products or compilations that
|
533 |
-
contain the covered work, unless you entered into that arrangement,
|
534 |
-
or that patent license was granted, prior to 28 March 2007.
|
535 |
-
|
536 |
-
Nothing in this License shall be construed as excluding or limiting
|
537 |
-
any implied license or other defenses to infringement that may
|
538 |
-
otherwise be available to you under applicable patent law.
|
539 |
-
|
540 |
-
12. No Surrender of Others' Freedom.
|
541 |
-
|
542 |
-
If conditions are imposed on you (whether by court order, agreement or
|
543 |
-
otherwise) that contradict the conditions of this License, they do not
|
544 |
-
excuse you from the conditions of this License. If you cannot convey a
|
545 |
-
covered work so as to satisfy simultaneously your obligations under this
|
546 |
-
License and any other pertinent obligations, then as a consequence you may
|
547 |
-
not convey it at all. For example, if you agree to terms that obligate you
|
548 |
-
to collect a royalty for further conveying from those to whom you convey
|
549 |
-
the Program, the only way you could satisfy both those terms and this
|
550 |
-
License would be to refrain entirely from conveying the Program.
|
551 |
-
|
552 |
-
13. Use with the GNU Affero General Public License.
|
553 |
-
|
554 |
-
Notwithstanding any other provision of this License, you have
|
555 |
-
permission to link or combine any covered work with a work licensed
|
556 |
-
under version 3 of the GNU Affero General Public License into a single
|
557 |
-
combined work, and to convey the resulting work. The terms of this
|
558 |
-
License will continue to apply to the part which is the covered work,
|
559 |
-
but the special requirements of the GNU Affero General Public License,
|
560 |
-
section 13, concerning interaction through a network will apply to the
|
561 |
-
combination as such.
|
562 |
-
|
563 |
-
14. Revised Versions of this License.
|
564 |
-
|
565 |
-
The Free Software Foundation may publish revised and/or new versions of
|
566 |
-
the GNU General Public License from time to time. Such new versions will
|
567 |
-
be similar in spirit to the present version, but may differ in detail to
|
568 |
-
address new problems or concerns.
|
569 |
-
|
570 |
-
Each version is given a distinguishing version number. If the
|
571 |
-
Program specifies that a certain numbered version of the GNU General
|
572 |
-
Public License "or any later version" applies to it, you have the
|
573 |
-
option of following the terms and conditions either of that numbered
|
574 |
-
version or of any later version published by the Free Software
|
575 |
-
Foundation. If the Program does not specify a version number of the
|
576 |
-
GNU General Public License, you may choose any version ever published
|
577 |
-
by the Free Software Foundation.
|
578 |
-
|
579 |
-
If the Program specifies that a proxy can decide which future
|
580 |
-
versions of the GNU General Public License can be used, that proxy's
|
581 |
-
public statement of acceptance of a version permanently authorizes you
|
582 |
-
to choose that version for the Program.
|
583 |
-
|
584 |
-
Later license versions may give you additional or different
|
585 |
-
permissions. However, no additional obligations are imposed on any
|
586 |
-
author or copyright holder as a result of your choosing to follow a
|
587 |
-
later version.
|
588 |
-
|
589 |
-
15. Disclaimer of Warranty.
|
590 |
-
|
591 |
-
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
592 |
-
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
593 |
-
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
594 |
-
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
595 |
-
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
596 |
-
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
597 |
-
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
598 |
-
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
599 |
-
|
600 |
-
16. Limitation of Liability.
|
601 |
-
|
602 |
-
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
603 |
-
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
604 |
-
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
605 |
-
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
606 |
-
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
607 |
-
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
608 |
-
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
609 |
-
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
610 |
-
SUCH DAMAGES.
|
611 |
-
|
612 |
-
17. Interpretation of Sections 15 and 16.
|
613 |
-
|
614 |
-
If the disclaimer of warranty and limitation of liability provided
|
615 |
-
above cannot be given local legal effect according to their terms,
|
616 |
-
reviewing courts shall apply local law that most closely approximates
|
617 |
-
an absolute waiver of all civil liability in connection with the
|
618 |
-
Program, unless a warranty or assumption of liability accompanies a
|
619 |
-
copy of the Program in return for a fee.
|
620 |
-
|
621 |
-
END OF TERMS AND CONDITIONS
|
622 |
-
|
623 |
-
How to Apply These Terms to Your New Programs
|
624 |
-
|
625 |
-
If you develop a new program, and you want it to be of the greatest
|
626 |
-
possible use to the public, the best way to achieve this is to make it
|
627 |
-
free software which everyone can redistribute and change under these terms.
|
628 |
-
|
629 |
-
To do so, attach the following notices to the program. It is safest
|
630 |
-
to attach them to the start of each source file to most effectively
|
631 |
-
state the exclusion of warranty; and each file should have at least
|
632 |
-
the "copyright" line and a pointer to where the full notice is found.
|
633 |
-
|
634 |
-
ultimate-upscale-for-automatic1111
|
635 |
-
Copyright (C) 2023 Mirzam
|
636 |
-
|
637 |
-
This program is free software: you can redistribute it and/or modify
|
638 |
-
it under the terms of the GNU General Public License as published by
|
639 |
-
the Free Software Foundation, either version 3 of the License, or
|
640 |
-
(at your option) any later version.
|
641 |
-
|
642 |
-
This program is distributed in the hope that it will be useful,
|
643 |
-
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
644 |
-
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
645 |
-
GNU General Public License for more details.
|
646 |
-
|
647 |
-
You should have received a copy of the GNU General Public License
|
648 |
-
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
649 |
-
|
650 |
-
Also add information on how to contact you by electronic and paper mail.
|
651 |
-
|
652 |
-
If the program does terminal interaction, make it output a short
|
653 |
-
notice like this when it starts in an interactive mode:
|
654 |
-
|
655 |
-
<program> Copyright (C) 2023 Mirzam
|
656 |
-
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
657 |
-
This is free software, and you are welcome to redistribute it
|
658 |
-
under certain conditions; type `show c' for details.
|
659 |
-
|
660 |
-
The hypothetical commands `show w' and `show c' should show the appropriate
|
661 |
-
parts of the General Public License. Of course, your program's commands
|
662 |
-
might be different; for a GUI interface, you would use an "about box".
|
663 |
-
|
664 |
-
You should also get your employer (if you work as a programmer) or school,
|
665 |
-
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
666 |
-
For more information on this, and how to apply and follow the GNU GPL, see
|
667 |
-
<https://www.gnu.org/licenses/>.
|
668 |
-
|
669 |
-
The GNU General Public License does not permit incorporating your program
|
670 |
-
into proprietary programs. If your program is a subroutine library, you
|
671 |
-
may consider it more useful to permit linking proprietary applications with
|
672 |
-
the library. If this is what you want to do, use the GNU Lesser General
|
673 |
-
Public License instead of this License. But first, please read
|
674 |
-
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ultimate-upscale-for-automatic1111/README.md
DELETED
@@ -1,119 +0,0 @@
|
|
1 |
-
# Ultimate SD Upscale extension for [AUTOMATIC1111 Stable Diffusion web UI](https://github.com/AUTOMATIC1111/stable-diffusion-webui)
|
2 |
-
Now you have the opportunity to use a large denoise (0.3-0.5) and not spawn many artifacts. Works on any video card, since you can use a 512x512 tile size and the image will converge.
|
3 |
-
|
4 |
-
News channel: https://t.me/usdunews
|
5 |
-
|
6 |
-
# Instructions
|
7 |
-
All instructions can be found on the project's [wiki](https://github.com/Coyote-A/ultimate-upscale-for-automatic1111/wiki).
|
8 |
-
|
9 |
-
# Refs
|
10 |
-
|
11 |
-
https://github.com/ssitu/ComfyUI_UltimateSDUpscale - Implementation for ComfyUI
|
12 |
-
|
13 |
-
# Examples
|
14 |
-
More on [wiki page](https://github.com/Coyote-A/ultimate-upscale-for-automatic1111/wiki/Examples)
|
15 |
-
|
16 |
-
<details>
|
17 |
-
<summary>E1</summary>
|
18 |
-
Original image
|
19 |
-
|
20 |
-
![Original](https://i.imgur.com/J8mRYOD.png)
|
21 |
-
|
22 |
-
2k upscaled. **Tile size**: 512, **Padding**: 32, **Mask blur**: 16, **Denoise**: 0.4
|
23 |
-
![2k upscale](https://i.imgur.com/0aKua4r.png)
|
24 |
-
</details>
|
25 |
-
|
26 |
-
<details>
|
27 |
-
<summary>E2</summary>
|
28 |
-
Original image
|
29 |
-
|
30 |
-
![Original](https://i.imgur.com/aALNI2w.png)
|
31 |
-
|
32 |
-
2k upscaled. **Tile size**: 768, **Padding**: 55, **Mask blur**: 20, **Denoise**: 0.35
|
33 |
-
![2k upscale](https://i.imgur.com/B5PHz0J.png)
|
34 |
-
|
35 |
-
4k upscaled. **Tile size**: 768, **Padding**: 55, **Mask blur**: 20, **Denoise**: 0.35
|
36 |
-
![4k upscale](https://i.imgur.com/tIUQ7TJ.jpg)
|
37 |
-
</details>
|
38 |
-
|
39 |
-
<details>
|
40 |
-
<summary>E3</summary>
|
41 |
-
Original image
|
42 |
-
|
43 |
-
![Original](https://i.imgur.com/AGtszA8.png)
|
44 |
-
|
45 |
-
4k upscaled. **Tile size**: 768, **Padding**: 55, **Mask blur**: 20, **Denoise**: 0.4
|
46 |
-
![4k upscale](https://i.imgur.com/LCYLfCs.jpg)
|
47 |
-
</details>
|
48 |
-
|
49 |
-
# API Usage
|
50 |
-
|
51 |
-
```javascript
|
52 |
-
{
|
53 |
-
"script_name" : "ultimate sd upscale",
|
54 |
-
"script_args" : [
|
55 |
-
null, // _ (not used)
|
56 |
-
512, // tile_width
|
57 |
-
512, // tile_height
|
58 |
-
8, // mask_blur
|
59 |
-
32, // padding
|
60 |
-
64, // seams_fix_width
|
61 |
-
0.35, // seams_fix_denoise
|
62 |
-
32, // seams_fix_padding
|
63 |
-
0, // upscaler_index
|
64 |
-
true, // save_upscaled_image a.k.a Upscaled
|
65 |
-
0, // redraw_mode
|
66 |
-
false, // save_seams_fix_image a.k.a Seams fix
|
67 |
-
8, // seams_fix_mask_blur
|
68 |
-
0, // seams_fix_type
|
69 |
-
0, // target_size_type
|
70 |
-
2048, // custom_width
|
71 |
-
2048, // custom_height
|
72 |
-
2 // custom_scale
|
73 |
-
]
|
74 |
-
}
|
75 |
-
```
|
76 |
-
upscaler_index
|
77 |
-
| Value | |
|
78 |
-
|:-------------:| -----:|
|
79 |
-
| 0 | None |
|
80 |
-
| 1 | Lanczos |
|
81 |
-
| 2 | Nearest |
|
82 |
-
| 3 | ESRGAN_4x |
|
83 |
-
| 4 | LDSR |
|
84 |
-
| 5 | R-ESRGAN_4x+ |
|
85 |
-
| 6 | R-ESRGAN 4x+ Anime6B |
|
86 |
-
| 7 | ScuNET GAN |
|
87 |
-
| 8 | ScuNET PSNR |
|
88 |
-
| 9 | SwinIR 4x |
|
89 |
-
|
90 |
-
redraw_mode
|
91 |
-
| Value | |
|
92 |
-
|:-------------:| -----:|
|
93 |
-
| 0 | Linear |
|
94 |
-
| 1 | Chess |
|
95 |
-
| 2 | None |
|
96 |
-
|
97 |
-
seams_fix_mask_blur
|
98 |
-
| Value | |
|
99 |
-
|:-------------:| -----:|
|
100 |
-
| 0 | None |
|
101 |
-
| 1 | BAND_PASS |
|
102 |
-
| 2 | HALF_TILE |
|
103 |
-
| 3 | HALF_TILE_PLUS_INTERSECTIONS |
|
104 |
-
|
105 |
-
seams_fix_type
|
106 |
-
| Value | |
|
107 |
-
|:-------------:| -----:|
|
108 |
-
| 0 | None |
|
109 |
-
| 1 | Band pass |
|
110 |
-
| 2 | Half tile offset pass |
|
111 |
-
| 3 | Half tile offset pass + intersections |
|
112 |
-
|
113 |
-
seams_fix_type
|
114 |
-
| Value | |
|
115 |
-
|:-------------:| -----:|
|
116 |
-
| 0 | From img2img2 settings |
|
117 |
-
| 1 | Custom size |
|
118 |
-
| 2 | Scale from image size |
|
119 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ultimate-upscale-for-automatic1111/scripts/__pycache__/ultimate-upscale.cpython-310.pyc
DELETED
Binary file (16.6 kB)
|
|
ultimate-upscale-for-automatic1111/scripts/ultimate-upscale.py
DELETED
@@ -1,559 +0,0 @@
|
|
1 |
-
import math
|
2 |
-
import gradio as gr
|
3 |
-
from PIL import Image, ImageDraw, ImageOps
|
4 |
-
from modules import processing, shared, images, devices, scripts
|
5 |
-
from modules.processing import StableDiffusionProcessing
|
6 |
-
from modules.processing import Processed
|
7 |
-
from modules.shared import opts, state
|
8 |
-
from enum import Enum
|
9 |
-
|
10 |
-
elem_id_prefix = "ultimateupscale"
|
11 |
-
|
12 |
-
class USDUMode(Enum):
|
13 |
-
LINEAR = 0
|
14 |
-
CHESS = 1
|
15 |
-
NONE = 2
|
16 |
-
|
17 |
-
class USDUSFMode(Enum):
|
18 |
-
NONE = 0
|
19 |
-
BAND_PASS = 1
|
20 |
-
HALF_TILE = 2
|
21 |
-
HALF_TILE_PLUS_INTERSECTIONS = 3
|
22 |
-
|
23 |
-
class USDUpscaler():
|
24 |
-
|
25 |
-
def __init__(self, p, image, upscaler_index:int, save_redraw, save_seams_fix, tile_width, tile_height) -> None:
|
26 |
-
self.p:StableDiffusionProcessing = p
|
27 |
-
self.image:Image = image
|
28 |
-
self.scale_factor = math.ceil(max(p.width, p.height) / max(image.width, image.height))
|
29 |
-
self.upscaler = shared.sd_upscalers[upscaler_index]
|
30 |
-
self.redraw = USDURedraw()
|
31 |
-
self.redraw.save = save_redraw
|
32 |
-
self.redraw.tile_width = tile_width if tile_width > 0 else tile_height
|
33 |
-
self.redraw.tile_height = tile_height if tile_height > 0 else tile_width
|
34 |
-
self.seams_fix = USDUSeamsFix()
|
35 |
-
self.seams_fix.save = save_seams_fix
|
36 |
-
self.seams_fix.tile_width = tile_width if tile_width > 0 else tile_height
|
37 |
-
self.seams_fix.tile_height = tile_height if tile_height > 0 else tile_width
|
38 |
-
self.initial_info = None
|
39 |
-
self.rows = math.ceil(self.p.height / self.redraw.tile_height)
|
40 |
-
self.cols = math.ceil(self.p.width / self.redraw.tile_width)
|
41 |
-
|
42 |
-
def get_factor(self, num):
|
43 |
-
# Its just return, don't need elif
|
44 |
-
if num == 1:
|
45 |
-
return 2
|
46 |
-
if num % 4 == 0:
|
47 |
-
return 4
|
48 |
-
if num % 3 == 0:
|
49 |
-
return 3
|
50 |
-
if num % 2 == 0:
|
51 |
-
return 2
|
52 |
-
return 0
|
53 |
-
|
54 |
-
def get_factors(self):
|
55 |
-
scales = []
|
56 |
-
current_scale = 1
|
57 |
-
current_scale_factor = self.get_factor(self.scale_factor)
|
58 |
-
while current_scale_factor == 0:
|
59 |
-
self.scale_factor += 1
|
60 |
-
current_scale_factor = self.get_factor(self.scale_factor)
|
61 |
-
while current_scale < self.scale_factor:
|
62 |
-
current_scale_factor = self.get_factor(self.scale_factor // current_scale)
|
63 |
-
scales.append(current_scale_factor)
|
64 |
-
current_scale = current_scale * current_scale_factor
|
65 |
-
if current_scale_factor == 0:
|
66 |
-
break
|
67 |
-
self.scales = enumerate(scales)
|
68 |
-
|
69 |
-
def upscale(self):
|
70 |
-
# Log info
|
71 |
-
print(f"Canva size: {self.p.width}x{self.p.height}")
|
72 |
-
print(f"Image size: {self.image.width}x{self.image.height}")
|
73 |
-
print(f"Scale factor: {self.scale_factor}")
|
74 |
-
# Check upscaler is not empty
|
75 |
-
if self.upscaler.name == "None":
|
76 |
-
self.image = self.image.resize((self.p.width, self.p.height), resample=Image.LANCZOS)
|
77 |
-
return
|
78 |
-
# Get list with scale factors
|
79 |
-
self.get_factors()
|
80 |
-
# Upscaling image over all factors
|
81 |
-
for index, value in self.scales:
|
82 |
-
print(f"Upscaling iteration {index+1} with scale factor {value}")
|
83 |
-
self.image = self.upscaler.scaler.upscale(self.image, value, self.upscaler.data_path)
|
84 |
-
# Resize image to set values
|
85 |
-
self.image = self.image.resize((self.p.width, self.p.height), resample=Image.LANCZOS)
|
86 |
-
|
87 |
-
def setup_redraw(self, redraw_mode, padding, mask_blur):
|
88 |
-
self.redraw.mode = USDUMode(redraw_mode)
|
89 |
-
self.redraw.enabled = self.redraw.mode != USDUMode.NONE
|
90 |
-
self.redraw.padding = padding
|
91 |
-
self.p.mask_blur = mask_blur
|
92 |
-
|
93 |
-
def setup_seams_fix(self, padding, denoise, mask_blur, width, mode):
|
94 |
-
self.seams_fix.padding = padding
|
95 |
-
self.seams_fix.denoise = denoise
|
96 |
-
self.seams_fix.mask_blur = mask_blur
|
97 |
-
self.seams_fix.width = width
|
98 |
-
self.seams_fix.mode = USDUSFMode(mode)
|
99 |
-
self.seams_fix.enabled = self.seams_fix.mode != USDUSFMode.NONE
|
100 |
-
|
101 |
-
def save_image(self):
|
102 |
-
if type(self.p.prompt) != list:
|
103 |
-
images.save_image(self.image, self.p.outpath_samples, "", self.p.seed, self.p.prompt, opts.samples_format, info=self.initial_info, p=self.p)
|
104 |
-
else:
|
105 |
-
images.save_image(self.image, self.p.outpath_samples, "", self.p.seed, self.p.prompt[0], opts.samples_format, info=self.initial_info, p=self.p)
|
106 |
-
|
107 |
-
def calc_jobs_count(self):
|
108 |
-
redraw_job_count = (self.rows * self.cols) if self.redraw.enabled else 0
|
109 |
-
seams_job_count = 0
|
110 |
-
if self.seams_fix.mode == USDUSFMode.BAND_PASS:
|
111 |
-
seams_job_count = self.rows + self.cols - 2
|
112 |
-
elif self.seams_fix.mode == USDUSFMode.HALF_TILE:
|
113 |
-
seams_job_count = self.rows * (self.cols - 1) + (self.rows - 1) * self.cols
|
114 |
-
elif self.seams_fix.mode == USDUSFMode.HALF_TILE_PLUS_INTERSECTIONS:
|
115 |
-
seams_job_count = self.rows * (self.cols - 1) + (self.rows - 1) * self.cols + (self.rows - 1) * (self.cols - 1)
|
116 |
-
|
117 |
-
state.job_count = redraw_job_count + seams_job_count
|
118 |
-
|
119 |
-
def print_info(self):
|
120 |
-
print(f"Tile size: {self.redraw.tile_width}x{self.redraw.tile_height}")
|
121 |
-
print(f"Tiles amount: {self.rows * self.cols}")
|
122 |
-
print(f"Grid: {self.rows}x{self.cols}")
|
123 |
-
print(f"Redraw enabled: {self.redraw.enabled}")
|
124 |
-
print(f"Seams fix mode: {self.seams_fix.mode.name}")
|
125 |
-
|
126 |
-
def add_extra_info(self):
|
127 |
-
self.p.extra_generation_params["Ultimate SD upscale upscaler"] = self.upscaler.name
|
128 |
-
self.p.extra_generation_params["Ultimate SD upscale tile_width"] = self.redraw.tile_width
|
129 |
-
self.p.extra_generation_params["Ultimate SD upscale tile_height"] = self.redraw.tile_height
|
130 |
-
self.p.extra_generation_params["Ultimate SD upscale mask_blur"] = self.p.mask_blur
|
131 |
-
self.p.extra_generation_params["Ultimate SD upscale padding"] = self.redraw.padding
|
132 |
-
|
133 |
-
def process(self):
|
134 |
-
state.begin()
|
135 |
-
self.calc_jobs_count()
|
136 |
-
self.result_images = []
|
137 |
-
if self.redraw.enabled:
|
138 |
-
self.image = self.redraw.start(self.p, self.image, self.rows, self.cols)
|
139 |
-
self.initial_info = self.redraw.initial_info
|
140 |
-
self.result_images.append(self.image)
|
141 |
-
if self.redraw.save:
|
142 |
-
self.save_image()
|
143 |
-
|
144 |
-
if self.seams_fix.enabled:
|
145 |
-
self.image = self.seams_fix.start(self.p, self.image, self.rows, self.cols)
|
146 |
-
self.initial_info = self.seams_fix.initial_info
|
147 |
-
self.result_images.append(self.image)
|
148 |
-
if self.seams_fix.save:
|
149 |
-
self.save_image()
|
150 |
-
state.end()
|
151 |
-
|
152 |
-
class USDURedraw():
|
153 |
-
|
154 |
-
def init_draw(self, p, width, height):
|
155 |
-
p.inpaint_full_res = True
|
156 |
-
p.inpaint_full_res_padding = self.padding
|
157 |
-
p.width = math.ceil((self.tile_width+self.padding) / 64) * 64
|
158 |
-
p.height = math.ceil((self.tile_height+self.padding) / 64) * 64
|
159 |
-
mask = Image.new("L", (width, height), "black")
|
160 |
-
draw = ImageDraw.Draw(mask)
|
161 |
-
return mask, draw
|
162 |
-
|
163 |
-
def calc_rectangle(self, xi, yi):
|
164 |
-
x1 = xi * self.tile_width
|
165 |
-
y1 = yi * self.tile_height
|
166 |
-
x2 = xi * self.tile_width + self.tile_width
|
167 |
-
y2 = yi * self.tile_height + self.tile_height
|
168 |
-
|
169 |
-
return x1, y1, x2, y2
|
170 |
-
|
171 |
-
def linear_process(self, p, image, rows, cols):
|
172 |
-
mask, draw = self.init_draw(p, image.width, image.height)
|
173 |
-
for yi in range(rows):
|
174 |
-
for xi in range(cols):
|
175 |
-
if state.interrupted:
|
176 |
-
break
|
177 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="white")
|
178 |
-
p.init_images = [image]
|
179 |
-
p.image_mask = mask
|
180 |
-
processed = processing.process_images(p)
|
181 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="black")
|
182 |
-
if (len(processed.images) > 0):
|
183 |
-
image = processed.images[0]
|
184 |
-
|
185 |
-
p.width = image.width
|
186 |
-
p.height = image.height
|
187 |
-
self.initial_info = processed.infotext(p, 0)
|
188 |
-
|
189 |
-
return image
|
190 |
-
|
191 |
-
def chess_process(self, p, image, rows, cols):
|
192 |
-
mask, draw = self.init_draw(p, image.width, image.height)
|
193 |
-
tiles = []
|
194 |
-
# calc tiles colors
|
195 |
-
for yi in range(rows):
|
196 |
-
for xi in range(cols):
|
197 |
-
if state.interrupted:
|
198 |
-
break
|
199 |
-
if xi == 0:
|
200 |
-
tiles.append([])
|
201 |
-
color = xi % 2 == 0
|
202 |
-
if yi > 0 and yi % 2 != 0:
|
203 |
-
color = not color
|
204 |
-
tiles[yi].append(color)
|
205 |
-
|
206 |
-
for yi in range(len(tiles)):
|
207 |
-
for xi in range(len(tiles[yi])):
|
208 |
-
if state.interrupted:
|
209 |
-
break
|
210 |
-
if not tiles[yi][xi]:
|
211 |
-
tiles[yi][xi] = not tiles[yi][xi]
|
212 |
-
continue
|
213 |
-
tiles[yi][xi] = not tiles[yi][xi]
|
214 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="white")
|
215 |
-
p.init_images = [image]
|
216 |
-
p.image_mask = mask
|
217 |
-
processed = processing.process_images(p)
|
218 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="black")
|
219 |
-
if (len(processed.images) > 0):
|
220 |
-
image = processed.images[0]
|
221 |
-
|
222 |
-
for yi in range(len(tiles)):
|
223 |
-
for xi in range(len(tiles[yi])):
|
224 |
-
if state.interrupted:
|
225 |
-
break
|
226 |
-
if not tiles[yi][xi]:
|
227 |
-
continue
|
228 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="white")
|
229 |
-
p.init_images = [image]
|
230 |
-
p.image_mask = mask
|
231 |
-
processed = processing.process_images(p)
|
232 |
-
draw.rectangle(self.calc_rectangle(xi, yi), fill="black")
|
233 |
-
if (len(processed.images) > 0):
|
234 |
-
image = processed.images[0]
|
235 |
-
|
236 |
-
p.width = image.width
|
237 |
-
p.height = image.height
|
238 |
-
self.initial_info = processed.infotext(p, 0)
|
239 |
-
|
240 |
-
return image
|
241 |
-
|
242 |
-
def start(self, p, image, rows, cols):
|
243 |
-
self.initial_info = None
|
244 |
-
if self.mode == USDUMode.LINEAR:
|
245 |
-
return self.linear_process(p, image, rows, cols)
|
246 |
-
if self.mode == USDUMode.CHESS:
|
247 |
-
return self.chess_process(p, image, rows, cols)
|
248 |
-
|
249 |
-
class USDUSeamsFix():
|
250 |
-
|
251 |
-
def init_draw(self, p):
|
252 |
-
self.initial_info = None
|
253 |
-
p.width = math.ceil((self.tile_width+self.padding) / 64) * 64
|
254 |
-
p.height = math.ceil((self.tile_height+self.padding) / 64) * 64
|
255 |
-
|
256 |
-
def half_tile_process(self, p, image, rows, cols):
|
257 |
-
|
258 |
-
self.init_draw(p)
|
259 |
-
processed = None
|
260 |
-
|
261 |
-
gradient = Image.linear_gradient("L")
|
262 |
-
row_gradient = Image.new("L", (self.tile_width, self.tile_height), "black")
|
263 |
-
row_gradient.paste(gradient.resize(
|
264 |
-
(self.tile_width, self.tile_height//2), resample=Image.BICUBIC), (0, 0))
|
265 |
-
row_gradient.paste(gradient.rotate(180).resize(
|
266 |
-
(self.tile_width, self.tile_height//2), resample=Image.BICUBIC),
|
267 |
-
(0, self.tile_height//2))
|
268 |
-
col_gradient = Image.new("L", (self.tile_width, self.tile_height), "black")
|
269 |
-
col_gradient.paste(gradient.rotate(90).resize(
|
270 |
-
(self.tile_width//2, self.tile_height), resample=Image.BICUBIC), (0, 0))
|
271 |
-
col_gradient.paste(gradient.rotate(270).resize(
|
272 |
-
(self.tile_width//2, self.tile_height), resample=Image.BICUBIC), (self.tile_width//2, 0))
|
273 |
-
|
274 |
-
p.denoising_strength = self.denoise
|
275 |
-
p.mask_blur = self.mask_blur
|
276 |
-
|
277 |
-
for yi in range(rows-1):
|
278 |
-
for xi in range(cols):
|
279 |
-
if state.interrupted:
|
280 |
-
break
|
281 |
-
p.width = self.tile_width
|
282 |
-
p.height = self.tile_height
|
283 |
-
p.inpaint_full_res = True
|
284 |
-
p.inpaint_full_res_padding = self.padding
|
285 |
-
mask = Image.new("L", (image.width, image.height), "black")
|
286 |
-
mask.paste(row_gradient, (xi*self.tile_width, yi*self.tile_height + self.tile_height//2))
|
287 |
-
|
288 |
-
p.init_images = [image]
|
289 |
-
p.image_mask = mask
|
290 |
-
processed = processing.process_images(p)
|
291 |
-
if (len(processed.images) > 0):
|
292 |
-
image = processed.images[0]
|
293 |
-
|
294 |
-
for yi in range(rows):
|
295 |
-
for xi in range(cols-1):
|
296 |
-
if state.interrupted:
|
297 |
-
break
|
298 |
-
p.width = self.tile_width
|
299 |
-
p.height = self.tile_height
|
300 |
-
p.inpaint_full_res = True
|
301 |
-
p.inpaint_full_res_padding = self.padding
|
302 |
-
mask = Image.new("L", (image.width, image.height), "black")
|
303 |
-
mask.paste(col_gradient, (xi*self.tile_width+self.tile_width//2, yi*self.tile_height))
|
304 |
-
|
305 |
-
p.init_images = [image]
|
306 |
-
p.image_mask = mask
|
307 |
-
processed = processing.process_images(p)
|
308 |
-
if (len(processed.images) > 0):
|
309 |
-
image = processed.images[0]
|
310 |
-
|
311 |
-
p.width = image.width
|
312 |
-
p.height = image.height
|
313 |
-
if processed is not None:
|
314 |
-
self.initial_info = processed.infotext(p, 0)
|
315 |
-
|
316 |
-
return image
|
317 |
-
|
318 |
-
def half_tile_process_corners(self, p, image, rows, cols):
|
319 |
-
fixed_image = self.half_tile_process(p, image, rows, cols)
|
320 |
-
processed = None
|
321 |
-
self.init_draw(p)
|
322 |
-
gradient = Image.radial_gradient("L").resize(
|
323 |
-
(self.tile_width, self.tile_height), resample=Image.BICUBIC)
|
324 |
-
gradient = ImageOps.invert(gradient)
|
325 |
-
p.denoising_strength = self.denoise
|
326 |
-
#p.mask_blur = 0
|
327 |
-
p.mask_blur = self.mask_blur
|
328 |
-
|
329 |
-
for yi in range(rows-1):
|
330 |
-
for xi in range(cols-1):
|
331 |
-
if state.interrupted:
|
332 |
-
break
|
333 |
-
p.width = self.tile_width
|
334 |
-
p.height = self.tile_height
|
335 |
-
p.inpaint_full_res = True
|
336 |
-
p.inpaint_full_res_padding = 0
|
337 |
-
mask = Image.new("L", (fixed_image.width, fixed_image.height), "black")
|
338 |
-
mask.paste(gradient, (xi*self.tile_width + self.tile_width//2,
|
339 |
-
yi*self.tile_height + self.tile_height//2))
|
340 |
-
|
341 |
-
p.init_images = [fixed_image]
|
342 |
-
p.image_mask = mask
|
343 |
-
processed = processing.process_images(p)
|
344 |
-
if (len(processed.images) > 0):
|
345 |
-
fixed_image = processed.images[0]
|
346 |
-
|
347 |
-
p.width = fixed_image.width
|
348 |
-
p.height = fixed_image.height
|
349 |
-
if processed is not None:
|
350 |
-
self.initial_info = processed.infotext(p, 0)
|
351 |
-
|
352 |
-
return fixed_image
|
353 |
-
|
354 |
-
def band_pass_process(self, p, image, cols, rows):
|
355 |
-
|
356 |
-
self.init_draw(p)
|
357 |
-
processed = None
|
358 |
-
|
359 |
-
p.denoising_strength = self.denoise
|
360 |
-
p.mask_blur = 0
|
361 |
-
|
362 |
-
gradient = Image.linear_gradient("L")
|
363 |
-
mirror_gradient = Image.new("L", (256, 256), "black")
|
364 |
-
mirror_gradient.paste(gradient.resize((256, 128), resample=Image.BICUBIC), (0, 0))
|
365 |
-
mirror_gradient.paste(gradient.rotate(180).resize((256, 128), resample=Image.BICUBIC), (0, 128))
|
366 |
-
|
367 |
-
row_gradient = mirror_gradient.resize((image.width, self.width), resample=Image.BICUBIC)
|
368 |
-
col_gradient = mirror_gradient.rotate(90).resize((self.width, image.height), resample=Image.BICUBIC)
|
369 |
-
|
370 |
-
for xi in range(1, rows):
|
371 |
-
if state.interrupted:
|
372 |
-
break
|
373 |
-
p.width = self.width + self.padding * 2
|
374 |
-
p.height = image.height
|
375 |
-
p.inpaint_full_res = True
|
376 |
-
p.inpaint_full_res_padding = self.padding
|
377 |
-
mask = Image.new("L", (image.width, image.height), "black")
|
378 |
-
mask.paste(col_gradient, (xi * self.tile_width - self.width // 2, 0))
|
379 |
-
|
380 |
-
p.init_images = [image]
|
381 |
-
p.image_mask = mask
|
382 |
-
processed = processing.process_images(p)
|
383 |
-
if (len(processed.images) > 0):
|
384 |
-
image = processed.images[0]
|
385 |
-
for yi in range(1, cols):
|
386 |
-
if state.interrupted:
|
387 |
-
break
|
388 |
-
p.width = image.width
|
389 |
-
p.height = self.width + self.padding * 2
|
390 |
-
p.inpaint_full_res = True
|
391 |
-
p.inpaint_full_res_padding = self.padding
|
392 |
-
mask = Image.new("L", (image.width, image.height), "black")
|
393 |
-
mask.paste(row_gradient, (0, yi * self.tile_height - self.width // 2))
|
394 |
-
|
395 |
-
p.init_images = [image]
|
396 |
-
p.image_mask = mask
|
397 |
-
processed = processing.process_images(p)
|
398 |
-
if (len(processed.images) > 0):
|
399 |
-
image = processed.images[0]
|
400 |
-
|
401 |
-
p.width = image.width
|
402 |
-
p.height = image.height
|
403 |
-
if processed is not None:
|
404 |
-
self.initial_info = processed.infotext(p, 0)
|
405 |
-
|
406 |
-
return image
|
407 |
-
|
408 |
-
def start(self, p, image, rows, cols):
|
409 |
-
if USDUSFMode(self.mode) == USDUSFMode.BAND_PASS:
|
410 |
-
return self.band_pass_process(p, image, rows, cols)
|
411 |
-
elif USDUSFMode(self.mode) == USDUSFMode.HALF_TILE:
|
412 |
-
return self.half_tile_process(p, image, rows, cols)
|
413 |
-
elif USDUSFMode(self.mode) == USDUSFMode.HALF_TILE_PLUS_INTERSECTIONS:
|
414 |
-
return self.half_tile_process_corners(p, image, rows, cols)
|
415 |
-
else:
|
416 |
-
return image
|
417 |
-
|
418 |
-
class Script(scripts.Script):
|
419 |
-
def title(self):
|
420 |
-
return "Ultimate SD upscale"
|
421 |
-
|
422 |
-
def show(self, is_img2img):
|
423 |
-
return is_img2img
|
424 |
-
|
425 |
-
def ui(self, is_img2img):
|
426 |
-
|
427 |
-
target_size_types = [
|
428 |
-
"From img2img2 settings",
|
429 |
-
"Custom size",
|
430 |
-
"Scale from image size"
|
431 |
-
]
|
432 |
-
|
433 |
-
seams_fix_types = [
|
434 |
-
"None",
|
435 |
-
"Band pass",
|
436 |
-
"Half tile offset pass",
|
437 |
-
"Half tile offset pass + intersections"
|
438 |
-
]
|
439 |
-
|
440 |
-
redrow_modes = [
|
441 |
-
"Linear",
|
442 |
-
"Chess",
|
443 |
-
"None"
|
444 |
-
]
|
445 |
-
|
446 |
-
info = gr.HTML(
|
447 |
-
"<p style=\"margin-bottom:0.75em\">Will upscale the image depending on the selected target size type</p>")
|
448 |
-
|
449 |
-
with gr.Row():
|
450 |
-
target_size_type = gr.Dropdown(label="Target size type", elem_id=f"{elem_id_prefix}_target_size_type", choices=[k for k in target_size_types], type="index",
|
451 |
-
value=next(iter(target_size_types)))
|
452 |
-
|
453 |
-
custom_width = gr.Slider(label='Custom width', elem_id=f"{elem_id_prefix}_custom_width", minimum=64, maximum=8192, step=64, value=2048, visible=False, interactive=True)
|
454 |
-
custom_height = gr.Slider(label='Custom height', elem_id=f"{elem_id_prefix}_custom_height", minimum=64, maximum=8192, step=64, value=2048, visible=False, interactive=True)
|
455 |
-
custom_scale = gr.Slider(label='Scale', elem_id=f"{elem_id_prefix}_custom_scale", minimum=1, maximum=16, step=0.01, value=2, visible=False, interactive=True)
|
456 |
-
|
457 |
-
gr.HTML("<p style=\"margin-bottom:0.75em\">Redraw options:</p>")
|
458 |
-
with gr.Row():
|
459 |
-
upscaler_index = gr.Radio(label='Upscaler', elem_id=f"{elem_id_prefix}_upscaler_index", choices=[x.name for x in shared.sd_upscalers],
|
460 |
-
value=shared.sd_upscalers[0].name, type="index")
|
461 |
-
with gr.Row():
|
462 |
-
redraw_mode = gr.Dropdown(label="Type", elem_id=f"{elem_id_prefix}_redraw_mode", choices=[k for k in redrow_modes], type="index", value=next(iter(redrow_modes)))
|
463 |
-
tile_width = gr.Slider(elem_id=f"{elem_id_prefix}_tile_width", minimum=0, maximum=2048, step=64, label='Tile width', value=512)
|
464 |
-
tile_height = gr.Slider(elem_id=f"{elem_id_prefix}_tile_height", minimum=0, maximum=2048, step=64, label='Tile height', value=0)
|
465 |
-
mask_blur = gr.Slider(elem_id=f"{elem_id_prefix}_mask_blur", label='Mask blur', minimum=0, maximum=64, step=1, value=8)
|
466 |
-
padding = gr.Slider(elem_id=f"{elem_id_prefix}_padding", label='Padding', minimum=0, maximum=512, step=1, value=32)
|
467 |
-
gr.HTML("<p style=\"margin-bottom:0.75em\">Seams fix:</p>")
|
468 |
-
with gr.Row():
|
469 |
-
seams_fix_type = gr.Dropdown(label="Type", elem_id=f"{elem_id_prefix}_seams_fix_type", choices=[k for k in seams_fix_types], type="index", value=next(iter(seams_fix_types)))
|
470 |
-
seams_fix_denoise = gr.Slider(label='Denoise', elem_id=f"{elem_id_prefix}_seams_fix_denoise", minimum=0, maximum=1, step=0.01, value=0.35, visible=False, interactive=True)
|
471 |
-
seams_fix_width = gr.Slider(label='Width', elem_id=f"{elem_id_prefix}_seams_fix_width", minimum=0, maximum=128, step=1, value=64, visible=False, interactive=True)
|
472 |
-
seams_fix_mask_blur = gr.Slider(label='Mask blur', elem_id=f"{elem_id_prefix}_seams_fix_mask_blur", minimum=0, maximum=64, step=1, value=4, visible=False, interactive=True)
|
473 |
-
seams_fix_padding = gr.Slider(label='Padding', elem_id=f"{elem_id_prefix}_seams_fix_padding", minimum=0, maximum=128, step=1, value=16, visible=False, interactive=True)
|
474 |
-
gr.HTML("<p style=\"margin-bottom:0.75em\">Save options:</p>")
|
475 |
-
with gr.Row():
|
476 |
-
save_upscaled_image = gr.Checkbox(label="Upscaled", elem_id=f"{elem_id_prefix}_save_upscaled_image", value=True)
|
477 |
-
save_seams_fix_image = gr.Checkbox(label="Seams fix", elem_id=f"{elem_id_prefix}_save_seams_fix_image", value=False)
|
478 |
-
|
479 |
-
def select_fix_type(fix_index):
|
480 |
-
all_visible = fix_index != 0
|
481 |
-
mask_blur_visible = fix_index == 2 or fix_index == 3
|
482 |
-
width_visible = fix_index == 1
|
483 |
-
|
484 |
-
return [gr.update(visible=all_visible),
|
485 |
-
gr.update(visible=width_visible),
|
486 |
-
gr.update(visible=mask_blur_visible),
|
487 |
-
gr.update(visible=all_visible)]
|
488 |
-
|
489 |
-
seams_fix_type.change(
|
490 |
-
fn=select_fix_type,
|
491 |
-
inputs=seams_fix_type,
|
492 |
-
outputs=[seams_fix_denoise, seams_fix_width, seams_fix_mask_blur, seams_fix_padding]
|
493 |
-
)
|
494 |
-
|
495 |
-
def select_scale_type(scale_index):
|
496 |
-
is_custom_size = scale_index == 1
|
497 |
-
is_custom_scale = scale_index == 2
|
498 |
-
|
499 |
-
return [gr.update(visible=is_custom_size),
|
500 |
-
gr.update(visible=is_custom_size),
|
501 |
-
gr.update(visible=is_custom_scale),
|
502 |
-
]
|
503 |
-
|
504 |
-
target_size_type.change(
|
505 |
-
fn=select_scale_type,
|
506 |
-
inputs=target_size_type,
|
507 |
-
outputs=[custom_width, custom_height, custom_scale]
|
508 |
-
)
|
509 |
-
|
510 |
-
return [info, tile_width, tile_height, mask_blur, padding, seams_fix_width, seams_fix_denoise, seams_fix_padding,
|
511 |
-
upscaler_index, save_upscaled_image, redraw_mode, save_seams_fix_image, seams_fix_mask_blur,
|
512 |
-
seams_fix_type, target_size_type, custom_width, custom_height, custom_scale]
|
513 |
-
|
514 |
-
def run(self, p, _, tile_width, tile_height, mask_blur, padding, seams_fix_width, seams_fix_denoise, seams_fix_padding,
|
515 |
-
upscaler_index, save_upscaled_image, redraw_mode, save_seams_fix_image, seams_fix_mask_blur,
|
516 |
-
seams_fix_type, target_size_type, custom_width, custom_height, custom_scale):
|
517 |
-
|
518 |
-
# Init
|
519 |
-
processing.fix_seed(p)
|
520 |
-
devices.torch_gc()
|
521 |
-
|
522 |
-
p.do_not_save_grid = True
|
523 |
-
p.do_not_save_samples = True
|
524 |
-
p.inpaint_full_res = False
|
525 |
-
|
526 |
-
p.inpainting_fill = 1
|
527 |
-
p.n_iter = 1
|
528 |
-
p.batch_size = 1
|
529 |
-
|
530 |
-
seed = p.seed
|
531 |
-
|
532 |
-
# Init image
|
533 |
-
init_img = p.init_images[0]
|
534 |
-
if init_img == None:
|
535 |
-
return Processed(p, [], seed, "Empty image")
|
536 |
-
init_img = images.flatten(init_img, opts.img2img_background_color)
|
537 |
-
|
538 |
-
#override size
|
539 |
-
if target_size_type == 1:
|
540 |
-
p.width = custom_width
|
541 |
-
p.height = custom_height
|
542 |
-
if target_size_type == 2:
|
543 |
-
p.width = math.ceil((init_img.width * custom_scale) / 64) * 64
|
544 |
-
p.height = math.ceil((init_img.height * custom_scale) / 64) * 64
|
545 |
-
|
546 |
-
# Upscaling
|
547 |
-
upscaler = USDUpscaler(p, init_img, upscaler_index, save_upscaled_image, save_seams_fix_image, tile_width, tile_height)
|
548 |
-
upscaler.upscale()
|
549 |
-
|
550 |
-
# Drawing
|
551 |
-
upscaler.setup_redraw(redraw_mode, padding, mask_blur)
|
552 |
-
upscaler.setup_seams_fix(seams_fix_padding, seams_fix_denoise, seams_fix_mask_blur, seams_fix_width, seams_fix_type)
|
553 |
-
upscaler.print_info()
|
554 |
-
upscaler.add_extra_info()
|
555 |
-
upscaler.process()
|
556 |
-
result_images = upscaler.result_images
|
557 |
-
|
558 |
-
return Processed(p, result_images, seed, upscaler.initial_info if upscaler.initial_info is not None else "")
|
559 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|