Arithmetic Discrete Parabolas
Identifieur interne :
000341 ( PascalFrancis/Corpus );
précédent :
000340;
suivant :
000342
Arithmetic Discrete Parabolas
Auteurs : I. Debled-Rennesson ;
E. Domenjoud ;
D. JametSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2006.
RBID : Pascal:08-0062356
Descripteurs français
English descriptors
Abstract
In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥1 of their normal vector.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
A01 | 01 | 1 | | @0 0302-9743 |
---|
A05 | | | | @2 4291 |
---|
A08 | 01 | 1 | ENG | @1 Arithmetic Discrete Parabolas |
---|
A09 | 01 | 1 | ENG | @1 Advances in visual computing. Part I-II : Second international symposium, ISVC 2006, Lake Tahoe, NV, USA, November 6-8, 2006 : proceedings |
---|
A11 | 01 | 1 | | @1 DEBLED-RENNESSON (I.) |
---|
A11 | 02 | 1 | | @1 DOMENJOUD (E.) |
---|
A11 | 03 | 1 | | @1 JAMET (D.) |
---|
A14 | 01 | | | @1 LORIA, Technopole de Nancy-Brabois, BP 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
---|
A20 | | | | @1 480-489 |
---|
A21 | | | | @1 2006 |
---|
A23 | 01 | | | @0 ENG |
---|
A26 | 01 | | | @0 3-540-48628-3 |
---|
A43 | 01 | | | @1 INIST @2 16343 @5 354000172812971390 |
---|
A44 | | | | @0 0000 @1 © 2008 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 9 ref. |
---|
A47 | 01 | 1 | | @0 08-0062356 |
---|
A60 | | | | @1 P @2 C |
---|
A61 | | | | @0 A |
---|
A64 | 01 | 1 | | @0 Lecture notes in computer science |
---|
A66 | 01 | | | @0 DEU |
---|
A66 | 02 | | | @0 USA |
---|
C01 | 01 | | ENG | @0 In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥1 of their normal vector. |
---|
C02 | 01 | X | | @0 001D02A05 |
---|
C02 | 02 | X | | @0 001D02C03 |
---|
C03 | 01 | X | FRE | @0 Vision ordinateur @5 01 |
---|
C03 | 01 | X | ENG | @0 Computer vision @5 01 |
---|
C03 | 01 | X | SPA | @0 Visión ordenador @5 01 |
---|
C03 | 02 | X | FRE | @0 Traitement image @5 02 |
---|
C03 | 02 | X | ENG | @0 Image processing @5 02 |
---|
C03 | 02 | X | SPA | @0 Procesamiento imagen @5 02 |
---|
C03 | 03 | X | FRE | @0 Connexité @5 18 |
---|
C03 | 03 | X | ENG | @0 Connectedness @5 18 |
---|
C03 | 03 | X | SPA | @0 Conexidad @5 18 |
---|
C03 | 04 | X | FRE | @0 Arithmétique @5 23 |
---|
C03 | 04 | X | ENG | @0 Arithmetics @5 23 |
---|
C03 | 04 | X | SPA | @0 Aritmética @5 23 |
---|
N21 | | | | @1 028 |
---|
N44 | 01 | | | @1 OTO |
---|
N82 | | | | @1 OTO |
---|
|
pR |
A30 | 01 | 1 | ENG | @1 International Symposium on Visual Computing @2 2 @3 Lake Tahoe NV USA @4 2006 |
---|
|
Format Inist (serveur)
NO : | PASCAL 08-0062356 INIST |
ET : | Arithmetic Discrete Parabolas |
AU : | DEBLED-RENNESSON (I.); DOMENJOUD (E.); JAMET (D.) |
AF : | LORIA, Technopole de Nancy-Brabois, BP 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
DT : | Publication en série; Congrès; Niveau analytique |
SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4291; Pp. 480-489; Bibl. 9 ref. |
LA : | Anglais |
EA : | In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥1 of their normal vector. |
CC : | 001D02A05; 001D02C03 |
FD : | Vision ordinateur; Traitement image; Connexité; Arithmétique |
ED : | Computer vision; Image processing; Connectedness; Arithmetics |
SD : | Visión ordenador; Procesamiento imagen; Conexidad; Aritmética |
LO : | INIST-16343.354000172812971390 |
ID : | 08-0062356 |
Links to Exploration step
Pascal:08-0062356
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Arithmetic Discrete Parabolas</title>
<author><name sortKey="Debled Rennesson, I" sort="Debled Rennesson, I" uniqKey="Debled Rennesson I" first="I." last="Debled-Rennesson">I. Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Domenjoud, E" sort="Domenjoud, E" uniqKey="Domenjoud E" first="E." last="Domenjoud">E. Domenjoud</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jamet, D" sort="Jamet, D" uniqKey="Jamet D" first="D." last="Jamet">D. Jamet</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">08-0062356</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 08-0062356 INIST</idno>
<idno type="RBID">Pascal:08-0062356</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000341</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Arithmetic Discrete Parabolas</title>
<author><name sortKey="Debled Rennesson, I" sort="Debled Rennesson, I" uniqKey="Debled Rennesson I" first="I." last="Debled-Rennesson">I. Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Domenjoud, E" sort="Domenjoud, E" uniqKey="Domenjoud E" first="E." last="Domenjoud">E. Domenjoud</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jamet, D" sort="Jamet, D" uniqKey="Jamet D" first="D." last="Jamet">D. Jamet</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arithmetics</term>
<term>Computer vision</term>
<term>Connectedness</term>
<term>Image processing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Vision ordinateur</term>
<term>Traitement image</term>
<term>Connexité</term>
<term>Arithmétique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥<sub>1</sub>
of their normal vector.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>4291</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Arithmetic Discrete Parabolas</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Advances in visual computing. Part I-II : Second international symposium, ISVC 2006, Lake Tahoe, NV, USA, November 6-8, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DEBLED-RENNESSON (I.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DOMENJOUD (E.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>JAMET (D.)</s1>
</fA11>
<fA14 i1="01"><s1>LORIA, Technopole de Nancy-Brabois, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>480-489</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-48628-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000172812971390</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2008 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>9 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>08-0062356</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥<sub>1</sub>
of their normal vector.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Vision ordinateur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer vision</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Visión ordenador</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Image processing</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Connexité</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Connectedness</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Conexidad</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Arithmétique</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Arithmetics</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Aritmética</s0>
<s5>23</s5>
</fC03>
<fN21><s1>028</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Symposium on Visual Computing</s1>
<s2>2</s2>
<s3>Lake Tahoe NV USA</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 08-0062356 INIST</NO>
<ET>Arithmetic Discrete Parabolas</ET>
<AU>DEBLED-RENNESSON (I.); DOMENJOUD (E.); JAMET (D.)</AU>
<AF>LORIA, Technopole de Nancy-Brabois, BP 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2006; Vol. 4291; Pp. 480-489; Bibl. 9 ref.</SO>
<LA>Anglais</LA>
<EA>In the present paper, we propose a new definition of discrete parabolas, the so-called arithmetic discrete parabolas. We base our approach on a non-constant thickness function and characterized the 0-connected and 1-connected parabolas in terms of thickness function. This results extend the well-known characterization of the K-connectedness of arithmetic discrete lines, depending on the norm ∥ . ∥ ∞ and ∥ .∥<sub>1</sub>
of their normal vector.</EA>
<CC>001D02A05; 001D02C03</CC>
<FD>Vision ordinateur; Traitement image; Connexité; Arithmétique</FD>
<ED>Computer vision; Image processing; Connectedness; Arithmetics</ED>
<SD>Visión ordenador; Procesamiento imagen; Conexidad; Aritmética</SD>
<LO>INIST-16343.354000172812971390</LO>
<ID>08-0062356</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000341 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000341 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:08-0062356
|texte= Arithmetic Discrete Parabolas
}}
| This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 | ![](Common/icons/LogoDilib.gif) |