The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Separating Style and Content with Bilinear Models
Abstract
Perceptual systems routinely separate “content” from “style,” classifying familiar words spoken in an unfamiliar accent, identifying a font or handwriting style across letters, or recognizing a familiar face or object seen under unfamiliar viewing conditions. Yet a general and tractable computational model of this ability to untangle the underlying factors of perceptual observations remains elusive (Hofstadter, 1985). Existing factor models (Mardia, Kent, & Bibby, 1979; Hinton & Zemel, 1994; Ghahramani, 1995; Bell & Sejnowski, 1995; Hinton, Dayan, Frey, & Neal, 1995; Dayan, Hinton, Neal, & Zemel, 1995; Hinton & Ghahramani, 1997) are either insufficiently rich to capture the complex interactions of perceptually meaningful factors such as phoneme and speaker accent or letter and font, or do not allow efficient learning algorithms. We present a general framework for learning to solve two-factor tasks using bilinear models, which provide sufficiently expressive representations of factor interactions but can nonetheless be fit to data using efficient algorithms based on the singular value decomposition and expectation-maximization. We report promising results on three different tasks in three different perceptual domains: spoken vowel classification with a benchmark multi-speaker database, extrapolation of fonts to unseen letters, and translation of faces to novel illuminants.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“GeAN also uses the bilinear model [29,30] to distil the knowledge interwoven in these representations by allowing each node and edge to collaboratively modulate each other's contributions through a shared learning space.”
From TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks (2024) · cites this paper as [29]
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Neural networks for pattern recognition
Bishop, C. (1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,537
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 12,040
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Shape and motion from image streams under orthography: a factorization method
Tomasi, C., & Takeo Kanade, A. (1992) · International Journal of Computer Vision · doi:10.1007/bf00129684 · Cited by 2,879
Matrix Differential Calculus with Applications in Statistics and Econometrics.
Magnus, J. R., & Neudecker, H. (1988) · Biometrics · doi:10.2307/2531754 · Cited by 2,729
Classical Electrodynamics (2nd edn)
Brereton, M. (1976) · Physics Bulletin · doi:10.1088/0031-9112/27/8/041 · Cited by 2,612
Cited by
Sorted by citations
Zhao, W., Chellappa, R., Phillips, P. J., & Rosenfeld, A. (2003) · ACM Computing Surveys · doi:10.1145/954339.954342 · Cited by 6,174
“, AN be m × 3 matrices whose columns are images of object i (from the bootstrap set) that contain the same m pixels; then the bilinear energy/cost function [Freeman and Tenenbaum 2000] for an image ys of object y under illumination s is ( ys − N ∑”
BackgroundImage Style Transfer Using Convolutional Neural Networks
Gatys, L. A., Ecker, A. S., & Bethge, M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.265 · Cited by 6,025
“Such factorised representations were previously achieved only for controlled subsets of natural images such as faces under different illumination conditions and characters in different font styles [29] or handwritten digits and house numbers [17].”
BackgroundA Neural Algorithm of Artistic Style
Gatys, L., Ecker, A., & Bethge, M. (2016) · Journal of Vision · doi:10.1167/16.12.326 · Cited by 2,612
“12,13 In our demonstration, we render a given photograph in the style of a range of well-known artworks.”
BackgroundBilinear CNN Models for Fine-Grained Visual Recognition
Lin, T., RoyChowdhury, A., & Maji, S. (2015) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.170 · Cited by 2,234
“Bilinear models were proposed by Tanenbaum and Freeman [33] to model two-factor variations, such as “style” and “content”, for images.”
MethodMultimodal Compact Bilinear Pooling for Visual Question Answering and Visual Grounding
Fukui, A., Park, D. H., Yang, D., Rohrbach, A., Darrell, T., & Rohrbach, M. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1044 · Cited by 1,582
Metadata
- Authors
- Tenenbaum, J. B., & Freeman, W. T.
- Affiliations
- Massachusetts Institute of Technology (US)
- Mitsubishi Electric Research Laboratories (United States) (US)
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2000-06-01
- Volume
- 12
- Issue
- 6
- Pages
- 1247-1283
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2170653751
- Semantic Scholar
- 7e85f7d59e37972ec52cbabfef0512588d87f125
- Cited by
- 840
- References
- 61
- Citations by year
- 2026: 2 · 2025: 17 · 2024: 20 · 2023: 31 · 2022: 38 · 2021: 61 · 2020: 58 · 2019: 70 · 2018: 49 · 2017: 39 · 2016: 56 · 2015: 34 · 2014: 27 · 2013: 39 · 2012: 30
- FWCI
- 13.29
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Neural Computation (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
- Keywords
- bilinear model, factor models, perceptual learning, speaker accent, singular value decomposition, expectation-maximization algorithm, factor interactions
- MeSH terms
- Algorithms, Face, Humans, Learning, Pattern Recognition, Visual, Speech Perception, Linear Models, Neural Networks, Computer
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
