File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: PAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs

TitlePAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs
Authors
KeywordsGraphics rendering
Mesh simplification
Pattern classification reference models
Software testing
Test oracles
Issue Date2009
PublisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/jss
Citation
Journal Of Systems And Software, 2009, v. 82 n. 3, p. 422-434 How to Cite?
AbstractGraphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result. Testing mesh simplification implementations is essential to assure the quality of the graphics applications. However, it is very difficult to determine the oracles (or expected outcomes) of mesh simplification for the verification of test results. A reference model is an implementation closely related to the program under test. Is it possible to use such reference models as pseudo-oracles for testing mesh simplification programs? If so, how effective are they? This paper presents a fault-based pattern classification methodology called PAT, to address the questions. In PAT, we train the C4.5 classifier using black-box features of samples from a reference model and its fault-based versions, in order to test samples from the subject program. We evaluate PAT using four implementations of mesh simplification algorithms as reference models applied to 44 open-source three-dimensional polygonal models. Empirical results reveal that the use of a reference model as a pseudo-oracle is effective for testing the implementations of resembling mesh simplification algorithms. However, the results also show a tradeoff: When compared with a simple reference model, the use of a resembling but sophisticated reference model is more effective and accurate but less robust. © 2008 Elsevier Inc. All rights reserved.
DescriptionA preliminary version of this paper was presented at the 30th Annual International Computer Software and Applications Conference (COMPSAC 2006) (Chan et al., 2006b).
Persistent Identifierhttp://hdl.handle.net/10722/55462
ISSN
2015 Impact Factor: 1.424
2015 SCImago Journal Rankings: 0.897
Other Identifiers
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, WKen_HK
dc.contributor.authorCheung, SCen_HK
dc.contributor.authorHo, JCFen_HK
dc.contributor.authorTse, THen_HK
dc.date.accessioned2009-08-10T07:57:16Z-
dc.date.available2009-08-10T07:57:16Z-
dc.date.issued2009en_HK
dc.identifierhttp://www.elsevier.com/wps/find/journaldescription.authors/505732/description#description-
dc.identifier.citationJournal Of Systems And Software, 2009, v. 82 n. 3, p. 422-434en_HK
dc.identifier.issn0164-1212en_HK
dc.identifier.urihttp://hdl.handle.net/10722/55462-
dc.descriptionA preliminary version of this paper was presented at the 30th Annual International Computer Software and Applications Conference (COMPSAC 2006) (Chan et al., 2006b).en
dc.description.abstractGraphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result. Testing mesh simplification implementations is essential to assure the quality of the graphics applications. However, it is very difficult to determine the oracles (or expected outcomes) of mesh simplification for the verification of test results. A reference model is an implementation closely related to the program under test. Is it possible to use such reference models as pseudo-oracles for testing mesh simplification programs? If so, how effective are they? This paper presents a fault-based pattern classification methodology called PAT, to address the questions. In PAT, we train the C4.5 classifier using black-box features of samples from a reference model and its fault-based versions, in order to test samples from the subject program. We evaluate PAT using four implementations of mesh simplification algorithms as reference models applied to 44 open-source three-dimensional polygonal models. Empirical results reveal that the use of a reference model as a pseudo-oracle is effective for testing the implementations of resembling mesh simplification algorithms. However, the results also show a tradeoff: When compared with a simple reference model, the use of a resembling but sophisticated reference model is more effective and accurate but less robust. © 2008 Elsevier Inc. All rights reserved.en_HK
dc.description.sponsorshipThis research is supported in part by a grant of City University of Hong Kong (project no. CityU 7002324) and grants of the Research Grants Council of Hong Kong (project nos. 111107, RPC07/08.EG24, and 714504).en
dc.languageeng-
dc.publisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/jssen_HK
dc.relation.ispartofJournal of Systems and Softwareen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Journal of Systems and Software. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Systems and Software, 2009, v. 82 n. 3, p. 422−434. DOI: 10.1016/j.jss.2008.07.019-
dc.subjectGraphics renderingen_HK
dc.subjectMesh simplificationen_HK
dc.subjectPattern classification reference modelsen_HK
dc.subjectSoftware testingen_HK
dc.subjectTest oraclesen_HK
dc.titlePAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0164-1212&volume=82&issue=3&spage=422−434&epage=&date=2009&atitle=PAT:+a+pattern+classification+approach+to+automatic+reference+oracles+for+the+testing+of+mesh+simplification+programs-
dc.identifier.emailTse, TH: thtse@cs.hku.hken_HK
dc.identifier.authorityTse, TH=rp00546en_HK
dc.description.naturepostprinten_HK
dc.identifier.doi10.1016/j.jss.2008.07.019en_HK
dc.identifier.scopuseid_2-s2.0-61349178878en_HK
dc.identifier.hkuros154679-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-61349178878&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume82en_HK
dc.identifier.issue3en_HK
dc.identifier.spage422en_HK
dc.identifier.epage434en_HK
dc.identifier.isiWOS:000264648700006-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChan, WK=23967779900en_HK
dc.identifier.scopusauthoridCheung, SC=7202472792en_HK
dc.identifier.scopusauthoridHo, JCF=16241374000en_HK
dc.identifier.scopusauthoridTse, TH=7005496974en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats