File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: B-spline snakes in two stages

TitleB-spline snakes in two stages
Authors
KeywordsComputers
Artificial intelligence
Issue Date2004
PublisherIEEE, Computer Society.
Citation
Proceedings - International Conference On Pattern Recognition, 2004, v. 1, p. 568-571 How to Cite?
AbstractIn using Snake algorithms, the slow convergence speed is due to the large number of control points to be selected, as well as difficulties in setting the weighting factors that comprise the internal energies of the curve. Even in using the B-Spline snakes, splines cannot be fitted into the corner of the object completely. In this paper, a novel two-stage method based on B-Spline Snakes is proposed. It is superior both in accuracy and fast convergence speed over previous B-Spline Snakes. The first stage reduces the number of control points using potential function V(x,y) minimization. Hence, it allows the spline to quickly approach the minimum energy state. The second stage is designed to refine the B-Spline snakes based on the node points of the polynomials without knots. In other words, an elasticity spline is controlled by node points where knots are fixed. Simulation and validation of results are presented. Compared to the traditional B-Spline snakes, better performance was achieved using the method proposed in this paper.
Persistent Identifierhttp://hdl.handle.net/10722/45799
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, CCen_HK
dc.contributor.authorChan, CHen_HK
dc.contributor.authorChan, FHYen_HK
dc.contributor.authorTsui, WKen_HK
dc.date.accessioned2007-10-30T06:35:43Z-
dc.date.available2007-10-30T06:35:43Z-
dc.date.issued2004en_HK
dc.identifier.citationProceedings - International Conference On Pattern Recognition, 2004, v. 1, p. 568-571en_HK
dc.identifier.issn1051-4651en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45799-
dc.description.abstractIn using Snake algorithms, the slow convergence speed is due to the large number of control points to be selected, as well as difficulties in setting the weighting factors that comprise the internal energies of the curve. Even in using the B-Spline snakes, splines cannot be fitted into the corner of the object completely. In this paper, a novel two-stage method based on B-Spline Snakes is proposed. It is superior both in accuracy and fast convergence speed over previous B-Spline Snakes. The first stage reduces the number of control points using potential function V(x,y) minimization. Hence, it allows the spline to quickly approach the minimum energy state. The second stage is designed to refine the B-Spline snakes based on the node points of the polynomials without knots. In other words, an elasticity spline is controlled by node points where knots are fixed. Simulation and validation of results are presented. Compared to the traditional B-Spline snakes, better performance was achieved using the method proposed in this paper.en_HK
dc.format.extent393021 bytes-
dc.format.extent2599 bytes-
dc.format.extent13817 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.relation.ispartofProceedings - International Conference on Pattern Recognitionen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectComputersen_HK
dc.subjectArtificial intelligenceen_HK
dc.titleB-spline snakes in two stagesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1051-4651&volume=1&spage=568&epage=571&date=2004&atitle=B-spline+snakes+in+two+stagesen_HK
dc.identifier.emailTsui, WK:wktsui@eee.hku.hken_HK
dc.identifier.authorityTsui, WK=rp00182en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICPR.2004.1334204en_HK
dc.identifier.scopuseid_2-s2.0-10044291041en_HK
dc.identifier.hkuros104942-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-10044291041&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume1en_HK
dc.identifier.spage568en_HK
dc.identifier.epage571en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLeung, CC=36725507200en_HK
dc.identifier.scopusauthoridChan, CH=7404813577en_HK
dc.identifier.scopusauthoridChan, FHY=7202586429en_HK
dc.identifier.scopusauthoridTsui, WK=7005623168en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats