Results 31 to 40 of about 864,269 (299)
IEEE Photonics Journal, 2010 We show that any family of universal quantum gates can be implemented based on a single optical hybrid/Mach-Zehnder interferometer (MZI)/directional coupler (DC) and either a highly nonlinear optical fiber or a tap coupler with an avalanche photodiode ...
Ivan B. Djordjevic
doaj +1 more source
Sparse codes as Alpha Matte [PDF]
Proceedings of the British Machine Vision Conference 2014, 2014 In this paper, image matting is cast as a sparse coding problem wherein the sparse codes directly give the estimate of the alpha matte. Hence, there is no need to use the matting equation that restricts the estimate of alpha from a single pair of foreground (F) and background (B) samples.
Johnson, Jubin +2 more
openaire +3 more sources
Applied Sciences, 2022 We present a new set of near orthogonal codes which we call Hadamard Aperiodic Interval (HAPI) codes and demonstrate their utility for parallel multi-transmitter synthetic aperture imaging. The codes are tri-state and sparse.
Tarek Kaddoura, Roger J. Zemp
doaj +1 more source
Sparse-Coding Variational Autoencoders [PDF]
Neural Computation, 2018 Abstract The sparse coding model posits that the visual system has evolved to efficiently code natural stimuli using a sparse set of features from an overcomplete dictionary. The original sparse coding model suffered from two key limitations; however: (1) computing the neural response to an image patch required minimizing a nonlinear ...
Victor Geadah +4 more
openaire +3 more sources
Image Classification Based on Neighborhood Preserving Embedding Sparse Coding [PDF]
Jisuanji gongcheng, 2016 Aiming at the problem of image classification with a complex background,this paper proposes a new image algorithm based on Neighborhood Preserving Embedding regularization Sparse Coding algorithm(NPESC).Comparing with traditional sparse coding,it adds ...
GAO Jiaxue,CHEN Xiuhong
doaj +1 more source
Multilevel structured low-density parity-check codes [PDF]
, 2008 Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to store their code description, which can be represented either by the connections ...
S. Chen +5 more
core +1 more source
Transformational Sparse Coding
CoRR, 2017 A fundamental problem faced by object recognition systems is that objects and their features can appear in different locations, scales and orientations. Current deep learning methods attempt to achieve invariance to local translations via pooling, discarding the locations of features in the process.
Dimitrios C. Gklezakos, Rajesh P. N. Rao
openaire +3 more sources
Efficient ab initio many-body calculations based on sparse modeling of Matsubara Green's function
SciPost Physics Lecture Notes, 2022 This lecture note reviews recently proposed sparse-modeling approaches for efficient ab initio many-body calculations based on the data compression of Green's functions.
Hiroshi Shinaoka, Naoya Chikano, Emanuel Gull, Jia Li, Takuya Nomoto, Junya Otsuki, Markus Wallerberger, Tianchun Wang, Kazuyoshi Yoshimi
doaj +1 more source
CoRR, 2012 We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic topic models, STC relaxes the normalization constraint of admixture proportions and the constraint of defining a normalized likelihood function.
Jun Zhu 0001, Eric P. Xing
openaire +3 more sources
Embedding dimension gaps in sparse codes [PDF]
, 2023 We study the open and closed embedding dimensions of a convex 3-sparse code $\mathcal{FP}$, which records the intersection pattern of lines in the Fano plane.
Siegel, Henry +3 more
core