New Extinction Values From Efficient Construction And Analysis Of Extended Attribute Component Tree

dc.creatorSilva A.G.
dc.creatorDe Alencar Lotufo R.
dc.date2008
dc.date2015-06-30T19:22:29Z
dc.date2015-11-26T15:32:15Z
dc.date2015-06-30T19:22:29Z
dc.date2015-11-26T15:32:15Z
dc.date.accessioned2018-03-28T22:40:44Z
dc.date.available2018-03-28T22:40:44Z
dc.identifier9780769533582
dc.identifierProceedings - 21st Brazilian Symposium On Computer Graphics And Image Processing, Sibgrapi 2008. , v. , n. , p. 204 - 211, 2008.
dc.identifier
dc.identifier10.1109/SIBGRAPI.2008.8
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56749131923&partnerID=40&md5=4011df6fb5b81280b5421aa122370380
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/105979
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/105979
dc.identifier2-s2.0-56749131923
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1262436
dc.descriptionA gray-level image can be interpreted as a topographical surface, and represented by a component tree, based on the inclusion relation of connected components obtained by threshold decomposition. Relations between plateaus, valleys or mountains of this relief are useful in computer vision systems. An important definition to characterize the topographical surface is the dynamics, introduced by Grimaud (1992), associated to each regional minimum. This concept has been extended, by Vachier and Meyer (1995), by the definition of extinction values associated to each extremum of the image. This paper proposes four new extinction values - two based on the topology of the component tree: (i) number of descendants and (ii) sub-tree height; and two geometric: (iii) height and (iv) width of a level component bounding box. This paper describes efficient computation of these extinction values based on the incremental determination of attributes from the component tree construction in quasilinear time, compares the computation time of the method and illustrates the usefulness of these new extinction values from real examples. © 2008 IEEE.
dc.description
dc.description
dc.description204
dc.description211
dc.descriptionBerger, C., Geraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E., Effective component tree computation with application to pattern recognition in astronomical imaging (2007) IEEE International Conference on Image Processing, 4, pp. 41-44. , San Antonio, USA, September
dc.descriptionBertrand, G., On the dynamics (2007) Image and Vision Computing, 25 (4), pp. 447-454
dc.descriptionBeucher, S., Meyer, F., The morphological approach to segmentation: The watershed transformation (1993) Mathematical Morphology in Image Processing, pp. 433-481. , E. R. Dougherty, editor, chapter 12, Marcel Dekker, New York
dc.descriptionBraga-Neto, U., Goutsias, J., Grayscale Level Connectivity: Theory and Applications (2004) IEEE Transactions on Image Processing, 13 (12), pp. 1567-1580
dc.descriptionBreen, E.J., Jones, R., Attribute Openings, Thinnings, and Granulometries (1996) Computer Vision and Image Understanding, 64 (3), pp. 377-389. , November
dc.descriptionChen, L., Berry, M.W., Hargrove, W.W., Using Dendronal Signatures for Feature Extraction and Retrieval (2000) International Journal of Imaging Systems and Technology, 11 (4), pp. 243-253
dc.descriptionGarrido, L.O., (2002) Hierarchical region based processing of images and video sequences: Application to filtering, segmentation and information retrieval, , PhD thesis, Department of Signal Theory and Communications, Universitat Politècnica de Catalunya, Barcelona, April
dc.descriptionGrimaud, M., A New Measure of Contrast: The Dynamics (1992) Image Algebra and Morphological Image Processing III, 1769, pp. 292-305. , SPIE, The International Society for Optical Engineering
dc.descriptionHuang, X., Fisher, M., Smith, D., An Efficient Implementation of Max Tree with Linked List and Hash Table (2003) VIIth Digital Imaging Computing: Techniques and Applications, pp. 299-308. , Sydney, December
dc.descriptionJones, R., Connected Filtering and Segmentation Using Component Trees (1999) Computer Vision and Image Understanding, 75, pp. 215-228
dc.descriptionMattes, J., Demongeot, J., Efficient Algorithms to Implement the Confinement Tree (2000) 9th International Conference on Discrete Geometry for Computer Imagery, pp. 392-405. , London, UK, Springer-Verlag
dc.descriptionMattes, J., Mathieu, R., Demongeot, J., Tree Representation for Image Matching and Object Recognition (1999) 8th International Conference on Discrete Geometry for Computer Imagery, pp. 298-312. , Marne-la-Vallee, France, March
dc.descriptionMeyer, F., The dynamics of minima and contours (1996) Mathematical Morphology and Its Applications to Image Processing, pp. 329-336. , Kluwer Academic Publishers
dc.descriptionNajman, L., Couprie, M., Building the Component Tree in Quasi-Linear Time (2006) IEEE Transactions on Image Processing, 15 (11), pp. 3531-3539
dc.descriptionOuzounis, G.K., Wilkinson, M.H.F., Mask-Based Second-Generation Connectivity and Attribute Filters (2007) IEEE Transactions on Pattern Analysis and Machine Intelligence, 29 (6), pp. 990-1004
dc.descriptionP. Salembier and L. Garrido. Binary partition tree as an efficient representation for filtering, segmentation and information retrieval. In IEEE Int. Conference on Image Processing, Proc. of ICIP'98, pages 4-7, Chicago (IL), USA, October 1998Salembier, P., Oliveras, A., Garrido, L., Antiextensive Connected Operators for Image and Sequence Processing (1998) IEEE Transactions on Image Processing, 7 (4), pp. 555-570
dc.descriptionTarjan, R.E., Efficiency of a Good But Not Linear Set Union Algorithm (1975) Journal of the ACM, 22 (2), pp. 215-225
dc.descriptionTzafestas, C., Maragos, P., Shape Connectivity: Multiscale Analysis and Application to Generalized Granulometries (2002) Journal of Mathematical Imaging and Vision, 17, p. 109129
dc.descriptionVachier, C., (1995) Extraction de caractéristiques, segmentation d'images et morphologie mathématique, , PhD thesis, Ecole des Mines, Paris
dc.descriptionVachier, C., Meyer, F., Extinction value: A new measurement of persistence (1995) IEEE Workshop on Nonlinear Signal and Image Processing, 1, pp. 254-257
dc.descriptionWilkinson, M., Roerdink, J., Fast morphological attribute operations using tarjan's union-find algorithm (2000) Mathematical Morphology and its Applications to Image and Signal Processing, Kluwer, pp. 311-320
dc.languageen
dc.publisher
dc.relationProceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008
dc.rightsfechado
dc.sourceScopus
dc.titleNew Extinction Values From Efficient Construction And Analysis Of Extended Attribute Component Tree
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución