Summing of non-zero elements of columns using indexing

3 次查看（过去 30 天）
D_coder
D_coder 2018-9-16
评论： D_coder 2018-9-16
I have idx, is there a way of using idx to make the sum(matrix,1) in the below code cheaper. In another words, is it possible to use idx for calculating sum of 'matrix'(see below code) along the columns to get a row vector.
matrix(matrix<thresh) = 0 ;
idx = find(matrix~=0);
while condition is true
matrix(idx) = matrix(idx).*another matrix(idx) %matrix is sparse and has lot of zeros ;numel(matrix) = 1000000
new_matrix(a,:) = b*sum(matrix,1) %here b is an integer, make this line efficient and faster so it takes only non zero elements for summing
end

请先登录，再回答此问题。

回答（2 个）

Walter Roberson
Walter Roberson 2018-9-16
Yes, it is possible to use idx to reduce the number of additions.
matrix(matrix<thresh) = 0 ;
idx = find(matrix~=0);
[idxr, idxc] = ind2sub(size(matrix), idx);
numcol = size(matrix,2);
while condition is true
matrix(idx) = matrix(idx).*another matrix(idx) %matrix is sparse and has lot of zeros ;numel(matrix) = 1000000
for col = 1 : num2col
matched_rows = idxr(idxc==col);
new_matrix(a,col) = b * sum(matrix(matched_rows, col));
end
end
I would be surprised if this is more efficient, but it is possible . It would probably be more efficient to loop calculating the column-wise indices into a cell array and indexing into that.
  1 个评论
D_coder
D_coder 2018-9-16
编辑：D_coder 2018-9-16
do you have any alternative code without use of for loop coz the while loop runs 9000 times so thats gonna consume a lot of time.accumarray()?

请先登录，再进行评论。

Akira Agata
Akira Agata 2018-9-16
If your matrix contains many zeros, I would recommend converting it to sparse matrix and applying sum function, like the following. It runs faster.
matrix = sparse(matrix); % Convert to sparse matrix
summedValue = sum(matrix,1);

类别

在 Help Center 和 File Exchange 中查找有关 Matrix Indexing 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by