{"title":"Semi-automatic Extraction of Parametric Characteristic Features from Images","authors":"Baojun Li, Xiuping Liu, Qingbao Li, Chong Liu, Mingzeng Liu, Ping Hu","doi":"10.1109/ICDH.2012.45","DOIUrl":"https://doi.org/10.1109/ICDH.2012.45","url":null,"abstract":"In order to extract exact characteristic features for industrial design, this paper proposed a novel semi-automatic approach for abstracting high quality parametric contours from images. Using prior knowledge and parameterized feature template for given objects, our method combines global matching/ morphing with hierarchical part-based approximation. The method starts from construction of parametric templates associated target object. Through contour detection preprocessing and template retrieval, we obtain the exact morphable feature template. Combining edge-oriented contour detection, corner detection and local prior template, the exact endpoints and curve segments are obtained. Finally, the segmented parametric feature lines are automatically fitted using cubic B¡äezier curves. Taking car body design as numerical examples, we establish the corresponding database. Numerical results show that our method is effective to abstract the design features with high precision for car styling.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126785378","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}
{"title":"Creases-persevering Mesh Smoothing Based on the Discrete Differential Operators","authors":"Yihui Guo","doi":"10.1109/ICDH.2012.62","DOIUrl":"https://doi.org/10.1109/ICDH.2012.62","url":null,"abstract":"This paper introduces a new method to mesh smoothing with crease-preserving by using discrete differential Laplacian operators. The eigenfunctions of the Laplace-Beltrami operator are used to define Fourier-like function basis and transform because it is both geometry aware and orthogonal. But the low-pass filters based on Fourier-like methods cannot preserve the creases. This paper proposes a novel approach which can preserve the creases better when filtering, and it can effectively get rid of various of noise in arbitrary 3D meshed surfaces, more over completely prevent the model from shrinking and deforming.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073683","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}
{"title":"Mesh Merging with Mean Value Coordinates","authors":"Zhengjie Deng, G. Chen, Fengwei Wang, Fan Zhou","doi":"10.1109/ICDH.2012.31","DOIUrl":"https://doi.org/10.1109/ICDH.2012.31","url":null,"abstract":"Merging a source mesh to a target mesh is one useful and important mesh operating technology. This paper introduces a method merging with mean value coordinates. The method firstly computes the mean value coordinates of the vertices in the source mesh with respect to its boundary. After specifying the difference between the two mesh's boundaries, it interpolates the difference of the source's inside vertices through the coordinates, and then constructs a new mesh to merge. With the same framework, smoothing the seaming line can be achieved by interpolating tangent vector variations. This method avoids the mesh parameterizations or the solving a large linear system, but does merge through computing close form expressions. Experiments show that mesh merging with this method is less artifacts and faster, comparing to the method through solving Poisson equation.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588069","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}
{"title":"Particle Swarm Optimization Feature Selection for Image Steganalysis","authors":"Guoming Chen, Qiang Chen, Dong Zhang, Weiheng Zhu","doi":"10.1109/ICDH.2012.28","DOIUrl":"https://doi.org/10.1109/ICDH.2012.28","url":null,"abstract":"The purpose of image steganalysis is to detect the presence of hidden messages in cover images. Steganalysis can be considered as a pattern recognition process to decide which class a test image belongs to: the cover images or the stego-images. We present a particle swarm optimization algorithm for feature selection for image steganalysis. Experiment results show that the proposed hybrid algorithm for feature selection increases the testing accuracy of classification. The combination of the feature sets extracted is likely to improve the performance of general steganalysis methods which have more practical value for deterring covert communications and the uncorrelated features extracted contain more discriminatory information when distinguish different kinds of steganography.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704054","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}
{"title":"Data-Driven Visualization of the Body Thermal Distributions","authors":"Chen Jun, Mao Aihua, Luo Jie","doi":"10.1109/ICDH.2012.85","DOIUrl":"https://doi.org/10.1109/ICDH.2012.85","url":null,"abstract":"This paper presents an alternative method, which is economical and easy-to-operate, to visualize the 3D skin temperature distribution of the body based on the data of skin temperature of available body points. The interpolation and mapping functions is presented in detail, and the visualization cases based on the data of skin temperature measured in previous researches are demonstrated. It enables the user to have more direct and effective observation of the skin temperature of the body without infrared photography.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233608","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}
{"title":"Line Matching Based on Characteristic Ratio Invariants of Collinear Points","authors":"Jielin Zhang, Q. Zhao, Xin Fan, Zhongxuan Luo","doi":"10.1109/ICDH.2012.47","DOIUrl":"https://doi.org/10.1109/ICDH.2012.47","url":null,"abstract":"This paper comes up with a method about line matching based on characteristic ratio invariants of collinear points, without resorting to any other constraints or priori knowledge. A novel concept called important point (IMP) is proposed for line matching: First, extracting lines using Hough transformation and obtaining the intersection points between the lines, Next, classifying the intersection points into IMPs and generating a two-dimensional characteristic ratio sequence of each IMP, Then, matching the IMPs using the two dimensional characteristic ratio sequence with NNDR, Finally, matching lines combining those correct matched IMPs with cross product symbol. Extensive experiments are conducted with this method. The results show that our proposed method is highly distinctive and effective for line matching under various kinds of transformations and outperform MSLD and B.Fan's method.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126285891","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}
{"title":"Calligraphy Beautification Method for Chinese Handwritings","authors":"Hailong Li, Peng Liu, Songhua Xu, Shujin Lin","doi":"10.1109/ICDH.2012.64","DOIUrl":"https://doi.org/10.1109/ICDH.2012.64","url":null,"abstract":"This paper propose a new calligraphy beautification method for online handwritten Chinese character. Handwriting stroke trajectories are input from a mouse or a touch pad. After the computer recognizes this stroke, we retrieve the most similarity standard stroke from a parametric standard stroke library, and then we render the user stroke by the method of learning the parametric information of the standard stroke. Finally, a corresponding Kai style character template is used for adjusting the overall architecture of the user-input character. The result proves that our beautification method can preserve user's personality as well as render the user's handwritings with the Kai style calligraphic effect well.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126293626","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}
{"title":"A New Algorithm of Geometric Fractal in Dynamic Geometry","authors":"Yongsheng Rao, Ying Wang, You Zou, C. Li","doi":"10.1109/ICDH.2012.67","DOIUrl":"https://doi.org/10.1109/ICDH.2012.67","url":null,"abstract":"Geometric Fractal is an important and interesting function of dynamic geometry, but it is a big system burden because geometric fractal has a significant negative impact on system performance. In this paper, we propose a new algorithm to improve the efficiency of geometric fractal in dynamic geometry system. The new algorithm treats lots of fractal graphics as a whole geometric object. This method can greatly reduce the computational load and complexity of generating and updating these fractal graphics runtime. It makes real-time calculation of geometric update possible and very rapid. The new algorithm was compared with Super Sketch Platform and The Geometer's Sketchpad, the most popular two dynamic geometry systems. The experimental results demonstrate the effectiveness of the proposed approach.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132039616","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}
Shengfa Wang, Yu Cai, Zhiling Yu, Junjie Cao, Zhixun Su
{"title":"Feature-Preserving Mesh Deformation Using Normal-Controlled Coordinates","authors":"Shengfa Wang, Yu Cai, Zhiling Yu, Junjie Cao, Zhixun Su","doi":"10.1109/ICDH.2012.37","DOIUrl":"https://doi.org/10.1109/ICDH.2012.37","url":null,"abstract":"As a local shape descriptor, normal-controlled coordinates (NCC) are well defined on the boundary vertices of open meshes, and proven being always parallel with the corresponding vertex normals, which means no tangential drift appears in various editing operations. These two properties make NCC outperform the previous differential coordinates in many mesh processing jobs. We develop a novel deformation algorithm based on NCC, which is efficient by subtly using vertex normals. In addition, since NCC have no tangential drift and are well defined on boundary, they can be easily extended to industry applications, such as automobile modeling. Experiments show that NCC perform better than the previous differential coordinates in both effectiveness and efficiency.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133585369","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}
{"title":"The Recognition and Enhancement of Traffic Sign for the Computer-Generated Image","authors":"Lin Yaping, Zhang Jinfang, Xu Fan-jiang, Sun Xv","doi":"10.1109/ICDH.2012.8","DOIUrl":"https://doi.org/10.1109/ICDH.2012.8","url":null,"abstract":"Image recognition in image understanding is very challenge research topic. However, the study of recognition and enhancement of the specific target for the computer generated image is very less. Compared with the natural image, this cause may be the characteristics (simple in overall) and the scene of applications (the 3D roaming, the game and so on) for the computer-generated image. For recognition and enhancement of the specific target (such as traffic sign) in the computer-generated image, the difficulty is how to accurately recognize and enhance the specific target, and maintaining other information of object do not been changed. In this paper, adopting stepwise refinement method attempts to solve the problem. The proposed method is based on three steps including image preprocessing, image recognition and enhancement. The experimental results show the method can be very good to deal with such issues. The research result shows that the image recognition and image enhancement is still not simple process. Therefore, we imagine that image recognition for complex real scene image also isn't simple issues. But the research idea of stepwise refinement which is proposed in the paper provides a methodological reference for complex image recognition.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115773145","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}