Identification of faces in line drawings by edge decomposition
This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face o...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Fang, Fen [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
18 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Association between dopa decarboxylase gene variants and borderline personality disorder - Mobascher, Arian ELSEVIER, 2014, the journal of the Pattern Recognition Society, Amsterdam |
|---|---|
| Übergeordnetes Werk: |
volume:48 ; year:2015 ; number:12 ; pages:3825-3842 ; extent:18 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.patcog.2015.05.025 |
|---|
| Katalog-ID: |
ELV034966528 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV034966528 | ||
| 003 | DE-627 | ||
| 005 | 20230625202549.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.patcog.2015.05.025 |2 doi | |
| 028 | 5 | 2 | |a GBVA2015023000018.pica |
| 035 | |a (DE-627)ELV034966528 | ||
| 035 | |a (ELSEVIER)S0031-3203(15)00204-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 000 |a 150 | |
| 082 | 0 | 4 | |a 000 |q DE-600 |
| 082 | 0 | 4 | |a 150 |q DE-600 |
| 100 | 1 | |a Fang, Fen |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Identification of faces in line drawings by edge decomposition |
| 264 | 1 | |c 2015transfer abstract | |
| 300 | |a 18 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. | ||
| 520 | |a This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. | ||
| 650 | 7 | |a Internal face |2 Elsevier | |
| 650 | 7 | |a 3D reconstruction |2 Elsevier | |
| 650 | 7 | |a Face identification |2 Elsevier | |
| 650 | 7 | |a Line drawing |2 Elsevier | |
| 650 | 7 | |a 3D wireframe |2 Elsevier | |
| 650 | 7 | |a Edge decomposition |2 Elsevier | |
| 700 | 1 | |a Lee, Yong Tsui |4 oth | |
| 700 | 1 | |a Leong, Mei Chee |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Mobascher, Arian ELSEVIER |t Association between dopa decarboxylase gene variants and borderline personality disorder |d 2014 |d the journal of the Pattern Recognition Society |g Amsterdam |w (DE-627)ELV017326583 |
| 773 | 1 | 8 | |g volume:48 |g year:2015 |g number:12 |g pages:3825-3842 |g extent:18 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.patcog.2015.05.025 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 951 | |a AR | ||
| 952 | |d 48 |j 2015 |e 12 |h 3825-3842 |g 18 | ||
| 953 | |2 045F |a 000 | ||
| author_variant |
f f ff |
|---|---|
| matchkey_str |
fangfenleeyongtsuileongmeichee:2015----:dniiainfaeilndaigbe |
| hierarchy_sort_str |
2015transfer abstract |
| publishDate |
2015 |
| allfields |
10.1016/j.patcog.2015.05.025 doi GBVA2015023000018.pica (DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 DE-627 ger DE-627 rakwb eng 000 150 000 DE-600 150 DE-600 Fang, Fen verfasserin aut Identification of faces in line drawings by edge decomposition 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier Lee, Yong Tsui oth Leong, Mei Chee oth Enthalten in Elsevier Mobascher, Arian ELSEVIER Association between dopa decarboxylase gene variants and borderline personality disorder 2014 the journal of the Pattern Recognition Society Amsterdam (DE-627)ELV017326583 volume:48 year:2015 number:12 pages:3825-3842 extent:18 https://doi.org/10.1016/j.patcog.2015.05.025 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U AR 48 2015 12 3825-3842 18 045F 000 |
| spelling |
10.1016/j.patcog.2015.05.025 doi GBVA2015023000018.pica (DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 DE-627 ger DE-627 rakwb eng 000 150 000 DE-600 150 DE-600 Fang, Fen verfasserin aut Identification of faces in line drawings by edge decomposition 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier Lee, Yong Tsui oth Leong, Mei Chee oth Enthalten in Elsevier Mobascher, Arian ELSEVIER Association between dopa decarboxylase gene variants and borderline personality disorder 2014 the journal of the Pattern Recognition Society Amsterdam (DE-627)ELV017326583 volume:48 year:2015 number:12 pages:3825-3842 extent:18 https://doi.org/10.1016/j.patcog.2015.05.025 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U AR 48 2015 12 3825-3842 18 045F 000 |
| allfields_unstemmed |
10.1016/j.patcog.2015.05.025 doi GBVA2015023000018.pica (DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 DE-627 ger DE-627 rakwb eng 000 150 000 DE-600 150 DE-600 Fang, Fen verfasserin aut Identification of faces in line drawings by edge decomposition 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier Lee, Yong Tsui oth Leong, Mei Chee oth Enthalten in Elsevier Mobascher, Arian ELSEVIER Association between dopa decarboxylase gene variants and borderline personality disorder 2014 the journal of the Pattern Recognition Society Amsterdam (DE-627)ELV017326583 volume:48 year:2015 number:12 pages:3825-3842 extent:18 https://doi.org/10.1016/j.patcog.2015.05.025 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U AR 48 2015 12 3825-3842 18 045F 000 |
| allfieldsGer |
10.1016/j.patcog.2015.05.025 doi GBVA2015023000018.pica (DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 DE-627 ger DE-627 rakwb eng 000 150 000 DE-600 150 DE-600 Fang, Fen verfasserin aut Identification of faces in line drawings by edge decomposition 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier Lee, Yong Tsui oth Leong, Mei Chee oth Enthalten in Elsevier Mobascher, Arian ELSEVIER Association between dopa decarboxylase gene variants and borderline personality disorder 2014 the journal of the Pattern Recognition Society Amsterdam (DE-627)ELV017326583 volume:48 year:2015 number:12 pages:3825-3842 extent:18 https://doi.org/10.1016/j.patcog.2015.05.025 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U AR 48 2015 12 3825-3842 18 045F 000 |
| allfieldsSound |
10.1016/j.patcog.2015.05.025 doi GBVA2015023000018.pica (DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 DE-627 ger DE-627 rakwb eng 000 150 000 DE-600 150 DE-600 Fang, Fen verfasserin aut Identification of faces in line drawings by edge decomposition 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier Lee, Yong Tsui oth Leong, Mei Chee oth Enthalten in Elsevier Mobascher, Arian ELSEVIER Association between dopa decarboxylase gene variants and borderline personality disorder 2014 the journal of the Pattern Recognition Society Amsterdam (DE-627)ELV017326583 volume:48 year:2015 number:12 pages:3825-3842 extent:18 https://doi.org/10.1016/j.patcog.2015.05.025 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U AR 48 2015 12 3825-3842 18 045F 000 |
| language |
English |
| source |
Enthalten in Association between dopa decarboxylase gene variants and borderline personality disorder Amsterdam volume:48 year:2015 number:12 pages:3825-3842 extent:18 |
| sourceStr |
Enthalten in Association between dopa decarboxylase gene variants and borderline personality disorder Amsterdam volume:48 year:2015 number:12 pages:3825-3842 extent:18 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Internal face 3D reconstruction Face identification Line drawing 3D wireframe Edge decomposition |
| dewey-raw |
000 |
| isfreeaccess_bool |
false |
| container_title |
Association between dopa decarboxylase gene variants and borderline personality disorder |
| authorswithroles_txt_mv |
Fang, Fen @@aut@@ Lee, Yong Tsui @@oth@@ Leong, Mei Chee @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
ELV017326583 |
| dewey-sort |
0 |
| id |
ELV034966528 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV034966528</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625202549.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.patcog.2015.05.025</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015023000018.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV034966528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0031-3203(15)00204-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">000</subfield><subfield code="a">150</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">150</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fang, Fen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Identification of faces in line drawings by edge decomposition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Internal face</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">3D reconstruction</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Face identification</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Line drawing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">3D wireframe</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge decomposition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lee, Yong Tsui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leong, Mei Chee</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Mobascher, Arian ELSEVIER</subfield><subfield code="t">Association between dopa decarboxylase gene variants and borderline personality disorder</subfield><subfield code="d">2014</subfield><subfield code="d">the journal of the Pattern Recognition Society</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV017326583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:12</subfield><subfield code="g">pages:3825-3842</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.patcog.2015.05.025</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2015</subfield><subfield code="e">12</subfield><subfield code="h">3825-3842</subfield><subfield code="g">18</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">000</subfield></datafield></record></collection>
|
| author |
Fang, Fen |
| spellingShingle |
Fang, Fen ddc 000 ddc 150 Elsevier Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Identification of faces in line drawings by edge decomposition |
| authorStr |
Fang, Fen |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV017326583 |
| format |
electronic Article |
| dewey-ones |
000 - Computer science, information & general works 150 - Psychology |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
000 150 000 DE-600 150 DE-600 Identification of faces in line drawings by edge decomposition Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition Elsevier |
| topic |
ddc 000 ddc 150 Elsevier Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition |
| topic_unstemmed |
ddc 000 ddc 150 Elsevier Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition |
| topic_browse |
ddc 000 ddc 150 Elsevier Internal face Elsevier 3D reconstruction Elsevier Face identification Elsevier Line drawing Elsevier 3D wireframe Elsevier Edge decomposition |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
y t l yt ytl m c l mc mcl |
| hierarchy_parent_title |
Association between dopa decarboxylase gene variants and borderline personality disorder |
| hierarchy_parent_id |
ELV017326583 |
| dewey-tens |
000 - Computer science, knowledge & systems 150 - Psychology |
| hierarchy_top_title |
Association between dopa decarboxylase gene variants and borderline personality disorder |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV017326583 |
| title |
Identification of faces in line drawings by edge decomposition |
| ctrlnum |
(DE-627)ELV034966528 (ELSEVIER)S0031-3203(15)00204-6 |
| title_full |
Identification of faces in line drawings by edge decomposition |
| author_sort |
Fang, Fen |
| journal |
Association between dopa decarboxylase gene variants and borderline personality disorder |
| journalStr |
Association between dopa decarboxylase gene variants and borderline personality disorder |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 100 - Philosophy & psychology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
zzz |
| container_start_page |
3825 |
| author_browse |
Fang, Fen |
| container_volume |
48 |
| physical |
18 |
| class |
000 150 000 DE-600 150 DE-600 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Fang, Fen |
| doi_str_mv |
10.1016/j.patcog.2015.05.025 |
| dewey-full |
000 150 |
| title_sort |
identification of faces in line drawings by edge decomposition |
| title_auth |
Identification of faces in line drawings by edge decomposition |
| abstract |
This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. |
| abstractGer |
This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. |
| abstract_unstemmed |
This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U |
| container_issue |
12 |
| title_short |
Identification of faces in line drawings by edge decomposition |
| url |
https://doi.org/10.1016/j.patcog.2015.05.025 |
| remote_bool |
true |
| author2 |
Lee, Yong Tsui Leong, Mei Chee |
| author2Str |
Lee, Yong Tsui Leong, Mei Chee |
| ppnlink |
ELV017326583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.patcog.2015.05.025 |
| up_date |
2024-07-06T22:27:24.726Z |
| _version_ |
1803870372864458752 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV034966528</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625202549.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.patcog.2015.05.025</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015023000018.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV034966528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0031-3203(15)00204-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">000</subfield><subfield code="a">150</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">150</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fang, Fen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Identification of faces in line drawings by edge decomposition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents a method to find the faces of objects in 2D line drawings, using an approach totally different from existing ones. It consists of two stages: decomposition and face forming. In decomposition, a drawing is decomposed into chains of connected edges. Each chain belongs to one face only, but may not yet form a closed loop. The decomposition is local to a vertex, and takes no account of the overall structure of the drawing. The algorithm ensures that there is a chain for every face in the object. The face forming stage completes the loop for each chain to form a face. Our method can deliver both the real faces and the internal faces separately. It depends only on the topology of the drawing and not on the geometry, and is therefore applicable to line drawings with curves and straight lines, and 3D wireframes. We implemented our algorithm and tested it with hundreds of objects, including objects used in previous publications. It always delivers the correct result. Comparison with the latest methods shows that it is faster often by tens of times and, in some cases, hundreds of times.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Internal face</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">3D reconstruction</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Face identification</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Line drawing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">3D wireframe</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge decomposition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lee, Yong Tsui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leong, Mei Chee</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Mobascher, Arian ELSEVIER</subfield><subfield code="t">Association between dopa decarboxylase gene variants and borderline personality disorder</subfield><subfield code="d">2014</subfield><subfield code="d">the journal of the Pattern Recognition Society</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV017326583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:12</subfield><subfield code="g">pages:3825-3842</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.patcog.2015.05.025</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2015</subfield><subfield code="e">12</subfield><subfield code="h">3825-3842</subfield><subfield code="g">18</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">000</subfield></datafield></record></collection>
|
| score |
7.402276 |