155 research outputs found
OrthoGAN: Multifaceted Semantics for Disentangled Face Editing
This paper describes a new technique for finding disentangled semantic
directions in the latent space of StyleGAN. OrthoGAN identifies meaningful
orthogonal subspaces that allow editing of one human face attribute, while
minimizing undesired changes in other attributes. Our model is capable of
editing a single attribute in multiple directions. Resulting in a range of
possible generated images. We compare our scheme with three state-of-the-art
models and show that our method outperforms them in terms of face editing and
disentanglement capabilities. Additionally, we suggest quantitative measures
for evaluating attribute separation and disentanglement, and exhibit the
superiority of our model with respect to those measures
DeepShadow: Neural Shape from Shadow
This paper presents DeepShadow, a one-shot method for recovering the depth
map and surface normals from photometric stereo shadow maps. Previous works
that try to recover the surface normals from photometric stereo images treat
cast shadows as a disturbance. We show that the self and cast shadows not only
do not disturb 3D reconstruction, but can be used alone, as a strong learning
signal, to recover the depth map and surface normals. We demonstrate that 3D
reconstruction from shadows can even outperform shape-from-shading in certain
cases. To the best of our knowledge, our method is the first to reconstruct 3D
shape-from-shadows using neural networks. The method does not require any
pre-training or expensive labeled data, and is optimized during inference time
Judicial Errors: Fake Imaging and the Modern Law of Evidence, 21 UIC Rev. Intell. Prop. L. 82 (2022)
Editorial : Integrating Visual System Mechanisms, Computational Models and Algorithms/Technologies
The Gray-code filter kernels
Abstract In this paper we introduce a family of filter kernels -the Gray-Code Kernels (GCK) and demonstrate their use in image analysis. Filtering an image with a sequence of Gray-Code Kernels is highly efficient and requires only 2 operations per pixel for each filter kernel, independent of the size or dimension of the kernel. We show that the family of kernels is large and includes the Walsh-Hadamard kernels amongst others. The GCK can be used to approximate any desired kernel and as such forms a complete representation. The efficiency of computation using a sequence of GCK filters can be exploited for various real-time applications, such as, pattern detection, feature extraction, texture analysis, texture synthesis, and more
- …