39 files changed, 1560 insertions, 0 deletions
diff --git a/SD-VBS/benchmarks/mser/.mser.mex.c.swp b/SD-VBS/benchmarks/mser/.mser.mex.c.swp
new file mode 100755
index 0000000..4f3a21c
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/.mser.mex.c.swp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/Makefile b/SD-VBS/benchmarks/mser/Makefile
new file mode 100644
index 0000000..60cc0ec
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/Makefile
@@ -0,0 +1,3 @@
+include ../../common/makefiles/Makefile.include
+include $(MAKEFILE_COMMON_DIR)/Makefile.recurse
diff --git a/SD-VBS/benchmarks/mser/data/Makefile b/SD-VBS/benchmarks/mser/data/Makefile
new file mode 100644
index 0000000..ba33d35
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/Makefile
@@ -0,0 +1,3 @@
+include ../../../common/makefiles/Makefile.include
+include $(MAKEFILE_COMMON_DIR)/Makefile.recurse
diff --git a/SD-VBS/benchmarks/mser/data/cif/1.bmp b/SD-VBS/benchmarks/mser/data/cif/1.bmp
new file mode 100644
index 0000000..df56ca3
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/cif/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/cif/Makefile b/SD-VBS/benchmarks/mser/data/cif/Makefile
new file mode 100644
index 0000000..41c7f38
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/cif/Makefile
@@ -0,0 +1,6 @@
+INPUT=cif
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/cif/VBS_Ver1 b/SD-VBS/benchmarks/mser/data/cif/VBS_Ver1
new file mode 100755
index 0000000..bafb9c7
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/cif/VBS_Ver1
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/cif/expected.m b/SD-VBS/benchmarks/mser/data/cif/expected.m
new file mode 100644
index 0000000..b4123c3
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/cif/expected.m
@@ -0,0 +1,162 @@
+91080   
+40916   
+90318   
+48277   
+57285   
+66702   
+66453   
+15757   
+56228   
+9401    
+72213   
+62502   
+50676   
+8016    
+76446   
+4080    
+26989   
+2894    
+15233   
+25177   
+46411   
+77708   
+79330   
+79286   
+7639    
+39100   
+20919   
+24125   
+69034   
+87683   
+33330   
+9587    
+14591   
+37790   
+57107   
+2905    
+72581   
+30138   
+66349   
+69782   
+53208   
+63252   
+8011    
+20400   
+47661   
+59179   
+71075   
+3544    
+75352   
+5143    
+42527   
+49924   
+9933    
+13880   
+38559   
+45184   
+48697   
+51275   
+57095   
+27545   
+41718   
+46519   
+25666   
+31481   
+56792   
+59176   
+29879   
+42197   
+62643   
+58210   
+20334   
+5623    
+43569   
+46210   
+50474   
+62104   
+65808   
+46945   
+52682   
+63195   
+77194   
+50534   
+60544   
+41770   
+48717   
+53246   
+57723   
+3829    
+20457   
+28461   
+32341   
+6413    
+30286   
+41193   
+50243   
+55458   
+56851   
+60038   
+35141   
+59004   
+63503   
+34763   
+48953   
+55092   
+4534    
+70791   
+20249   
+28134   
+33971   
+53439   
+55882   
+30562   
+33993   
+34523   
+67709   
+60469   
+8591    
+20489   
+72123   
+20237   
+62971   
+26046   
+27337   
+27638   
+29497   
+46390   
+18004   
+41108   
+47659   
+72386   
+31584   
+52173   
+58091   
+46624   
+68233   
+25267   
+29768   
+52802   
+63228   
+39529   
+37092   
+48469   
+41074   
+44231   
+18653   
+40524   
+26529   
+32423   
+27131   
+37373   
+39650   
+65233   
+72920   
+12277   
+33656   
+33151   
+40026   
+48408   
+33352   
+91265   
+32307   
+33875   
diff --git a/SD-VBS/benchmarks/mser/data/cif/expected_C.txt b/SD-VBS/benchmarks/mser/data/cif/expected_C.txt
new file mode 100644
index 0000000..05b4c67
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/cif/expected_C.txt
@@ -0,0 +1 @@
+91081   40917   90319   48278   57286   66703   66454   15758   56229   9402    72214   62503   50677   8017    76447   4081    26990   2895    15234   25178   46412   77709   79331   79287   7640    39101   20920   24126   69035   87684   33331   9588    14592   37791   57108   2906    72582   30139   66350   69783   53209   63253   8012    20401   47662   59180   71076   3545    75353   5144    42528   49925   9934    13881   38560   45185   48698   51276   57096   27546   41719   46520   25667   31482   56793   59177   29880   42198   62644   58211   20335   5624    43570   46211   50475   62105   65809   46946   52683   63196   77195   50535   60545   41771   48718   53247   57724   3830    20458   28462   32342   6414    30287   41194   50244   55459   56852   60039   35142   59005   63504   34764   48954   55093   4535    70792   20250   28135   33972   53440   55883   30563   33994   34524   67710   60470   8592    20490   72124   20238   62972   26047   27338   27639   29498   46391   18005   41109   47660   72387   31585   52174   58092   46625   68234   25268   29769   52803   63229   39530   37093   48470   41075   44232   18654   40525   26530   32424   27132   37374   39651   65234   72921   12278   33657   33152   40027   48409   33353   91266   32308   33876   
diff --git a/SD-VBS/benchmarks/mser/data/fullhd/1.bmp b/SD-VBS/benchmarks/mser/data/fullhd/1.bmp
new file mode 100644
index 0000000..c09aaf0
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/fullhd/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/fullhd/Makefile b/SD-VBS/benchmarks/mser/data/fullhd/Makefile
new file mode 100644
index 0000000..5cce221
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/fullhd/Makefile
@@ -0,0 +1,6 @@
+INPUT=fullhd
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/fullhd/expected_C.txt b/SD-VBS/benchmarks/mser/data/fullhd/expected_C.txt
new file mode 100644
index 0000000..4da91c9
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/fullhd/expected_C.txt
@@ -0,0 +1 @@
+1529403 2050668 2060219 2065998 1115208 1189974 1103738 1138213 1161232 1631082 1700107 2065921 1076907 1044256 1571996 938727  1276781 1552683 2012388 1608460 1585368 1667945 485340  1734635 96820   170073  825522  1571939 1113544 1350947 1702192 700563  777477  867824  168152  481500  562220  597608  1112457 1330394 273235  405671  571794  624470  1078084 355720  760235  1238216 1608260 1732716 213837  221544  371107  560320  590102  1744632 1159602 1586979 1602528 1792334 284744  557432  568930  833734  1765486 117983  215695  468960  511244  1269602 1275329 1465595 1818735 104343  326933  333496  511419  534515  956235  131244  254368  885381  1270760 1527618 177267  386650  591865  708851  760754  837286  1099035 1144201 1249657 1312035 1383067 1515290 1570495 1583144 1631403 1820636 198667  354025  873795  946545  1527616 1550679 1745877 38379   90228   120941  193864  434629  587939  1007984 1773259 1820631 1778960 238062  236779  243805  295645  463153  615019  802856  959667  1057488 1204079 1350097 1346579 1359848 1373122 1382692 1769004 2051145 172672  114309  175350  444015  453826  470831  490220  547861  599768  866204  932950  1363850 1694218 1692382 1759663 131254  382773  421199  449971  524710  547758  566964  877657  975458  1050648 1123424 1763660 461304  522815  643729  965684  1011794 1066617 1119806 1160136 1302360 1306276 1726958 114304  119653  229092  311581  271376  342533  542244  545922  720510  743464  1138651 1452189 1857862 1856027 67219   272290  276124  386713  379098  733921  845066  847083  1068846 1125711 1254744 1379427 1842559 1913462 1999653 2003666 1786838 80733   129324  240584  523100  571448  666560  848711  1335245 1494247 1540503 1834482 1824959 1849805 1930503 1938248 1978435 1988276 2012993 2049629 2034394 2057165 2068696 285288  321166  607510  873970  1091422 1317427 1335587 1356332 1365994 1500249 1852264 1418    164305  352275  360088  546482  1082435 1232013 1328020 1597868 1671168 1761335 77615   104339  283363  319643  350425  363892  488416  704297  846791  860244  952488  971790  1114038 1241333 1275824 1419185 1442542 1521003 1653652 1655511 1799706 83521   306379  331285  492752  573360  609785  751728  1061431 1137245 1261940 1407996 117731  356213  363877  536887  992690  1033349 1064701 1110678 1141384 1136738 1160061 1448728 1469580 1636301 1655564 1822530 1839151 609266  701280  921337  1006279 1080514 1090610 1096560 1127232 1129081 1141064 1159842 1135074 1183287 1198321 1480633 1442708 1465496 1523318 1592646 1833563 243075  399748  405994  574505  672282  814238  842950  929725  937371  962166  1219325 1248164 1250572 1511842 1519509 1802860 1830413 1230091 1256148 1283800 1287280 1296899 235275  444901  570624  1096443 1196401 1095215 1131755 1206317 1227485 1237055 1453880 1363925 1374951 106760  85487   100502  261326  281437  785434  812320  910139  1248647 1287135 1314019 1346573 1478881 1623149 506366  719077  724038  990365  1051591 1174183 1207798 1262323 1425312 617016  137323  314204  339159  551413  667838  743976  994751  1139456 1090449 1186070 1320014 1350253 1360089 1421847 1467162 1705786 621012  734456  1390932 1419129 81614   381293  652464  675475  677227  988818  1118034 1168707 1176496 1425472 233352  553255  562982  610108  675157  1132282 1216602 1509898 1798254 294220  488649  644265  696125  701011  794413  819343  854441  1680547 918108  1231630 1340325 1388270 1536261 1563174 1599735 1666985 1688540 625058  715603  777156  777763  1182825 1228170 1246733 1332668 1351761 1418003 1621227 328754  446326  488645  502527  524471  636615  763692  908163  1030298 1061656 1230024 1241557 1330721 1329411 1521570 185328  543661  825065  1009921 1041835 1221929 1437044 712401  255681  442688  471566  486911  625361  763594  1045612 1235651 1301825 1419685 1542614 1554155 427603  699090  729151  747077  762336  826798  972870  1042569 1078903 1595810 1548327 1759818 1791736 1799450 656140  798078  848458  1055029 1094434 1197260 1231808 602216  617541  641557  771344  825132  953740  1064863 1297983 388228  674179  963274  1286511 1321042 1339252 1406446 1412128 1484412 1515107 1603571 1809723 110462  444830  506095  711870  728863  730712  734833  736694  790259  826797  871157  1243138 1074342 1084834 1128999 1193422 1480502 1475487 1744099 421752  632714  659748  646385  761457  1313392 1442835 1477440 596528  598482  696121  1056933 1036262 1147370 1219201 8240    177643  450540  606961  728849  734557  828750  876774  897960  932449  1195397 1198110 1434443 1447876 1548512 1895251 38991   671294  797737  1011203 1011141 1172433 1259586 1357565 1435142 60245   844238  847923  840587  842213  842493  1001703 1054989 1024601 1057173 659720  943954  965077  997804  1245272 1579221 793896  813698  811841  819478  834833  869240  955360  1020869 1040032 1490073 870875  928602  1014995 1005448 1508114 531300  803640  844488  1165466 1260561 1294081 1294108 1357441 1376652 1396834 1473725 926843  718928  926679  939850  990022  1480466 856043  888697  1026463 991697  1045522 1470858 799794  850338  849759  1026688 991724  1628326 1810642 527456  982128  1712717 790052  415979  763126  770816  1068373 965288  1788579 623624  602423  1028284 1026381 1070271 763124  862987  1011036 1022845 1026385 778563  642766  792104  1011013 1022523 805527  776642  806832  763165  1009117 767703  883645  763858  638917  761243  1449790 555812  239161  179508  907416  1609320 911260  1795940 237240  878616  905494  684609  978441  965006  786510  1688897 724950  726382  978705  870928  1663995 1331557 1662082 1656339 718709  1683145 1713818 1709983 716793  2025035 2059603 1093129 1988548 2021195 1089300 1873763 1892551 1106648 709148  1951870 1098986 1888734 707207  1077806 902484  712947  896808  1973190 915987  1868004 2071640 1884902 607080  1186616 2015894 2040300 2034541 2055661 2053792 2065339 2071552 2073094 424777  1087211 388261  1093568 686115  705280  1099460 734650  788407  1071699 772406  1054651 912583  845435  849213  891445  958681  1241478 880043  899239  
diff --git a/SD-VBS/benchmarks/mser/data/qcif/1.bmp b/SD-VBS/benchmarks/mser/data/qcif/1.bmp
new file mode 100644
index 0000000..f5a4408
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/qcif/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/qcif/Makefile b/SD-VBS/benchmarks/mser/data/qcif/Makefile
new file mode 100644
index 0000000..0c1d924
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/qcif/Makefile
@@ -0,0 +1,6 @@
+INPUT=qcif
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/qcif/VBS_Ver1 b/SD-VBS/benchmarks/mser/data/qcif/VBS_Ver1
new file mode 100755
index 0000000..a973e58
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/qcif/VBS_Ver1
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/qcif/expected.m b/SD-VBS/benchmarks/mser/data/qcif/expected.m
new file mode 100644
index 0000000..41fc7d7
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/qcif/expected.m
@@ -0,0 +1,68 @@
+22308   
+10162   
+14251   
+9500    
+18683   
+5669    
+1501    
+2813    
+5180    
+6119    
+3731    
+3939    
+22065   
+2417    
+5048    
+17994   
+14159   
+15203   
+17195   
+18926   
+13616   
+2192    
+2       
+6900    
+9794    
+11366   
+14679   
+5344    
+17471   
+11778   
+16661   
+10323   
+12856   
+13141   
+7022    
+12740   
+11984   
+14560   
+12982   
+19042   
+13916   
+1250    
+7680    
+159     
+5477    
+13909   
+15632   
+7620    
+6936    
+14660   
+2021    
+12466   
+16436   
+6556    
+12499   
+9457    
+6559    
+13998   
+17616   
+9992    
+12224   
+14654   
+9572    
+6970    
+8661    
+18900   
+3364    
+8379    
diff --git a/SD-VBS/benchmarks/mser/data/qcif/expected_C.txt b/SD-VBS/benchmarks/mser/data/qcif/expected_C.txt
new file mode 100644
index 0000000..e4c467b
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/qcif/expected_C.txt
@@ -0,0 +1 @@
+22309   10163   14252   9501    18684   5670    1502    2814    5181    6120    3732    3940    22066   2418    5049    17995   14160   15204   17196   18927   13617   2193    3       6901    9795    11367   14680   5345    17472   11779   16662   10324   12857   13142   7023    12741   11985   14561   12983   19043   13917   1251    7681    160     5478    13910   15633   7621    6937    14661   2022    12467   16437   6557    12500   9458    6560    13999   17617   9993    12225   14655   9573    6971    8662    18901   3365    8380    
diff --git a/SD-VBS/benchmarks/mser/data/sim/1.bmp b/SD-VBS/benchmarks/mser/data/sim/1.bmp
new file mode 100644
index 0000000..953fe98
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/sim/Makefile b/SD-VBS/benchmarks/mser/data/sim/Makefile
new file mode 100644
index 0000000..fc94f6e
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim/Makefile
@@ -0,0 +1,6 @@
+INPUT=sim
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/sim/expected.m b/SD-VBS/benchmarks/mser/data/sim/expected.m
new file mode 100644
index 0000000..c52e720
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim/expected.m
@@ -0,0 +1,16 @@
+3611    
+5615    
+3876    
+2441    
+5556    
+127     
+1109    
+71      
+8       
+16      
+3567    
+817     
+3169    
+2121    
+4036    
+3985    
diff --git a/SD-VBS/benchmarks/mser/data/sim/expected_C.txt b/SD-VBS/benchmarks/mser/data/sim/expected_C.txt
new file mode 100644
index 0000000..a468444
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim/expected_C.txt
@@ -0,0 +1 @@
+3612    5616    3877    2442    5557    128     1110    72      9       17      3568    818     3170    2122    4037    3986    
diff --git a/SD-VBS/benchmarks/mser/data/sim_fast/1.bmp b/SD-VBS/benchmarks/mser/data/sim_fast/1.bmp
new file mode 100644
index 0000000..5ec0de1
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim_fast/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/sim_fast/Makefile b/SD-VBS/benchmarks/mser/data/sim_fast/Makefile
new file mode 100644
index 0000000..f5845eb
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim_fast/Makefile
@@ -0,0 +1,8 @@
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+INPUT=sim_fast
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/sim_fast/expected.m b/SD-VBS/benchmarks/mser/data/sim_fast/expected.m
new file mode 100644
index 0000000..5ba3c55
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim_fast/expected.m
@@ -0,0 +1,7 @@
+1214    
+353     
+1146    
+29      
+187     
+829     
+976     
diff --git a/SD-VBS/benchmarks/mser/data/sim_fast/expected_C.txt b/SD-VBS/benchmarks/mser/data/sim_fast/expected_C.txt
new file mode 100644
index 0000000..d5b961e
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sim_fast/expected_C.txt
@@ -0,0 +1 @@
+1215    354     1147    30      188     830     977     
diff --git a/SD-VBS/benchmarks/mser/data/sqcif/1.bmp b/SD-VBS/benchmarks/mser/data/sqcif/1.bmp
new file mode 100644
index 0000000..9122269
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sqcif/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/sqcif/Makefile b/SD-VBS/benchmarks/mser/data/sqcif/Makefile
new file mode 100644
index 0000000..42808ce
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sqcif/Makefile
@@ -0,0 +1,6 @@
+INPUT=sqcif
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/sqcif/expected.m b/SD-VBS/benchmarks/mser/data/sqcif/expected.m
new file mode 100644
index 0000000..a3ccbad
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sqcif/expected.m
@@ -0,0 +1,27 @@
+3549    
+5615    
+3941    
+5626    
+5113    
+1079    
+3840    
+4838    
+4050    
+7       
+1741    
+2778    
+2060    
+3911    
+13      
+1923    
+3918    
+3463    
+480     
+1488    
+344     
+33      
+2158    
+3398    
+1694    
+2420    
+4026    
diff --git a/SD-VBS/benchmarks/mser/data/sqcif/expected_C.txt b/SD-VBS/benchmarks/mser/data/sqcif/expected_C.txt
new file mode 100644
index 0000000..172e512
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/sqcif/expected_C.txt
@@ -0,0 +1 @@
+3550    5616    3942    5627    5114    1080    3841    4839    4051    8       1742    2779    2061    3912    14      1924    3919    3464    481     1489    345     34      2159    3399    1695    2421    4027    
diff --git a/SD-VBS/benchmarks/mser/data/test/1.bmp b/SD-VBS/benchmarks/mser/data/test/1.bmp
new file mode 100644
index 0000000..ba8fb8b
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/test/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/test/Makefile b/SD-VBS/benchmarks/mser/data/test/Makefile
new file mode 100644
index 0000000..8a1c79b
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/test/Makefile
@@ -0,0 +1,7 @@
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+INPUT=test
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/test/expected.m b/SD-VBS/benchmarks/mser/data/test/expected.m
new file mode 100644
index 0000000..30d764c
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/test/expected.m
@@ -0,0 +1 @@
+171     
diff --git a/SD-VBS/benchmarks/mser/data/test/expected_C.txt b/SD-VBS/benchmarks/mser/data/test/expected_C.txt
new file mode 100644
index 0000000..73baba4
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/test/expected_C.txt
@@ -0,0 +1 @@
+172     
diff --git a/SD-VBS/benchmarks/mser/data/vga/1.bmp b/SD-VBS/benchmarks/mser/data/vga/1.bmp
new file mode 100644
index 0000000..bbb3e60
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/vga/1.bmp
Binary files differ
diff --git a/SD-VBS/benchmarks/mser/data/vga/Makefile b/SD-VBS/benchmarks/mser/data/vga/Makefile
new file mode 100644
index 0000000..1b0032a
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/vga/Makefile
@@ -0,0 +1,6 @@
+INPUT=vga
+include ../../../../common/makefiles/Makefile.include
+BMARK=mser
+include $(MAKEFILE_COMMON_DIR)/Makefile.common
diff --git a/SD-VBS/benchmarks/mser/data/vga/expected.m b/SD-VBS/benchmarks/mser/data/vga/expected.m
new file mode 100644
index 0000000..23ca6be
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/vga/expected.m
@@ -0,0 +1,297 @@
+150188  
+139161  
+226889  
+295683  
+188158  
+218738  
+24760   
+122860  
+234561  
+71415   
+184318  
+25237   
+84868   
+27054   
+73340   
+252342  
+178044  
+251786  
+38543   
+166539  
+265202  
+13175   
+230154  
+241697  
+268924  
+106165  
+87963   
+140157  
+178621  
+3821    
+49293   
+51544   
+87463   
+138676  
+146393  
+153034  
+178140  
+263663  
+35512   
+81293   
+128231  
+24929   
+38545   
+157836  
+201762  
+260875  
+53461   
+58270   
+68286   
+78904   
+123882  
+143979  
+155623  
+289494  
+17912   
+166189  
+172421  
+188794  
+258462  
+80809   
+110040  
+125346  
+193605  
+215682  
+492     
+242242  
+98477   
+204773  
+271899  
+305023  
+20339   
+47220   
+48233   
+48129   
+78890   
+78902   
+121066  
+157838  
+157696  
+222421  
+195436  
+202237  
+222353  
+247870  
+263209  
+60698   
+67419   
+141637  
+168504  
+225211  
+246839  
+16955   
+45396   
+75542   
+167666  
+175462  
+185528  
+186845  
+11725   
+12720   
+17432   
+90532   
+153694  
+157695  
+163260  
+166188  
+228166  
+242515  
+264159  
+24279   
+90873   
+137217  
+178145  
+85543   
+103800  
+121961  
+126261  
+142142  
+149331  
+166705  
+138344  
+192225  
+61171   
+137772  
+159873  
+183201  
+191826  
+12731   
+21743   
+41559   
+116677  
+177659  
+157702  
+163404  
+187318  
+199366  
+216135  
+174026  
+209457  
+218175  
+256531  
+109213  
+205085  
+50229   
+137858  
+155858  
+176013  
+190780  
+10764   
+169116  
+56443   
+99749   
+100683  
+184963  
+34340   
+84582   
+152527  
+225832  
+60575   
+115240  
+226637  
+161966  
+183392  
+197327  
+213856  
+241059  
+240186  
+100504  
+74754   
+81674   
+93395   
+132483  
+183200  
+197487  
+71281   
+78323   
+108050  
+115058  
+156455  
+179831  
+104     
+178270  
+200686  
+205651  
+54048   
+67055   
+157242  
+226147  
+264274  
+97314   
+112166  
+99664   
+112206  
+116049  
+182192  
+21848   
+66537   
+130426  
+152940  
+156285  
+197779  
+209053  
+238177  
+259864  
+61533   
+97798   
+104222  
+176915  
+180751  
+210478  
+63199   
+69447   
+224698  
+238313  
+67034   
+85757   
+85258   
+105388  
+153466  
+180480  
+88659   
+123185  
+176914  
+26649   
+101110  
+109718  
+112129  
+153412  
+169722  
+173098  
+97319   
+122228  
+126071  
+150970  
+186255  
+91527   
+149140  
+222949  
+117832  
+128889  
+129467  
+151042  
+125202  
+126520  
+173763  
+196324  
+207128  
+103415  
+137589  
+149105  
+82420   
+118796  
+137047  
+146660  
+151972  
+118828  
+127476  
+124086  
+68492   
+91587   
+90605   
+113982  
+117387  
+150991  
+152035  
+122974  
+84235   
+212209  
+114957  
+42000   
+242485  
+103945  
+143398  
+116457  
+198008  
+134212  
+257564  
+255173  
+252776  
+107194  
+289726  
+294096  
+161443  
+292606  
+277399  
+105290  
+159533  
+294098  
+276919  
+279700  
+304797  
+90329   
+57239   
+104324  
+58669   
+114859  
+185568  
diff --git a/SD-VBS/benchmarks/mser/data/vga/expected_C.txt b/SD-VBS/benchmarks/mser/data/vga/expected_C.txt
new file mode 100644
index 0000000..0e741d0
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/data/vga/expected_C.txt
@@ -0,0 +1 @@
+150189  139162  226890  295684  188159  218739  24761   122861  234562  71416   184319  25238   84869   27055   73341   252343  178045  251787  38544   166540  265203  13176   230155  241698  268925  106166  87964   140158  178622  3822    49294   51545   87464   138677  146394  153035  178141  263664  35513   81294   128232  24930   38546   157837  201763  260876  53462   58271   68287   78905   123883  143980  155624  289495  17913   166190  172422  188795  258463  80810   110041  125347  193606  215683  493     242243  98478   204774  271900  305024  20340   47221   48234   48130   78891   78903   121067  157839  157697  222422  195437  202238  222354  247871  263210  60699   67420   141638  168505  225212  246840  16956   45397   75543   167667  175463  185529  186846  11726   12721   17433   90533   153695  157696  163261  166189  228167  242516  264160  24280   90874   137218  178146  85544   103801  121962  126262  142143  149332  166706  138345  192226  61172   137773  159874  183202  191827  12732   21744   41560   116678  177660  157703  163405  187319  199367  216136  174027  209458  218176  256532  109214  205086  50230   137859  155859  176014  190781  10765   169117  56444   99750   100684  184964  34341   84583   152528  225833  60576   115241  226638  161967  183393  197328  213857  241060  240187  100505  74755   81675   93396   132484  183201  197488  71282   78324   108051  115059  156456  179832  105     178271  200687  205652  54049   67056   157243  226148  264275  97315   112167  99665   112207  116050  182193  21849   66538   130427  152941  156286  197780  209054  238178  259865  61534   97799   104223  176916  180752  210479  63200   69448   224699  238314  67035   85758   85259   105389  153467  180481  88660   123186  176915  26650   101111  109719  112130  153413  169723  173099  97320   122229  126072  150971  186256  91528   149141  222950  117833  128890  129468  151043  125203  126521  173764  196325  207129  103416  137590  149106  82421   118797  137048  146661  151973  118829  127477  124087  68493   91588   90606   113983  117388  150992  152036  122975  84236   212210  114958  42001   242486  103946  143399  116458  198009  134213  257565  255174  252777  107195  289727  294097  161444  292607  277400  105291  159534  294099  276920  279701  304798  90330   57240   104325  58670   114860  185569  
diff --git a/SD-VBS/benchmarks/mser/src/c/mser.c b/SD-VBS/benchmarks/mser/src/c/mser.c
new file mode 100644
index 0000000..d886d7a
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/src/c/mser.c
@@ -0,0 +1,714 @@
+/********************************
+Author: Sravanthi Kota Venkata
+********************************/
+/***
+%   MSER  Maximally Stable Extremal Regions
+%   R=MSER(I,DELTA) computes the Maximally Stable Extremal Regions
+%   (MSER) of image I with stability threshold DELTA. I is any
+%   array of class UINT8, while DELTA is a scalar of the same class.
+%   R is an index set (of class UINT32) which enumerates the
+%   representative pixels of the detected regions.
+%
+%   A region R can be recovered from a representative pixel X as the
+%   connected component of the level set {Y:I(Y) <= I(X)} which
+%   contains X.
+***/
+#include "mser.h"
+#include <string.h>
+/* advance N-dimensional subscript */
+void
+adv(iArray *dims, int ndims, iArray *subs_pt)
+{
+    int d = 0 ;
+    while(d < ndims) 
+    {
+        sref(subs_pt,d) = sref(subs_pt,d) + 1;
+        if( sref(subs_pt,d)  < sref(dims,d) ) 
+            return ;
+        sref(subs_pt,d++) = 0 ;
+    }
+}
+/** driver **/
+I2D* mser(I2D* I, int in_delta,
+          iArray* subs_pt, iArray* nsubs_pt, iArray* strides_pt, iArray* visited_pt, iArray* dims, 
+          uiArray* joins_pt,
+          region_t* regions_pt, 
+          pair_t* pairs_pt,
+          node_t* forest_pt,
+          ulliArray* acc_pt, ulliArray* ell_pt,
+          I2D* out)
+{
+   idx_t i, rindex=0;
+   int k;
+   int nout = 1;
+   
+   int OUT_REGIONS=0;
+   int OUT_ELL = 1;
+   int OUT_PARENTS = 2;
+   int OUT_AREA = 3;
+   int BUCKETS = 256;
+   
+   //I2D* out;
+   int IN_I = 0;
+   int IN_DELTA = 1;   
+    /* configuration */
+    int verbose = 1 ;      /* be verbose                              */
+    int small_cleanup= 1 ; /* remove very small regions               */
+    int big_cleanup  = 1 ; /* remove very big regions                 */
+    int bad_cleanup  = 0 ; /* remove very bad regions                 */
+    int dup_cleanup  = 1 ; /* remove duplicates                       */
+    val_t delta ;          /* stability delta                         */
+    /* node value denoting a void node */
+    idx_t const node_is_void = 0xffffffff ;
+    //iArray*   subs_pt ;       /* N-dimensional subscript                 
+    //iArray*   nsubs_pt ;      /* diff-subscript to point to neigh.       
+//    uiArray* strides_pt ;    /* strides to move in image array          
+//    uiArray* visited_pt ;    /* flag                                    
+    int nel ;              /* number of image elements (pixels)       */
+    int ner = 0 ;          /* number of extremal regions              */
+    int nmer = 0 ;         /* number of maximally stable              */
+    int ndims ;            /* number of dimensions                    */
+//    iArray* dims ;           /* dimensions                              
+    int njoins = 0 ;       /* number of join ops                      */
+    I2D* I_pt ;    /* source image                            */
+    //pair_t*   pairs_pt ;   /* scratch buffer to sort pixels           
+//    node_t*   forest_pt ;  /* the extremal regions forest             
+//    region_t* regions_pt ; /* list of extremal regions found          
+    int regions_pt_size;
+    int pairs_pt_size;
+    int forest_pt_size;
+    /* ellipses fitting */
+    //ulliArray* acc_pt ;        /* accumulator to integrate region moments
+    //ulliArray* ell_pt ;        /* ellipses parameters                     
+    int    gdl ;           /* number of parameters of an ellipse      */
+    //uiArray* joins_pt ;      /* sequence of joins                       
+   
+    delta = 0;
+    delta = in_delta;
+    /* get dimensions */
+    nel = I->height*I->width;            /* number of elements of src image */
+    ndims = 2;
+    //dims = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    I_pt = I;
+    
+    sref(dims,0) = I->height;
+    sref(dims,1) = I->width;
+    
+    /* allocate stuff */
+    //subs_pt = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    //nsubs_pt = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    //strides_pt = malloc(sizeof(uiArray)+sizeof(unsigned int)*ndims);
+    //visited_pt = malloc(sizeof(uiArray) + sizeof(unsigned int)*nel);
+    //joins_pt = malloc(sizeof(uiArray) + sizeof(unsigned int)*nel);
+    //regions_pt = (region_t*)malloc(sizeof(region_t)*nel);
+    regions_pt_size = nel;
+    //pairs_pt = (pair_t*)malloc(sizeof(pair_t)*nel);
+    pairs_pt_size = nel;
+    //forest_pt = (node_t*)malloc(sizeof(node_t)*nel);
+    forest_pt_size = nel;
+    /* compute strides to move into the N-dimensional image array */
+    sref(strides_pt,0) = 1;
+    for(k = 1 ; k < ndims ; ++k)
+    {
+        sref(strides_pt,k) = sref(strides_pt,k-1) * sref(dims,k-1) ;
+    }
+    /* sort pixels in increasing order of intensity: using Bucket Sort */
+    {
+        int unsigned buckets [BUCKETS] ;
+        memset(buckets, 0, sizeof(int unsigned)*BUCKETS) ;
+        for(i = 0 ; i < nel ; ++i) 
+        {
+            val_t v = asubsref(I_pt,i) ;
+            ++buckets[v] ;
+        }
+        
+        for(i = 1 ; i < BUCKETS ; ++i) 
+        {
+            arrayref(buckets,i) += arrayref(buckets,i-1) ;
+        }
+        
+        for(i = nel ; i >= 1 ; )
+        {
+            val_t v = asubsref(I_pt,--i) ;
+            idx_t j = --buckets[v] ;
+            pairs_pt[j].value = v ;
+            pairs_pt[j].index = i ;
+        }
+    }
+     
+    /* initialize the forest with all void nodes */
+    for(i = 0 ; i < nel ; ++i) 
+    {
+        forest_pt[i].parent = node_is_void  ;
+    }
+  
+    /* number of ellipse free parameters */
+    gdl = ndims*(ndims+1)/2 + ndims ;
+    /* -----------------------------------------------------------------
+    *                                     Compute extremal regions tree
+    * -------------------------------------------------------------- */
+  
+    for(i = 0 ; i < nel ; ++i)
+    {
+        /* pop next node xi */
+        idx_t index = pairs_pt [i].index ;    
+        val_t value = pairs_pt [i].value ;
+        /* this will be needed later */
+        rindex = index ;
+    
+        /* push it into the tree */
+        forest_pt [index] .parent   = index ;
+        forest_pt [index] .shortcut = index ;
+        forest_pt [index] .area     = 1 ;
+#ifdef USE_RANK_UNION
+        forest_pt [index] .height   = 1 ;
+#endif
+    
+    /* convert index into a subscript sub; also initialize nsubs 
+    to (-1,-1,...,-1) */
+        {
+            idx_t temp = index ;
+            for(k = ndims-1 ; k >=0 ; --k) 
+            {
+                sref(nsubs_pt,k) = -1 ;
+                sref(subs_pt,k) = temp / sref(strides_pt,k) ;
+                temp         = temp % sref(strides_pt,k) ;
+            }
+        }
+    
+    /* process neighbors of xi */
+        while(1) 
+        {
+            int good = 1 ;
+            idx_t nindex = 0 ;
+      
+      /* compute NSUBS+SUB, the correspoinding neighbor index NINDEX
+         and check that the pixel is within image boundaries. */
+            for(k = 0 ; k < ndims && good ; ++k) 
+            {
+                int temp = sref(nsubs_pt,k) + sref(subs_pt,k) ;
+                good &= 0 <= temp && temp < sref(dims,k) ;
+                nindex += temp * sref(strides_pt,k) ;
+            }      
+      
+      /* keep going only if
+         1 - the neighbor is within image boundaries;
+         2 - the neighbor is indeed different from the current node
+             (this happens when nsub=(0,0,...,0));
+         3 - the nieghbor is already in the tree, meaning that
+             is a pixel older than xi.
+      */
+            if(good && nindex != index && forest_pt[nindex].parent != node_is_void ) 
+            {
+                idx_t nrindex = 0, nvisited ;
+                val_t nrvalue = 0 ;
+                
+#ifdef USE_RANK_UNION
+                int height  = forest_pt [ rindex] .height ;
+                int nheight = forest_pt [nrindex] .height ;
+#endif
+        
+        /* RINDEX = ROOT(INDEX) might change as we merge trees, so we
+           need to update it after each merge */
+        
+        /* find the root of the current node */
+        /* also update the shortcuts */
+                nvisited = 0 ;
+                while( forest_pt[rindex].shortcut != rindex ) 
+                {          
+                    sref(visited_pt,nvisited++) = rindex ;
+                    rindex = forest_pt[rindex].shortcut ;
+                }      
+                while( nvisited-- ) 
+                {
+                    forest_pt [ sref(visited_pt,nvisited) ] .shortcut = rindex ;
+                }
+        
+        /* find the root of the neighbor */
+                nrindex  = nindex ;
+                nvisited = 0 ;
+                while( forest_pt[nrindex].shortcut != nrindex ) 
+                {          
+                    sref(visited_pt, nvisited++) = nrindex ;
+                    nrindex = forest_pt[nrindex].shortcut ;
+                }      
+                while( nvisited-- ) 
+                {
+                    forest_pt [ sref(visited_pt,nvisited) ] .shortcut = nrindex ;
+                }
+        
+        /*
+          Now we join the two subtrees rooted at
+          
+            RINDEX = ROOT(INDEX) and NRINDEX = ROOT(NINDEX).
+          
+          Only three things can happen:
+          
+          a - ROOT(INDEX) == ROOT(NRINDEX). In this case the two trees
+              have already been joined and we do not do anything.
+          
+          b - I(ROOT(INDEX)) == I(ROOT(NRINDEX)). In this case index
+              is extending an extremal region with the same
+              value. Since ROOT(NRINDEX) will NOT be an extremal
+              region of the full image, ROOT(INDEX) can be safely
+              addedd as children of ROOT(NRINDEX) if this reduces
+              the height according to union rank.
+               
+          c - I(ROOT(INDEX)) > I(ROOT(NRINDEX)) as index is extending
+              an extremal region, but increasing its level. In this
+              case ROOT(NRINDEX) WILL be an extremal region of the
+              final image and the only possibility is to add
+              ROOT(NRINDEX) as children of ROOT(INDEX).
+        */
+                if( rindex != nrindex ) 
+                {
+                    /* this is a genuine join */
+          
+                    nrvalue = asubsref(I_pt,nrindex) ;
+                    if( nrvalue == value 
+#ifdef USE_RANK_UNION             
+              && height < nheight
+#endif
+                    ) 
+                    {
+                        /* ROOT(INDEX) becomes the child */
+                        forest_pt[rindex] .parent   = nrindex ;
+                        forest_pt[rindex] .shortcut = nrindex ;          
+                        forest_pt[nrindex].area    += forest_pt[rindex].area ;
+#ifdef USE_RANK_UNION
+                        forest_pt[nrindex].height = MAX(nheight, height+1) ;
+#endif
+                        sref(joins_pt,njoins++) = rindex ;
+                    } 
+                    else 
+                    {
+                        /* ROOT(index) becomes parent */
+                        forest_pt[nrindex] .parent   = rindex ;
+                        forest_pt[nrindex] .shortcut = rindex ;
+                        forest_pt[rindex]  .area    += forest_pt[nrindex].area ;
+#ifdef USE_RANK_UNION
+                        forest_pt[rindex].height = MAX(height, nheight+1) ;
+#endif
+                        if( nrvalue != value ) 
+                        {            
+                            /* nrindex is extremal region: save for later */
+                            forest_pt[nrindex].region = ner ;
+                            regions_pt [ner] .index      = nrindex ;
+                            regions_pt [ner] .parent     = ner ;
+                            regions_pt [ner] .value      = nrvalue ;
+                            regions_pt [ner] .area       = forest_pt [nrindex].area ;
+                            regions_pt [ner] .area_top   = nel ;
+                            regions_pt [ner] .area_bot   = 0 ;            
+                            ++ner ;
+                        }
+            
+                        /* annote join operation for post-processing */
+                        sref(joins_pt,njoins++) = nrindex ;
+                    }
+                }
+        
+            } /* neighbor done */
+      
+            /* move to next neighbor */      
+            k = 0 ;
+            sref(nsubs_pt,k) = sref(nsubs_pt,k) + 1;
+            while( sref(nsubs_pt, k) > 1) 
+            {
+                sref(nsubs_pt,k++) = -1 ;
+                if(k == ndims) goto done_all_neighbors ;
+                sref(nsubs_pt,k) = sref(nsubs_pt,k) + 1;
+            }
+        } /* next neighbor */
+        done_all_neighbors : ;
+    } /* next pixel */    
+    
+ 
+    /* the root of the last processed pixel must be a region */
+    forest_pt [rindex].region = ner ;
+    regions_pt [ner] .index      = rindex ;
+    regions_pt [ner] .parent     = ner ;
+    regions_pt [ner] .value      = asubsref(I_pt,rindex) ;
+    regions_pt [ner] .area       = forest_pt [rindex] .area ;
+    regions_pt [ner] .area_top   = nel ;
+    regions_pt [ner] .area_bot   = 0 ;            
+    ++ner ;
+    
+    /* -----------------------------------------------------------------
+    *                                            Compute region parents
+    * -------------------------------------------------------------- */
+    for( i = 0 ; i < ner ; ++i) 
+    {
+        idx_t index  = regions_pt [i].index ;    
+        val_t value  = regions_pt [i].value ;
+        idx_t j      = i ;
+        while(j == i) 
+        {
+            idx_t pindex = forest_pt [index].parent ;
+            val_t pvalue = asubsref(I_pt,pindex) ;
+            /* top of the tree */
+            if(index == pindex) 
+            {
+                j = forest_pt[index].region ;
+                break ;
+            }
+            /* if index is the root of a region, either this is still
+            i, or it is the parent region we are looking for. */
+            if(value < pvalue) 
+            {
+                j = forest_pt[index].region ;
+            }
+            index = pindex ;
+            value = pvalue ;
+        }
+        regions_pt[i]. parent = j ;
+    }
+  
+    /* -----------------------------------------------------------------
+    *                                 Compute areas of tops and bottoms
+    * -------------------------------------------------------------- */
+    /* We scan the list of regions from the bottom. Let x0 be the current
+     region and be x1 = PARENT(x0), x2 = PARENT(x1) and so on.
+     
+     Here we do two things:
+     
+     1) Look for regions x for which x0 is the BOTTOM. This requires
+        VAL(x0) <= VAL(x) - DELTA < VAL(x1).
+        We update AREA_BOT(x) for each of such x found.
+        
+     2) Look for the region y which is the TOP of x0. This requires
+          VAL(y) <= VAL(x0) + DELTA < VAL(y+1)
+          We update AREA_TOP(x0) as soon as we find such y.
+        
+    */
+    for( i = 0 ; i < ner ; ++i) 
+    {
+        /* fix xi as the region, then xj are the parents */
+        idx_t parent = regions_pt [i].parent ;
+        int   val0   = regions_pt [i].value ;
+        int   val1   = regions_pt [parent].value ;
+        int   val    = val0 ;
+        idx_t j = i ;
+        while(1) 
+        {
+            int valp = regions_pt [parent].value ;
+            /* i is the bottom of j */
+            if(val0 <= val - delta && val - delta < val1) 
+            {
+                regions_pt [j].area_bot  =
+                MAX(regions_pt [j].area_bot, regions_pt [i].area) ;
+            }
+      
+            /* j is the top of i */
+            if(val <= val0 + delta && val0 + delta < valp) 
+            {
+                regions_pt [i].area_top = regions_pt [j].area ;
+            }
+      
+            /* stop if going on is useless */
+            if(val1 <= val - delta && val0 + delta < val)
+                break ;
+            /* stop also if j is the root */
+            if(j == parent)
+                break ;
+      
+            /* next region upward */
+            j      = parent ;
+            parent = regions_pt [j].parent ;
+            val    = valp ;
+        }
+    }
+    /* -----------------------------------------------------------------
+    *                                                 Compute variation
+    * -------------------------------------------------------------- */
+    for(i = 0 ; i < ner ; ++i) 
+    {
+        int area     = regions_pt [i].area ;
+        int area_top = regions_pt [i].area_top ;
+        int area_bot = regions_pt [i].area_bot ;    
+        regions_pt [i].variation = (area_top - area_bot) / (area*1.0) ;
+        /* initialize .mastable to 1 for all nodes */
+        regions_pt [i].maxstable = 1 ;
+    }
+    /* -----------------------------------------------------------------
+    *                     Remove regions which are NOT maximally stable
+    * -------------------------------------------------------------- */
+    nmer = ner ;
+    for(i = 0 ; i < ner ; ++i) 
+    {
+        idx_t parent = regions_pt [i]      .parent ;
+        float var    = regions_pt [i]      .variation ;
+        float pvar   = regions_pt [parent] .variation ;
+        idx_t loser ;
+        /* decide which one to keep and put that in loser */
+        if(var < pvar) loser = parent ; else loser = i ;
+    
+        /* make loser NON maximally stable */
+        if(regions_pt [loser].maxstable) --nmer ;
+        regions_pt [loser].maxstable = 0 ;
+    }
+    /* -----------------------------------------------------------------
+    *                                               Remove more regions
+    * -------------------------------------------------------------- */
+    /* it is critical for correct duplicate detection to remove regions
+     from the bottom (smallest one first) */
+    if( big_cleanup || small_cleanup || bad_cleanup || dup_cleanup ) 
+    {
+        int nbig   = 0 ;
+        int nsmall = 0 ;
+        int nbad   = 0 ;
+        int ndup   = 0 ;
+        /* scann all extremal regions */
+        for(i = 0 ; i < ner ; ++i) 
+        {
+      
+            /* process only maximally stable extremal regions */
+            if(! regions_pt [i].maxstable) continue ;
+      
+            if( bad_cleanup   && regions_pt[i].variation >= 1.0f  ) 
+            {
+                ++nbad ;
+                goto remove_this_region ;
+            }
+            if( big_cleanup   && regions_pt[i].area  >  nel/2 ) 
+            {
+                ++nbig ;
+                goto remove_this_region ;
+            }
+            if( small_cleanup && regions_pt[i].area      <  25    ) 
+            {
+                ++nsmall ;
+                goto remove_this_region ;
+            }
+      
+            /** Remove duplicates */
+            if( dup_cleanup ) 
+            {
+                idx_t parent = regions_pt [i].parent ;
+                int area, parea ;
+                float change ;
+        
+                /* the search does not apply to root regions */
+                if(parent != i) 
+                {
+          
+                    /* search for the maximally stable parent region */
+                    while(! regions_pt[parent].maxstable) 
+                    {
+                        idx_t next = regions_pt[parent].parent ;
+                        if(next == parent) break ;
+                        parent = next ;
+                    }
+          
+                    /* compare with the parent region; if the current and parent
+                    regions are too similar, keep only the parent */
+          
+                    area   = regions_pt [i].area ;
+                    parea  = regions_pt [parent].area ;
+                    change = (parea - area)/(area*1.0) ;
+                    if(change < 0.5)  
+                    {
+                        ++ndup ;
+                        goto remove_this_region ;
+                    }
+                } /* drop duplicates */ 
+            }
+      
+            continue ;
+            remove_this_region :
+            regions_pt[i].maxstable = 0 ;
+            --nmer ;
+                  
+        } /* next region to cleanup */
+        if(0) 
+        {
+            printf("  Bad regions:        %d\n", nbad   ) ;
+            printf("  Small regions:      %d\n", nsmall ) ;
+            printf("  Big regions:        %d\n", nbig   ) ;
+            printf("  Duplicated regions: %d\n", ndup   ) ;
+        }
+    }
+/*    printf("Cleaned-up regions: %d (%.1f%%)\n", 
+                       nmer, 100.0 * (double) nmer / ner) ;
+*/
+    /* -----------------------------------------------------------------
+    *                                                      Fit ellipses
+    * -------------------------------------------------------------- */
+    //ell_pt = 0 ;
+    //memset(ell_pt, sizeof(ulliArray) + sizeof(acc_t)*gdl*nmer, 0) ; 
+    if (nout >= 1) 
+    {
+        int midx = 1 ;
+        int d, index, j ;
+    
+        /* enumerate maxstable regions */
+        for(i = 0 ; i < ner ; ++i) 
+        {      
+            if(! regions_pt [i].maxstable) continue ;
+            regions_pt [i].maxstable = midx++ ;
+        }
+    
+        /* allocate space */
+        //acc_pt = malloc(sizeof(ulliArray) + sizeof(acc_t)*nel) ;
+        //printf("nmer = %d\n", nmer);
+        //ell_pt = malloc(sizeof(ulliArray) + sizeof(acc_t)*gdl*nmer) ; 
+   
+        /* clear accumulators */
+        for(d=0; d<(gdl*nmer); d++)
+            sref(ell_pt,d) = 0;
+    
+        /* for each gdl */
+        for(d = 0 ; d < gdl ; ++d) 
+        {
+            /* initalize parameter */
+            int counter_i;
+            for(counter_i=0; counter_i<ndims; counter_i++)
+                sref(subs_pt,counter_i) = 0;
+      
+            if(d < ndims) 
+            {
+                for(index = 0 ; index < nel ; ++ index) 
+                {
+                    sref(acc_pt,index) = sref(subs_pt,d) ;
+                    adv(dims, ndims, subs_pt) ;
+                }
+            } 
+            else 
+            {
+                /* decode d-ndims into a (i,j) pair */
+                i = d-ndims ; 
+                j = 0 ;
+                while(i > j) 
+                {
+                    i -= j + 1 ;
+                    j ++ ;
+                }
+                /* add x_i * x_j */
+                for(index = 0 ; index < nel ; ++ index)
+                {
+                    sref(acc_pt,index) = sref(subs_pt,i) * sref(subs_pt,j) ;
+                    adv(dims, ndims, subs_pt) ;
+                }
+            }
+            /* integrate parameter */
+            for(i = 0 ; i < njoins ; ++i) 
+            {      
+                idx_t index  = sref(joins_pt,i);
+                idx_t parent = forest_pt [ index ].parent ;
+                sref(acc_pt,parent) += sref(acc_pt,index) ;
+            }
+    
+            /* save back to ellpises */
+            for(i = 0 ; i < ner ; ++i) 
+            {
+                idx_t region = regions_pt [i].maxstable ;
+                /* skip if not extremal region */
+                if(region-- == 0) continue ;
+                sref(ell_pt,d + gdl*region) = sref(acc_pt, regions_pt[i].index) ;
+            }
+            /* next gdl */
+        }
+        //free(acc_pt) ;
+        //free(ell_pt) ;
+    }
+  
+    /* -----------------------------------------------------------------
+    *                                                Save back and exit
+    * -------------------------------------------------------------- */
+    /*
+    * Save extremal regions
+    */
+    {
+        int dims[2], j=0;
+        I2D* pt ;
+        dims[0] = nmer ;
+        //out = iMallocHandle(1, nmer);
+        out->height = 1;
+        out->width = nmer;
+        pt = out;
+        for (i = 0 ; i < ner ; ++i) 
+        {
+            if( regions_pt[i].maxstable ) 
+            {
+                /* adjust for MATLAB index compatibility */
+//                *pt++ = regions_pt[i].index + 1 ;
+                asubsref(pt,j++) = regions_pt[i].index + 1 ;
+            }
+        }
+    }
+    /* free stuff */
+    //free(dims);
+    //free( forest_pt  ) ;
+    //free( pairs_pt   ) ;
+    //free( regions_pt ) ;
+    //free( visited_pt ) ;
+    //free( strides_pt ) ;
+    //free( nsubs_pt   ) ;
+    //free( subs_pt    ) ;
+    //free( joins_pt    ) ;
+    return out;
+}
diff --git a/SD-VBS/benchmarks/mser/src/c/mser.h b/SD-VBS/benchmarks/mser/src/c/mser.h
new file mode 100644
index 0000000..8876311
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/src/c/mser.h
@@ -0,0 +1,83 @@
+/********************************
+Author: Sravanthi Kota Venkata
+********************************/
+#ifndef _MSER_
+#define _MSER_
+#define sref(a,i) a->data[i]
+#include "sdvbs_common.h"
+#define NMER_MAX 756
+typedef int val_t;
+typedef struct
+{
+    int width;
+    int data[];
+}iArray;
+typedef struct
+{
+    int width;
+    unsigned int data[];
+}uiArray;
+typedef struct
+{
+    int width;
+    long long int unsigned data[];
+}ulliArray;
+#define MIN(a,b) (a<b)?a:b
+#define MAX(a,b) (a>b)?a:b
+typedef int  unsigned idx_t ;
+typedef long long int unsigned acc_t ;
+/* pairs are used to sort the pixels */
+typedef struct 
+{
+  val_t value ; 
+  idx_t  index ;
+} pair_t ;
+/* forest node */
+typedef struct
+{
+  idx_t parent ;   /**< parent pixel         */
+  idx_t shortcut ; /**< shortcut to the root */
+  idx_t region ;   /**< index of the region  */
+  int   area ;     /**< area of the region   */
+#ifdef USE_RANK_UNION
+  int   height ;    /**< node height         */
+#endif
+} node_t ;
+/* extremal regions */
+typedef struct
+{
+  idx_t parent ;     /**< parent region                           */
+  idx_t index ;      /**< index of root pixel                     */
+  val_t value ;      /**< value of root pixel                     */
+  int   area ;       /**< area of the region                      */
+  int   area_top ;   /**< area of the region DELTA levels above   */
+  int   area_bot  ;  /**< area of the region DELTA levels below   */
+  float variation ;  /**< variation                               */
+  int   maxstable ;  /**< max stable number (=0 if not maxstable) */
+} region_t ;
+int script_mser();
+I2D* mser(I2D* I, int in_delta,  
+          iArray* subs_pt, iArray* nsubs_pt, iArray* strides_pt, iArray* visited_pt, iArray* dims, 
+          uiArray* joins_pt,
+          region_t* regions_pt, 
+          pair_t* pairs_pt,
+          node_t* forest_pt,
+          ulliArray* acc_pt, ulliArray* ell_pt,
+          I2D* out);
+#endif
diff --git a/SD-VBS/benchmarks/mser/src/c/script_mser.c b/SD-VBS/benchmarks/mser/src/c/script_mser.c
new file mode 100644
index 0000000..d4a98cd
--- /dev/null
+++ b/SD-VBS/benchmarks/mser/src/c/script_mser.c
@@ -0,0 +1,120 @@
+/********************************
+Author: Sravanthi Kota Venkata
+********************************/
+#include "mser.h"
+#include <malloc.h>
+#include "extra.h"
+#define min(a,b) (a<b)?a:b
+#define max(a,b) (a>b)?a:b
+int main(int argc, char* argv[])
+{
+    SET_UP
+    int which_image;
+    int i, j, k;
+    I2D *idx;
+    I2D *I;
+    I2D *It;
+    I2D *out;
+    int rows=196, cols=98;
+    int minVal = 1000;
+    int maxVal = -1000;
+    int lev = 10;
+    char im1[100], im2[100];
+    iArray *subs_pt, *nsubs_pt, *strides_pt, *visited_pt, *dims;   
+    uiArray* joins_pt;
+    ulliArray *acc_pt, *ell_pt;
+    region_t* regions_pt;
+    pair_t* pairs_pt;
+    node_t* forest_pt;
+    int ndims, nel, gdl, nmer;
+    printf("Input Image: ");
+    scanf("%s", im1);
+    I = readImage(im1);
+    rows = I->height;
+    cols = I->width;
+    It = readImage(im1);
+    k = 0;
+    for(i=0; i<cols; i++)
+    {
+        for(j=0; j<rows; j++)
+        {
+            asubsref(It,k++) = subsref(I,j,i);
+        }
+    }
+    
+    ndims = 2;
+    nel = It->height * It->width;
+    gdl = ndims * (ndims+1)/2 + ndims;
+    nmer = NMER_MAX;
+    dims = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    /* allocate stuff */
+    subs_pt = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    nsubs_pt = malloc(sizeof(iArray) + sizeof(int)*ndims);
+    strides_pt = malloc(sizeof(uiArray)+sizeof(unsigned int)*ndims);
+    visited_pt = malloc(sizeof(uiArray) + sizeof(unsigned int)*nel);
+    joins_pt = malloc(sizeof(uiArray) + sizeof(unsigned int)*nel);
+    regions_pt = (region_t*)malloc(sizeof(region_t)*nel);
+    pairs_pt = (pair_t*)malloc(sizeof(pair_t)*nel);
+    forest_pt = (node_t*)malloc(sizeof(node_t)*nel);
+    acc_pt = malloc(sizeof(ulliArray) + sizeof(acc_t)*nel) ;
+    ell_pt = malloc(sizeof(ulliArray) + sizeof(acc_t)*gdl*nmer) ; 
+    out = iMallocHandle(1, nmer);
+    printf("start\n");
+    for_each_job{
+        idx = mser(It, 2, subs_pt, nsubs_pt, strides_pt, visited_pt, dims, 
+                   joins_pt,
+                   regions_pt,
+                   pairs_pt,
+                   forest_pt,
+                   acc_pt, ell_pt,
+                   out);
+    }
+    printf("end..\n");
+    
+#ifdef CHECK   
+    /** Self checking - use expected.txt from data directory  **/
+    {
+        int tol, ret=0;
+        tol = 1;
+#ifdef GENERATE_OUTPUT
+        writeMatrix(idx, argv[1]);
+#endif
+        ret = selfCheck(idx, "expected_C.txt", tol);
+        if (ret == -1)
+            printf("Error in MSER\n");
+    }
+    /** Self checking done **/
+#endif    
+    free(dims);
+    free( forest_pt  ) ;
+    free( pairs_pt   ) ;
+    free( regions_pt ) ;
+    free( visited_pt ) ;
+    free( strides_pt ) ;
+    free( nsubs_pt   ) ;
+    free( subs_pt    ) ;
+    free( joins_pt    ) ;
+    free( acc_pt ) ;
+    free( ell_pt ) ;
+    iFreeHandle(idx);
+    iFreeHandle(I);
+    iFreeHandle(It);
+    WRITE_TO_FILE
+    return 0;
+}