/usr/share/octave/packages/signal-1.3.2/clustersegment.m is in octave-signal 1.3.2-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 | ## Copyright (c) 2010 Juan Pablo Carbajal <carbajal@ifi.uzh.ch>
##
## This program is free software; you can redistribute it and/or modify
## it under the terms of the GNU General Public License as published by
## the Free Software Foundation; either version 3 of the License, or
## (at your option) any later version.
##
## This program is distributed in the hope that it will be useful,
## but WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
## GNU General Public License for more details.
##
## You should have received a copy of the GNU General Public License
## along with this program; if not, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @deftypefn {Function File} {@var{clusteridx} =} clustersegment (@var{unos})
## Calculate boundary indexes of clusters of 1's.
##
## The function calculates the initial index and end index of the sequences of
## 1's in the rows of @var{unos}. The clusters are sought in the rows of the
## array @var{unos}.
##
## The result is returned in a cell array of size 1-by-@var{Np}, where @var{Np}
## is the number of rows in @var{unos}. Each element of the cell has two rows.
## The first row is the initial index of a sequence of 1's and the second row
## is the end index of that sequence.
##
## If @var{Np} == 1 the output is a matrix with two rows.
##
## The function works by finding the indexes of jumps between consecutive
## values in the rows of @var{unos}.
##
## @end deftypefn
function contRange = clustersegment(xhi)
## Find discontinuities
bool_discon = diff(xhi,1,2);
[Np Na] = size(xhi);
contRange = cell(1,Np);
for i = 1:Np
idxUp = find(bool_discon(i,:)>0)+1;
idxDwn = find(bool_discon(i,:)<0);
tLen = length(idxUp) + length(idxDwn);
if xhi(i,1)==1
## first event was down
contRange{i}(1) = 1;
contRange{i}(2:2:tLen+1) = idxDwn;
contRange{i}(3:2:tLen+1) = idxUp;
else
## first event was up
contRange{i}(1:2:tLen) = idxUp;
contRange{i}(2:2:tLen) = idxDwn;
endif
if xhi(i,end)==1
## last event was up
contRange{i}(end+1) = Na;
endif
tLen = length(contRange{i});
if tLen ~=0
contRange{i}=reshape(contRange{i},2,tLen/2);
endif
endfor
if Np == 1
contRange = cell2mat (contRange);
endif
endfunction
%!demo
%! xhi = [0 0 1 1 1 0 0 1 0 0 0 1 1];
%! ranges = clustersegment (xhi)
%!
%! % The first sequence of 1's in xhi lies in the interval
%! ranges(1,1):ranges(2,1)
%!demo
%! xhi = rand(3,10)>0.4
%! ranges = clustersegment(xhi)
|