matrix decomposition (not quite non-negative matrix decomposition)
I'm interested in finding a good approximation of the mxn matrix $Y$ as $Yapprox XB$ where the mxn matrix $X$ has only non-negative elements and $B$ is an invertable nxn matrix. Are there algorithms available for this task?
Context: I am trying to classify a set of images containing n atoms that are either in a fluorescing or non-fluorescing state. The matrix $Y$ results from a principal component analysis of pixel correlations and contains the $n$ most relevant eigenvectors. These eigenvectors enable a dimensional reduction by projecting images onto $Y$; however, I'm not really interested in representing an image as a linear superposition of a few eigenvectors but rather as a linear superposition of n (non-orthogonal) vectors, each of which representing exactly one atom in the fluorescing state; these vectors only have non-negative elements.
matrix-decomposition
add a comment |
I'm interested in finding a good approximation of the mxn matrix $Y$ as $Yapprox XB$ where the mxn matrix $X$ has only non-negative elements and $B$ is an invertable nxn matrix. Are there algorithms available for this task?
Context: I am trying to classify a set of images containing n atoms that are either in a fluorescing or non-fluorescing state. The matrix $Y$ results from a principal component analysis of pixel correlations and contains the $n$ most relevant eigenvectors. These eigenvectors enable a dimensional reduction by projecting images onto $Y$; however, I'm not really interested in representing an image as a linear superposition of a few eigenvectors but rather as a linear superposition of n (non-orthogonal) vectors, each of which representing exactly one atom in the fluorescing state; these vectors only have non-negative elements.
matrix-decomposition
add a comment |
I'm interested in finding a good approximation of the mxn matrix $Y$ as $Yapprox XB$ where the mxn matrix $X$ has only non-negative elements and $B$ is an invertable nxn matrix. Are there algorithms available for this task?
Context: I am trying to classify a set of images containing n atoms that are either in a fluorescing or non-fluorescing state. The matrix $Y$ results from a principal component analysis of pixel correlations and contains the $n$ most relevant eigenvectors. These eigenvectors enable a dimensional reduction by projecting images onto $Y$; however, I'm not really interested in representing an image as a linear superposition of a few eigenvectors but rather as a linear superposition of n (non-orthogonal) vectors, each of which representing exactly one atom in the fluorescing state; these vectors only have non-negative elements.
matrix-decomposition
I'm interested in finding a good approximation of the mxn matrix $Y$ as $Yapprox XB$ where the mxn matrix $X$ has only non-negative elements and $B$ is an invertable nxn matrix. Are there algorithms available for this task?
Context: I am trying to classify a set of images containing n atoms that are either in a fluorescing or non-fluorescing state. The matrix $Y$ results from a principal component analysis of pixel correlations and contains the $n$ most relevant eigenvectors. These eigenvectors enable a dimensional reduction by projecting images onto $Y$; however, I'm not really interested in representing an image as a linear superposition of a few eigenvectors but rather as a linear superposition of n (non-orthogonal) vectors, each of which representing exactly one atom in the fluorescing state; these vectors only have non-negative elements.
matrix-decomposition
matrix-decomposition
asked Dec 9 '18 at 23:31
felix
11
11
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3033185%2fmatrix-decomposition-not-quite-non-negative-matrix-decomposition%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3033185%2fmatrix-decomposition-not-quite-non-negative-matrix-decomposition%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown