This paper presents a method to convert Thai decorative pattern (Lai-Thai) from a hand-drawn picture into a vector graphic image. The proposed method samples a series of points from a scanned image. Then a Progressive Iterative Approximation (PIA) algorithm is used to plot a corresponding Bézier curve that fits sampling points. Examples of curve fitting to Thai famous decorative patterns, Kra-Jung-Taa-Aoy and Pra-jam-yam patterns are demonstrated. The results show that more number of sampling points on the input path yields better quality in pattern recognition but the process may consume longer computational time. A challenge of this method is to choose an optimal number of sampling points to yield good quality of the approximation with minimal computational time. Quality of the output also depends on the methods of selecting sampling points.
{"title":"An Approach to Thai Decorative Pattern Recognition Using Bezier Curve Representation with Progressive Iterative Approximation","authors":"Suchada Senawongsa, N. Dejdumrong","doi":"10.1109/CGIV.2013.18","DOIUrl":"https://doi.org/10.1109/CGIV.2013.18","url":null,"abstract":"This paper presents a method to convert Thai decorative pattern (Lai-Thai) from a hand-drawn picture into a vector graphic image. The proposed method samples a series of points from a scanned image. Then a Progressive Iterative Approximation (PIA) algorithm is used to plot a corresponding Bézier curve that fits sampling points. Examples of curve fitting to Thai famous decorative patterns, Kra-Jung-Taa-Aoy and Pra-jam-yam patterns are demonstrated. The results show that more number of sampling points on the input path yields better quality in pattern recognition but the process may consume longer computational time. A challenge of this method is to choose an optimal number of sampling points to yield good quality of the approximation with minimal computational time. Quality of the output also depends on the methods of selecting sampling points.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123317498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There are several methods used to construct curves in CAGD, e.g., the de Casteljaus algorithm, DP algorithm, and NB1 algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating DP curve, NB1 Curve by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs for their propositions. Thus, this paper shows the proofs for the conversions from DP polynomial into its monomial form as well as NB1 polynomial.
{"title":"New Monomial Forms Approach for DP and NB1 Curves with Their Proofs","authors":"Dilokvith Savetseranee, N. Dejdumrong","doi":"10.1109/CGIV.2013.17","DOIUrl":"https://doi.org/10.1109/CGIV.2013.17","url":null,"abstract":"There are several methods used to construct curves in CAGD, e.g., the de Casteljaus algorithm, DP algorithm, and NB1 algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating DP curve, NB1 Curve by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs for their propositions. Thus, this paper shows the proofs for the conversions from DP polynomial into its monomial form as well as NB1 polynomial.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133032274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Khobkhun, A. Prayote, P. Rakwatin, N. Dejdumrong
This paper presents the method to determine rice cropping pattern in Thailand for future prediction of water supply demand, pricing, and other related issues including governmental policies. Datasets was obtained from an orbital instrument called a Moderate-Resolution Imaging Spectroradiometer (MODIS) operated by NASA. A Normalized Difference Vegetation Index (NDVI) was derived from MODIS datasets once every 16 days. This image data has been analyzed using image processing techniques in order to determine rice cropping area in Thailand. Rice cropping data is represented as a time series displaying type of rice crop in which peak data points indicate rice cropping cycle in each year. A Progressive Iterative Approximation (PIA) is used for signal smoothing and reducing noise by providing a Bezier curve representation of time-series data. The experimental results show that using PIA technique for noise reduction yields better results comparing with a common filtering method like Savitzky Golay filter.
{"title":"Rice Phenology Monitoring Using PIA Time Series MODIS Imagery","authors":"B. Khobkhun, A. Prayote, P. Rakwatin, N. Dejdumrong","doi":"10.1109/CGIV.2013.12","DOIUrl":"https://doi.org/10.1109/CGIV.2013.12","url":null,"abstract":"This paper presents the method to determine rice cropping pattern in Thailand for future prediction of water supply demand, pricing, and other related issues including governmental policies. Datasets was obtained from an orbital instrument called a Moderate-Resolution Imaging Spectroradiometer (MODIS) operated by NASA. A Normalized Difference Vegetation Index (NDVI) was derived from MODIS datasets once every 16 days. This image data has been analyzed using image processing techniques in order to determine rice cropping area in Thailand. Rice cropping data is represented as a time series displaying type of rice crop in which peak data points indicate rice cropping cycle in each year. A Progressive Iterative Approximation (PIA) is used for signal smoothing and reducing noise by providing a Bezier curve representation of time-series data. The experimental results show that using PIA technique for noise reduction yields better results comparing with a common filtering method like Savitzky Golay filter.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In real human crowds, diversification is caused by many factors such as gender, age, skin color, clothing, walking style, psychology etc., yet most crowd simulation systems rely only on appearance related variables for diversification. This research explores improving crowd diversity by simulating the biomechanical effects of aging in humans within crowd characters. Simulated characters were reprogrammed to be able to predict their behavior through an aging parameter predictor using support vector regression respective to their age. Data from gerontology studies recording spinal curvature and walking pattern deterioration with age were used for training. A spatial diversity algorithm was designed and implemented to distribute the resulting variants evenly among each other. Evaluations were conducted to gauge the impact on the diversification of the crowd simulation. The results prove that simulating posture and walking pattern deterioration in older characters does significantly improve biomechanical diversity within a virtual human crowd.
{"title":"Simulating Gait and Structural Effects of Aging for Improved Diversity in Virtual Crowds","authors":"Chathika Gunaratne, P. Wimalaratne","doi":"10.1109/CGIV.2013.13","DOIUrl":"https://doi.org/10.1109/CGIV.2013.13","url":null,"abstract":"In real human crowds, diversification is caused by many factors such as gender, age, skin color, clothing, walking style, psychology etc., yet most crowd simulation systems rely only on appearance related variables for diversification. This research explores improving crowd diversity by simulating the biomechanical effects of aging in humans within crowd characters. Simulated characters were reprogrammed to be able to predict their behavior through an aging parameter predictor using support vector regression respective to their age. Data from gerontology studies recording spinal curvature and walking pattern deterioration with age were used for training. A spatial diversity algorithm was designed and implemented to distribute the resulting variants evenly among each other. Evaluations were conducted to gauge the impact on the diversification of the crowd simulation. The results prove that simulating posture and walking pattern deterioration in older characters does significantly improve biomechanical diversity within a virtual human crowd.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121266615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sequence motif's characteristics are commonly visualized by using a sequence logo. This paper describes a user study aimed at evaluating the effectiveness of sequence logo as evaluation metric for motif prediction tools. We also investigate the nature of confirmation biases in using sequence logos in result reporting in publications. While sequence logos have been widely used for visualizing sequence motifs in the past 20 years, no study has reported its effectiveness and possible misuses in decision making. We conducted a paper-and-pencil test to determine the effectiveness of sequence logos in some of their common usages. A survey study was also performed to investigate sequence logos' learn ability. We found that there are great mismatches between users' perception and actual quality of motifs when sequence logos were used as an evaluation metric. Therefore, evaluation of motif prediction tools based on sequence logos has to be interpreted cautiously. Our result also suggests that there are still room for improvements in the current sequence logo's layout design.
{"title":"Potential Perils of Biological Sequence Visualization Using Sequence Logo","authors":"Nung Kion Lee, Oon Yin Bee","doi":"10.1109/CGIV.2013.26","DOIUrl":"https://doi.org/10.1109/CGIV.2013.26","url":null,"abstract":"Sequence motif's characteristics are commonly visualized by using a sequence logo. This paper describes a user study aimed at evaluating the effectiveness of sequence logo as evaluation metric for motif prediction tools. We also investigate the nature of confirmation biases in using sequence logos in result reporting in publications. While sequence logos have been widely used for visualizing sequence motifs in the past 20 years, no study has reported its effectiveness and possible misuses in decision making. We conducted a paper-and-pencil test to determine the effectiveness of sequence logos in some of their common usages. A survey study was also performed to investigate sequence logos' learn ability. We found that there are great mismatches between users' perception and actual quality of motifs when sequence logos were used as an evaluation metric. Therefore, evaluation of motif prediction tools based on sequence logos has to be interpreted cautiously. Our result also suggests that there are still room for improvements in the current sequence logo's layout design.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128057098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graph cuts based interactive segmentation has drawn a lot of attention in recent years. In original graph cuts, the extraction of foreground object from its background often leads to many mistakes and the histogram distribution for energy function is not enough. In this paper, an iterated graph cut algorithm integrating texture characterization is proposed. We utilize user intervention to cycle the object approximately in the beginning, and the image is divided into superpixels by "SLIC" method. After initialization Gaussian mixture model (GMM) by RGB colors, we use a vector which combines color model and texture description for the estimation of GMM parameters. Then min-cut algorithm is applied in the graph for energy minimization, so GMM adjust their clusters and recompute the parameters. The process iterates until min-cut algorithm converges. Finally, we give a comparison between our method and "GrabCut". The experiments show that our have good results.
{"title":"Iterated Graph Cut Integrating Texture Characterization for Interactive Image Segmentation","authors":"Ning An, Chi-Man Pun","doi":"10.1109/CGIV.2013.34","DOIUrl":"https://doi.org/10.1109/CGIV.2013.34","url":null,"abstract":"Graph cuts based interactive segmentation has drawn a lot of attention in recent years. In original graph cuts, the extraction of foreground object from its background often leads to many mistakes and the histogram distribution for energy function is not enough. In this paper, an iterated graph cut algorithm integrating texture characterization is proposed. We utilize user intervention to cycle the object approximately in the beginning, and the image is divided into superpixels by \"SLIC\" method. After initialization Gaussian mixture model (GMM) by RGB colors, we use a vector which combines color model and texture description for the estimation of GMM parameters. Then min-cut algorithm is applied in the graph for energy minimization, so GMM adjust their clusters and recompute the parameters. The process iterates until min-cut algorithm converges. Finally, we give a comparison between our method and \"GrabCut\". The experiments show that our have good results.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125614413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Document skew correction is one of the core preprocessing steps in document analysis systems. In this paper, the author proposes a new multi-step skew detection technique for printed Arabic documents. The technique exploits the unique property of the writing line of Arabic script and is based on connected component analysis and projection profiles. The proposed technique works for different types of Arabic documents having text and non-text zones with unrestricted layout. Moreover due to the multi-step approach, it can detect skews with the resolution of ± 0.05 degrees. Experiments conducted on different Arabic documents shows the effectiveness of the technique.
{"title":"A Technique for Skew Detection of Printed Arabic Documents","authors":"Irfan Ahmad","doi":"10.1109/CGIV.2013.21","DOIUrl":"https://doi.org/10.1109/CGIV.2013.21","url":null,"abstract":"Document skew correction is one of the core preprocessing steps in document analysis systems. In this paper, the author proposes a new multi-step skew detection technique for printed Arabic documents. The technique exploits the unique property of the writing line of Arabic script and is based on connected component analysis and projection profiles. The proposed technique works for different types of Arabic documents having text and non-text zones with unrestricted layout. Moreover due to the multi-step approach, it can detect skews with the resolution of ± 0.05 degrees. Experiments conducted on different Arabic documents shows the effectiveness of the technique.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131691759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The illumination of rough refraction is challenging due to the complex integrations of scattered lights from multiple directions. Prefiltered environment map is able to eliminate the comprehensive integrations, but the precomputation stage protects it from being adapted into dynamically varying environmental lighting. We propose a real-time method for rendering rough refraction, supporting dynamically changing lighting, geometries and materials. Environment maps are efficiently compressed by summed area table (SAT), whose construction only costs several milliseconds. Meanwhile, rough refraction effects are approximated by our lobe merging method. Solid results of our approach are demonstrated by comparing with ground truth results generated with a path tracing engine.
{"title":"Real-Time Rendering of Rough Refraction under Dynamically Varying Environmental Lighting","authors":"Tianchao Lu, Jie Guo, Jingui Pan","doi":"10.1109/CGIV.2013.14","DOIUrl":"https://doi.org/10.1109/CGIV.2013.14","url":null,"abstract":"The illumination of rough refraction is challenging due to the complex integrations of scattered lights from multiple directions. Prefiltered environment map is able to eliminate the comprehensive integrations, but the precomputation stage protects it from being adapted into dynamically varying environmental lighting. We propose a real-time method for rendering rough refraction, supporting dynamically changing lighting, geometries and materials. Environment maps are efficiently compressed by summed area table (SAT), whose construction only costs several milliseconds. Meanwhile, rough refraction effects are approximated by our lobe merging method. Solid results of our approach are demonstrated by comparing with ground truth results generated with a path tracing engine.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114661364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The penetration of multi-touch devices have created a new generation of users comfortable with the gestures associated with such devices. Developers have already embraced such trends by capturing and handling them in their applications. We propose a novel approach to use mobile devices as system controls for applications. Unlike existing approaches, our solution has three key features. First, it is flexible to customize for different applications. Second, it allows multiple users to interact with the application as well as to interact with each other. Third, it fully supports multi-touch and user-defined gestures. The feasibility of our solution is demonstrated through the implementation test we have made for web applications.
{"title":"Multi-touch Multi-user Interactive Control System Using Mobile Devices","authors":"Kar Leong Tew, Haifeng Lu","doi":"10.1109/CGIV.2013.27","DOIUrl":"https://doi.org/10.1109/CGIV.2013.27","url":null,"abstract":"The penetration of multi-touch devices have created a new generation of users comfortable with the gestures associated with such devices. Developers have already embraced such trends by capturing and handling them in their applications. We propose a novel approach to use mobile devices as system controls for applications. Unlike existing approaches, our solution has three key features. First, it is flexible to customize for different applications. Second, it allows multiple users to interact with the application as well as to interact with each other. Third, it fully supports multi-touch and user-defined gestures. The feasibility of our solution is demonstrated through the implementation test we have made for web applications.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"22 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114117174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chinchen Chang, B. Wu, Hao-Jen Hsu, Je-Wei Liang, Yuan-Ching Peng, Wen-Kai Tai
In recent years, a lot of 2D textures have been synthesized from input 2D textures. However, the quality problems still exist for many textures. Further improvements are required to extract more reliable texture features. In this paper, we present a texture synthesis approach using cooperative color and grey-level features. For color feature extraction, we extract appearance vectors to replace RGB color values. For grey-level feature extraction, we extract the statistical features including entropy, contrast, and correlation based on the grey level co-occurrence probabilities (GLCPs). Moreover, we introduce cooperative color and GLCP features for neighborhood matching in the synthesis process. We assign different weights for color and grey-level features according to the characteristics of the input texture. The results show that the proposed approach performs well in terms of the synthesis quality.
{"title":"Texture Synthesis Approach Using Cooperative Features","authors":"Chinchen Chang, B. Wu, Hao-Jen Hsu, Je-Wei Liang, Yuan-Ching Peng, Wen-Kai Tai","doi":"10.1109/CGIV.2013.19","DOIUrl":"https://doi.org/10.1109/CGIV.2013.19","url":null,"abstract":"In recent years, a lot of 2D textures have been synthesized from input 2D textures. However, the quality problems still exist for many textures. Further improvements are required to extract more reliable texture features. In this paper, we present a texture synthesis approach using cooperative color and grey-level features. For color feature extraction, we extract appearance vectors to replace RGB color values. For grey-level feature extraction, we extract the statistical features including entropy, contrast, and correlation based on the grey level co-occurrence probabilities (GLCPs). Moreover, we introduce cooperative color and GLCP features for neighborhood matching in the synthesis process. We assign different weights for color and grey-level features according to the characteristics of the input texture. The results show that the proposed approach performs well in terms of the synthesis quality.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114972830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：