III WVC 2007 - Iris.sel.eesc.sc.usp.br - USP

More documents

Recommendations

Info

WVC'2007 - III Workshop de Visão Computacional, 22 a 24 de Outubro de 2007, São José do Rio Preto, SP.the developed technique. For each example shown the valuesof the parameters used will be given.Figure 6a represents a binary image of a pyramid. Figures6c and 6d illustrates different convergences of the initialcontour (figure 6b) when the value of the alpha parametervaries. This parameter controls the snake elasticity. Ahigher value (figure 6d) prevented the contour from expanding,while beta should be set to zero, as a higher value wouldprevent the snake from finding the sharp edge of the object.Once the desired contour is found, the vertexes identificationfor a quadrangular base pyramid is carried out. Theresulting contours and vertexes, as well the parameters usedin this experiment are illustrated in figures 6e and 6f.Notice that in the example illustrated above an anglevariation of 11 o has been employed. A higher value wouldprobably not be adequate in the identification of all its fourvisible vertexes.This technique, as well as being applied on binary images,can also be applied on gray scale images, as shownin figure 7, where a high-pass filter has been used to computethe the edge map.To illustrate the benefits of the proposed method, we performeda similar experiment with Hough transform technique[2], which is a traditional mechanism for line detection.Figure 8 illustrates the Hough Transform applied to theoriginal cube of figure 7a. Figure 8b represents the binaryimage of the original cube, while figures 8c, 8d, and 8e are,respectively, the Hough transform results for line segmentswith pixels quantities (threshold in Hough space) equal to5, 20, and 30.Although they have not been shown in the images, thevertexes can be easily calculated with the Hough transformtechnique, once each point in the Hough space represents aline. To calculate a vertex coordinate, the computation of theintersection points for each pair of lines would suffice. Thedifficulty, however, is to accurately define which, among allthe computed vertexes, truly belong to the cube. The difficultyin defining the correct vertex increases with the thresholdin Hough space. Although it can be trivial to find line intersections(possible vertexes) there is no clear indication ofwhich points actually are the real vertexes of the object.5. ConclusionsBy applying the active contour concept, this paper hasproposed an automatic edge and vertexes detection schemeto some geometric shapes that can be an aid device for imagebased modelling tools, such as Canoma.A survey on image-based modelling tools has been madeand no such functionality as that proposed in this article hasbeen found. This new approach turned out to be rather functional,specially for simple shape primitives such as cubesand pyramids. This is due to fact that the mechanism presentedembodies geometric information of the object andthe ability of the GVF snake to correctly converge to theoriginal object contour.Although the methodology is highly parameterized, wecan identify an adequate set of values to this parameters, accordingto the image type, so that the performance is satisfactory.Tests have also been carried out with Hough transform,but the results found were worst than those obtained withthe method proposed in this paper. Although the Houghtransform is an elegant line detection mechanism, no geometricalinformation on the object is provided. On the otherhand, in the method proposed such information comes fromthe edge map, needed to compute the snake.We must point out that this is not primarily a segmentationtool capable of finding occluded objects. We assumethat the scene is composed of a single object with little noisybackground. However, this work can be extended to includea pre-processing process tha could be used to segment morecomplex scenes.References[1] V. Cantoni, L. Lombardi, M. Porta, and N. Sicard. Vanishingpoint detection: Representation analysis and new approaches.In Proceedings of the IEEE International Conferenceon Image Analysis and Processing, volume 11, pages90–94, 2001.[2] P. V. C. Hough. A method and means for recognition complexpatterns. US Patent, 1962.[3] M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Activecontour models. International Journal of Computer Vision,1(4):321–331, 1987.[4] A. C. C. Machado, L. R. Galvo, T. A. Vanderlei, and W. Y. R.Santos. Uma ferramenta de extrao de bordas utilizando t-snakes. Revista Eletrnica de Iniciao Cientfica, 2002.[5] M. Oliveira. Image-based modeling and rendering techniques:a survey. RITA - Revista de informtica terica e aplicada,(2):37–66, 2002.[6] B. S. Pimentel. Segmentao de imagens mdicas utilizandomodelos de active contours. Avaiable in:¡http://www.lrvpa.dcc.ufmg.br/vision/snake/artigo.htm¿,Laboratrio de Viso Computacional e Robtica. Acessed in:10/08/05, 2000.[7] L. Stevens. Canoma - Manual do usurio. MetaCreationsCorp., 6303 Carpinteria Avenue, Carpinteria, CA 93013,1999.[8] C. Xu and J. L. Prince. Gradient vector flow: A new externalforce for snakes. In IEEE Proc. Conf. Comp. Vis. Patt.Recog. (CVPR), pages 66–71, 1997.[9] C. Xu and J. L. Prince. Snakes, shapes, and gradient vectorflow. IEEE Transaction on Image Processing, 7(3):359–369,March 1998.[10] O. A. Zuniga and R. M. Haralick. Integrated directionalderivative gradient operator. 17:508–517, 1987.79
WVC'2007 - III Workshop de Visão Computacional, 22 a 24 de Outubro de 2007, São José do Rio Preto, SP.Figure 6. a) Original image (87x94); b) initial contour defined by the user and resulting snake in c) after6 iterations and in d) after 4 iterations. The visible vertexes are detected in e); in f) the localizationof hidden vertexes to a quadrangular base pyramid.Figure 7. a) Initial contour defined by the user in the original image (160x150); b) parameters usedin contour detection; c) snake final position; d) parameters used in visible vertexes detection of theobject; e) visible vertexes detected by the tool; f) 1 and 2 degree vertexes projected in vanishingpoints A and B and g) hidden vertexes identification.a) b) c) d)Figure 8. a) Original image, b) binary image of the original cube; Hough Transform with b) threshold5; c) threshold 20; and d) threshold 30.80
Page 1 and 2:
III Workshop de VisãoComputacional
Page 3 and 4:
Instituto de Biociências, Letras e
Page 5 and 6:
WVC 2007 - III Workshop de Visão C
Page 7 and 8:
ApresentaçãoA área de Visão Com
Page 10 and 11:
Automatic Pattern Recognition of Bi
Page 12 and 13:
WVC'2007 - III Workshop de Visão C
Page 14 and 15:
Page 16:
Page 19:
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
Page 30 and 31:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40: WVC'2007 - III Workshop de Visão C
Page 89: WVC'2007 - III Workshop de Visão C
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Page 305 and 306:
Page 307 and 308:
Page 309 and 310:
Page 311 and 312:
Page 313 and 314:
Page 315 and 316:
Page 317 and 318:
Page 319 and 320:
Page 321 and 322:
Page 323 and 324:
Page 325 and 326:
Page 327 and 328:
Page 329 and 330:
Page 331 and 332:
Page 333 and 334:
Page 335 and 336:
Page 337 and 338:
Page 339 and 340:
Page 341 and 342:
Page 343 and 344:
Page 345 and 346:
Page 347 and 348:
Page 349 and 350:
Page 351 and 352:
Page 353 and 354:
Page 355 and 356:
Page 357 and 358:
Page 359 and 360:
Page 361 and 362:
Page 363:
show all

III WVC 2007 - Iris.sel.eesc.sc.usp.br - USP

Create successful ePaper yourself

Delete template?

Save as template?