{"title":"Lung Cancer Detection from X-ray CT Scans Using Discriminant Filters and View-based Support Vector Machine","authors":"H. Takizawa, H. Nishizako","doi":"10.11371/IIEEJ.40.59","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.59","url":null,"abstract":"","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115549757","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}
Shohei Wada, H. Johan, Pablo Garcia Trigo, T. Nishita
{"title":"Real-Time Line Drawing of 3D Models Taking into Account Curvature-Based Importance","authors":"Shohei Wada, H. Johan, Pablo Garcia Trigo, T. Nishita","doi":"10.11371/IIEEJ.40.105","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.105","url":null,"abstract":"〈Summary〉 In recent years, many line drawing algorithms have been proposed for 3D shape depiction. One common drawback is that these algorithms draw only part of the necessary lines for fully depicting the shape. Cole et al. have shown that these algorithms can be complementary to each other. Based on that, in this paper, we combine the previous algorithms to produce better line drawings of 3D objects. By directly superposing multiple line drawing algorithms, however, there is a risk of generating too many unnecessary lines, especially in regions where many lines are located near to each other, making them to appear over-sketched. To solve this problem, we define an attribute called ”importance” for all points on each line. The importance describes which lines should be drawn in preference. In addition, we determine the width of the lines based on the number of lines in their neighborhood. Our algorithm runs on GPU, achieving real-time speed. From experimental results, our method avoids drawing excessive lines while conveying the shapes effectively.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122329859","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}
Naoki Kobayashi, Masami Hamada, S. Ochiai, Daisuke Nagamine
{"title":"Evaluation Method of Visual Induced Motion Sickness by Interactive Video Using Time-Variant Biosignals","authors":"Naoki Kobayashi, Masami Hamada, S. Ochiai, Daisuke Nagamine","doi":"10.11371/IIEEJ.40.159","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.159","url":null,"abstract":"","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124413360","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":"Restoration for JPEG and Blurred Images Based on Ensemble Learning Algorithm","authors":"E. Watanabe, T. Ozeki, T. Kohama","doi":"10.11371/IIEEJ.40.42","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.42","url":null,"abstract":"","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372857","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}
Kouhei Saito, Katsuya Sakaguchi, Nami Inadomi, Minoru Ito
{"title":"New Approaches for Highly Accurate Detection of Scaling-Change Center Positions and for Precise Scaling Correction of Scaling-Changed Images","authors":"Kouhei Saito, Katsuya Sakaguchi, Nami Inadomi, Minoru Ito","doi":"10.11371/IIEEJ.40.24","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.24","url":null,"abstract":"〈Summary〉 This paper describes a new approach for accurately detecting scaling-change center positions of slightly scaling-changed images and also proposes a new technique for correcting the scaling changes. These approaches utilize the phase difference spectrum analysis approach for detecting image shifts and the technique for detecting scaling factors, without iterative approximation calculation. In experiments, three types of image patterns were used. When the position is within a few ten pixels from the image center, the detection accuracy of the scaling-change center position is 2.2 pixels on average and as high as 1.1 pixels, excluding errors for scaling-factor changes below ±0.6%. The correction accuracy for scaling factors is almost completely independent of the scaling-center position and is about 0.0004 on average. The pixel displacement of the corrected image from the reference image is about 0.012 pixels on average when the scaling-change center position is within a few ten pixels from the image center. From these results, it is clear that the proposed approaches, despite their simplicity, make it possible to detect scaling-change center positions for scaling-changed images and to correct the images with high accuracy and reliability.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132303123","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":"CFA Interpolation with Flexible Filtering Masks using Unified High-Frequency Map","authors":"Yuji Itoh","doi":"10.11371/IIEEJ.40.182","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.182","url":null,"abstract":"","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131440608","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":"Deterministic Blue Noise Sampling by Solving Largest Empty Circle Problems","authors":"Yoshihiro Kanamori, Zoltan Szego, T. Nishita","doi":"10.11371/IIEEJ.40.6","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.6","url":null,"abstract":"〈Summary〉 Sampling patterns with a blue noise distribution are widely used in many areas of computer graphics, yet their efficient generation remains a difficult problem. We propose a method to generate point sets with a blue noise distribution using a deterministic algorithm with no preprocessing. We insert each new sample at the center of the largest empty circle in the point set, which is obtained by calculating the Delaunay-triangulation of the set and finding the triangle with the largest circumcircle. Our method supports adaptive sampling according to a user-specified density function, as well as specifying the exact number of required samples. It can also be extended to perform sampling on a three-dimensional curved surface.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128547972","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":"Proposal and Implementation of Virtual Chinkin","authors":"S. Mizuno","doi":"10.11371/IIEEJ.40.132","DOIUrl":"https://doi.org/10.11371/IIEEJ.40.132","url":null,"abstract":"〈Summary〉 In this paper, a method to enable people to experience “Chinkin” in the virtual space is proposed. Chinkin is a traditional artistic technique in Japan and some Asian countries to draw designs on lacquer ware with fine lines and dots, and it was widely used to produce Daimyo’s utensils in the Edo period during the 17th and the 19th century. The author develops a virtual Chinkin system based on the virtual sculpting method which is an interactive CG creating method developed by the author. The real Chinkin consists of some processes and each process is realized by virtual carving: an interactive deformation of solids, and virtual painting: an interactive generation of a 3D texture map in the virtual space. Improvement in a rendering method is also given for more useful operation. In this system, the user can experience each process of the Chinkin technique in the virtual space and can create virtual sculptures ornamented with Chinkin designs as CG. Both the operation and the result are similar to the real ones and it would be useful for introduction, education and preservation of the traditional Chinkin technique.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121468590","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}
Chen Liu, T. Zhang, Xin Jin, Minghui Wang, S. Goto
{"title":"Fast Inter Mode Decision Algorithm Based on Residual Feature","authors":"Chen Liu, T. Zhang, Xin Jin, Minghui Wang, S. Goto","doi":"10.11371/IIEEJ.39.663","DOIUrl":"https://doi.org/10.11371/IIEEJ.39.663","url":null,"abstract":"〈Summary〉 H.264/AVC introduces the variable block size motion estimation (VBSME), which brings huge computational cost of the encoder. In this paper, a novel fast inter mode decision algorithm for H.264/AVC has been proposed. The proposed algorithm evaluates the modes based on residual feature. The residual is obtained after the motion search of P16 × 16 mode or P8 × 8 mode. And then basing on the extracted residual feature, the complexity and similarity are evaluated for the inter mode decision. According to the evaluation of similarity between different sub-blocks and the complexity of each sub-block, the most possible inter modes for current block is chosen to be conducted. In the worst case, the proposed whole scheme of inter mode decision algorithm only conducts 4 modes, which is much more effective than conducting all the 8 modes in conventional approach. The simulation results show that, comparing to JM14.1, on average, the proposed algorithm achieves 57.98% and 55.72% time-saving on CIF and 720p sequences respectively, with equivalent 0.219 dB PSNR drop and 5.55% bit rate increase for CIF and 0.107 dB PSNR drop and 3.53% bit rate increase for 720p. Compared to existing inter mode decision algorithm, proposed algorithm achieves 10.68% and 13.26% timing-reduction on CIF and 720p sequences respectively with less performance loss.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908167","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 Macroblock Homogeneity Detection Method and its Application for Block Size Decision in H.264/AVC","authors":"G. Tian, T. Zhang, S. Goto","doi":"10.11371/IIEEJ.39.672","DOIUrl":"https://doi.org/10.11371/IIEEJ.39.672","url":null,"abstract":"〈 Summary 〉 The variable block sizes for intra and inter coding in H.264/AVC achieves significant coding gain compared with coding a macroblock (MB) with fixed size. How-ever, extremely heavy computational burden is required when Rate Distortion Optimization (RDO) process runs in brutal force searching manner for selecting the optimal coding block. This paper proposes an MB homogeneity detection method to accelerate H.264/AVC intra and inter coding. All the luminance values of pixels in an MB are taken to calculate their entropy feature, which is defined as MB’s spatial homogeneity. Based on homogeneity judgment, 16 × 16 or 4 × 4 block size is appropriately selected for intra coding; Meanwhile, either the large blocks in { 16 × 16 , 16 × 8 , 8 × 16 } or sub-blocks in { 8 × 8 , 8 × 4 , 4 × 8 , 4 × 4 } are chosen for inter coding. Especially, a cost function is defined to select near optimal threshold for selecting optimal block size. Proposed methods are verified on a wide range of video sequences with different spatial-/motion characteristics. Sufficient simulations demonstrate that consistent encoding gain is achieved for all videos with different motion and spatial features. Encoding complexity for intra coding alone can be reduced by 31%– 34% and time savings for inter mode decision is 43.7%–58.7%, both with negligible loss in bitrate and PSNR.","PeriodicalId":153591,"journal":{"name":"The Journal of the Institute of Image Electronics Engineers of Japan","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133826663","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}