mlsanityData to 14 Oct 2026

TGHop: An Explainable, Efficient and Lightweight Method for Texture Generation

arXiv 2107.04020 ↗First posted 8 Jul 2021cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

An explainable, efficient and lightweight method for texture generation, called TGHop (an acronym of Texture Generation PixelHop), is proposed in this work. Although synthesis of visually pleasant texture can be achieved by deep neural networks, the associated models are large in size, difficult to explain in theory, and computationally expensive in training. In contrast, TGHop is small in its model size, mathematically transparent, efficient in training and inference, and able to generate high quality texture. Given an exemplary texture, TGHop first crops many sample patches out of it to form a collection of sample patches called the source. Then, it analyzes pixel statistics of samples from the source and obtains a sequence of fine-to-coarse subspaces for these patches by using the PixelHop++ framework. To generate texture patches with TGHop, we begin with the coarsest subspace, which is called the core, and attempt to generate samples in each subspace by following the distribution of real samples. Finally, texture patches are stitched to form texture images of a large size. It is demonstrated by experimental results that TGHop can generate texture images of superior quality with a small model size and at a fast speed.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 55 references that are in the map. First posted on arXiv 8 Jul 2021.

Builds on

26 of 55 references.

References · 26

  1. 2016Improved Techniques for Training GANscited by 2,970
  2. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
  3. 2017Universal Style Transfer via Feature Transformscited by 354
  4. 2019Texture Fields: Learning Texture Representations in Function Spacecited by 210
  5. 2016Texture Networks: Feed-forward Synthesis of Textures and Stylized Imagescited by 174
  6. 2017Stable and Controllable Neural Texture Synthesis and Style Transfer Using Histogram Lossescited by 69
  7. 2017Diversified Texture Synthesis with Feed-forward Networkscited by 59
  8. 2018Interpretable Convolutional Neural Networks via Feedforward Designcited by 49
  9. 2019PointHop: An Explainable Machine Learning Method for Point Cloud Classificationcited by 46
  10. 2018Visual Analytics for Explainable Deep Learningcited by 39
  11. 2020PixelHop++: A Small Successive-Subspace-Learning-Based (SSL-based) Model for Image Classificationcited by 37
  12. 2016Understanding Convolutional Neural Networks with A Mathematical Modelcited by 33
14 more
  1. 2021DefakeHop: A Light-Weight High-Performance Deepfake Detectorcited by 31
  2. 2021R-PointHop: A Green, Accurate, and Unsupervised Point Cloud Registration Methodcited by 26
  3. 2020PointHop++: A Lightweight Learning Model on Point Sets for 3D Classificationcited by 22
  4. 2019Re-Identification Supervised Texture Generationcited by 19
  5. 2020Unsupervised Point Cloud Registration via Salient Points Analysis (SPA)cited by 19
  6. 2021VoxelHop: Successive Subspace Learning for ALS Disease Classification Using Structural MRIcited by 18
  7. 2020Unsupervised Feedforward Feature (UFF) Learning for Point Cloud Classification and Segmentationcited by 17
  8. 2020FaceHop: A Light-Weight Low-Resolution Face Gender Classification Methodcited by 16
  9. 2020NITES: A Non-Parametric Interpretable Texture Synthesis Methodcited by 13
  10. 2021AnomalyHop: An SSL-based Image Anomaly Localization Methodcited by 12
  11. 2021Successive Subspace Learning: An Overviewcited by 11
  12. 2016Texture Synthesis Through Convolutional Neural Networks and Spectrum Constraintscited by 8
  13. 2019An Interpretable Compression and Classification System: Theory and Applicationscited by 6
  14. 2019Visualization, Discriminability and Applications of Interpretable Saak Featurescited by 5

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 4.

8 papers.