Search

Your search keyword '"polygonal representation"' showing total 19 results
Start Over Descriptor "polygonal representation"

Refine your results

more »

more »

more »
19 results on '"polygonal representation"'

1. A Discrete Approach for Polygonal Approximation of Irregular Noise Contours

Author

Ngo, Phuc, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Vento, Mario, editor, and Percannella, Gennaro, editor

Published
2019
Full Text
View/download PDF

2. Multilevel polygonal descriptor matching defined by combining discrete lines and force histogram concepts.

Author

Wendling, L., Debled-Rennesson, I., and Nasser, H.

Subjects
HISTOGRAMS, CONCEPTS, CURVES, DATABASES, POLYGONS
Abstract

A new method allowing to describe shapes from a set of polygonal curves using a relational descriptor is proposed in this paper. An approach based on discrete lines at several increasing widths is run on the contour of an object to provide a multi-level polygonal representation from accurate description to more and more rough aspects. On each polygon, a force histogram is calculated to define a relational feature signature following a set of directions integrating both spatial relation organization and disparities of the shape in a same distribution. Three different matching schemes are proposed to compare multilevel distributions: global representation, level to level following extracted maxima. This new method is fast and a first experimental study achieved on a common database shows its good behavior. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

3. A Linear Algorithm for Polygonal Representations of Digital Sets

Author

Dörksen-Reiter, Helene, Debled-Rennesson, Isabelle, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Reulke, Ralf, editor, Eckardt, Ulrich, editor, Flach, Boris, editor, Knauer, Uwe, editor, and Polthier, Konrad, editor

Published
2006
Full Text
View/download PDF

5. Multilevel polygonal descriptor matching defined by combining discrete lines and force histogram concepts

Author

Isabelle Debled-Rennesson, Hayat Nasser, Laurent Wendling, Laboratoire d'Informatique Paris Descartes (LIPADE (URP_2517)), Université Paris Cité (UPCité), Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Université de Paris (UP)

Subjects
Matching (graph theory), Computer Networks and Communications, Computer science, Discrete lines, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], force histogram, multilevel structure, 020207 software engineering, 02 engineering and technology, Object (computer science), [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, Set (abstract data type), Spatial relation, Hardware and Architecture, Feature (computer vision), Histogram, Polygon, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, Representation (mathematics), polygonal representation, Algorithm, Software
Abstract

International audience; A new method allowing to describe shapes from a set of polygonal curves using a relational descriptor is proposed in this paper. An approach based on discrete lines at several increasing widths is run on the contour of an object to provide a multi-level polygonal representation from accurate description to more and more rough aspects. On each polygon is calculated a force histogram to define a relational feature signature following a set of directions integrating both spatial relation organization and disparities of the shape in a same distribution. Three different matching schemes are proposed to compare multilevel distributions: global representation, level to level following extracted maxima. This new method is fast and a first experimental study achieved on a common database shows its good behavior.

Published
2019

7. Faithful polygonal representation of the convex and concave parts of a digital curve

Author

Roussillon, Tristan and Sivignon, Isabelle

Subjects
*DIGITAL image processing, *POLYGONS, *CONVEX domains, *CONCAVE functions, *CURVES, *TIME
Abstract

Abstract: From results about digital convexity, we define a reversible polygon that faithfully represents the maximal convex and concave parts of a digital curve. Such a polygon always exists and is unique in the general case. It is computed from a given digital curve in linear-time using well-known routines: adding a point at the front of a digital straight segment and removing a point from the back of a digital straight segment. It may helps to extract perceptually meaningful parts of shape outlines or lines. [Copyright &y& Elsevier]

Published
2011
Full Text
View/download PDF

8. Computation of volume and surface body moments

Author

Tuzikov, A.V., Sheynin, S.A., and Vasiliev, P.V.

Subjects
*IMAGE analysis, *POLYTOPES, *TOPOLOGY
Abstract

The paper presents explicit formulae for calculation of surface moments for polytopes in Rn. We describe also efficient algorithms for calculation of 3D body volume and surface moments. The algorithms are based on explicit formulae for moment calculation and take advantages of shape polygonal representation. They use only coordinates of the body vertices and faces orientation. [Copyright &y& Elsevier]

Published
2003
Full Text
View/download PDF

9. A discrete approach for polygonal approximation of irregular noise contours

Author

Phuc Ngo, Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer science, Process (computing), Structure (category theory), ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Image processing, Context (language use), 0102 computer and information sciences, 02 engineering and technology, Polygonal representation, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Digital image, Noise, 010201 computation theory & mathematics, Robustness (computer science), Discrete structure, Computer Science::Computer Vision and Pattern Recognition, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Algorithm, Data compression, Dominant point
Abstract

International audience; Polygonal approximation is often involved in many applications of computer vision, image processing and data compression. In this context, we are interested in digital curves extracted from contours of objects contained in digital images. In particular, we propose a fully discrete structure, based on the notion of blurred segments, to study the geometrical features on such curves and apply it in a process of polygonal approximation. The experimental results demonstrate the robustness of the proposed method to local variation and noise on the curve.

Published
2019

11. Active contours approach to object tracking in image sequences with complex background

Author

Jenny Benois, Philippe Delagnes, Dominique Barba, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)

