{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-1297"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-1297","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"Practical algorithms for image compression and surface estimation","abstract":"Practical Algorithms for Image Compression and Surface Estimation describes three algorithms for image compression and one algorithm for surface estimation that incorporates kriging and parametric cubic splines. Two of the image compression algorithms are innovative extensions of the Run Length Encoding image compression algorithm and the third is an image compression technique based on kriging. In general the modified Run Length Encoding algorithms yield a better compression ratio by a factor of two while retaining fast decompression of the image. The algorithm based on kriging achieves a compression ratio up to 250:1 and is unique in that the compressed image can be viewed directly and resembles a scaled version of the original image; Neither kriging nor parametric cubic splines are the theory has existed for many years. The union of the two techniques, however, is unique. The fundamentals of kriging are outlined, three dimensional parametric cubic splines are derived, and finally the union of the two ideas is discussed.","abstract_html":"Practical Algorithms for Image Compression and Surface Estimation describes three algorithms for image compression and one algorithm for surface estimation that incorporates kriging and parametric cubic splines. Two of the image compression algorithms are innovative extensions of the Run Length Encoding image compression algorithm and the third is an image compression technique based on kriging. In general the modified Run Length Encoding algorithms yield a better compression ratio by a factor of two while retaining fast decompression of the image. The algorithm based on kriging achieves a compression ratio up to 250:1 and is unique in that the compressed image can be viewed directly and resembles a scaled version of the original image; Neither kriging nor parametric cubic splines are the theory has existed for many years. The union of the two techniques, however, is unique. The fundamentals of kriging are outlined, three dimensional parametric cubic splines are derived, and finally the union of the two ideas is discussed.","abstract_has_math":false,"creators":["Au, Matthew Y"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1993,"date_issued":"1993-01-01T08:00:00Z","date_published":"1993-01-01T08:00:00Z","updated_at":"2026-07-24T05:24:22Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/298"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/298","href":"https://oasis.library.unlv.edu/rtds/298","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/e4vb-vw6n","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Au, Matthew Y"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/e4vb-vw6n","https://oasis.library.unlv.edu/rtds/298","https://oasis.library.unlv.edu/context/rtds/article/1297/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Practical Algorithms for Image Compression and Surface Estimation describes three algorithms for image compression and one algorithm for surface estimation that incorporates kriging and parametric cubic splines. Two of the image compression algorithms are innovative extensions of the Run Length Encoding image compression algorithm and the third is an image compression technique based on kriging. In general the modified Run Length Encoding algorithms yield a better compression ratio by a factor of two while retaining fast decompression of the image. The algorithm based on kriging achieves a compression ratio up to 250:1 and is unique in that the compressed image can be viewed directly and resembles a scaled version of the original image; Neither kriging nor parametric cubic splines are the theory has existed for many years. The union of the two techniques, however, is unique. The fundamentals of kriging are outlined, three dimensional parametric cubic splines are derived, and finally the union of the two ideas is discussed."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["Practical algorithms for image compression and surface estimation"]}]}],"canonical_facts":{"dc:creator":["Au, Matthew Y"],"dc:description.abstract":["Practical Algorithms for Image Compression and Surface Estimation describes three algorithms for image compression and one algorithm for surface estimation that incorporates kriging and parametric cubic splines. Two of the image compression algorithms are innovative extensions of the Run Length Encoding image compression algorithm and the third is an image compression technique based on kriging. In general the modified Run Length Encoding algorithms yield a better compression ratio by a factor of two while retaining fast decompression of the image. The algorithm based on kriging achieves a compression ratio up to 250:1 and is unique in that the compressed image can be viewed directly and resembles a scaled version of the original image; Neither kriging nor parametric cubic splines are the theory has existed for many years. The union of the two techniques, however, is unique. The fundamentals of kriging are outlined, three dimensional parametric cubic splines are derived, and finally the union of the two ideas is discussed."],"dc:format":["pdf"],"dc:identifier":["10.25669/e4vb-vw6n","https://oasis.library.unlv.edu/rtds/298","https://oasis.library.unlv.edu/context/rtds/article/1297/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Practical algorithms for image compression and surface estimation"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:24:22Z"}