{"title":"最优分形图像编码","authors":"Deng Cai, M. Hirobe","doi":"10.1109/TENCON.1999.818498","DOIUrl":null,"url":null,"abstract":"Image compression techniques based on fractals or the iterated function systems (IFS) theory have been developed in the last few years, and may promise better compression performance. Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. These facts are reasoned that because images of the real world tend to consist of many complex patterns that recur at various sizes, i.e. fractals. There should be a way to translate pictures into fractal equations. Images so coded would require less data and thus less disk space to store and less time to transmit. In addition, the images are resolution-independent. In the present report, we discuss an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion(partition)+/spl lambda/Rate(partition).","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal fractal image coding\",\"authors\":\"Deng Cai, M. Hirobe\",\"doi\":\"10.1109/TENCON.1999.818498\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image compression techniques based on fractals or the iterated function systems (IFS) theory have been developed in the last few years, and may promise better compression performance. Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. These facts are reasoned that because images of the real world tend to consist of many complex patterns that recur at various sizes, i.e. fractals. There should be a way to translate pictures into fractal equations. Images so coded would require less data and thus less disk space to store and less time to transmit. In addition, the images are resolution-independent. In the present report, we discuss an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion(partition)+/spl lambda/Rate(partition).\",\"PeriodicalId\":121142,\"journal\":{\"name\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1999.818498\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image compression techniques based on fractals or the iterated function systems (IFS) theory have been developed in the last few years, and may promise better compression performance. Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. These facts are reasoned that because images of the real world tend to consist of many complex patterns that recur at various sizes, i.e. fractals. There should be a way to translate pictures into fractal equations. Images so coded would require less data and thus less disk space to store and less time to transmit. In addition, the images are resolution-independent. In the present report, we discuss an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion(partition)+/spl lambda/Rate(partition).