Subjects
Computer science, 2D object tracking, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, Tracking (particle physics), Image (mathematics), Set (abstract data type), Artificial Intelligence, Active shape model, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Computer vision, Texture-based energy, ComputingMethodologies_COMPUTERGRAPHICS, Active contour model, business.industry, Active contours, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], 020207 software engineering, Polygonal representation, Object (computer science), Video tracking, Signal Processing, 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, Artificial intelligence, business, Software
Abstract

International audience; Active contour models (“snakes”) are a powerful tool for deformable object tracking in moving images. But the existing snake models are not well-adapted for tracking corners and objects on a complex background. In this paper, we present a novel active contour model, the “Adjustable Polygons”, which is a set of active segments that can fit any object shape (including comers). A new energy based on textural characteristics of objects is also proposed, in order to resolve conflict situations while tracking objects on multiple contour background.

Published
1995

12. Finding contour-based abstractions of planar patterns

Author

Giuliana Ramella and Carlo Arcelli

Subjects
Selection (relational algebra), business.industry, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Process (computing), Schematic, Polygonal representation, Perceptual significance, Set (abstract data type), Planar, Artificial Intelligence, Accumulated evidence, Iterated selection, Signal Processing, Polygon, Computer vision, Computer Vision and Pattern Recognition, Artificial intelligence, Representation (mathematics), business, Algorithm, Software, Dominant points, ComputingMethodologies_COMPUTERGRAPHICS, Mathematics
Abstract

An algorithm is described to detect a number of points, on the contour of a planar shape, which constitute the vertices of a schematic polygonal representation of the shape itself. A set of points, initially extracted from the chain-coded representation of the contour, is iteratively examined, while removing some points and inserting new ones. The number of selected points decreases in size from iteration to iteration, and the selection process converges towards an expected perceptually significant set of points. The polygon obtained by linking successive points approximates the contour in an intuitive way. It is not constrained within a given tolerance, and is likely to locally change from a coarse to a more faithful approximating shape, in correspondence with contour regions increasing in details.

Published
1993

13. Parameter-free method for polygonal representation of the noisy curves

Author

Nguyen, Thanh Phuong, Debled-Rennesson, Isabelle, Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), ANR-GEODIB, and Nguyen, Thanh Phuong

Subjects
[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], multiscale, dominant point, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], polygonal representation
Abstract

International audience; We propose a parameter-free method for the detection of dominant points and polygonal representation of possibly noisy curves. Based on \cite{ND07,NguyenDebled09}, this work aims at a parameter-free method through a multiscale approach. We propose a new evaluation criterion to automatically determine the most appropriate width parameter for each input curve. Thanks to a recent result \cite{FF08} on the decomposition of a curve into a sequence of maximal blurred segments, the complexity of this algorithm is $O(n\log n)$.

Published
2009

14. Convex and Concave Parts of Digital Curves

Author

Reiter-Dorksen, Hélène, Debled-Rennesson, Isabelle, Fachbereich Mathematik [Kassel], Universität Kassel [Kassel], Applying discrete algorithms to genomics (ADAGE), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), and none

Subjects
droite discrète, digital geometry, convex and concave curves, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], géométrie discrète, digital convexity, convexité discrète, représentation polygonale, polygonal representation, discrete line, courbes convexes et concaves
Abstract

Contribution à un ouvrage.; Decomposition of a digital curve into convex and concave parts is of relevance in several scopes of image processing. In digital plane convexity cannot be observed locally. It becomes an interesting question, how far one can decide whether a part of a digital curve is convex or concave by a method which is "as local as possible". In a previous paper, it was proposed to define the meaningful parts of a digital curve as meaningful parts of the corresponding polygonal representation. This technique has an approximative character. In our considerations, we use geometry of arithmetical discrete line segments. We will introduce an exact method to define convex and concave parts of a digital curve.

