tags/2.4.0/src/jp/nyatla/nyartoolkit/core/labeling/rlelabeling/NyARLabeling_Rle.java

   1 /* \r
   2  * PROJECT: NyARToolkit(Extension)\r
   3  * --------------------------------------------------------------------------------\r
   4  * The NyARToolkit is Java edition ARToolKit class library.\r
   5  * Copyright (C)2008-2009 Ryo Iizuka\r
   6  *\r
   7  * This program is free software: you can redistribute it and/or modify\r
   8  * it under the terms of the GNU General Public License as published by\r
   9  * the Free Software Foundation, either version 3 of the License, or\r
  10  * (at your option) any later version.\r
  11  * \r
  12  * This program is distributed in the hope that it will be useful,\r
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r
  15  * GNU General Public License for more details.\r
  16  *\r
  17  * You should have received a copy of the GNU General Public License\r
  18  * along with this program.  If not, see <http://www.gnu.org/licenses/>.\r
  19  * \r
  20  * For further information please contact.\r
  21  *      http://nyatla.jp/nyatoolkit/\r
  22  *      <airmail(at)ebony.plala.or.jp> or <nyatla(at)nyatla.jp>\r
  23  * \r
  24  */\r
  25 package jp.nyatla.nyartoolkit.core.labeling.rlelabeling;\r
  26 \r
  27 import jp.nyatla.nyartoolkit.NyARException;\r
  28 import jp.nyatla.nyartoolkit.core.raster.*;\r
  29 import jp.nyatla.utils.*;\r
  30 \r
  31 class RleInfoStack extends NyObjectStack<RleInfoStack.RleInfo>\r
  32 {\r
  33         public class RleInfo\r
  34         {\r
  35                 //継承メンバ\r
  36                 public int entry_x; // フラグメントラベルの位置\r
  37                 public int area;\r
  38                 public int clip_r;\r
  39                 public int clip_l;\r
  40                 public int clip_b;\r
  41                 public int clip_t;\r
  42                 public long pos_x;\r
  43                 public long pos_y;              \r
  44         }       \r
  45         public RleInfoStack(int i_length)\r
  46         {\r
  47                 super(i_length, RleInfoStack.RleInfo.class);\r
  48                 return;\r
  49         }\r
  50 \r
  51         protected RleInfoStack.RleInfo createElement()\r
  52         {\r
  53                 return new RleInfoStack.RleInfo();\r
  54         }\r
  55 }\r
  56 /**\r
  57  * [strage class]\r
  58  */\r
  59 \r
  60 \r
  61 class RleElement\r
  62 {\r
  63         int l;\r
  64         int r;\r
  65         int fid;\r
  66         public static RleElement[] createArray(int i_length)\r
  67         {\r
  68                 RleElement[] ret = new RleElement[i_length];\r
  69                 for (int i = 0; i < i_length; i++) {\r
  70                         ret[i] = new RleElement();\r
  71                 }\r
  72                 return ret;\r
  73         }\r
  74 }\r
  75 \r
  76 // RleImageをラベリングする。\r
  77 public class NyARLabeling_Rle\r
  78 {\r
  79         private static final int AR_AREA_MAX = 100000;// #define AR_AREA_MAX 100000\r
  80         private static final int AR_AREA_MIN = 70;// #define AR_AREA_MIN 70\r
  81         \r
  82         private RleInfoStack _rlestack;\r
  83         private RleElement[] _rle1;\r
  84         private RleElement[] _rle2;\r
  85         private int _max_area;\r
  86         private int _min_area;\r
  87 \r
  88         public NyARLabeling_Rle(int i_width,int i_height)\r
  89         {\r
  90                 this._rlestack=new RleInfoStack(i_width*i_height*2048/(320*240)+32);\r
  91                 this._rle1 = RleElement.createArray(i_width/2+1);\r
  92                 this._rle2 = RleElement.createArray(i_width/2+1);\r
  93                 setAreaRange(AR_AREA_MAX,AR_AREA_MIN);\r
  94 \r
  95                 return;\r
  96         }\r
  97         /**\r
  98          * 対象サイズ\r
  99          * @param i_max\r
 100          * @param i_min\r
 101          */\r
 102         public void setAreaRange(int i_max,int i_min)\r
 103         {\r
 104                 this._max_area=i_max;\r
 105                 this._min_area=i_min;\r
 106                 return;\r
 107         }\r
 108 \r
 109         /**\r
 110          * i_bin_bufのbinイメージをREL圧縮する。\r
 111          * \r
 112          * @param i_bin_raster\r
 113          */\r
 114         private int toRel(int[] i_bin_buf, int i_st, int i_len, RleElement[] i_out)\r
 115         {\r
 116                 int current = 0;\r
 117                 int r = -1;\r
 118                 // 行確定開始\r
 119                 int x = i_st;\r
 120                 final int right_edge = i_st + i_len - 1;\r
 121                 while (x < right_edge) {\r
 122                         // 暗点(0)スキャン\r
 123                         if (i_bin_buf[x] != 0) {\r
 124                                 x++;\r
 125                                 continue;\r
 126                         }\r
 127                         // 暗点発見→暗点長を調べる\r
 128                         r = (x - i_st);\r
 129                         i_out[current].l = r;\r
 130                         r++;// 暗点+1\r
 131                         x++;\r
 132                         while (x < right_edge) {\r
 133                                 if (i_bin_buf[x] != 0) {\r
 134                                         // 明点(1)→暗点(0)配列終了>登録\r
 135                                         i_out[current].r = r;\r
 136                                         current++;\r
 137                                         x++;// 次点の確認。\r
 138                                         r = -1;// 右端の位置を0に。\r
 139                                         break;\r
 140                                 } else {\r
 141                                         // 暗点(0)長追加\r
 142                                         r++;\r
 143                                         x++;\r
 144                                 }\r
 145                         }\r
 146                 }\r
 147                 // 最後の1点だけ判定方法が少し違うの。\r
 148                 if (i_bin_buf[x] != 0) {\r
 149                         // 明点→rカウント中なら暗点配列終了>登録\r
 150                         if (r >= 0) {\r
 151                                 i_out[current].r = r;\r
 152                                 current++;\r
 153                         }\r
 154                 } else {\r
 155                         // 暗点→カウント中でなければl1で追加\r
 156                         if (r >= 0) {\r
 157                                 i_out[current].r = (r + 1);\r
 158                         } else {\r
 159                                 // 最後の1点の場合\r
 160                                 i_out[current].l = (i_len - 1);\r
 161                                 i_out[current].r = (i_len);\r
 162                         }\r
 163                         current++;\r
 164                 }\r
 165                 // 行確定\r
 166                 return current;\r
 167         }\r
 168 \r
 169         private void addFragment(RleElement i_rel_img, int i_nof, int i_row_index,RleInfoStack o_stack) throws NyARException\r
 170         {\r
 171                 int l=i_rel_img.l;\r
 172                 final int len=i_rel_img.r - l;\r
 173                 i_rel_img.fid = i_nof;// REL毎の固有ID\r
 174                 RleInfoStack.RleInfo v = o_stack.prePush();\r
 175                 v.entry_x = l;\r
 176                 v.area =len;\r
 177                 v.clip_l=l;\r
 178                 v.clip_r=i_rel_img.r-1;\r
 179                 v.clip_t=i_row_index;\r
 180                 v.clip_b=i_row_index;\r
 181                 v.pos_x=(len*(2*l+(len-1)))/2;\r
 182                 v.pos_y=i_row_index*len;\r
 183 \r
 184                 return;\r
 185         }\r
 186 \r
 187         //\r
 188         public int labeling(NyARBinRaster i_bin_raster, int i_top, int i_bottom,RleLabelFragmentInfoStack o_stack) throws NyARException\r
 189         {\r
 190                 // リセット処理\r
 191                 final RleInfoStack rlestack=this._rlestack;\r
 192                 rlestack.clear();\r
 193 \r
 194                 //\r
 195                 RleElement[] rle_prev = this._rle1;\r
 196                 RleElement[] rle_current = this._rle2;\r
 197                 int len_prev = 0;\r
 198                 int len_current = 0;\r
 199                 final int width = i_bin_raster.getWidth();\r
 200                 int[] in_buf = (int[]) i_bin_raster.getBufferReader().getBuffer();\r
 201 \r
 202                 int id_max = 0;\r
 203                 int label_count=0;\r
 204                 // 初段登録\r
 205 \r
 206                 len_prev = toRel(in_buf, i_top, width, rle_prev);\r
 207                 for (int i = 0; i < len_prev; i++) {\r
 208                         // フラグメントID=フラグメント初期値、POS=Y値、RELインデクス=行\r
 209                         addFragment(rle_prev[i], id_max, i_top,rlestack);\r
 210                         id_max++;\r
 211                         // nofの最大値チェック\r
 212                         label_count++;\r
 213                 }\r
 214                 RleInfoStack.RleInfo[] f_array = rlestack.getArray();\r
 215                 // 次段結合\r
 216                 for (int y = i_top + 1; y < i_bottom; y++) {\r
 217                         // カレント行の読込\r
 218                         len_current = toRel(in_buf, y * width, width, rle_current);\r
 219                         int index_prev = 0;\r
 220 \r
 221                         SCAN_CUR: for (int i = 0; i < len_current; i++) {\r
 222                                 // index_prev,len_prevの位置を調整する\r
 223                                 int id = -1;\r
 224                                 // チェックすべきprevがあれば確認\r
 225                                 SCAN_PREV: while (index_prev < len_prev) {\r
 226                                         if (rle_current[i].l - rle_prev[index_prev].r > 0) {// 0なら8方位ラベリング\r
 227                                                 // prevがcurの左方にある→次のフラグメントを探索\r
 228                                                 index_prev++;\r
 229                                                 continue;\r
 230                                         } else if (rle_prev[index_prev].l - rle_current[i].r > 0) {// 0なら8方位ラベリングになる\r
 231                                                 // prevがcur右方にある→独立フラグメント\r
 232                                                 addFragment(rle_current[i], id_max, y,rlestack);\r
 233                                                 id_max++;\r
 234                                                 label_count++;\r
 235                                                 // 次のindexをしらべる\r
 236                                                 continue SCAN_CUR;\r
 237                                         }\r
 238                                         id=rle_prev[index_prev].fid;//ルートフラグメントid\r
 239                                         RleInfoStack.RleInfo id_ptr = f_array[id];\r
 240                                         //結合対象(初回)->prevのIDをコピーして、ルートフラグメントの情報を更新\r
 241                                         rle_current[i].fid = id;//フラグメントIDを保存\r
 242                                         //\r
 243                                         final int l= rle_current[i].l;\r
 244                                         final int r= rle_current[i].r;\r
 245                                         final int len=r-l;\r
 246                                         //結合先フラグメントの情報を更新する。\r
 247                                         id_ptr.area += len;\r
 248                                         //tとentry_xは、結合先のを使うので更新しない。\r
 249                                         id_ptr.clip_l=l<id_ptr.clip_l?l:id_ptr.clip_l;\r
 250                                         id_ptr.clip_r=r>id_ptr.clip_r?r-1:id_ptr.clip_r;\r
 251                                         id_ptr.clip_b=y;\r
 252                                         id_ptr.pos_x+=(len*(2*l+(len-1)))/2;\r
 253                                         id_ptr.pos_y+=y*len;\r
 254                                         //多重結合の確認（２個目以降）\r
 255                                         index_prev++;\r
 256                                         while (index_prev < len_prev) {\r
 257                                                 if (rle_current[i].l - rle_prev[index_prev].r > 0) {// 0なら8方位ラベリング\r
 258                                                         // prevがcurの左方にある→prevはcurに連結していない。\r
 259                                                         break SCAN_PREV;\r
 260                                                 } else if (rle_prev[index_prev].l - rle_current[i].r > 0) {// 0なら8方位ラベリングになる\r
 261                                                         // prevがcurの右方にある→prevはcurに連結していない。\r
 262                                                         index_prev--;\r
 263                                                         continue SCAN_CUR;\r
 264                                                 }\r
 265                                                 // prevとcurは連結している→ルートフラグメントの統合\r
 266                                                 \r
 267                                                 //結合するルートフラグメントを取得\r
 268                                                 final int prev_id =rle_prev[index_prev].fid;\r
 269                                                 RleInfoStack.RleInfo prev_ptr = f_array[prev_id];\r
 270                                                 if (id != prev_id){\r
 271                                                         label_count--;\r
 272                                                         //prevとcurrentのフラグメントidを書き換える。\r
 273                                                         for(int i2=index_prev;i2<len_prev;i2++){\r
 274                                                                 //prevは現在のidから最後まで\r
 275                                                                 if(rle_prev[i2].fid==prev_id){\r
 276                                                                         rle_prev[i2].fid=id;\r
 277                                                                 }\r
 278                                                         }\r
 279                                                         for(int i2=0;i2<i;i2++){\r
 280                                                                 //currentは0から現在-1まで\r
 281                                                                 if(rle_current[i2].fid==prev_id){\r
 282                                                                         rle_current[i2].fid=id;\r
 283                                                                 }\r
 284                                                         }\r
 285                                                         \r
 286                                                         //現在のルートフラグメントに情報を集約\r
 287                                                         id_ptr.area +=prev_ptr.area;\r
 288                                                         id_ptr.pos_x+=prev_ptr.pos_x;\r
 289                                                         id_ptr.pos_y+=prev_ptr.pos_y;\r
 290                                                         //tとentry_xの決定\r
 291                                                         if (id_ptr.clip_t > prev_ptr.clip_t) {\r
 292                                                                 // 現在の方が下にある。\r
 293                                                                 id_ptr.clip_t = prev_ptr.clip_t;\r
 294                                                                 id_ptr.entry_x = prev_ptr.entry_x;\r
 295                                                         }else if (id_ptr.clip_t < prev_ptr.clip_t) {\r
 296                                                                 // 現在の方が上にある。prevにフィードバック\r
 297                                                         } else {\r
 298                                                                 // 水平方向で小さい方がエントリポイント。\r
 299                                                                 if (id_ptr.entry_x > prev_ptr.entry_x) {\r
 300                                                                         id_ptr.entry_x = prev_ptr.entry_x;\r
 301                                                                 }else{\r
 302                                                                 }\r
 303                                                         }\r
 304                                                         //lの決定\r
 305                                                         if (id_ptr.clip_l > prev_ptr.clip_l) {\r
 306                                                                 id_ptr.clip_l=prev_ptr.clip_l;\r
 307                                                         }else{\r
 308                                                         }\r
 309                                                         //rの決定\r
 310                                                         if (id_ptr.clip_r < prev_ptr.clip_r) {\r
 311                                                                 id_ptr.clip_r=prev_ptr.clip_r;\r
 312                                                         }else{\r
 313                                                         }\r
 314                                                         //bの決定\r
 315 \r
 316                                                         //結合済のルートフラグメントを無効化する。\r
 317                                                         prev_ptr.area=0;\r
 318                                                 }\r
 319 \r
 320 \r
 321                                                 index_prev++;\r
 322                                         }\r
 323                                         index_prev--;\r
 324                                         break;\r
 325                                 }\r
 326                                 // curにidが割り当てられたかを確認\r
 327                                 // 右端独立フラグメントを追加\r
 328                                 if (id < 0){\r
 329                                         addFragment(rle_current[i], id_max, y,rlestack);\r
 330                                         id_max++;\r
 331                                         label_count++;\r
 332                                 }\r
 333                         }\r
 334                         // prevとrelの交換\r
 335                         RleElement[] tmp = rle_prev;\r
 336                         rle_prev = rle_current;\r
 337                         len_prev = len_current;\r
 338                         rle_current = tmp;\r
 339                 }\r
 340                 //対象のラベルだけ転写\r
 341                 o_stack.reserv(label_count);\r
 342                 RleLabelFragmentInfoStack.RleLabelFragmentInfo[] o_dest_array=o_stack.getArray();\r
 343                 final int max=this._max_area;\r
 344                 final int min=this._min_area;\r
 345                 int active_labels=0;\r
 346                 for(int i=id_max-1;i>=0;i--){\r
 347                         final int area=f_array[i].area;\r
 348                         if(area<min || area>max){//対象外のエリア0のもminではじく\r
 349                                 continue;\r
 350                         }\r
 351                         //\r
 352                         final RleInfoStack.RleInfo src_info=f_array[i];\r
 353                         final RleLabelFragmentInfoStack.RleLabelFragmentInfo dest_info=o_dest_array[active_labels];\r
 354                         dest_info.area=area;\r
 355                         dest_info.clip_b=src_info.clip_b;\r
 356                         dest_info.clip_r=src_info.clip_r;\r
 357                         dest_info.clip_t=src_info.clip_t;\r
 358                         dest_info.clip_l=src_info.clip_l;\r
 359                         dest_info.entry_x=src_info.entry_x;\r
 360                         dest_info.pos_x=src_info.pos_x/src_info.area;\r
 361                         dest_info.pos_y=src_info.pos_y/src_info.area;\r
 362                         active_labels++;\r
 363                 }\r
 364                 //ラベル数を再設定\r
 365                 o_stack.pops(label_count-active_labels);\r
 366                 //ラベル数を返却\r
 367                 return active_labels;\r
 368         }       \r
 369 }\r
 370 \r
 371 \r
 372 \r