msaf/algorithms/interface.py
def _postprocess(self, est_idxs, est_labels):
        """Post processes the estimations from the algorithm, removing empty
        segments and making sure the lenghts of the boundaries and labels
        match."""
        # Make sure we are using the previously input bounds, if any
        if self.in_bound_idxs is not None:
            F = self._preprocess()
            est_labels = U.synchronize_labels(self.in_bound_idxs, est_idxs,
                                              est_labels, F.shape[0])
            est_idxs = self.in_bound_idxs

        # Remove empty segments if needed
        est_idxs, est_labels = U.remove_empty_segments(est_idxs, est_labels)

        assert len(est_idxs) - 1 == len(est_labels), "Number of boundaries " \
            "(%d) and number of labels(%d) don't match" % (len(est_idxs),
                                                           len(est_labels))

        # Make sure the indeces are integers
        est_idxs = np.asarray(est_idxs, dtype=int)

        return est_idxs, est_labels
def _postprocess(self, est_idxs, est_labels):
        # Make sure we are using the previously input bounds, if any
        if self.in_bound_idxs is not None:
            F = self._preprocess()
            est_labels = U.synchronize_labels(self.in_bound_idxs, est_idxs,
                                              est_labels, F.shape[0])
            est_idxs = self.in_bound_idxs

        # Remove empty segments if needed
        est_idxs, est_labels = U.remove_empty_segments(est_idxs, est_labels)

        assert len(est_idxs) - 1 == len(est_labels), "Number of boundaries " \
            "(%d) and number of labels(%d) don't match" % (len(est_idxs),
                                                           len(est_labels))

        # Make sure the indeces are integers
        est_idxs = np.asarray(est_idxs, dtype=int)

        return est_idxs, est_labels
def _postprocess ( self , est_idxs , est_labels ) : # Make sure we are using the previously input bounds, if any if self . in_bound_idxs is not None : F = self . _preprocess ( ) est_labels = U . synchronize_labels ( self . in_bound_idxs , est_idxs , est_labels , F . shape [ 0 ] ) est_idxs = self . in_bound_idxs # Remove empty segments if needed est_idxs , est_labels = U . remove_empty_segments ( est_idxs , est_labels ) assert len ( est_idxs ) - 1 == len ( est_labels ) , "Number of boundaries " "(%d) and number of labels(%d) don't match" % ( len ( est_idxs ) , len ( est_labels ) ) # Make sure the indeces are integers est_idxs = np . asarray ( est_idxs , dtype = int ) return est_idxs , est_labels
Post processes the estimations from the algorithm, removing empty
        segments and making sure the lenghts of the boundaries and labels
        match.
Post processes the estimations from the algorithm removing empty segments and making sure the lenghts of the boundaries and labels match .