plateform stringclasses 1
value | repo_name stringlengths 13 113 | name stringlengths 3 74 | ext stringclasses 1
value | path stringlengths 12 229 | size int64 23 843k | source_encoding stringclasses 9
values | md5 stringlengths 32 32 | text stringlengths 23 843k |
|---|---|---|---|---|---|---|---|---|
github | lewisli/RSFSRC-master | fx_decon.m | .m | RSFSRC-master/book/tccs/emdpf/matfun/fx_decon.m | 3,932 | utf_8 | 6b47709ea0f32265d79d98ea49f49c46 | function [DATA_f] = fx_decon(DATA,dt,lf,mu,flow,fhigh);
%FX_DECON: SNR enhancement using fx-deconvolution.
%
% [DATA_f] = fx_decon(DATA,dt,lf,mu,flow,fhigh);
%
% IN DATA: the data matrix, columns are traces
% dt: sampling interval in sec
% lf: lenght of operator (lenght of the filter)
% ... |
github | lewisli/RSFSRC-master | rsf_create.m | .m | RSFSRC-master/api/octave/rsf_create.m | 3,107 | utf_8 | dab629fb15d420286fe7a45c6b504af0 | ## Copyright (C) 2007 Ioan Vlad
##
## 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 2 of the License, or
## (at your option) any later version.
##
## This program is distributed... |
github | lewisli/RSFSRC-master | rsf_dim.m | .m | RSFSRC-master/api/octave/rsf_dim.m | 2,394 | utf_8 | 008750836bdbae9c693cb9c7d0890a84 | ## Copyright (C) 2007 Ioan Vlad
##
## 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 2 of the License, or
## (at your option) any later version.
##
## This program is distributed... |
github | lewisli/RSFSRC-master | rsf_par.m | .m | RSFSRC-master/api/octave/rsf_par.m | 2,369 | utf_8 | 86fa70b256264c49b98a52f8205c92c6 | ## Copyright (C) 2007 Ioan Vlad
##
## 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 2 of the License, or
## (at your option) any later version.
##
## This program is distributed... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | nonmax_channels.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/nonmax_channels.m | 314 | utf_8 | 49a5e48384add2644eb4df8eea927460 | % given NxMxnum_ori oriented channels, compute oriented nonmax suppression
function nmax = nonmax_channels(pb, nonmax_ori_tol)
if (nargin < 2), nonmax_ori_tol = pi/8; end
n_ori = size(pb,3);
oris = (0:(n_ori-1))/n_ori * pi;
[y,i] = max(pb,[],3);
i = oris(i);
y(y<0)=0;
nmax = nonmax_oriented(y,i, nonmax_ori_tol);
|
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | gPb_from_cues.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/gPb_from_cues.m | 1,446 | utf_8 | 1f6871c3ff35f275a7915b710b83c359 | % compute globalPb from mPb, sPb, and cues
function [gPb_orient gPb_thin] = gPb_from_cues(bg1, bg2, bg3, cga1, cga2, cga3, cgb1, cgb2, cgb3, tg1, tg2, tg3, mPb, sPb)
weights = [0 0 0.0039 0.0050 0.0058 0.0069 0.0040 0.0044 0.0049 0.0024 0.0027 0.0170 0.0074];
% get size of finest scale
[sx sy sz] = size(b... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | fit_contour.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/fit_contour.m | 2,079 | utf_8 | 4bfdde57e42bc906f763181bfeffecad | % extract contours and neighboring regions given non-max suppressed edge map
function contours = fit_contour(nmax)
% extract contours
[skel, labels, is_v, is_e, assign, vertices, edges, ...
v_left, v_right, e_left, e_right, c_left, c_right, ...
edge_equiv_ids, is_compl, e_x_coords, e_y_coords] = ...
mex_contour_s... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | nonmax_oriented.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/nonmax_oriented.m | 1,172 | utf_8 | a4e08e58a40018a0a8fbbe52c89d89cf | % Oriented non-max suppression (2D).
%
% Perform non-max suppression orthogonal to the specified orientation on
% the given 2D matrix using linear interpolation in a 3x3 neighborhood.
%
% A local maximum must be greater than the interpolated values of its
% adjacent elements along the direction orthogonal to this orie... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | multiscalePb.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/multiscalePb.m | 5,229 | utf_8 | 01cc64a657759c0193ec864da916b849 | function [mPb_nmax, mPb_nmax_rsz, bg1, bg2, bg3, cga1, cga2, cga3, cgb1, cgb2, cgb3, tg1, tg2, tg3, textons] = multiscalePb(im, rsz)
%function [mPb_nmax, mPb_nmax_rsz, bg1, bg2, bg3, cga1, cga2, cga3, cgb1, cgb2, cgb3, tg1, tg2, tg3, textons] = multiscalePb(im, rsz)
%
% description:
% compute local contour cues of an i... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | mPb_from_cues.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/mPb_from_cues.m | 2,595 | utf_8 | 2251f35fe181a45235f5eeeb417bff50 | % compute multiscale pb from cues
function [mPb_nmax, mPb_nmax_rsz] = mPb_from_cues(bg1, bg2, bg3, cga1, cga2, cga3, cgb1, cgb2, cgb3, tg1, tg2, tg3, rsz);
weights = [0.0146 0.0145 0.0163 0.0210 0.0243 0.0287 0.0166 0.0185 0.0204 0.0101 0.0111 0.0141];
% get size of finest scale
[sx s... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | contours2ucm.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/lib/contours2ucm.m | 5,753 | utf_8 | f9d1ae5dd34410d873db7128ace439d8 | function [ucm] = contours2ucm(pb_oriented, fmt)
% Creates Ultrametric Contour Map from oriented contours
%
% syntax:
% [ucm] = contours2ucm(pb_oriented, fmt)
%
% description:
% Computes UCM by considering
% the mean pb value on the boundary between regions as dissimilarity.
%
% arguments:
% pb_oriented: Orient... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_compile.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/vl_compile.m | 5,060 | utf_8 | 978f5189bb9b2a16db3368891f79aaa6 | function vl_compile(compiler)
% VL_COMPILE Compile VLFeat MEX files
% VL_COMPILE() uses MEX() to compile VLFeat MEX files. This command
% works only under Windows and is used to re-build problematic
% binaries. The preferred method of compiling VLFeat on both UNIX
% and Windows is through the provided Makefile... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_noprefix.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/vl_noprefix.m | 1,875 | utf_8 | 97d8755f0ba139ac1304bc423d3d86d3 | function vl_noprefix
% VL_NOPREFIX Create a prefix-less version of VLFeat commands
% VL_NOPREFIX() creats prefix-less stubs for VLFeat functions
% (e.g. SIFT for VL_SIFT). This function is seldom used as the stubs
% are included in the VLFeat binary distribution anyways. Moreover,
% on UNIX platforms, the stub... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_pegasos.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/misc/vl_pegasos.m | 2,837 | utf_8 | d5e0915c439ece94eb5597a07090b67d | % VL_PEGASOS [deprecated]
% VL_PEGASOS is deprecated. Please use VL_SVMTRAIN() instead.
function [w b info] = vl_pegasos(X,Y,LAMBDA, varargin)
% Verbose not supported
if (sum(strcmpi('Verbose',varargin)))
varargin(find(strcmpi('Verbose',varargin),1))=[];
fprintf('Option VERBOSE is no longer supported.\n');
en... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_svmpegasos.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/misc/vl_svmpegasos.m | 1,178 | utf_8 | 009c2a2b87a375d529ed1a4dbe3af59f | % VL_SVMPEGASOS [deprecated]
% VL_SVMPEGASOS is deprecated. Please use VL_SVMTRAIN() instead.
function [w b info] = vl_svmpegasos(DATA,LAMBDA, varargin)
% Verbose not supported
if (sum(strcmpi('Verbose',varargin)))
varargin(find(strcmpi('Verbose',varargin),1))=[];
fprintf('Option VERBOSE is no longer suppor... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_override.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/misc/vl_override.m | 4,654 | utf_8 | e233d2ecaeb68f56034a976060c594c5 | function config = vl_override(config,update,varargin)
% VL_OVERRIDE Override structure subset
% CONFIG = VL_OVERRIDE(CONFIG, UPDATE) copies recursively the fileds
% of the structure UPDATE to the corresponding fields of the
% struture CONFIG.
%
% Usually CONFIG is interpreted as a list of paramters with their
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_quickvis.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/quickshift/vl_quickvis.m | 3,696 | utf_8 | 27f199dad4c5b9c192a5dd3abc59f9da | function [Iedge dists map gaps] = vl_quickvis(I, ratio, kernelsize, maxdist, maxcuts)
% VL_QUICKVIS Create an edge image from a Quickshift segmentation.
% IEDGE = VL_QUICKVIS(I, RATIO, KERNELSIZE, MAXDIST, MAXCUTS) creates an edge
% stability image from a Quickshift segmentation. RATIO controls the tradeoff
% bet... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_aib.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/demo/vl_demo_aib.m | 2,928 | utf_8 | 590c6db09451ea608d87bfd094662cac | function vl_demo_aib
% VL_DEMO_AIB Test Agglomerative Information Bottleneck (AIB)
D = 4 ;
K = 20 ;
randn('state',0) ;
rand('state',0) ;
X1 = randn(2,300) ; X1(1,:) = X1(1,:) + 2 ;
X2 = randn(2,300) ; X2(1,:) = X2(1,:) - 2 ;
X3 = randn(2,300) ; X3(2,:) = X3(2,:) + 2 ;
figure(1) ; clf ; hold on ;
vl_plotframe(X... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_alldist.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/demo/vl_demo_alldist.m | 5,460 | utf_8 | 6d008a64d93445b9d7199b55d58db7eb | function vl_demo_alldist
%
numRepetitions = 3 ;
numDimensions = 1000 ;
numSamplesRange = [300] ;
settingsRange = {{'alldist2', 'double', 'l2', }, ...
{'alldist', 'double', 'l2', 'nosimd'}, ...
{'alldist', 'double', 'l2' }, ...
{'alldist2', 's... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_svm.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/demo/vl_demo_svm.m | 1,235 | utf_8 | 7cf6b3504e4fc2cbd10ff3fec6e331a7 | % VL_DEMO_SVM Demo: SVM: 2D linear learning
function vl_demo_svm
y=[];X=[];
% Load training data X and their labels y
load('vl_demo_svm_data.mat')
Xp = X(:,y==1);
Xn = X(:,y==-1);
figure
plot(Xn(1,:),Xn(2,:),'*r')
hold on
plot(Xp(1,:),Xp(2,:),'*b')
axis equal ;
vl_demo_print('svm_training') ;
% Parameters
lambda =... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_kdtree_sift.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/demo/vl_demo_kdtree_sift.m | 6,832 | utf_8 | e676f80ac330a351f0110533c6ebba89 | function vl_demo_kdtree_sift
% VL_DEMO_KDTREE_SIFT
% Demonstrates the use of a kd-tree forest to match SIFT
% features. If FLANN is present, this function runs a comparison
% against it.
% AUTORIGHS
rand('state',0) ;
randn('state',0);
do_median = 0 ;
do_mean = 1 ;
% try to setup flann
if ~exist('flann_search'... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_impattern.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/imop/vl_impattern.m | 6,876 | utf_8 | 1716a4d107f0186be3d11c647bc628ce | function im = vl_impattern(varargin)
% VL_IMPATTERN Generate an image from a stock pattern
% IM=VLPATTERN(NAME) returns an instance of the specified
% pattern. These stock patterns are useful for testing algoirthms.
%
% All generated patterns are returned as an image of class
% DOUBLE. Both gray-scale and colou... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_tpsu.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/imop/vl_tpsu.m | 1,755 | utf_8 | 09f36e1a707c069b375eb2817d0e5f13 | function [U,dU,delta]=vl_tpsu(X,Y)
% VL_TPSU Compute the U matrix of a thin-plate spline transformation
% U=VL_TPSU(X,Y) returns the matrix
%
% [ U(|X(:,1) - Y(:,1)|) ... U(|X(:,1) - Y(:,N)|) ]
% [ ]
% [ U(|X(:,M) - Y(:,1)|) ... U(|X(:,M) - Y(:,N)|) ]
%
% where X... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_xyz2lab.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/imop/vl_xyz2lab.m | 1,570 | utf_8 | 09f95a6f9ae19c22486ec1157357f0e3 | function J=vl_xyz2lab(I,il)
% VL_XYZ2LAB Convert XYZ color space to LAB
% J = VL_XYZ2LAB(I) converts the image from XYZ format to LAB format.
%
% VL_XYZ2LAB(I,IL) uses one of the illuminants A, B, C, E, D50, D55,
% D65, D75, D93. The default illuminatn is E.
%
% See also: VL_XYZ2LUV(), VL_HELP().
% Copyright ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_gmm.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_gmm.m | 1,332 | utf_8 | 76782cae6c98781c6c38d4cbf5549d94 | function results = vl_test_gmm(varargin)
% VL_TEST_GMM
% Copyright (C) 2007-12 Andrea Vedaldi and Brian Fulkerson.
% All rights reserved.
%
% This file is part of the VLFeat library and is made available under
% the terms of the BSD license (see the COPYING file).
vl_test_init ;
end
function s = setup()
randn('st... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_twister.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_twister.m | 1,251 | utf_8 | 2bfb5a30cbd6df6ac80c66b73f8646da | function results = vl_test_twister(varargin)
% VL_TEST_TWISTER
vl_test_init ;
function test_illegal_args()
vl_assert_exception(@() vl_twister(-1), 'vl:invalidArgument') ;
vl_assert_exception(@() vl_twister(1, -1), 'vl:invalidArgument') ;
vl_assert_exception(@() vl_twister([1, -1]), 'vl:invalidArgument') ;
function te... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_kdtree.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_kdtree.m | 2,449 | utf_8 | 9d7ad2b435a88c22084b38e5eb5f9eb9 | function results = vl_test_kdtree(varargin)
% VL_TEST_KDTREE
vl_test_init ;
function s = setup()
randn('state',0) ;
s.X = single(randn(10, 1000)) ;
s.Q = single(randn(10, 10)) ;
function test_nearest(s)
for tmethod = {'median', 'mean'}
for type = {@single, @double}
conv = type{1} ;
tmethod = char(tmethod) ;... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imwbackward.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_imwbackward.m | 514 | utf_8 | 33baa0784c8f6f785a2951d7f1b49199 | function results = vl_test_imwbackward(varargin)
% VL_TEST_IMWBACKWARD
vl_test_init ;
function s = setup()
s.I = im2double(imread(fullfile(vl_root,'data','spots.jpg'))) ;
function test_identity(s)
xr = 1:size(s.I,2) ;
yr = 1:size(s.I,1) ;
[x,y] = meshgrid(xr,yr) ;
vl_assert_almost_equal(s.I, vl_imwbackward(xr,yr,s.I,... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_alphanum.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_alphanum.m | 1,624 | utf_8 | 2da2b768c2d0f86d699b8f31614aa424 | function results = vl_test_alphanum(varargin)
% VL_TEST_ALPHANUM
vl_test_init ;
function s = setup()
s.strings = ...
{'1000X Radonius Maximus','10X Radonius','200X Radonius','20X Radonius','20X Radonius Prime','30X Radonius','40X Radonius','Allegia 50 Clasteron','Allegia 500 Clasteron','Allegia 50B Clasteron','Al... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_printsize.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_printsize.m | 1,447 | utf_8 | 0f0b6437c648b7a2e1310900262bd765 | function results = vl_test_printsize(varargin)
% VL_TEST_PRINTSIZE
vl_test_init ;
function s = setup()
s.fig = figure(1) ;
s.usletter = [8.5, 11] ; % inches
s.a4 = [8.26772, 11.6929] ;
clf(s.fig) ; plot(1:10) ;
function teardown(s)
close(s.fig) ;
function test_basic(s)
for sigma = [1 0.5 0.2]
vl_printsize(s.fig, s... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_cummax.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_cummax.m | 762 | utf_8 | 3dddb5736dfffacdd94b156e67cb9c14 | function results = vl_test_cummax(varargin)
% VL_TEST_CUMMAX
vl_test_init ;
function test_basic()
vl_assert_almost_equal(...
vl_cummax(1), 1) ;
vl_assert_almost_equal(...
vl_cummax([1 2 3 4], 2), [1 2 3 4]) ;
function test_multidim()
a = [1 2 3 4 3 2 1] ;
b = [1 2 3 4 4 4 4] ;
for k=1:6
dims = ones(1,6) ;
dim... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imintegral.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_imintegral.m | 1,429 | utf_8 | 4750f04ab0ac9fc4f55df2c8583e5498 | function results = vl_test_imintegral(varargin)
% VL_TEST_IMINTEGRAL
vl_test_init ;
function state = setup()
state.I = ones(5,6) ;
state.correct = [ 1 2 3 4 5 6 ;
2 4 6 8 10 12 ;
3 6 9 12 15 18 ;
4 8 12 ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_sift.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_sift.m | 1,318 | utf_8 | 806c61f9db9f2ebb1d649c9bfcf3dc0a | function results = vl_test_sift(varargin)
% VL_TEST_SIFT
vl_test_init ;
function s = setup()
s.I = im2single(imread(fullfile(vl_root,'data','box.pgm'))) ;
[s.ubc.f, s.ubc.d] = ...
vl_ubcread(fullfile(vl_root,'data','box.sift')) ;
function test_ubc_descriptor(s)
err = [] ;
[f, d] = vl_sift(s.I,...
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_binsum.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_binsum.m | 1,301 | utf_8 | 5bbd389cbc4d997e413d809fe4efda6d | function results = vl_test_binsum(varargin)
% VL_TEST_BINSUM
vl_test_init ;
function test_three_args()
vl_assert_almost_equal(...
vl_binsum([0 0], 1, 2), [0 1]) ;
vl_assert_almost_equal(...
vl_binsum([1 7], -1, 1), [0 7]) ;
vl_assert_almost_equal(...
vl_binsum([1 7], -1, [1 2 2 2 2 2 2 2]), [0 0]) ;
function te... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_lbp.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_lbp.m | 1,056 | utf_8 | 3b5cca50109af84014e56a4280a3352a | function results = vl_test_lbp(varargin)
% VL_TEST_TWISTER
vl_test_init ;
function test_one_on()
I = {} ;
I{1} = [0 0 0 ; 0 0 1 ; 0 0 0] ;
I{2} = [0 0 0 ; 0 0 0 ; 0 0 1] ;
I{3} = [0 0 0 ; 0 0 0 ; 0 1 0] ;
I{4} = [0 0 0 ; 0 0 0 ; 1 0 0] ;
I{5} = [0 0 0 ; 1 0 0 ; 0 0 0] ;
I{6} = [1 0 0 ; 0 0 0 ; 0 0 0] ;
I{7} = [0 1 0 ;... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_colsubset.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_colsubset.m | 828 | utf_8 | be0c080007445b36333b863326fb0f15 | function results = vl_test_colsubset(varargin)
% VL_TEST_COLSUBSET
vl_test_init ;
function s = setup()
s.x = [5 2 3 6 4 7 1 9 8 0] ;
function test_beginning(s)
vl_assert_equal(1:5, vl_colsubset(1:10, 5, 'beginning')) ;
vl_assert_equal(1:5, vl_colsubset(1:10, .5, 'beginning')) ;
function test_ending(s)
vl_assert_equa... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_alldist.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_alldist.m | 2,373 | utf_8 | 9ea1a36c97fe715dfa2b8693876808ff | function results = vl_test_alldist(varargin)
% VL_TEST_ALLDIST
vl_test_init ;
function s = setup()
vl_twister('state', 0) ;
s.X = 3.1 * vl_twister(10,10) ;
s.Y = 4.7 * vl_twister(10,7) ;
function test_null_args(s)
vl_assert_equal(...
vl_alldist(zeros(15,12), zeros(15,0), 'kl2'), ...
zeros(12,0)) ;
vl_assert_equa... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_ihashsum.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_ihashsum.m | 581 | utf_8 | edc283062469af62056b0782b171f5fc | function results = vl_test_ihashsum(varargin)
% VL_TEST_IHASHSUM
vl_test_init ;
function s = setup()
rand('state',0) ;
s.data = uint8(round(16*rand(2,100))) ;
sel = find(all(s.data==0)) ;
s.data(1,sel)=1 ;
function test_hash(s)
D = size(s.data,1) ;
K = 5 ;
h = zeros(1,K,'uint32') ;
id = zeros(D,K,'uint8');
next = zer... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_grad.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_grad.m | 434 | utf_8 | 4d03eb33a6a4f68659f868da95930ffb | function results = vl_test_grad(varargin)
% VL_TEST_GRAD
vl_test_init ;
function s = setup()
s.I = rand(150,253) ;
s.I_small = rand(2,2) ;
function test_equiv(s)
vl_assert_equal(gradient(s.I), vl_grad(s.I)) ;
function test_equiv_small(s)
vl_assert_equal(gradient(s.I_small), vl_grad(s.I_small)) ;
function test_equiv... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_whistc.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_whistc.m | 1,384 | utf_8 | 81c446d35c82957659840ab2a579ec2c | function results = vl_test_whistc(varargin)
% VL_TEST_WHISTC
vl_test_init ;
function test_acc()
x = ones(1, 10) ;
e = 1 ;
o = 1:10 ;
vl_assert_equal(vl_whistc(x, o, e), 55) ;
function test_basic()
x = 1:10 ;
e = 1:10 ;
o = ones(1, 10) ;
vl_assert_equal(histc(x, e), vl_whistc(x, o, e)) ;
x = linspace(-1,11,100) ;
o =... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_roc.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_roc.m | 1,019 | utf_8 | 9b2ae71c9dc3eda0fc54c65d55054d0c | function results = vl_test_roc(varargin)
% VL_TEST_ROC
vl_test_init ;
function s = setup()
s.scores0 = [5 4 3 2 1] ;
s.scores1 = [5 3 4 2 1] ;
s.labels = [1 1 -1 -1 -1] ;
function test_perfect_tptn(s)
[tpr,tnr] = vl_roc(s.labels,s.scores0) ;
vl_assert_almost_equal(tpr, [0 1 2 2 2 2] / 2) ;
vl_assert_almost_equal(tnr,... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_dsift.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_dsift.m | 2,048 | utf_8 | fbbfb16d5a21936c1862d9551f657ccc | function results = vl_test_dsift(varargin)
% VL_TEST_DSIFT
vl_test_init ;
function s = setup()
I = im2double(imread(fullfile(vl_root,'data','spots.jpg'))) ;
s.I = rgb2gray(single(I)) ;
function test_fast_slow(s)
binSize = 4 ; % bin size in pixels
magnif = 3 ; % bin size / keypoint scale
scale = binSize... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_alldist2.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_alldist2.m | 2,284 | utf_8 | 89a787e3d83516653ae8d99c808b9d67 | function results = vl_test_alldist2(varargin)
% VL_TEST_ALLDIST
vl_test_init ;
% TODO: test integer classes
function s = setup()
vl_twister('state', 0) ;
s.X = 3.1 * vl_twister(10,10) ;
s.Y = 4.7 * vl_twister(10,7) ;
function test_null_args(s)
vl_assert_equal(...
vl_alldist2(zeros(15,12), zeros(15,0), 'kl2'), ...
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_fisher.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_fisher.m | 1,703 | utf_8 | 41b28dce7f0d0ae5cb6abd942acbef56 | function results = vl_test_fisher(varargin)
% VL_TEST_FISHER
vl_test_init ;
function s = setup()
randn('state',0) ;
dimension = 5 ;
numData = 21 ;
numComponents = 3 ;
s.x = randn(dimension,numData) ;
s.mu = randn(dimension,numComponents) ;
s.sigma2 = ones(dimension,numComponents) ;
s.prior = ones(1,numComponents) ;
s... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imsmooth.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_imsmooth.m | 1,837 | utf_8 | 718235242cad61c9804ba5e881c22f59 | function results = vl_test_imsmooth(varargin)
% VL_TEST_IMSMOOTH
vl_test_init ;
function s = setup()
I = im2double(imread(fullfile(vl_root,'data','spots.jpg'))) ;
I = max(min(vl_imdown(I),1),0) ;
s.I = single(I) ;
function test_pad_by_continuity(s)
% Convolving a constant signal padded with continuity does not change... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_svmtrain.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_svmtrain.m | 4,277 | utf_8 | 071b7c66191a22e8236fda16752b27aa | function results = vl_test_svmtrain(varargin)
% VL_TEST_SVMTRAIN
vl_test_init ;
end
function s = setup()
randn('state',0) ;
Np = 10 ;
Nn = 10 ;
xp = diag([1 3])*randn(2, Np) ;
xn = diag([1 3])*randn(2, Nn) ;
xp(1,:) = xp(1,:) + 2 + 1 ;
xn(1,:) = xn(1,:) - 2 + 1 ;
s.x = [xp xn] ;
s.y = [ones(1,Np) ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_phow.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_phow.m | 549 | utf_8 | f761a3bb218af855986263c67b2da411 | function results = vl_test_phow(varargin)
% VL_TEST_PHOPW
vl_test_init ;
function s = setup()
s.I = im2double(imread(fullfile(vl_root,'data','spots.jpg'))) ;
s.I = single(s.I) ;
function test_gray(s)
[f,d] = vl_phow(s.I, 'color', 'gray') ;
assert(size(d,1) == 128) ;
function test_rgb(s)
[f,d] = vl_phow(s.I, 'color',... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_kmeans.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_kmeans.m | 3,632 | utf_8 | 719f7fca81e19eed5cc45c2ca251aad0 | function results = vl_test_kmeans(varargin)
% VL_TEST_KMEANS
% Copyright (C) 2007-12 Andrea Vedaldi and Brian Fulkerson.
% All rights reserved.
%
% This file is part of the VLFeat library and is made available under
% the terms of the BSD license (see the COPYING file).
vl_test_init ;
function s = setup()
randn('sta... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_hikmeans.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_hikmeans.m | 463 | utf_8 | dc3b493646e66316184e86ff4e6138ab | function results = vl_test_hikmeans(varargin)
% VL_TEST_IKMEANS
vl_test_init ;
function s = setup()
rand('state',0) ;
s.data = uint8(rand(2,1000) * 255) ;
function test_basic(s)
[tree, assign] = vl_hikmeans(s.data,3,100) ;
assign_ = vl_hikmeanspush(tree, s.data) ;
vl_assert_equal(assign,assign_) ;
function test_elka... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_aib.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_aib.m | 1,277 | utf_8 | 78978ae54e7ebe991d136336ba4bf9c6 | function results = vl_test_aib(varargin)
% VL_TEST_AIB
vl_test_init ;
function s = setup()
s = [] ;
function test_basic(s)
Pcx = [.3 .3 0 0
0 0 .2 .2] ;
% This results in the AIB tree
%
% 1 - \
% 5 - \
% 2 - / \
% - 7
% 3 - \ /
% 6 - /
% 4 - /
%
% coded by the map [5 ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_plotbox.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_plotbox.m | 414 | utf_8 | aa06ce4932a213fb933bbede6072b029 | function results = vl_test_plotbox(varargin)
% VL_TEST_PLOTBOX
vl_test_init ;
function test_basic(s)
figure(1) ; clf ;
vl_plotbox([-1 -1 1 1]') ;
xlim([-2 2]) ;
ylim([-2 2]) ;
close(1) ;
function test_multiple(s)
figure(1) ; clf ;
randn('state', 0) ;
vl_plotbox(randn(4,10)) ;
close(1) ;
function test_style(s)
figure... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imarray.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_imarray.m | 795 | utf_8 | c5e6a5aa8c2e63e248814f5bd89832a8 | function results = vl_test_imarray(varargin)
% VL_TEST_IMARRAY
vl_test_init ;
function test_movie_rgb(s)
A = rand(23,15,3,4) ;
B = vl_imarray(A,'movie',true) ;
function test_movie_indexed(s)
cmap = get(0,'DefaultFigureColormap') ;
A = uint8(size(cmap,1)*rand(23,15,4)) ;
A = min(A,size(cmap,1)-1) ;
B = vl_imarray(A,'m... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_homkermap.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_homkermap.m | 1,903 | utf_8 | c157052bf4213793a961bde1f73fb307 | function results = vl_test_homkermap(varargin)
% VL_TEST_HOMKERMAP
vl_test_init ;
function check_ker(ker, n, window, period)
args = {n, ker, 'window', window} ;
if nargin > 3
args = {args{:}, 'period', period} ;
end
x = [-1 -.5 0 .5 1] ;
y = linspace(0,2,100) ;
for conv = {@single, @double}
x = feval(conv{1}, x) ;... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_slic.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_slic.m | 200 | utf_8 | 12a6465e3ef5b4bcfd7303cd8a9229d4 | function results = vl_test_slic(varargin)
% VL_TEST_SLIC
vl_test_init ;
function s = setup()
s.im = im2single(vl_impattern('roofs1')) ;
function test_slic(s)
segmentation = vl_slic(s.im, 10, 0.1) ;
|
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_ikmeans.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_ikmeans.m | 466 | utf_8 | 1ee2f647ac0035ed0d704a0cd615b040 | function results = vl_test_ikmeans(varargin)
% VL_TEST_IKMEANS
vl_test_init ;
function s = setup()
rand('state',0) ;
s.data = uint8(rand(2,1000) * 255) ;
function test_basic(s)
[centers, assign] = vl_ikmeans(s.data,100) ;
assign_ = vl_ikmeanspush(s.data, centers) ;
vl_assert_equal(assign,assign_) ;
function test_elk... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_mser.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_mser.m | 242 | utf_8 | 1ad33563b0c86542a2978ee94e0f4a39 | function results = vl_test_mser(varargin)
% VL_TEST_MSER
vl_test_init ;
function s = setup()
s.im = im2uint8(rgb2gray(vl_impattern('roofs1'))) ;
function test_mser(s)
[regions,frames] = vl_mser(s.im) ;
mask = vl_erfill(s.im, regions(1)) ;
|
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_inthist.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_inthist.m | 811 | utf_8 | 459027d0c54d8f197563a02ab66ef45d | function results = vl_test_inthist(varargin)
% VL_TEST_INTHIST
vl_test_init ;
function s = setup()
rand('state',0) ;
s.labels = uint32(8*rand(123, 76, 3)) ;
function test_basic(s)
l = 10 ;
hist = vl_inthist(s.labels, 'numlabels', l) ;
hist_ = inthist_slow(s.labels, l) ;
vl_assert_equal(double(hist),hist_) ;
function... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imdisttf.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_imdisttf.m | 1,885 | utf_8 | ae921197988abeb984cbcdf9eaf80e77 | function results = vl_test_imdisttf(varargin)
% VL_TEST_DISTTF
vl_test_init ;
function test_basic()
for conv = {@single, @double}
conv = conv{1} ;
I = conv([0 0 0 ; 0 -2 0 ; 0 0 0]) ;
D = vl_imdisttf(I);
assert(isequal(D, conv(- [0 1 0 ; 1 2 1 ; 0 1 0]))) ;
I(2,2) = -3 ;
[D,map] = vl_imdisttf(I) ;
asse... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_vlad.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_vlad.m | 1,977 | utf_8 | d3797288d6edb1d445b890db3780c8ce | function results = vl_test_vlad(varargin)
% VL_TEST_VLAD
vl_test_init ;
function s = setup()
randn('state',0) ;
s.x = randn(128,256) ;
s.mu = randn(128,16) ;
assignments = rand(16, 256) ;
s.assignments = bsxfun(@times, assignments, 1 ./ sum(assignments,1)) ;
function test_basic (s)
x = [1, 2, 3] ;
mu = [0, 0, 0] ;
a... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_pr.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_pr.m | 3,763 | utf_8 | 4d1da5ccda1a7df2bec35b8f12fdd620 | function results = vl_test_pr(varargin)
% VL_TEST_PR
vl_test_init ;
function s = setup()
s.scores0 = [5 4 3 2 1] ;
s.scores1 = [5 3 4 2 1] ;
s.labels = [1 1 -1 -1 -1] ;
function test_perfect_tptn(s)
[rc,pr] = vl_pr(s.labels,s.scores0) ;
vl_assert_almost_equal(pr, [1 1/1 2/2 2/3 2/4 2/5]) ;
vl_assert_almost_equal(rc, ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_hog.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_hog.m | 1,555 | utf_8 | eed7b2a116d142040587dc9c4eb7cd2e | function results = vl_test_hog(varargin)
% VL_TEST_HOG
vl_test_init ;
function s = setup()
s.im = im2single(vl_impattern('roofs1')) ;
[x,y]= meshgrid(linspace(-1,1,128)) ;
s.round = single(x.^2+y.^2);
s.imSmall = s.im(1:128,1:128,:) ;
s.imSmall = s.im ;
s.imSmallFlipped = s.imSmall(:,end:-1:1,:) ;
function test_basic... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_argparse.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_argparse.m | 795 | utf_8 | e72185b27206d0ee1dfdc19fe77a5be6 | function results = vl_test_argparse(varargin)
% VL_TEST_ARGPARSE
vl_test_init ;
function test_basic()
opts.field1 = 1 ;
opts.field2 = 2 ;
opts.field3 = 3 ;
opts_ = opts ;
opts_.field1 = 3 ;
opts_.field2 = 10 ;
opts = vl_argparse(opts, {'field2', 10, 'field1', 3}) ;
assert(isequal(opts, opts_)) ;
opts_.field1 = 9 ;
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_liop.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_liop.m | 1,023 | utf_8 | a162be369073bed18e61210f44088cf3 | function results = vl_test_liop(varargin)
% VL_TEST_SIFT
vl_test_init ;
function s = setup()
randn('state',0) ;
s.patch = randn(65,'single') ;
xr = -32:32 ;
[x,y] = meshgrid(xr) ;
s.blob = - single(x.^2+y.^2) ;
function test_basic(s)
d = vl_liop(s.patch) ;
function test_blob(s)
% with a blob, all local intensity ord... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_binsearch.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/xtest/vl_test_binsearch.m | 1,339 | utf_8 | 85dc020adce3f228fe7dfb24cf3acc63 | function results = vl_test_binsearch(varargin)
% VL_TEST_BINSEARCH
vl_test_init ;
function test_inf_bins()
x = [-inf -1 0 1 +inf] ;
vl_assert_equal(vl_binsearch([], x), [0 0 0 0 0]) ;
vl_assert_equal(vl_binsearch([-inf 0], x), [1 1 2 2 2]) ;
vl_assert_equal(vl_binsearch([-inf], x), [1 1 1 1 1]) ;
vl_a... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_roc.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/plotop/vl_roc.m | 8,747 | utf_8 | 6b8b4786c9242d5112ca90a616db507a | function [tpr,tnr,info] = vl_roc(labels, scores, varargin)
%VL_ROC ROC curve.
% [TPR,TNR] = VL_ROC(LABELS, SCORES) computes the Receiver Operating
% Characteristic (ROC) curve. LABELS are the ground truth labels,
% greather than zero for a positive sample and smaller than zero for
% a negative one. SCORES are... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_click.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/plotop/vl_click.m | 2,661 | utf_8 | 6982e869cf80da57fdf68f5ebcd05a86 | function P = vl_click(N,varargin) ;
% VL_CLICK Click a point
% P=VL_CLICK() let the user click a point in the current figure and
% returns its coordinates in P. P is a two dimensiona vectors where
% P(1) is the point X-coordinate and P(2) the point Y-coordinate. The
% user can abort the operation by pressing any k... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_pr.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/plotop/vl_pr.m | 9,135 | utf_8 | c5d1b9d67f843d10c0b2c6b48fab3c53 | function [recall, precision, info] = vl_pr(labels, scores, varargin)
%VL_PR Precision-recall curve.
% [RECALL, PRECISION] = VL_PR(LABELS, SCORES) computes the
% precision-recall (PR) curve. LABELS are the ground truth labels,
% greather than zero for a positive sample and smaller than zero for
% a negative on... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_ubcread.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/sift/vl_ubcread.m | 3,015 | utf_8 | e8ddd3ecd87e76b6c738ba153fef050f | function [f,d] = vl_ubcread(file, varargin)
% SIFTREAD Read Lowe's SIFT implementation data files
% [F,D] = VL_UBCREAD(FILE) reads the frames F and the descriptors D
% from FILE in UBC (Lowe's original implementation of SIFT) format
% and returns F and D as defined by VL_SIFT().
%
% VL_UBCREAD(FILE, 'FORMAT', '... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_frame2oell.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/sift/vl_frame2oell.m | 2,160 | utf_8 | 457c5f2e8b637108c8c1b2256396de13 | function eframes = vl_frame2oell(frames)
% FRAMES2OELL Convert generic feature frames to oriented ellipses
% EFRAMES = VL_FRAME2OELL(FRAMES) converts the specified FRAMES to
% the oriented ellipses EFRAMES.
%
% A frame is either a point, disc, oriented disc, ellipse, or
% oriented ellipse. These are represene... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_plotsiftdescriptor.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/toolbox/sift/vl_plotsiftdescriptor.m | 4,725 | utf_8 | 395bf4e0d7417674401ddf34cc8a70da | function h=vl_plotsiftdescriptor(d,f,varargin)
% VL_PLOTSIFTDESCRIPTOR Plot SIFT descriptor
% VL_PLOTSIFTDESCRIPTOR(D) plots the SIFT descriptors D, stored as
% columns of the matrix D. D has the same format used by VL_SIFT().
%
% VL_PLOTSIFTDESCRIPTOR(D,F) plots the SIFT descriptors warped to
% the SIFT fram... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | phow_caltech101.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/apps/phow_caltech101.m | 11,595 | utf_8 | cdd4c2add2b7bbfe66a43831513f99fc | function phow_caltech101()
% PHOW_CALTECH101 Image classification in the Caltech-101 dataset
% This program demonstrates how to use VLFeat to construct an image
% classifier on the Caltech-101 data. The classifier uses PHOW
% features (dense SIFT), spatial histograms of visual words, and a
% Chi2 SVM. To speedu... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | sift_mosaic.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/apps/sift_mosaic.m | 4,621 | utf_8 | 8fa3ad91b401b8f2400fb65944c79712 | function mosaic = sift_mosaic(im1, im2)
% SIFT_MOSAIC Demonstrates matching two images using SIFT and RANSAC
%
% SIFT_MOSAIC demonstrates matching two images based on SIFT
% features and RANSAC and computing their mosaic.
%
% SIFT_MOSAIC by itself runs the algorithm on two standard test
% images. Use SIFT_MOSAI... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | encodeImage.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/apps/recognition/encodeImage.m | 5,278 | utf_8 | 5d9dc6161995b8e10366b5649bf4fda4 | function descrs = encodeImage(encoder, im, varargin)
% ENCODEIMAGE Apply an encoder to an image
% DESCRS = ENCODEIMAGE(ENCODER, IM) applies the ENCODER
% to image IM, returning a corresponding code vector PSI.
%
% IM can be an image, the path to an image, or a cell array of
% the same, to operate on multiple ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | experiments.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/apps/recognition/experiments.m | 6,905 | utf_8 | 1e4a4911eed4a451b9488b9e6cc9b39c | function experiments()
% EXPERIMENTS Run image classification experiments
% The experimens download a number of benchmark datasets in the
% 'data/' subfolder. Make sure that there are several GBs of
% space available.
%
% By default, experiments run with a lite option turned on. This
% quickly runs all... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | getDenseSIFT.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_linux/vlfeat-0.9.17/apps/recognition/getDenseSIFT.m | 1,679 | utf_8 | 2059c0a2a4e762226d89121408c6e51c | function features = getDenseSIFT(im, varargin)
% GETDENSESIFT Extract dense SIFT features
% FEATURES = GETDENSESIFT(IM) extract dense SIFT features from
% image IM.
% Author: Andrea Vedaldi
% Copyright (C) 2013 Andrea Vedaldi
% All rights reserved.
%
% This file is part of the VLFeat library and is made availab... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_compile.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/vl_compile.m | 5,060 | utf_8 | 978f5189bb9b2a16db3368891f79aaa6 | function vl_compile(compiler)
% VL_COMPILE Compile VLFeat MEX files
% VL_COMPILE() uses MEX() to compile VLFeat MEX files. This command
% works only under Windows and is used to re-build problematic
% binaries. The preferred method of compiling VLFeat on both UNIX
% and Windows is through the provided Makefile... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_noprefix.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/vl_noprefix.m | 1,875 | utf_8 | 97d8755f0ba139ac1304bc423d3d86d3 | function vl_noprefix
% VL_NOPREFIX Create a prefix-less version of VLFeat commands
% VL_NOPREFIX() creats prefix-less stubs for VLFeat functions
% (e.g. SIFT for VL_SIFT). This function is seldom used as the stubs
% are included in the VLFeat binary distribution anyways. Moreover,
% on UNIX platforms, the stub... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_pegasos.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/misc/vl_pegasos.m | 2,837 | utf_8 | d5e0915c439ece94eb5597a07090b67d | % VL_PEGASOS [deprecated]
% VL_PEGASOS is deprecated. Please use VL_SVMTRAIN() instead.
function [w b info] = vl_pegasos(X,Y,LAMBDA, varargin)
% Verbose not supported
if (sum(strcmpi('Verbose',varargin)))
varargin(find(strcmpi('Verbose',varargin),1))=[];
fprintf('Option VERBOSE is no longer supported.\n');
en... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_svmpegasos.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/misc/vl_svmpegasos.m | 1,178 | utf_8 | 009c2a2b87a375d529ed1a4dbe3af59f | % VL_SVMPEGASOS [deprecated]
% VL_SVMPEGASOS is deprecated. Please use VL_SVMTRAIN() instead.
function [w b info] = vl_svmpegasos(DATA,LAMBDA, varargin)
% Verbose not supported
if (sum(strcmpi('Verbose',varargin)))
varargin(find(strcmpi('Verbose',varargin),1))=[];
fprintf('Option VERBOSE is no longer suppor... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_override.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/misc/vl_override.m | 4,654 | utf_8 | e233d2ecaeb68f56034a976060c594c5 | function config = vl_override(config,update,varargin)
% VL_OVERRIDE Override structure subset
% CONFIG = VL_OVERRIDE(CONFIG, UPDATE) copies recursively the fileds
% of the structure UPDATE to the corresponding fields of the
% struture CONFIG.
%
% Usually CONFIG is interpreted as a list of paramters with their
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_quickvis.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/quickshift/vl_quickvis.m | 3,696 | utf_8 | 27f199dad4c5b9c192a5dd3abc59f9da | function [Iedge dists map gaps] = vl_quickvis(I, ratio, kernelsize, maxdist, maxcuts)
% VL_QUICKVIS Create an edge image from a Quickshift segmentation.
% IEDGE = VL_QUICKVIS(I, RATIO, KERNELSIZE, MAXDIST, MAXCUTS) creates an edge
% stability image from a Quickshift segmentation. RATIO controls the tradeoff
% bet... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_aib.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/demo/vl_demo_aib.m | 2,928 | utf_8 | 590c6db09451ea608d87bfd094662cac | function vl_demo_aib
% VL_DEMO_AIB Test Agglomerative Information Bottleneck (AIB)
D = 4 ;
K = 20 ;
randn('state',0) ;
rand('state',0) ;
X1 = randn(2,300) ; X1(1,:) = X1(1,:) + 2 ;
X2 = randn(2,300) ; X2(1,:) = X2(1,:) - 2 ;
X3 = randn(2,300) ; X3(2,:) = X3(2,:) + 2 ;
figure(1) ; clf ; hold on ;
vl_plotframe(X... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_alldist.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/demo/vl_demo_alldist.m | 5,460 | utf_8 | 6d008a64d93445b9d7199b55d58db7eb | function vl_demo_alldist
%
numRepetitions = 3 ;
numDimensions = 1000 ;
numSamplesRange = [300] ;
settingsRange = {{'alldist2', 'double', 'l2', }, ...
{'alldist', 'double', 'l2', 'nosimd'}, ...
{'alldist', 'double', 'l2' }, ...
{'alldist2', 's... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_svm.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/demo/vl_demo_svm.m | 1,235 | utf_8 | 7cf6b3504e4fc2cbd10ff3fec6e331a7 | % VL_DEMO_SVM Demo: SVM: 2D linear learning
function vl_demo_svm
y=[];X=[];
% Load training data X and their labels y
load('vl_demo_svm_data.mat')
Xp = X(:,y==1);
Xn = X(:,y==-1);
figure
plot(Xn(1,:),Xn(2,:),'*r')
hold on
plot(Xp(1,:),Xp(2,:),'*b')
axis equal ;
vl_demo_print('svm_training') ;
% Parameters
lambda =... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_demo_kdtree_sift.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/demo/vl_demo_kdtree_sift.m | 6,832 | utf_8 | e676f80ac330a351f0110533c6ebba89 | function vl_demo_kdtree_sift
% VL_DEMO_KDTREE_SIFT
% Demonstrates the use of a kd-tree forest to match SIFT
% features. If FLANN is present, this function runs a comparison
% against it.
% AUTORIGHS
rand('state',0) ;
randn('state',0);
do_median = 0 ;
do_mean = 1 ;
% try to setup flann
if ~exist('flann_search'... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_impattern.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/imop/vl_impattern.m | 6,876 | utf_8 | 1716a4d107f0186be3d11c647bc628ce | function im = vl_impattern(varargin)
% VL_IMPATTERN Generate an image from a stock pattern
% IM=VLPATTERN(NAME) returns an instance of the specified
% pattern. These stock patterns are useful for testing algoirthms.
%
% All generated patterns are returned as an image of class
% DOUBLE. Both gray-scale and colou... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_tpsu.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/imop/vl_tpsu.m | 1,755 | utf_8 | 09f36e1a707c069b375eb2817d0e5f13 | function [U,dU,delta]=vl_tpsu(X,Y)
% VL_TPSU Compute the U matrix of a thin-plate spline transformation
% U=VL_TPSU(X,Y) returns the matrix
%
% [ U(|X(:,1) - Y(:,1)|) ... U(|X(:,1) - Y(:,N)|) ]
% [ ]
% [ U(|X(:,M) - Y(:,1)|) ... U(|X(:,M) - Y(:,N)|) ]
%
% where X... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_xyz2lab.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/imop/vl_xyz2lab.m | 1,570 | utf_8 | 09f95a6f9ae19c22486ec1157357f0e3 | function J=vl_xyz2lab(I,il)
% VL_XYZ2LAB Convert XYZ color space to LAB
% J = VL_XYZ2LAB(I) converts the image from XYZ format to LAB format.
%
% VL_XYZ2LAB(I,IL) uses one of the illuminants A, B, C, E, D50, D55,
% D65, D75, D93. The default illuminatn is E.
%
% See also: VL_XYZ2LUV(), VL_HELP().
% Copyright ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_gmm.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_gmm.m | 1,332 | utf_8 | 76782cae6c98781c6c38d4cbf5549d94 | function results = vl_test_gmm(varargin)
% VL_TEST_GMM
% Copyright (C) 2007-12 Andrea Vedaldi and Brian Fulkerson.
% All rights reserved.
%
% This file is part of the VLFeat library and is made available under
% the terms of the BSD license (see the COPYING file).
vl_test_init ;
end
function s = setup()
randn('st... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_twister.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_twister.m | 1,251 | utf_8 | 2bfb5a30cbd6df6ac80c66b73f8646da | function results = vl_test_twister(varargin)
% VL_TEST_TWISTER
vl_test_init ;
function test_illegal_args()
vl_assert_exception(@() vl_twister(-1), 'vl:invalidArgument') ;
vl_assert_exception(@() vl_twister(1, -1), 'vl:invalidArgument') ;
vl_assert_exception(@() vl_twister([1, -1]), 'vl:invalidArgument') ;
function te... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_kdtree.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_kdtree.m | 2,449 | utf_8 | 9d7ad2b435a88c22084b38e5eb5f9eb9 | function results = vl_test_kdtree(varargin)
% VL_TEST_KDTREE
vl_test_init ;
function s = setup()
randn('state',0) ;
s.X = single(randn(10, 1000)) ;
s.Q = single(randn(10, 10)) ;
function test_nearest(s)
for tmethod = {'median', 'mean'}
for type = {@single, @double}
conv = type{1} ;
tmethod = char(tmethod) ;... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imwbackward.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_imwbackward.m | 514 | utf_8 | 33baa0784c8f6f785a2951d7f1b49199 | function results = vl_test_imwbackward(varargin)
% VL_TEST_IMWBACKWARD
vl_test_init ;
function s = setup()
s.I = im2double(imread(fullfile(vl_root,'data','spots.jpg'))) ;
function test_identity(s)
xr = 1:size(s.I,2) ;
yr = 1:size(s.I,1) ;
[x,y] = meshgrid(xr,yr) ;
vl_assert_almost_equal(s.I, vl_imwbackward(xr,yr,s.I,... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_alphanum.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_alphanum.m | 1,624 | utf_8 | 2da2b768c2d0f86d699b8f31614aa424 | function results = vl_test_alphanum(varargin)
% VL_TEST_ALPHANUM
vl_test_init ;
function s = setup()
s.strings = ...
{'1000X Radonius Maximus','10X Radonius','200X Radonius','20X Radonius','20X Radonius Prime','30X Radonius','40X Radonius','Allegia 50 Clasteron','Allegia 500 Clasteron','Allegia 50B Clasteron','Al... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_printsize.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_printsize.m | 1,447 | utf_8 | 0f0b6437c648b7a2e1310900262bd765 | function results = vl_test_printsize(varargin)
% VL_TEST_PRINTSIZE
vl_test_init ;
function s = setup()
s.fig = figure(1) ;
s.usletter = [8.5, 11] ; % inches
s.a4 = [8.26772, 11.6929] ;
clf(s.fig) ; plot(1:10) ;
function teardown(s)
close(s.fig) ;
function test_basic(s)
for sigma = [1 0.5 0.2]
vl_printsize(s.fig, s... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_cummax.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_cummax.m | 762 | utf_8 | 3dddb5736dfffacdd94b156e67cb9c14 | function results = vl_test_cummax(varargin)
% VL_TEST_CUMMAX
vl_test_init ;
function test_basic()
vl_assert_almost_equal(...
vl_cummax(1), 1) ;
vl_assert_almost_equal(...
vl_cummax([1 2 3 4], 2), [1 2 3 4]) ;
function test_multidim()
a = [1 2 3 4 3 2 1] ;
b = [1 2 3 4 4 4 4] ;
for k=1:6
dims = ones(1,6) ;
dim... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_imintegral.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_imintegral.m | 1,429 | utf_8 | 4750f04ab0ac9fc4f55df2c8583e5498 | function results = vl_test_imintegral(varargin)
% VL_TEST_IMINTEGRAL
vl_test_init ;
function state = setup()
state.I = ones(5,6) ;
state.correct = [ 1 2 3 4 5 6 ;
2 4 6 8 10 12 ;
3 6 9 12 15 18 ;
4 8 12 ... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_sift.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_sift.m | 1,318 | utf_8 | 806c61f9db9f2ebb1d649c9bfcf3dc0a | function results = vl_test_sift(varargin)
% VL_TEST_SIFT
vl_test_init ;
function s = setup()
s.I = im2single(imread(fullfile(vl_root,'data','box.pgm'))) ;
[s.ubc.f, s.ubc.d] = ...
vl_ubcread(fullfile(vl_root,'data','box.sift')) ;
function test_ubc_descriptor(s)
err = [] ;
[f, d] = vl_sift(s.I,...
... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_binsum.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_binsum.m | 1,301 | utf_8 | 5bbd389cbc4d997e413d809fe4efda6d | function results = vl_test_binsum(varargin)
% VL_TEST_BINSUM
vl_test_init ;
function test_three_args()
vl_assert_almost_equal(...
vl_binsum([0 0], 1, 2), [0 1]) ;
vl_assert_almost_equal(...
vl_binsum([1 7], -1, 1), [0 7]) ;
vl_assert_almost_equal(...
vl_binsum([1 7], -1, [1 2 2 2 2 2 2 2]), [0 0]) ;
function te... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_lbp.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_lbp.m | 1,056 | utf_8 | 3b5cca50109af84014e56a4280a3352a | function results = vl_test_lbp(varargin)
% VL_TEST_TWISTER
vl_test_init ;
function test_one_on()
I = {} ;
I{1} = [0 0 0 ; 0 0 1 ; 0 0 0] ;
I{2} = [0 0 0 ; 0 0 0 ; 0 0 1] ;
I{3} = [0 0 0 ; 0 0 0 ; 0 1 0] ;
I{4} = [0 0 0 ; 0 0 0 ; 1 0 0] ;
I{5} = [0 0 0 ; 1 0 0 ; 0 0 0] ;
I{6} = [1 0 0 ; 0 0 0 ; 0 0 0] ;
I{7} = [0 1 0 ;... |
github | ivpshu/Saliency-Tree-A-Novel-Saliency-Detection-Framework-master | vl_test_colsubset.m | .m | Saliency-Tree-A-Novel-Saliency-Detection-Framework-master/ST_release/ST_win/vlfeat-0.9.17/toolbox/xtest/vl_test_colsubset.m | 828 | utf_8 | be0c080007445b36333b863326fb0f15 | function results = vl_test_colsubset(varargin)
% VL_TEST_COLSUBSET
vl_test_init ;
function s = setup()
s.x = [5 2 3 6 4 7 1 9 8 0] ;
function test_beginning(s)
vl_assert_equal(1:5, vl_colsubset(1:10, 5, 'beginning')) ;
vl_assert_equal(1:5, vl_colsubset(1:10, .5, 'beginning')) ;
function test_ending(s)
vl_assert_equa... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.