On Interactive Object Shape Modeling Using Algebraic Curves
Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interact...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1998 |
|---|
| Umfang: |
11 |
|---|
| Reproduktion: |
Springer Online Journal Archives 1860-2002 |
|---|---|
| Übergeordnetes Werk: |
in: The journal of VLSI signal processing systems for signal, image, and video technology - 1989, 20(1998) vom: Jan./Feb., Seite 151-161 |
| Übergeordnetes Werk: |
volume:20 ; year:1998 ; month:01/02 ; pages:151-161 ; extent:11 |
| Links: |
|---|
| Katalog-ID: |
NLEJ196174503 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ196174503 | ||
| 003 | DE-627 | ||
| 005 | 20210705183926.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 070526s1998 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)NLEJ196174503 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 245 | 1 | 0 | |a On Interactive Object Shape Modeling Using Algebraic Curves |
| 264 | 1 | |c 1998 | |
| 300 | |a 11 | ||
| 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 Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. | ||
| 533 | |f Springer Online Journal Archives 1860-2002 | ||
| 700 | 1 | |a Lei, Zhibin |4 oth | |
| 700 | 1 | |a Cooper, David B. |4 oth | |
| 773 | 0 | 8 | |i in |t The journal of VLSI signal processing systems for signal, image, and video technology |d 1989 |g 20(1998) vom: Jan./Feb., Seite 151-161 |w (DE-627)NLEJ18898593X |w (DE-600)1479778-1 |x 1573-109X |7 nnns |
| 773 | 1 | 8 | |g volume:20 |g year:1998 |g month:01/02 |g pages:151-161 |g extent:11 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1023/A:1008078625770 |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-SOJ | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 20 |j 1998 |c 1/2 |h 151-161 |g 11 | ||
| matchkey_str |
article:1573109X:1998----::nneatvojcsaeoeigsna |
|---|---|
| hierarchy_sort_str |
1998 |
| publishDate |
1998 |
| allfields |
(DE-627)NLEJ196174503 DE-627 ger DE-627 rakwb eng On Interactive Object Shape Modeling Using Algebraic Curves 1998 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. Springer Online Journal Archives 1860-2002 Lei, Zhibin oth Cooper, David B. oth in The journal of VLSI signal processing systems for signal, image, and video technology 1989 20(1998) vom: Jan./Feb., Seite 151-161 (DE-627)NLEJ18898593X (DE-600)1479778-1 1573-109X nnns volume:20 year:1998 month:01/02 pages:151-161 extent:11 http://dx.doi.org/10.1023/A:1008078625770 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 20 1998 1/2 151-161 11 |
| spelling |
(DE-627)NLEJ196174503 DE-627 ger DE-627 rakwb eng On Interactive Object Shape Modeling Using Algebraic Curves 1998 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. Springer Online Journal Archives 1860-2002 Lei, Zhibin oth Cooper, David B. oth in The journal of VLSI signal processing systems for signal, image, and video technology 1989 20(1998) vom: Jan./Feb., Seite 151-161 (DE-627)NLEJ18898593X (DE-600)1479778-1 1573-109X nnns volume:20 year:1998 month:01/02 pages:151-161 extent:11 http://dx.doi.org/10.1023/A:1008078625770 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 20 1998 1/2 151-161 11 |
| allfields_unstemmed |
(DE-627)NLEJ196174503 DE-627 ger DE-627 rakwb eng On Interactive Object Shape Modeling Using Algebraic Curves 1998 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. Springer Online Journal Archives 1860-2002 Lei, Zhibin oth Cooper, David B. oth in The journal of VLSI signal processing systems for signal, image, and video technology 1989 20(1998) vom: Jan./Feb., Seite 151-161 (DE-627)NLEJ18898593X (DE-600)1479778-1 1573-109X nnns volume:20 year:1998 month:01/02 pages:151-161 extent:11 http://dx.doi.org/10.1023/A:1008078625770 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 20 1998 1/2 151-161 11 |
| allfieldsGer |
(DE-627)NLEJ196174503 DE-627 ger DE-627 rakwb eng On Interactive Object Shape Modeling Using Algebraic Curves 1998 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. Springer Online Journal Archives 1860-2002 Lei, Zhibin oth Cooper, David B. oth in The journal of VLSI signal processing systems for signal, image, and video technology 1989 20(1998) vom: Jan./Feb., Seite 151-161 (DE-627)NLEJ18898593X (DE-600)1479778-1 1573-109X nnns volume:20 year:1998 month:01/02 pages:151-161 extent:11 http://dx.doi.org/10.1023/A:1008078625770 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 20 1998 1/2 151-161 11 |
| allfieldsSound |
(DE-627)NLEJ196174503 DE-627 ger DE-627 rakwb eng On Interactive Object Shape Modeling Using Algebraic Curves 1998 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. Springer Online Journal Archives 1860-2002 Lei, Zhibin oth Cooper, David B. oth in The journal of VLSI signal processing systems for signal, image, and video technology 1989 20(1998) vom: Jan./Feb., Seite 151-161 (DE-627)NLEJ18898593X (DE-600)1479778-1 1573-109X nnns volume:20 year:1998 month:01/02 pages:151-161 extent:11 http://dx.doi.org/10.1023/A:1008078625770 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 20 1998 1/2 151-161 11 |
| language |
English |
| source |
in The journal of VLSI signal processing systems for signal, image, and video technology 20(1998) vom: Jan./Feb., Seite 151-161 volume:20 year:1998 month:01/02 pages:151-161 extent:11 |
| sourceStr |
in The journal of VLSI signal processing systems for signal, image, and video technology 20(1998) vom: Jan./Feb., Seite 151-161 volume:20 year:1998 month:01/02 pages:151-161 extent:11 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| isfreeaccess_bool |
false |
| container_title |
The journal of VLSI signal processing systems for signal, image, and video technology |
| authorswithroles_txt_mv |
Lei, Zhibin @@oth@@ Cooper, David B. @@oth@@ |
| publishDateDaySort_date |
1998-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ18898593X |
| id |
NLEJ196174503 |
| 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">NLEJ196174503</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210705183926.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070526s1998 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ196174503</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="245" ind1="1" ind2="0"><subfield code="a">On Interactive Object Shape Modeling Using Algebraic Curves</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</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">Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lei, Zhibin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cooper, David B.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">The journal of VLSI signal processing systems for signal, image, and video technology</subfield><subfield code="d">1989</subfield><subfield code="g">20(1998) vom: Jan./Feb., Seite 151-161</subfield><subfield code="w">(DE-627)NLEJ18898593X</subfield><subfield code="w">(DE-600)1479778-1</subfield><subfield code="x">1573-109X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:1998</subfield><subfield code="g">month:01/02</subfield><subfield code="g">pages:151-161</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1023/A:1008078625770</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">1998</subfield><subfield code="c">1/2</subfield><subfield code="h">151-161</subfield><subfield code="g">11</subfield></datafield></record></collection>
|
| series2 |
Springer Online Journal Archives 1860-2002 |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ18898593X |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1573-109X |
| topic_title |
On Interactive Object Shape Modeling Using Algebraic Curves |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
z l zl d b c db dbc |
| hierarchy_parent_title |
The journal of VLSI signal processing systems for signal, image, and video technology |
| hierarchy_parent_id |
NLEJ18898593X |
| hierarchy_top_title |
The journal of VLSI signal processing systems for signal, image, and video technology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ18898593X (DE-600)1479778-1 |
| title |
On Interactive Object Shape Modeling Using Algebraic Curves |
| spellingShingle |
On Interactive Object Shape Modeling Using Algebraic Curves |
| ctrlnum |
(DE-627)NLEJ196174503 |
| title_full |
On Interactive Object Shape Modeling Using Algebraic Curves |
| journal |
The journal of VLSI signal processing systems for signal, image, and video technology |
| journalStr |
The journal of VLSI signal processing systems for signal, image, and video technology |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
1998 |
| contenttype_str_mv |
zzz |
| container_start_page |
151 |
| container_volume |
20 |
| physical |
11 |
| format_se |
Elektronische Aufsätze |
| title_sort |
on interactive object shape modeling using algebraic curves |
| title_auth |
On Interactive Object Shape Modeling Using Algebraic Curves |
| abstract |
Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. |
| abstractGer |
Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. |
| abstract_unstemmed |
Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval. |
| collection_details |
GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE |
| title_short |
On Interactive Object Shape Modeling Using Algebraic Curves |
| url |
http://dx.doi.org/10.1023/A:1008078625770 |
| remote_bool |
true |
| author2 |
Lei, Zhibin Cooper, David B. |
| author2Str |
Lei, Zhibin Cooper, David B. |
| ppnlink |
NLEJ18898593X |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| up_date |
2024-07-06T05:48:13.178Z |
| _version_ |
1803807509109014528 |
| 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">NLEJ196174503</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210705183926.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070526s1998 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ196174503</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="245" ind1="1" ind2="0"><subfield code="a">On Interactive Object Shape Modeling Using Algebraic Curves</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</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">Abstract Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within ε of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lei, Zhibin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cooper, David B.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">The journal of VLSI signal processing systems for signal, image, and video technology</subfield><subfield code="d">1989</subfield><subfield code="g">20(1998) vom: Jan./Feb., Seite 151-161</subfield><subfield code="w">(DE-627)NLEJ18898593X</subfield><subfield code="w">(DE-600)1479778-1</subfield><subfield code="x">1573-109X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:1998</subfield><subfield code="g">month:01/02</subfield><subfield code="g">pages:151-161</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1023/A:1008078625770</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">1998</subfield><subfield code="c">1/2</subfield><subfield code="h">151-161</subfield><subfield code="g">11</subfield></datafield></record></collection>
|
| score |
7.401903 |