The merging of neural radiance fields with generative adversarial networks (GANs) can synthesize novel views of objects from latent code (noise). However, the challenge for generative neural radiance fields (NERFs) is that a single multiple layer perceptron (MLP) network represents a scene or object, and the shape and appearance of the generated object are unpredictable, owing to the randomness of latent code. In this paper, we propose a stylized generative radiance field (SGRF) to produce 3D-aware images with explicit control. To achieve this goal, we manipulated the input and output of the MLP in the model to entangle and disentangle label codes into/from the latent code, and incorporated an extra discriminator to differentiate between the class and color mode of the generated object. Based on the labels provided, the model could generate images of prohibited items varying in class, pose, scale, and color mode, thereby significantly increasing the quantity and diversity of images in the dataset. Through a systematic analysis of the results, the method was demonstrated to be effective in improving the detection performance of deep learning algorithms during security screening.
Citation: Jian Liu, Zhen Yu, Wenyu Guo. The 3D-aware image synthesis of prohibited items in the X-ray security inspection by stylized generative radiance fields[J]. Electronic Research Archive, 2024, 32(3): 1801-1821. doi: 10.3934/era.2024082
[1] | Limin Liu, Hongjin Liu . Consistent pairs of s-torsion pairs in extriangulated categories with negative first extensions. AIMS Mathematics, 2024, 9(1): 1494-1508. doi: 10.3934/math.2024073 |
[2] | Xiaolin Xie, Hui Kou . The Cartesian closedness of c-spaces. AIMS Mathematics, 2022, 7(9): 16315-16327. doi: 10.3934/math.2022891 |
[3] | Zhen Zhang, Shance Wang . Silting objects and recollements of extriangulated categories. AIMS Mathematics, 2024, 9(9): 24796-24809. doi: 10.3934/math.20241207 |
[4] | Sana Khadim, Muhammad Qasim . Quotient reflective subcategories of the category of bounded uniform filter spaces. AIMS Mathematics, 2022, 7(9): 16632-16648. doi: 10.3934/math.2022911 |
[5] | Haijun Cao, Fang Xiao . The category of affine algebraic regular monoids. AIMS Mathematics, 2022, 7(2): 2666-2679. doi: 10.3934/math.2022150 |
[6] | Alessandro Linzi . Polygroup objects in regular categories. AIMS Mathematics, 2024, 9(5): 11247-11277. doi: 10.3934/math.2024552 |
[7] | Jinlei Dong, Fang Li, Longgang Sun . Derived equivalence, recollements under H-Galois extensions. AIMS Mathematics, 2023, 8(2): 3210-3225. doi: 10.3934/math.2023165 |
[8] | Yutong Zhou . Idempotent completion of right suspended categories. AIMS Mathematics, 2022, 7(7): 13442-13453. doi: 10.3934/math.2022743 |
[9] | Inga Timofejeva, Zenonas Navickas, Tadas Telksnys, Romas Marcinkevičius, Xiao-Jun Yang, Minvydas Ragulskis . The extension of analytic solutions to FDEs to the negative half-line. AIMS Mathematics, 2021, 6(4): 3257-3271. doi: 10.3934/math.2021195 |
[10] | Mesfer H. Alqahtani, Alaa M. Abd El-latif . Separation axioms via novel operators in the frame of topological spaces and applications. AIMS Mathematics, 2024, 9(6): 14213-14227. doi: 10.3934/math.2024690 |
The merging of neural radiance fields with generative adversarial networks (GANs) can synthesize novel views of objects from latent code (noise). However, the challenge for generative neural radiance fields (NERFs) is that a single multiple layer perceptron (MLP) network represents a scene or object, and the shape and appearance of the generated object are unpredictable, owing to the randomness of latent code. In this paper, we propose a stylized generative radiance field (SGRF) to produce 3D-aware images with explicit control. To achieve this goal, we manipulated the input and output of the MLP in the model to entangle and disentangle label codes into/from the latent code, and incorporated an extra discriminator to differentiate between the class and color mode of the generated object. Based on the labels provided, the model could generate images of prohibited items varying in class, pose, scale, and color mode, thereby significantly increasing the quantity and diversity of images in the dataset. Through a systematic analysis of the results, the method was demonstrated to be effective in improving the detection performance of deep learning algorithms during security screening.
Exact and triangulated categories are two important structures in category theory. Recently, Nakaoka and Palu [14] introduced the notion of extriangulated categories as a simultaneous generalization of exact categories and extension-closed subcategories of triangulated categories. After that, the study of extriangulated categories has become an active topic, and up to now, many results on exact categories and triangulated categories can be unified in the same framework.
Extension-closed subcategories form an important class of subcategories in representation theory of algebra. The existence of Auslander-Reiten sequences (resp., triangles) in extension-closed subcategories of abelian (resp., triangulated) categories is a very important topic in representation theory, for example, see [4,12] for the abelian case and [10] for the triangulated case. Jørgensen studied the Auslander-Reiten triangles in subcategories ending at non-Ext-projective objects in [11,Theorem 3.1], and Iyama, Nakaoka and Palu studied the extriangulated version in [8,Proposition 5.15]. In [6], Fedele considered minimal right almost split morphisms ending at Ext-projective objects in an extension-closed category of a triangulated category, and found something quite similar to Auslander-Reiten triangles in a suitable extension-closed subcategory. Extension-closed subcategories admit sometimes nice categorical structures, for example, extension-closed subcategories of abelian categories are exact categories. Extension-closed subcategories of triangulated categories are not necessarily triangulated, but they are extriangulated. In [11], Jørgensen showed that an extension-closed subcategory of a triangulated category admits an exact structure under some assumption. In [17], Zhou considered n-extension closed subcategories of (n+2)-angulated categories. Therefore, it is natural to ask whether there is a framework in the setting of extriangulated categories for these results. The aim of this paper is to prove the analogues of the triangulated results [6,Theorem A] and [11,Proposition 2.5(ⅰ)] into the extriangulated setup.
In Section 2, we recall some terminologies. In Section 3, we show that given an s-triangle in K, if β is a minimal right almost split morphism in X, and X is X-projective, then: (1) Y∉X, (2) α is an X-envelope of Y, (3) Y is indecomposable. This generalizes Fedele's result [6,Theorem A]. In Section 4, let K be an extriangulated category admitting a negative first extension E−1. In general, extension-closed subcategories of extriangulated categories are still extriangulated, but not necessarily exact. We show that if X is an extension-closed subcategory of K satisfying E−1(X,X)=0, then X is an exact category, which generalizes Jørgensen's result [11], Proposition 2.5(ⅰ)].
We first recall some notions from [14].
In this section, K is an additive category and E:Kop×K→Ab is a biadditive functor, where Ab is the category of abelian groups.
Let A,C∈K. An element δ∈E(C,A) is called an E-extension. Two sequences of morphisms
![]() |
in K are said to be equivalent if there exists an isomorphism b∈HomK(B,B′) such that x′=bx and y=y′b. We denote by the equivalence class of
. In particular, we write
For an E-extension δ∈E(C,A), we briefly write
a⋆δ:=E(C,a)(δ) and c⋆δ:=E(c,A)(δ). |
For two E-extensions δ∈E(C,A) and δ′∈E(C′,A′), a morphism from δ to δ′ is a pair (a,c) of morphisms with a∈HomK(A,A′) and c∈HomK(C,C′) such that a⋆δ=c⋆δ′.
Definition 2.1. ([14,Definition 2.9]) Let s be a correspondence which associates an equivalence class to each E-extension δ∈E(C,A). Such s is called a realization of E provided that it satisfies the following condition.
(R) Let δ∈E(C,A) and δ′∈E(C′,A′) be any pair of E-extensions with
![]() |
Then for any morphism (a,c):δ→δ′, there exists b∈HomK(B,B′) such that the following diagram
![]() |
commutes.
Let s be a realization of E. If for some E-extension δ∈E(C,A), then one says that the sequence
realizes δ; and in the condition (R), the triple (a,b,c) realizes the morphism (a,c).
For any two equivalence classes and
, we define
![]() |
Definition 2.2. ([14,Definition 2.10]) A realization s of E is called additive if it satisfies the following conditions.
(1) For any A,C∈K, the split E-extension 0∈E(C,A) satisfies s(0)=0.
(2) For any pair of E-extensions δ∈E(C,A) and δ′∈E(C′,A′), we have s(δ⊕δ′)=s(δ)⊕s(δ′).
Definition 2.3. ([14,Definition 2.12]) The triple (K,E,s) is called an externally triangulated (or extriangulated for short) category if it satisfies the following conditions.
(ET1) E:Kop×K→Ab is a biadditive functor.
(ET2) s is an additive realization of E.
(ET3) Let δ∈E(C,A) and δ′∈E(C′,A′) be any pair of E-extensions with
![]() |
For any commutative diagram
![]() |
in K, there exists a morphism (a,c):δ→δ′ which is realized by the triple (a,b,c).
(ET3)op Dual of (ET3).
(ET4) Let δ∈E(C,A) and ρ∈E(F,B) be any pair of E-extensions with
![]() |
Then there exist an object E∈K, an E-extension ξ with , and a commutative diagram
![]() |
in K, which satisfy the following compatibilities.
(i)
(ii) s⋆ξ=δ.
(iii) x⋆ξ=t⋆ρ.
(ET4)op Dual of (ET4).
Definition 2.4. ([14,Definitions 2.15,2.17 and 2.19]) Let K be an extriangulated category.
(1) A sequence in K is called a conflation if it realizes some E-extension δ∈E(C,A). In this case, x is called an inflation and y is called a deflation.
2 If a conflation in K realizes δ∈E(C,A), the pair
is called an E-triangle (or s-triangle, extriangle), and write it in the following way:
![]() |
We usually do not write this "δ" if it is not used in the argument.
(3) Let and
be any pair of E-triangles. If a triplet (a,b,c) realizes (a,c):δ→δ′, then we write it as
![]() |
and call (a,b,c) a morphism of E-triangles.
If a,b,c above are isomorphisms, then and
are said to be isomorphic.
(4) Let X be a full additive subcategory of K, closed under isomorphisms. The subcategory X is said to be extension-closed (or equivalently, closed under extensions) if, for any conflation A→B→C which satisfies A,C∈X, then B∈X.
Example 2.5. Both exact categories and triangulated categories are extriangulated categories (see [14,Proposition 3.22]) and extension closed subcategories of extriangulated categories are again extriangulated (see [14,Remark 2.18]). Moreover, there exist extriangulated categories which are neither exact categories nor triangulated categories, see [14,Proposition 3.30]. For more examples, see also [7,Theorem 1.2], [16,Example 2.8], [18,Corollary 4.12 and Remark 4.13].
Condition (WIC):
(1) Let f∈HomK(A,B), g∈HomK(B,C) be any composable pair of morphisms. If gf is an inflation, then so is f.
(2) Let f∈HomK(A,B), g∈HomK(B,C) be any composable pair of morphisms. If gf is a deflation, then so is g.
Assume that k is a field, and K a skeletally small k-linear Hom-finite Krull-Schmidt extriangulated category satisfying Condition (WIC). All subcategories are full, and closed under isomorphisms and direct summands.
Assume that X is an additive subcategory of K which is closed under extensions. We will investigate minimal right almost split deflations in X, and give a relation between minimal right almost split deflations of X-projective objects and X-envelopes in an s-triangle which generalizes [6,Theorem A]. The results follow closely part of Sections 2 and 3 from [6] and the proofs also follow by very similar arguments.
Definition 3.1. Let A,B∈X.
(1) A morphism α:A→B is called right almost split in X if α is not a split epimorphism, and for any C∈X, any morphism β:C→B which is not a split epimorphism factors through α. Dually, the notion of left almost split morphisms is given.
(2) A morphism α:A→B is called minimal right almost split in X if it is both right minimal and right almost split in X. A minimal left almost split morphism in X is defined dually.
Lemma 3.2. Let β:B→C be a right almost split morphism in X. Then C is indecomposable. Moreover, if β is right minimal and β′:B′→C is a minimal right almost split morphism in X, then there is an isomorphism φ:B→B′ such that β=β′φ.
Proof. The proof follows from the same argument of [6,Proposition 2.7].
Definition 3.3. An object X∈X is called X-injective if E(X,X)=0. An object X∈X is called X-projective if E(X,X)=0.
Lemma 3.4. ([6,Lemma 3.4]) Assume that f=(f1,f2):A1⊕A2→B is right minimal in K. Then f1 and f2 are right minimal.
Lemma 3.5. Let be an s-triangle in K. Then
(1) β∈radK(B,C) if and only if α is left minimal.
(2) α∈radK(A,B) if and only if β is right minimal.
Proof. (1) By [14,Proposition 3.3], there is an exact sequence
![]() |
Then the result holds by the dual of [9,Lemma 1.1].
(2) is similar.
Lemma 3.6. Let X∈X be indecomposable X-projective, and be a non-split s-triangle with X′∈X. Then α is an X-envelope of Y.
Moreover, if β is right minimal, then Y is indecomposable.
Proof. Applying HomK(−,X) to the given s-triangle, we have an exact sequence
![]() |
Since X is X-projective, E(X,X)=0, and hence HomK(α,X) is epic. This shows that α is an X-preenvelope of Y.
Since K is Krull-Schmidt, we can write X′=X′1⊕⋯⊕X′t, where X′1,⋯,X′t are indecomposable, and write β=(β1,⋯,βt), where βi:X′i→X, i=1,⋯,t. Since δ≠0, β is not a split epimorphism, and hence each βi is not a split epimorphism. By [3,Appendix,Proposition 3.5], each βi∈radK(X′i,X). Thus β∈radK(X′,X) by [3,Appendix,Lemma 3.4]. By Lemma 3.5(1), α is left minimal, and hence α is an X-envelope of Y.
Now let β be right minimal, and let Y=Y1⊕⋯⊕Yr, where each Yi is indecomposable. Let inc:Yi→Y be the inclusion. For any X″∈X, and any g:Yi→X″, consider the diagram
![]() |
Then there exists ¯g:Y→X″ such that g=¯g∘inc. Since α is an X-envelope of Y, there is h:X′→X″ with ¯g=hα. Thus g=¯g∘inc=h∘α∘inc, which shows that α∘inc:Yi→X′ is an X-preenvelope of Yi. Since K is Krull-Schmidt, there exists an X-envelope αi:Yi→Xi. Thus we get an X-envelope ⊕ri=1αi:⊕ri=1Yi→⊕ri=1Xi. But X-envelopes are unique up to isomorphisms, so we may assume that α=⊕ri=1αi and X′=⊕ri=1Xi. Note that since each αi:Yi→Xi is an X-envelope, we have a commutative diagram
![]() |
Then α∘inc is an inflation implies that αi is an inflation by Condition (WIC). Thus there exists an s-triangle . Consider the following diagram
![]() |
where the left square is commutative. By (ET3), there exists wi:Zi→X such that the following diagram
![]() |
commutates. Therefore, we get a commutative diagram
![]() |
By [14,Corollary 3.6], X≅⊕ti=1Zi. But X is indecomposable, so we may assume that X≅Z1, and Zi=0 for i≠1. This shows that wi=γi=0 and αi is an isomorphism for i≠1.
Now suppose that β=(β1,⋯,βr) is right minimal, by Lemma 3.4, each βi is right minimal. On the other hand, for i≠1, βi=β∘inc=wiγi=0, thus
β∘0=0=β=β∘1Bi, ∀i≠1⇒0=1Bi, ∀i≠1⇒Xi=0, ∀i≠1⇒Yi=0, ∀i≠1⇒Y=Y1 is indecomposable. |
Theorem 3.7. Let be an s-triangle in K. Assume that β is a minimal right almost split morphism in X, and X is X-projective. Then
(i) (1) Y∉X,
(2) α is an X-envelope of Y,
(3) Y is indecomposable.
(ii) If there is an s-triangle such that ˜β is a minimal right almost split morphism in X and ˜Xis X-projective, then X≅˜X if and only if Y≅˜Y.
Proof. (ⅰ) Since β is a right almost split morphism in X, X is indecomposable by Lemma 3.2. Now assume Y∈X. Since X is X-projective, we have E(X,Y)=0, and hence δ=0. Thus β is a split epimorphism, which is a contradiction. Hence Y∉X. By Lemma 3.6, α is an X-envelope of Y. Moreover, since β is right minimal, Y is indecomposable by Lemma 3.6.
(ⅱ) Using (ⅰ), we have that ˜Y∉X, ˜Y is indecomposable, and ˜α is an X-envelope of ˜Y.
The "only if" part. Assume that X≅˜X, that is, there is an isomorphism φ:X→˜X. Then ˜β:~X′→˜X and φβ:X′→˜X are minimal right almost split morphisms. By Lemma 3.2, there exists an isomorphism ψ:X′→~X′ such that φβ=˜βψ. Then we get the following commutative diagram
![]() |
By [14,Corollary 3.6], ϕ is an isomorphism, and hence Y≅˜Y.
The "if" part. Assume Y≅˜Y, that is, there is an isomorphism ϕ:Y→˜Y. Then α and ˜αϕ are X-envelopes of Y. Then X′≅~X′ since envelopes are unique up to isomorphisms. That is, there exists an isomorphism ψ:X′→~X′ such that ˜αϕ=ψα. Then we have the following commutative diagram
![]() |
By [14,Corollary 3.6], φ is an isomorphism, and hence X≅˜X.
Example 3.8. Let Λ=kQ be a finite-dimensional hereditary path algebra over an algebraically closed field k, where Q is the quiver
1←2←3. |
Then the Auslander-Reiten quiver of Λ is as follows ([3], Chapter Ⅳ, Example 4.10]):
![]() |
where the symbol [M] denotes the isomorphism class of a module M, and
(1) S1=(k←0←0), S2=(0←k←0) and S3=(0←0←k) are all simple modules;
(2) P1=S1, P2=(k←k←0) and P3=(k←k←k) are all indecomposable projective modules;
(3) I1=P3, I2=(0←k←k) and I3=S3 are all indecomposable injective modules.
Let K=modΛ be the category of finitely generated left Λ-modules. Then modΛ is an extriangulated category with E=Ext1Λ. Set X=add(I2⊕S3). Then X is closed under extensions. Clearly, there is an Auslander-Reiten sequence 0→S2α→I2β→I3→0 in modΛ. In particular, β is a minimal right almost split morphism. Moreover, since Ext1Λ(S3,I2⊕S3)≅DHomΛ(I2⊕S3,τS3)=DHomΛ(I2⊕S3,S2)=0, we have that S3 is X-projective. By Theorem 3.7, α is an X-envelope.
Remark 3.9. (1) An s-triangle in K of the form with A,B,C∈X is said to be an Auslander-Reiten s-triangle in X if
(i) δ≠0,
(ii) α is left almost split in X,
(iii) β is right almost split in X.
Clearly, the s-triangle given in Theorem 3.7 is not Auslander-Reiten s-triangle in X since the starting object is not in X at least.
(2) Let K=T be a triangulated category, [1] the shift functor, and E=HomT(−,−[1]). Then Theorem 3.7 recovers [6,Theorem A].
(3) Dual to Theorem 3.7, we have the following result: Let be an s-triangle in K. Assume that α is a minimal left almost split morphism in X, and Y is X-injective. Then
(i) (a) X∉X,
(b) β is an X-cover of X,
(c) X is indecomposable.
(ⅱ) If there is an s-triangle such that ˜α is a minimal left almost split morphism in X and ˜Y is X-injective, then Y≅˜Y if and only if X≅˜X.
Assume that K is an extriangulated category, and X be an extension-closed subcategory of K. By [14,Remark 2.18], X is also an extriangulated category. In this section, we will show that X has an exact structure under some assumptions, which generalizes [11,Proposition 2.5]. The results in this section follow closely part of Section 2 from [11] and that the proofs also follow by very similar arguments. An important difference is that in our setup one has to add the assumption that the extriangulated category has a negative first extension in order to obtain the needed exact sequences in our arguments, while in [11] these exact sequences come for free from the triangulated structure.
Definition 4.1. A homotopy cartesian square in K is a commutative diagram
![]() |
in K such that is a conflation.
Let X be an additive subcategory of K. We set
EX:={conflations X1→X2→X3 in K with X1,X2,X3∈X}. |
Definition 4.2. ([1,Definition 2.3]) A negative first extension structure on K consists of the following data:
(NE1) E−1:Kop×K→Ab is an additive bifunctor.
(NE2) For each δ∈E(C,A), there exist two natural transformations
δ−1♯:E−1(−,C)→HomK(−,A)δ♯−1:E−1(A,−)→HomK(C,−) |
such that for each and each W∈K, two sequences
![]() |
are exact.
In this case, we call (K,E,s,E−1) an extriangulated category with a negative first extension.
In what follows, we assume that K is an extriangulated category with a negative first extension E−1, and X is an additive subcategory of K which is closed under extensions and E−1(X,X)=0.
Lemma 4.3. Each conflation in EX is a kernel-cokernel pair in X.
Proof. For any X∈X, we have exact sequences
![]() |
(4.1) |
and
![]() |
(4.2) |
By assumption, E−1(X,X3)=0=E−1(X1,X). Thus the sequence (4.1) implies that f is a kernel of g, and the sequence (4.2) implies that g is a cokernel of f. Thus is a kernel-cokernel pair in X.
Lemma 4.4. Assume that the following diagram
![]() |
is a homotopy cartesian square with each Xi∈X. Then it is a pullback and a pushout in X.
Proof. By definition, there is an s-triangle . For any X∈X, there are exact sequences
![]() |
(4.3) |
and
![]() |
(4.4) |
By assumption, E−1(X,X4)=0=E−1(X1,X). Thus the sequence (4.3) implies that the given diagram is a pullback in X, and the sequence (4.4) implies that the given diagram is a pushout in X.
We recall the definition of exact categories from [5,Definition 2.1]. As proven by Bühler, it is equivalent to the original definition by Quillen from [15,Section 2]. Let C be an additive category. A kernel-cokernel pair (i,p) in C is a pair of composable morphisms such that i is a kernel of p and p is a cokernel of i. If a class E of kernel-cokernel pairs on C is fixed, a morphism i is called an inflation if there is a morphism p with (i,p)∈E. Deflations are defined dually.
Let C be an additive category. An exact structure on C is a class E of kernel-cokernel pairs which is closed under isomorphisms and satisfies the following axioms:
[E0] ∀A∈C, 1A is an inflation.
[E0op] ∀A∈C, 1A is a deflation.
[E1] The class of inflations is closed under composition.
[E1op] The class of deflations is closed under composition.
[E2] The pushout of an inflation along an arbitrary morphism exists and yields an inflation.
[E2op] The pullback of a deflation along an arbitrary morphism exists and yields a deflation.
An exact category is a pair (C,E) consisting of an additive category C and an exact structure E on C.
Theorem 4.5. (X,EX) is an exact category.
Proof. We will check [E0], [E1], [E2] and their dual.
[E0] and [E0op]: For each X∈X, there are s-triangles and
. Clearly,
and
belong to EX. Thus 1A is an inflation and a deflation.
[E1]: Let x:X0→X1 and y:X1→X2 be two inflations in X. Then there exist two conflations and
in EX. By (ET4), we have a commutative diagram
![]() |
where all rows and columns are conflations. Since X3,X4∈X, we have X5∈X, and hence Thus yx is an inflation in X. That is, inflations in X are closed under compositions.
[E1op]: Dual to [E1].
[E2]: Given a diagram
![]() |
in X, where x is an inflation. Then there is an s-triangle with X4∈X. By [13,Proposition 1.20], there exists a morphism φ:X2→X5 such that there is a morphism of s-triangles
![]() |
and meanwhile, there is a conflation . That is, the diagram
![]() |
is a homotopy cartesian diagram. Moreover, since X3,X4∈X, we have X5∈X. Thus by Lemma 4.4, this homotopy cartesian diagram is a pushout in X, and ϕ is an inflation in X.
[E2op] Dual to [E2].
Remark 4.6. Let K=T be a triangulated category, [1] the shift functor, E=HomT(−,−[1]), and E−1=HomT(−[1],−). Then Theorem 4.5 recovers [11,Proposition 2.5(1)].
Let X be an extension-closed subcategory of an extriangulated category K. We show that if C is X-projective and there is a minimal right almost split deflation in X ending by C, then there is an s-triangle ending by C which is very similar to an Auslander-Reiten triangle in X, and it generalizes [6,Theorem A]. We also show that if K admits a negative first extension E−1 and E−1(X,X)=0, then the subcategory X has an exact structure which generalizes [11,Proposition 2.5(ⅰ)].
This work was supported by the NSF of China (11901341), the project ZR2021QA001 supported by Shandong Provincial Natural Science Foundation, the project funded by China Postdoctoral Science Foundation (2020M682141), and Innovation Foundation for Graduate Dissertation of Qufu Normal University (LWCXB202105). The authors would like to thank the anonymous reviewers for their comments and suggestions.
The authors declare no conflict of interests.
[1] |
A. Chavaillaz, A. Schwaninger, S. Michel, J. Sauer, Expertise, automation and trust in X-ray screening of cabin baggage, Front. Psychol., 10 (2019), 256. https://doi.org/10.3389/fpsyg.2019.00256 doi: 10.3389/fpsyg.2019.00256
![]() |
[2] | D. Turcsany, A. Mouton, T. P. Breckon, Improving feature-based object recognition for X-ray baggage security screening using primed visual words, in 2013 IEEE International Conference on Industrial Technology (ICIT), IEEE, (2013), 1140–1145. https://doi.org/10.1109/ICIT.2013.6505833 |
[3] | Z. Chen, Y. Zheng, B. R. Abidi, D. L. Page, M. A. Abidi, A combinational approach to the fusion, de-noising and enhancement of dual-energy X-ray luggage images, in 2005 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, IEEE, (2005), 2. https://doi.org/10.1109/CVPR.2005.386 |
[4] |
B. R. Abidi, Y. Zheng, A. V. Gribok, M. A. Abidi, Improving weapon detection in single energy X-ray images through pseudo coloring, IEEE Trans. Syst. Man Cybern. Part C Appl. Rev., 36 (2006), 784–796. https://doi.org/10.1109/TSMCC.2005.855523 doi: 10.1109/TSMCC.2005.855523
![]() |
[5] |
Q. Lu, R. W. Conners, Using image processing methods to improve the explosive detection accuracy, IEEE Trans. Syst. Man Cybern. Part C Appl. Rev., 36 (2006), 750–760. https://doi.org/10.1109/TSMCC.2005.855532 doi: 10.1109/TSMCC.2005.855532
![]() |
[6] | T. W. Rogers, N. Jaccard, E. J. Morton, L. D. Griffin, Detection of cargo container loads from X-ray images, in 2nd IET International Conference on Intelligent Signal Processing 2015 (ISP), (2015), 1–6. https://doi.org/10.1049/cp.2015.1762 |
[7] | M. Kundegorski, S. Akçay, M. Devereux, A. Mouton, T. Breckon, On using feature descriptors as visual words for object detection within X-ray baggage security screening, in 7th International Conference on Imaging for Crime Detection and Prevention (ICDP), (2016), 1–6. https://doi.org/10.1049/ic.2016.0080 |
[8] | D. Mery, E. Svec, M. Arias, Object recognition in baggage inspection using adaptive sparse representations of X-ray images, in Image and Video Technology, Springer, 9431 (2016), 709–720. https://doi.org/10.1007/978-3-319-29451-3_56 |
[9] | T. Franzel, U. Schmidt, S. Roth, Object detection in multi-view X-ray images, in Pattern Recognition, Springer, 7476 (2012), 144–154. https://doi.org/10.1007/978-3-642-32717-9_15 |
[10] |
M. Bastan, Multi-view object detection in dual-energy X-ray images, Mach. Vision Appl., 26 (2015), 1045–1060. https://doi.org/10.1007/s00138-015-0706-x doi: 10.1007/s00138-015-0706-x
![]() |
[11] | G. Heitz, G. Chechik, Object separation in X-ray image sets, in 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2010), 2093–2100. https://doi.org/10.1109/CVPR.2010.5539887 |
[12] | O. K. Stamatis, N. Aouf, D. Nam, C. Belloni, Automatic X-ray image segmentation and clustering for threat detection, in Proceedings Volume 10432, Target and Background Signatures III, (2017), 104320O. https://doi.org/10.1117/12.2277190 |
[13] | D. Mery, Computer Vision Technology for X-ray Testing, Springer, 2015. https://doi.org/10.1007/978-3-319-20747-6 |
[14] |
D. Mery, V. Riffo, U. Zscherpel, G. Mondragón, I. Lillo, I. Zuccar, et al., GDXray: The database of X-ray images for nondestructive testing, J. Nondestr. Eval., 34 (2015), 42. https://doi.org/10.1007/s10921-015-0315-7 doi: 10.1007/s10921-015-0315-7
![]() |
[15] | T. W. Rogers, N. Jaccard, E. D. Protonotarios, J. Ollier, E. J. Morton, L. D. Griffin, Threat image projection (TIP) into X-ray images of cargo containers for training humans and machines, in 2016 IEEE International Carnahan Conference on Security Technology (ICCST), IEEE, (2016), 1–7. https://doi.org/10.1109/CCST.2016.7815717 |
[16] | C. Miao, L. Xie, F. Wan, C. Su, H. Liu, J. Jiao, et al., Sixray : A large-scale security inspection x-ray benchmark for prohibited item discovery in overlapping images, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2019), 2114–2123. https://doi.org/10.1109/CVPR.2019.00222 |
[17] | Y. Wei, R. Tao, Z. Wu, Y. Ma, L. Zhang, X. Liu, Occluded prohibited items detection: an X-ray security inspection benchmark and de-occlusion attention module, in Proceedings of the 28th ACM International Conference on Multimedia, ACM, (2020), 138–146. https://doi.org/10.1145/3394171.3413828 |
[18] |
J. Yang, Z. Zhao, H. Zhang, Y. Shi, Data augmentation for X-ray prohibited item images using generative adversarial networks, IEEE Access, 7 (2019), 28894–28902. https://doi.org/10.1109/ACCESS.2019.2902121 doi: 10.1109/ACCESS.2019.2902121
![]() |
[19] |
Y. Zhu, Y. Zhang, H. Zhang, J. Yang, Z. Zhao, Data augmentation of X-ray images in baggage inspection based on generative adversarial networks, IEEE Access, 8 (2020), 86536–86544. https://doi.org/10.1109/ACCESS.2020.2992861 doi: 10.1109/ACCESS.2020.2992861
![]() |
[20] |
J. Liu, T. H. Lin, A framework for the synthesis of X-ray security inspection images based on generative adversarial networks, IEEE Access, 11 (2023), 63751–63760. https://doi.org/10.1109/ACCESS.2023.3288087 doi: 10.1109/ACCESS.2023.3288087
![]() |
[21] | I. Goodfellow, NIPS 2016 Tutorial: Generative adversarial networks, preprint, arXiv: 1701.00160. |
[22] |
X. Wu, K. Xu, P. Hall, A survey of image synthesis and editing with generative adversarial networks, Tsinghua Sci. Technol., 22 (2017), 660–674. https://doi.org/10.23919/TST.2017.8195348 doi: 10.23919/TST.2017.8195348
![]() |
[23] |
Z. Pan, W. Yu, X. Yi, A. Khan, F. Yuan, Y. Zheng, Recent progress on generative adversarial networks (GANs): A survey, IEEE Access, 7 (2019), 36322–36333. https://doi.org/10.1109/ACCESS.2019.2905015 doi: 10.1109/ACCESS.2019.2905015
![]() |
[24] | A. Radford, L. Metz, S. Chintala, Unsupervised representation learning with deep convolutional generative adversarial networks, preprint, arXiv: 1511.06434. |
[25] | M. Mirza, S. Osindero, Conditional generative adversarial nets, preprint, arXiv: 1411.1784. |
[26] | A. Odena, C. Olah, J. Shlens, Conditional image synthesis with auxiliary classifier GANs, preprint, arXiv: 1610.09585. |
[27] | X. Chen, Y. Duan, R. Houthooft, J. Schulman, I. Sutskever, P. Abbeel, InfoGAN: Interpretable representation learning by information maximizing generative adversarial nets, preprint, arXiv: 1606.03657. |
[28] | M. Arjovsky, S. Chintala, L. Bottou, Wasserstein generative adversarial networks, in International Conference on Machine Learning, PMLR, (2017), 214–223. |
[29] | I. Gulrajani, F. Ahmed, M. Arjovsky, V. Dumoulin, A. C. Courville, Improved training of wasserstein GANs, in Proceedings of the 31st International Conference on Neural Information Processing Systems, Curran Associates, Inc., (2017), 5769–5779. |
[30] | H. Petzka, A. Fischer, D. Lukovnicov, On the regularization of wasserstein GANs, preprint, arXiv: 1709.08894. |
[31] | P. Isola, J. Y. Zhu, T. Zhou, A. A. Efros, Image-to-image translation with conditional adversarial networks, in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2017), 5967–5976. https://doi.org/10.1109/CVPR.2017.632 |
[32] | T. C. Wang, M. Y. Liu, J. Y. Zhu, A. Tao, J. Kautz, B. Catanzaro, High-resolution image synthesis and semantic manipulation with conditional GANs, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, (2018), 8798–8807. https://doi.org/10.1109/CVPR.2018.00917 |
[33] | J. Y. Zhu, T. Park, P. Isola, A. A. Efros, Unpaired image-to-image translation using cycle-consistent adversarial networks, in 2017 IEEE International Conference on Computer Vision (ICCV), IEEE, (2018), 2242–2251. https://doi.org/10.1109/ICCV.2017.244 |
[34] | T. Kim, M. Cha, H. Kim, J. K. Lee, J. Kim, Learning to discover cross-domain relations with generative adversarial networks, in Proceedings 34th International Conference Machine Learning, PMLR, (2017), 1857–1865. |
[35] | Z. Yi, H. Zhang, P. Tan, M. Gong, DualGAN: Unsupervised dual learning for image-to-image translation, in Proceedings of the IEEE International Conference on Computer Vision (ICCV), IEEE, (2017), 2849–2857. |
[36] | Y. Choi, M. Choi, M. Kim, J. W. Ha, S. Kim, J. Choo, StarGAN: Unified generative adversarial networks for multi-domain image-to-image translation, in 2018 Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2018), 8789–8797. https://doi.org/10.1109/CVPR.2018.00916 |
[37] | B. Mildenhall, P. Srinivasan, M. Tancik, J. T. Barron, R. Ramamoorthi, R. Ng, NeRF: Representing scenes as neural radiance fields for view Synthesis, preprint, arXiv: 2003.08934. |
[38] | S. J. Garbin, M. Kowalski, M. Johnson, J. Shotton, J. Valentin, Fastnerf: High-fidelity neural rendering at 200fps, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 14346–14355. |
[39] | Z. Li, S. Niklaus, N. Snavely, N. Snavely, O. Wang, Neural scene flow fields for space-time view synthesis of dynamic scenes, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 6498–6508. |
[40] | A. Yu, V. Ye, M. Tancik, M. Tancik, A. Kanazawa, Pixelnerf: Neural radiance fields from one or few images, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 4578–4587. |
[41] | Q. Wang, Z. Wang, K. Genova, P. P. Srinivasan, H. Zhou, J. T. Barron, et al., IBRnet: Learning multi-view image-based rendering, in 2021 Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 4688–4697. https://doi.org/10.1109/CVPR46437.2021.00466 |
[42] | K. Schwarz, Y. Liao, M. Niemeyer, A. Geiger, GRAF: Generative radiance fields for 3D-aware image synthesis, preprint, arXiv: 2007.02442. |
[43] | M. Niemeyer, A. Geiger, GIRAFFE: Representing scenes as compositional generative neural feature fields, in 2021 Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 11448–11459. https://doi.org/10.1109/CVPR46437.2021.01129 |
[44] | K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556. |
[45] | Q. Xu, G. Huang, Y. Yuan, C. Guo, Y. Sun, F. Wu, et al., An empirical study on evaluation metrics of generative adversarial net, preprint, arXiv: 1806.07755. |
[46] | M. Bińkowski, D. J. Sutherland, M. Arbel, A. Gretton, Demystifying MMD GANs, preprint, arXiv: 1801.01401. |
[47] | Ultralytics, YOLOv8 Project, GitHub. Available from: https://github.com/ultralytics/ultralytics. |
1. | Li Wang, Jiaqun Wei, Haicheng Zhang, Indices and c-vectors in extriangulated categories, 2023, 1674-7283, 10.1007/s11425-022-2054-y | |
2. | Limin Liu, Hongjin Liu, Consistent pairs of s-torsion pairs in extriangulated categories with negative first extensions, 2023, 9, 2473-6988, 1494, 10.3934/math.2024073 |