Published
2004

15. Two-Dimensional Polygonal Representation of Maps for Use with Autonomous Vehicle Route Planning

Abstract

We present in this study a two-phase approach to the generation and maintenance of a polygonal cartographic database useful for autonomous vehicle route planning. The database is generated non-interactively from available U.S. Geological Survey topographical maps. The database is maintained interactively by a graphics workstation. The focus of this study is on the non-interactive generation of the polygonal database. The non-interactive generation process uses both a set of heuristics derived from the characteristics of paper maps and classical region growing. This study presents a two-phase approach to the digital map production problem. The first phase is a non-interactive phase in which general information is gleaned from a paper topographical map with the use of an image digitizer and computer vision software. The second phase is an interactive one that focuses on the refinement, correction and revision of the map produced in the first phase.

Published
1986

16. Automatické generování okrajové plochy kraniálního implantátu

Abstract

Tato práce se zabývá problematikou automatického generování okrajové plochy kraniálního implantátu. Je zde popsán postup tvorby 3D modelu tkání a následně je rozebrána problematika kraniálního implantátu. Dále dokument obsahuje možné pohledy na řešení automatického generování jeho okrajové plochy. Druhá polovina dokumentu se zabývá implementací nástroje pro automatické generování okrajové plochy. V závěru jsou shrnuty výsledky práce s implementovaným nástrojem., This thesis is focused to problems of automatic generation of border surface for cranial implant. This document includes description of 3D modeling human tissue, followed with issue of cranial implant. Next it includes possible perspectives of solving automatic generation problems for implant border. Second half of this document is focused to implementation of tool for automatic generation of border surface. Final part deals with results of work with this tool.

17. Automatické generování okrajové plochy kraniálního implantátu

Abstract

Tato práce se zabývá problematikou automatického generování okrajové plochy kraniálního implantátu. Je zde popsán postup tvorby 3D modelu tkání a následně je rozebrána problematika kraniálního implantátu. Dále dokument obsahuje možné pohledy na řešení automatického generování jeho okrajové plochy. Druhá polovina dokumentu se zabývá implementací nástroje pro automatické generování okrajové plochy. V závěru jsou shrnuty výsledky práce s implementovaným nástrojem., This thesis is focused to problems of automatic generation of border surface for cranial implant. This document includes description of 3D modeling human tissue, followed with issue of cranial implant. Next it includes possible perspectives of solving automatic generation problems for implant border. Second half of this document is focused to implementation of tool for automatic generation of border surface. Final part deals with results of work with this tool.

18. Automatické generování okrajové plochy kraniálního implantátu

Abstract

Tato práce se zabývá problematikou automatického generování okrajové plochy kraniálního implantátu. Je zde popsán postup tvorby 3D modelu tkání a následně je rozebrána problematika kraniálního implantátu. Dále dokument obsahuje možné pohledy na řešení automatického generování jeho okrajové plochy. Druhá polovina dokumentu se zabývá implementací nástroje pro automatické generování okrajové plochy. V závěru jsou shrnuty výsledky práce s implementovaným nástrojem., This thesis is focused to problems of automatic generation of border surface for cranial implant. This document includes description of 3D modeling human tissue, followed with issue of cranial implant. Next it includes possible perspectives of solving automatic generation problems for implant border. Second half of this document is focused to implementation of tool for automatic generation of border surface. Final part deals with results of work with this tool.

19. Automatické generování okrajové plochy kraniálního implantátu

Abstract

Tato práce se zabývá problematikou automatického generování okrajové plochy kraniálního implantátu. Je zde popsán postup tvorby 3D modelu tkání a následně je rozebrána problematika kraniálního implantátu. Dále dokument obsahuje možné pohledy na řešení automatického generování jeho okrajové plochy. Druhá polovina dokumentu se zabývá implementací nástroje pro automatické generování okrajové plochy. V závěru jsou shrnuty výsledky práce s implementovaným nástrojem., This thesis is focused to problems of automatic generation of border surface for cranial implant. This document includes description of 3D modeling human tissue, followed with issue of cranial implant. Next it includes possible perspectives of solving automatic generation problems for implant border. Second half of this document is focused to implementation of tool for automatic generation of border surface. Final part deals with results of work with this tool.

Catalog

Books, media, physical & digital resources
See catalog results