Wu-Hsiao Hsu, Sheng-Cheng Yeh, Yuh-Pyng Shieh, Cheng-Ying Yang
Multimedia services are typically much more sensitive to throughput, delay, and packet loss than traditional services. These parameters give technical performances of the network but they do not reveal QoS perceived by users. Hence, how to capture users’ overall perceptions when they are using network services is an important issue. In this paper, we simulate a streaming video environment in bandwidth broker (BB), and provide the data of measuring the quality of experience (QoE) for genetic algorithm (GA). After GA acquires these data, GA can use the proposed fitness function to measure the multicast group member’s QoE, and decide whether to adjust a DiffServ-aware multicast tree (DAMT) according to the measured results. The simulation results have proved that the DAMTs adjusted by GA can satisfy the QoE of multicast group member.
{"title":"A QoE-Based Measurement for DiffServ Multicasting Networks","authors":"Wu-Hsiao Hsu, Sheng-Cheng Yeh, Yuh-Pyng Shieh, Cheng-Ying Yang","doi":"10.1109/ICCSA.2010.51","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.51","url":null,"abstract":"Multimedia services are typically much more sensitive to throughput, delay, and packet loss than traditional services. These parameters give technical performances of the network but they do not reveal QoS perceived by users. Hence, how to capture users’ overall perceptions when they are using network services is an important issue. In this paper, we simulate a streaming video environment in bandwidth broker (BB), and provide the data of measuring the quality of experience (QoE) for genetic algorithm (GA). After GA acquires these data, GA can use the proposed fitness function to measure the multicast group member’s QoE, and decide whether to adjust a DiffServ-aware multicast tree (DAMT) according to the measured results. The simulation results have proved that the DAMTs adjusted by GA can satisfy the QoE of multicast group member.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121736044","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}
We consider the I/O-efficient rectangular segment search problem in 2D. The problem involves storing a given set ${cal S}$ of $N$ line segments in a data structure such that an axis aligned rectangular range query ${cal R}$ can be performed efficiently; i.e., report all line segments in ${cal S}$ which intersect ${cal R}$. We give a data structure requiring space $O(N(N/B)^2)$ disk blocks that can answer a range query ${cal R}$ using $O(log_B N + K/B)$ I/Os, where $B$ is the number of line segments transferred in one I/O, and $K$ is the number of line segments intersecting ${cal R}$. Search complexity of $O(log_B (N/B) + K/B)$ I/Os can be achieved with reduced storage if the set ${cal S}$ contains only non-intersecting line segments, orif set ${cal S}$ contains only horizontal and vertical line segments. In the former case the space complexity is $O((N/B)^2)$ disk blocks and in the latter case the space complexity is $O(N frac{log N}{loglog_B N})$.We also consider the problem of finding all the line segments which are entirely within the rectangle ${cal R}$ if the set ${cal S}$ contains only vertical and horizontal line segments. For this problem, an optimal data structure is presented with size $O(N frac{log N}{loglog_B N})$ disk blocks that requires $O(log_B (N/B) + K/B)$ I/Os to answer the query.
{"title":"I/O-Efficient Rectangular Segment Search","authors":"G. Das, B. Nickerson","doi":"10.1109/ICCSA.2010.35","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.35","url":null,"abstract":"We consider the I/O-efficient rectangular segment search problem in 2D. The problem involves storing a given set ${cal S}$ of $N$ line segments in a data structure such that an axis aligned rectangular range query ${cal R}$ can be performed efficiently; i.e., report all line segments in ${cal S}$ which intersect ${cal R}$. We give a data structure requiring space $O(N(N/B)^2)$ disk blocks that can answer a range query ${cal R}$ using $O(log_B N + K/B)$ I/Os, where $B$ is the number of line segments transferred in one I/O, and $K$ is the number of line segments intersecting ${cal R}$. Search complexity of $O(log_B (N/B) + K/B)$ I/Os can be achieved with reduced storage if the set ${cal S}$ contains only non-intersecting line segments, orif set ${cal S}$ contains only horizontal and vertical line segments. In the former case the space complexity is $O((N/B)^2)$ disk blocks and in the latter case the space complexity is $O(N frac{log N}{loglog_B N})$.We also consider the problem of finding all the line segments which are entirely within the rectangle ${cal R}$ if the set ${cal S}$ contains only vertical and horizontal line segments. For this problem, an optimal data structure is presented with size $O(N frac{log N}{loglog_B N})$ disk blocks that requires $O(log_B (N/B) + K/B)$ I/Os to answer the query.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822720","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 today's technological era, technologies for drawing fine figures have become necessary for effective communication in areas such as scientific research, industry, architecture, medical service, and education. In the areas of scientific research and education, computer algebra system (CAS) has become the preferred tool because of its superb drawing utilities and symbolic computation capabilities. However, embedding the graphics generated with CAS into preferred documents such as LaTeX is limited, cumbersome and inefficient. For instance, a large sized graphical file becomes an issue for fast web-tech based communication. To remedy this issue, we have developed a macro package of CAS, named KETpic, as a convenient tool for supplying high quality graphics (produced with the aid of CAS) embedded in high-quality scientific documents (edited by LaTeX). Although its versions for Mathematica and Maple have been fully developed, we recently migrated it to a popular shareware Scilab so that more people can use it. In a sense, the extent of the facilities which a CAS provides and the expense to purchase it present a "tradeoff'" relation. Consequently, some extra contrivance was necessary in the migration described above. This paper illustrates that the facilities of KETpic version for Scilab become almost equal to those of its Mathematica and Maple counterparts.
{"title":"Handier Use of Scilab to Draw Fine LaTeX Figures: Usage of KETpic Version for Scilab","authors":"Hiroaki Koshikawa, Masataka Kaneko, Satoshi Yamashita, Kiyoshi Kitahara, Setsuo Takato","doi":"10.1109/ICCSA.2010.33","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.33","url":null,"abstract":"In today's technological era, technologies for drawing fine figures have become necessary for effective communication in areas such as scientific research, industry, architecture, medical service, and education. In the areas of scientific research and education, computer algebra system (CAS) has become the preferred tool because of its superb drawing utilities and symbolic computation capabilities. However, embedding the graphics generated with CAS into preferred documents such as LaTeX is limited, cumbersome and inefficient. For instance, a large sized graphical file becomes an issue for fast web-tech based communication. To remedy this issue, we have developed a macro package of CAS, named KETpic, as a convenient tool for supplying high quality graphics (produced with the aid of CAS) embedded in high-quality scientific documents (edited by LaTeX). Although its versions for Mathematica and Maple have been fully developed, we recently migrated it to a popular shareware Scilab so that more people can use it. In a sense, the extent of the facilities which a CAS provides and the expense to purchase it present a \"tradeoff'\" relation. Consequently, some extra contrivance was necessary in the migration described above. This paper illustrates that the facilities of KETpic version for Scilab become almost equal to those of its Mathematica and Maple counterparts.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329518","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 time evolution of bright solitons in an ion-acoustic plasma with non-isothermal electrons are determined numerically by using the Crank-Nicolson scheme. Head-on collisions between two solitons with the same and different amplitudes are investigated. Both types of collision are found to be inelastic -- the amplitudes and speeds of the outgoing solitons are a little different from those of the incoming solitons.
{"title":"Numerical Solutions of the Nonlinear Schrödinger Equation with a Square Root Nonlinearity","authors":"S. Phibanchon, M. A. Allen","doi":"10.1109/ICCSA.2010.68","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.68","url":null,"abstract":"The time evolution of bright solitons in an ion-acoustic plasma with non-isothermal electrons are determined numerically by using the Crank-Nicolson scheme. Head-on collisions between two solitons with the same and different amplitudes are investigated. Both types of collision are found to be inelastic -- the amplitudes and speeds of the outgoing solitons are a little different from those of the incoming solitons.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233089","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 this paper a circular shape representation isused to define a circular set for a pair of fixed shapes. This paper is an extension of an approach to shape comparison based on skeleton isomorphism proposed in [5]. The main advantage over existing approaches is mathematically correctly defined shape metrics via Hausdorff distance with the concurrent use of topology features of a shape. The circular function is proposed on the defined circular set. It has two parametersas two given shapes and two variables as two circulars. Thecircular set could be reduced to a special shrunk isomorphicsubset. The minimization of a circular function problem on ashrunk subset for a pair of shapes is proposed. The existence and reachability of minimum on this shrunk subset is proved.Effective monotone subsets are constructed to reduce thesearching of an optimal problem’s solution. The latter reduces the number of all possible subgraphs where to search the best pair to logarithmic (by skeleton edges) computational complexity comparing to the exponential total number of possible subgraphs. All the results are mathematically correct and may be useful in shape comparison and shape analysis applications where pairs of shapes are considered.
{"title":"On the Minimization of a Circular Function on the Isomorphic Shrunk Subset","authors":"L. Domakhina","doi":"10.1109/ICCSA.2010.34","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.34","url":null,"abstract":"In this paper a circular shape representation isused to define a circular set for a pair of fixed shapes. This paper is an extension of an approach to shape comparison based on skeleton isomorphism proposed in [5]. The main advantage over existing approaches is mathematically correctly defined shape metrics via Hausdorff distance with the concurrent use of topology features of a shape. The circular function is proposed on the defined circular set. It has two parametersas two given shapes and two variables as two circulars. Thecircular set could be reduced to a special shrunk isomorphicsubset. The minimization of a circular function problem on ashrunk subset for a pair of shapes is proposed. The existence and reachability of minimum on this shrunk subset is proved.Effective monotone subsets are constructed to reduce thesearching of an optimal problem’s solution. The latter reduces the number of all possible subgraphs where to search the best pair to logarithmic (by skeleton edges) computational complexity comparing to the exponential total number of possible subgraphs. All the results are mathematically correct and may be useful in shape comparison and shape analysis applications where pairs of shapes are considered.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351863","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}
N. Nguyen, D. Nguyen, Marc-Aurelien Le Gall, N. Saxena, Hyunseung Choo
The uneven deployment of wireless sensor networks and the breakdown of sensor nodes often lead to the presence of holes in their topology. Two important factors considered in designing a geographic routing algorithm are overhead and success rate of packet routing. Therefore, in this paper, we present a novel strategy to aid a routing algorithm improve its performance by increasing success rate of packet routing, while there is no significant overhead involved. To evaluate the efficiency of our strategy, we design a novel routing algorithm called Greedy Forwarding with Virtual Destination (GFVD). Moreover, we utilize the concept of virtual position of sensor nodes to design a combined scheme named Greedy Forwarding with Virtual Destination and Virtual Position (GFVD-ViP). Analysis and extensive simulation are conducted to study the efficiency of our schemes compared to the existing ones.
{"title":"Greedy Forwarding with Virtual Destination Strategy for Geographic Routing in Wireless Sensor Networks","authors":"N. Nguyen, D. Nguyen, Marc-Aurelien Le Gall, N. Saxena, Hyunseung Choo","doi":"10.1109/ICCSA.2010.55","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.55","url":null,"abstract":"The uneven deployment of wireless sensor networks and the breakdown of sensor nodes often lead to the presence of holes in their topology. Two important factors considered in designing a geographic routing algorithm are overhead and success rate of packet routing. Therefore, in this paper, we present a novel strategy to aid a routing algorithm improve its performance by increasing success rate of packet routing, while there is no significant overhead involved. To evaluate the efficiency of our strategy, we design a novel routing algorithm called Greedy Forwarding with Virtual Destination (GFVD). Moreover, we utilize the concept of virtual position of sensor nodes to design a combined scheme named Greedy Forwarding with Virtual Destination and Virtual Position (GFVD-ViP). Analysis and extensive simulation are conducted to study the efficiency of our schemes compared to the existing ones.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"63 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132477734","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}
Hyeonwoo Cho, Jewon Lee, Younghun Lee, Sang Woo Kim
In this paper, we propose a localization algorithm for a mobile node based on the IEEE 802.15.4a chirp spread spectrum (CSS). IEEE 802.15.4a is an alternative PHY for IEEE 802.15.4, which is used for wireless sensor networks, and it can be applied to ranging applications. Through CSS ranging, the coordinate of a CSS node can be calculated by using trilateration. This approach is usually used for mobile robot localization. In the case of mobile robot localization, the dynamics of a mobile robot can be modeled as a state-space equation because a robot is an artificial object manufactured by designers. Therefore, the coordinate of a mobile robot can be estimated by using the Kalman filter. However, in the case of localization of a mobile node whose movement cannot be predicted, the dynamics of the mobile node are difficult to model. Therefore, we propose a strategy that regards the un-modeled dynamics as the process noise of the state-space equation. Further, we propose a method for determining the statics of the process noise based on some reasonable assumptions. Through the localization experiment, we verify the proposed method and discuss the results.
{"title":"Localization for a Mobile Node Based on Chrip Spread Spectrum Ranging","authors":"Hyeonwoo Cho, Jewon Lee, Younghun Lee, Sang Woo Kim","doi":"10.1109/ICCSA.2010.54","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.54","url":null,"abstract":"In this paper, we propose a localization algorithm for a mobile node based on the IEEE 802.15.4a chirp spread spectrum (CSS). IEEE 802.15.4a is an alternative PHY for IEEE 802.15.4, which is used for wireless sensor networks, and it can be applied to ranging applications. Through CSS ranging, the coordinate of a CSS node can be calculated by using trilateration. This approach is usually used for mobile robot localization. In the case of mobile robot localization, the dynamics of a mobile robot can be modeled as a state-space equation because a robot is an artificial object manufactured by designers. Therefore, the coordinate of a mobile robot can be estimated by using the Kalman filter. However, in the case of localization of a mobile node whose movement cannot be predicted, the dynamics of the mobile node are difficult to model. Therefore, we propose a strategy that regards the un-modeled dynamics as the process noise of the state-space equation. Further, we propose a method for determining the statics of the process noise based on some reasonable assumptions. Through the localization experiment, we verify the proposed method and discuss the results.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617568","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 realistic wireless sensor networks (WSNs), wireless link can be extremely unreliable and for the reliable and efficient data delivery many characteristics should be considered such as link quality, distance and energy. Therefore, an optimal solution which considers these characteristics is necessary. Previous geographic routing protocols which consider only some of these characteristics are not adequate to use in realistic WSNs. In the paper, we propose a scheme which balances link-quality, distance and energy. Our proposed scheme is more energy-efficient than previous routing protocols, and has longer lifetime. Numerical expressions such as Packet Reception Rate (PRR), distance, and Energy-level are used in the paper. In addition, we explain how to forward a packet to the destination with these expressions. Simulation results show that our proposed scheme is more efficient than PRR x Distance scheme and achieves higher network lifetime compared with that of previous routing schemes.
{"title":"Energy Efficient Geographic Routing for Prolonging Network Lifetime in Wireless Sensor Networks","authors":"Eunil Park, D. Bae, Hyunseung Choo","doi":"10.1109/ICCSA.2010.66","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.66","url":null,"abstract":"In realistic wireless sensor networks (WSNs), wireless link can be extremely unreliable and for the reliable and efficient data delivery many characteristics should be considered such as link quality, distance and energy. Therefore, an optimal solution which considers these characteristics is necessary. Previous geographic routing protocols which consider only some of these characteristics are not adequate to use in realistic WSNs. In the paper, we propose a scheme which balances link-quality, distance and energy. Our proposed scheme is more energy-efficient than previous routing protocols, and has longer lifetime. Numerical expressions such as Packet Reception Rate (PRR), distance, and Energy-level are used in the paper. In addition, we explain how to forward a packet to the destination with these expressions. Simulation results show that our proposed scheme is more efficient than PRR x Distance scheme and achieves higher network lifetime compared with that of previous routing schemes.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"413 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863180","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}
D. Bae, Moonshik Choi, Sang-Hun Cho, Hyunseung Choo
Greedy forwarding is the main component of geographic routing in wireless sensor networks (WSNs). As it uses 1-hop local information for packet forwarding, it does not need to maintain routing table, having low overhead and high scalability. Early proposed greedy forwarding schemes do not consider link quality, so the schemes experience performance degradation from unreliability of links in real environment. To solve the problem other schemes have been proposed, still they have either asymmetry link problem or high overhead from the use of global information. In the paper, a Back-off Interval Greedy Forwarding scheme (BI-GF) is proposed to solve the problems while maintaining the benefits of greedy forwarding. In BI-GF, each neighbor node calculates BI using 2-hop information, and based on that, data packet is forwarded. In the simulation result, BI-GF improves delivery rate up to 46% and energy efficiency up to 37% compared with PRR×Distance greedy forwarding.
{"title":"Efficient Greedy Forwarding Scheme Using Back-Off Intervals in Wireless Sensor Networks","authors":"D. Bae, Moonshik Choi, Sang-Hun Cho, Hyunseung Choo","doi":"10.1109/ICCSA.2010.56","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.56","url":null,"abstract":"Greedy forwarding is the main component of geographic routing in wireless sensor networks (WSNs). As it uses 1-hop local information for packet forwarding, it does not need to maintain routing table, having low overhead and high scalability. Early proposed greedy forwarding schemes do not consider link quality, so the schemes experience performance degradation from unreliability of links in real environment. To solve the problem other schemes have been proposed, still they have either asymmetry link problem or high overhead from the use of global information. In the paper, a Back-off Interval Greedy Forwarding scheme (BI-GF) is proposed to solve the problems while maintaining the benefits of greedy forwarding. In BI-GF, each neighbor node calculates BI using 2-hop information, and based on that, data packet is forwarded. In the simulation result, BI-GF improves delivery rate up to 46% and energy efficiency up to 37% compared with PRR×Distance greedy forwarding.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"C-17 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121006815","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}
Kazuyoshi Nomura, X. Yin, Y. Sakaguchi, Hiromi T. Tanaka
In this paper, we compare three methods for synthesizing tactile vibration signals from photometric images. Firstly we obtain the geometric information from the photometric images. Secondly analyzing the surface normal and the frictional phenomena between finger and object, we propose some methods of rendering the tactile feeling vibration. Finally, implementations are carried out to show effectiveness of proposed technique using voice coil motor(VCM).
{"title":"Estimation and Rendering of Tactile Information Based on Photometric Images","authors":"Kazuyoshi Nomura, X. Yin, Y. Sakaguchi, Hiromi T. Tanaka","doi":"10.1109/ICCSA.2010.81","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.81","url":null,"abstract":"In this paper, we compare three methods for synthesizing tactile vibration signals from photometric images. Firstly we obtain the geometric information from the photometric images. Secondly analyzing the surface normal and the frictional phenomena between finger and object, we propose some methods of rendering the tactile feeling vibration. Finally, implementations are carried out to show effectiveness of proposed technique using voice coil motor(VCM).","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"52 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120855190","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
扫码关注我们
求助内容：
应助结果提醒方式：