Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906733
P. Duraisamy, S. Jackson
This paper concerns orthogonal corner detection from small-scale features (micro-structures) in images, and its use in the registration of an unregistered aerial orthophoto with a LiDAR point cloud data. First, we classify the corners in the aerial and LiDAR images using a corner detection algorithm specifically adapted for orthogonal corner detection. Then we use a search algorithm to register the orthogonal corners from the orthophoto image over the LiDAR image. The search algorithm is tailored for the matchings of orthogonal corners, for which there may be many features in one image with no corresponding feature in the other, but for which there are several corresponding corner features which are highly localized in spatial coordinates. The search algorithm requires an initial coarse estimate of the registration homography in order to perform quickly. We use this method to register a LiDAR and an aerial image of a coastal region with several man-made buildings in the vicinity (and thus well-defined orthocorners). The methods of this experiment can be useful for registering the images from two different modalities, even from high altitude photographs. The experimental results show a high degree of accuracy in the shoreline registration can be attained. The algorithm gives a registration which matches the micro-structures with pixel level accuracy. This is in contrast to the coarse registration, which in our cases was computed from an estimate of the shorelines in the images, which has an error around 10-20 pixels.
{"title":"Orthogonal corner detection from micro structures","authors":"P. Duraisamy, S. Jackson","doi":"10.1109/ICCCV.2013.6906733","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906733","url":null,"abstract":"This paper concerns orthogonal corner detection from small-scale features (micro-structures) in images, and its use in the registration of an unregistered aerial orthophoto with a LiDAR point cloud data. First, we classify the corners in the aerial and LiDAR images using a corner detection algorithm specifically adapted for orthogonal corner detection. Then we use a search algorithm to register the orthogonal corners from the orthophoto image over the LiDAR image. The search algorithm is tailored for the matchings of orthogonal corners, for which there may be many features in one image with no corresponding feature in the other, but for which there are several corresponding corner features which are highly localized in spatial coordinates. The search algorithm requires an initial coarse estimate of the registration homography in order to perform quickly. We use this method to register a LiDAR and an aerial image of a coastal region with several man-made buildings in the vicinity (and thus well-defined orthocorners). The methods of this experiment can be useful for registering the images from two different modalities, even from high altitude photographs. The experimental results show a high degree of accuracy in the shoreline registration can be attained. The algorithm gives a registration which matches the micro-structures with pixel level accuracy. This is in contrast to the coarse registration, which in our cases was computed from an estimate of the shorelines in the images, which has an error around 10-20 pixels.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076548","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906734
Manar D. Samad
In a robot-assisted tele-operation, the operator uses a hand controller to maneuver a tool attached to the robot's end-effector. The performance in such tele-operation may depend on perceptual information about the operating site as well as the design of the hand-controller. A hand-controller that provides haptic information as force feedback during the interaction in tele-operation may be beneficial in robot-assisted tasks such as robot-assisted surgery. To evaluate the effect of such perceptual information such as visual and haptic information, it is important to analyze their effect on human hand motion and performance in a robot-assisted task. This study examines the effect of visual and haptic information on hand motion and the performance in a robot-assisted tracing task in each of three degrees of freedom (DOF). Our findings reveal that there is a significant asymmetry in performance in each DOF. The effect of force conditions as haptic information is more evident under inadequate visual information during the tracing task. A force condition opposite to the motion direction of the tracing yields best performance in compared to no force or other force conditions. These findings can be useful in designing a hand controller interface that yields optimal performance in robot-assisted tasks.
{"title":"Effect of haptic and visual information on asymmetric hand motion in a robot-assisted task","authors":"Manar D. Samad","doi":"10.1109/ICCCV.2013.6906734","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906734","url":null,"abstract":"In a robot-assisted tele-operation, the operator uses a hand controller to maneuver a tool attached to the robot's end-effector. The performance in such tele-operation may depend on perceptual information about the operating site as well as the design of the hand-controller. A hand-controller that provides haptic information as force feedback during the interaction in tele-operation may be beneficial in robot-assisted tasks such as robot-assisted surgery. To evaluate the effect of such perceptual information such as visual and haptic information, it is important to analyze their effect on human hand motion and performance in a robot-assisted task. This study examines the effect of visual and haptic information on hand motion and the performance in a robot-assisted tracing task in each of three degrees of freedom (DOF). Our findings reveal that there is a significant asymmetry in performance in each DOF. The effect of force conditions as haptic information is more evident under inadequate visual information during the tracing task. A force condition opposite to the motion direction of the tracing yields best performance in compared to no force or other force conditions. These findings can be useful in designing a hand controller interface that yields optimal performance in robot-assisted tasks.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124567923","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906737
Renuka Sruthi Thorati, Revathi Venkatesan, M. S. Saleem Basha
Currently on web, services are being created and utilized at the drop of a hat. Due to the growing number of services over the web, use of native techniques to obtain the most desired web services is becoming archaic. So, to enhance the horizons of web service discovery platforms, in the current paper we coupled Service Oriented Architecture (SOA) with Event Driven Architecture (EDA) so as to make web service discovery more time and cost efficient. Also, we introduce Bi-matchmaking technique based on Ontologies over Event Driven Service Oriented Architecture (EDSOA) which is conducive to automated and proficient discovery of web services in time critical business processes and also to face the future Internet trend.
{"title":"Proficient discovery of services by ontology based Bi-matchmaking technique in Event Driven SOA","authors":"Renuka Sruthi Thorati, Revathi Venkatesan, M. S. Saleem Basha","doi":"10.1109/ICCCV.2013.6906737","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906737","url":null,"abstract":"Currently on web, services are being created and utilized at the drop of a hat. Due to the growing number of services over the web, use of native techniques to obtain the most desired web services is becoming archaic. So, to enhance the horizons of web service discovery platforms, in the current paper we coupled Service Oriented Architecture (SOA) with Event Driven Architecture (EDA) so as to make web service discovery more time and cost efficient. Also, we introduce Bi-matchmaking technique based on Ontologies over Event Driven Service Oriented Architecture (EDSOA) which is conducive to automated and proficient discovery of web services in time critical business processes and also to face the future Internet trend.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122119892","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906739
Nivedita Supakar, A. Senthil
PSO (particle swarm optimization) is a stochastic population based computational method that optimizes the problem iteratively, trying to improve the solution particles to get better quality of the particle called target solution. In this paper, PSO algorithm is used to find the particle best position value by searching the solution space to determine the minimum distance from the obstacle. The position of each particle is updated according to the distance and velocity equation. The LEGO NXT mobile robot which is considered to be as source is placed in any position in n-dimensional environment. And there are `n' numbers of obstacle placed in the same unknown environment. Each time, a swarm of particles are moving in the same workspace to detect and ensure if an obstacle is present there or not near to gbest location. The particles move to the global best position, following the one which is at the minimum distance from the obstacle and stop at the certain range from the obstacle. The robot then moves to the located position each time iteratively, until and unless it reaches to the target solution. Based on the position of the obstacle, the objective function to find the exact minimum distance from the obstacle is calculated. Main objective of this paper is to provide an optimized algorithm based on PSO for robot to move from source to destination by avoiding all possible obstacles. Already existing standard PSO algorithm has been modified by introducing one more objective function which is used to perform the local search based on the global search depending on the calculated gbest value by using the standard PSO algorithm. Thus we introduce a modified version of PSO algorithm called MPSO which increases the efficiency of the already existing PSO algorithm.
{"title":"PSO obstacle avoidance algorithm for robot in unknown environment","authors":"Nivedita Supakar, A. Senthil","doi":"10.1109/ICCCV.2013.6906739","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906739","url":null,"abstract":"PSO (particle swarm optimization) is a stochastic population based computational method that optimizes the problem iteratively, trying to improve the solution particles to get better quality of the particle called target solution. In this paper, PSO algorithm is used to find the particle best position value by searching the solution space to determine the minimum distance from the obstacle. The position of each particle is updated according to the distance and velocity equation. The LEGO NXT mobile robot which is considered to be as source is placed in any position in n-dimensional environment. And there are `n' numbers of obstacle placed in the same unknown environment. Each time, a swarm of particles are moving in the same workspace to detect and ensure if an obstacle is present there or not near to gbest location. The particles move to the global best position, following the one which is at the minimum distance from the obstacle and stop at the certain range from the obstacle. The robot then moves to the located position each time iteratively, until and unless it reaches to the target solution. Based on the position of the obstacle, the objective function to find the exact minimum distance from the obstacle is calculated. Main objective of this paper is to provide an optimized algorithm based on PSO for robot to move from source to destination by avoiding all possible obstacles. Already existing standard PSO algorithm has been modified by introducing one more objective function which is used to perform the local search based on the global search depending on the calculated gbest value by using the standard PSO algorithm. Thus we introduce a modified version of PSO algorithm called MPSO which increases the efficiency of the already existing PSO algorithm.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"51 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378675","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906741
R. Krishnamoorthy, S. S. Kumar
In this paper, a new cluster validation technique called Inter Cluster Validation (ICV) is presented. The proposed technique is aimed to measure the inter cluster similarity and inter cluster dissimilarity over the each individual cluster with other clusters in the resulting cluster of the unsupervised clustering techniques. The proposed ICV technique consists of two measures which are Inter Cluster Similarity (ICS) and Inter Cluster Dissimilarity (ICD). The first measure (ICS), is aimed to measure the inter cluster similarity over the each individual cluster with other cluster in resulting cluster and, it also calculate the overall resulting cluster similarity. The second measure (ICD), is evaluate the inter cluster dissimilarity over the each individual with other clusters in the resulting cluster. The proposed ICV technique is test over the resulting cluster of the four unsupervised clustering techniques are K-Means, CURE, OAC and LIAC. Experimental results show that the ICV technique is simple and better suitable for evaluating the inter cluster similarity and inter cluster dissimilarity over the each individual cluster belongs to the resulting cluster of the unsupervised clustering techniques such as K-Means, CURE, OAC and LIAC.
{"title":"A new inter cluster validation method for unsupervised clustering techniques","authors":"R. Krishnamoorthy, S. S. Kumar","doi":"10.1109/ICCCV.2013.6906741","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906741","url":null,"abstract":"In this paper, a new cluster validation technique called Inter Cluster Validation (ICV) is presented. The proposed technique is aimed to measure the inter cluster similarity and inter cluster dissimilarity over the each individual cluster with other clusters in the resulting cluster of the unsupervised clustering techniques. The proposed ICV technique consists of two measures which are Inter Cluster Similarity (ICS) and Inter Cluster Dissimilarity (ICD). The first measure (ICS), is aimed to measure the inter cluster similarity over the each individual cluster with other cluster in resulting cluster and, it also calculate the overall resulting cluster similarity. The second measure (ICD), is evaluate the inter cluster dissimilarity over the each individual with other clusters in the resulting cluster. The proposed ICV technique is test over the resulting cluster of the four unsupervised clustering techniques are K-Means, CURE, OAC and LIAC. Experimental results show that the ICV technique is simple and better suitable for evaluating the inter cluster similarity and inter cluster dissimilarity over the each individual cluster belongs to the resulting cluster of the unsupervised clustering techniques such as K-Means, CURE, OAC and LIAC.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128568662","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906735
B. Pandey, Ekta Walia
In this work, clock gating technique is applied on the Frame Buffers in order to get more energy efficient Frame Buffers. Frame Buffer is an in-built memory of digital Image Processor, which is writeable by the CPU and readable by the Video Interface and used to store color of each pixel. Clock gating is a power saving technique which turns off the inactive component of design in order to save power consumption. When frame buffer is operating on 10 GHz speed, 98.41% reduction in clock power and 2.51% reduction in I/O power is possible with clock gating. The main purpose of frame buffer is to store or access images more rapidly usually at video rates. Therefore, highest speed of 1THz is applied for frame buffer and we get 98.28% reduction in clock power and 96.58% reduction in I/O power. In that way, we achieve our design goal of both high performance (in range of 1THz) and energy efficient (in range of 90% reduction in power) frame buffer design to achieve high performance energy efficient digital image processor (HPEEC-DIP). In this experiment, Xilinx 14.6 is used as simulator, Verilog is used as verification language, XPower is a power consumption estimator, Frame Buffer is target design and Virtex-6 is targeting 40nm FPGA Device.
{"title":"Clock gating aware energy efficient Frame buffer design on FPGA","authors":"B. Pandey, Ekta Walia","doi":"10.1109/ICCCV.2013.6906735","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906735","url":null,"abstract":"In this work, clock gating technique is applied on the Frame Buffers in order to get more energy efficient Frame Buffers. Frame Buffer is an in-built memory of digital Image Processor, which is writeable by the CPU and readable by the Video Interface and used to store color of each pixel. Clock gating is a power saving technique which turns off the inactive component of design in order to save power consumption. When frame buffer is operating on 10 GHz speed, 98.41% reduction in clock power and 2.51% reduction in I/O power is possible with clock gating. The main purpose of frame buffer is to store or access images more rapidly usually at video rates. Therefore, highest speed of 1THz is applied for frame buffer and we get 98.28% reduction in clock power and 96.58% reduction in I/O power. In that way, we achieve our design goal of both high performance (in range of 1THz) and energy efficient (in range of 90% reduction in power) frame buffer design to achieve high performance energy efficient digital image processor (HPEEC-DIP). In this experiment, Xilinx 14.6 is used as simulator, Verilog is used as verification language, XPower is a power consumption estimator, Frame Buffer is target design and Virtex-6 is targeting 40nm FPGA Device.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904063","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906740
Ishani Saha, A. Senthil
Robot technology has been rapidly developed more & more robots such as humanoid robots work with humans. The objective of this project is to develop a system for an autonomous mobile robot for searching and tracking sound source based target using sound sensors. Finding objects or events by following a sound source direction is an intuitive response for human and animal when they cannot see the target. Lego nxt sound sensor can detect the frequency of sound but is unable to detect the direction from where the sound is originating. PSO algorithm has been implemented for the optimization of the exact sound source. PSO (particle swarm optimization) is a stochastic population based computational method that optimizes the problem in each iteration, trying to improve the particle solutions and to get better quality of the particles each time. Objective function has been applied to detect the frequency and then the source continuously updates its position on the basis of frequency being detected. So that maximum frequency sound can be detected in minimum possible time and in exact location. Simulation work has been carried out by implementing the PSO algorithm in MATLAB to see how exactly the sound sources are detecting the frequency and at what particular frequency the source is exactly detecting the sound. Results have been computed by changing the number of iterations to see the exact location where the sound source is finding the frequency. Thus the main objective of this paper is to compute that the source is detecting the optimized maximum frequency sound by updating its gbest values continuously in every iteration and finally reaching the best possible value.
{"title":"An optimal sound detection for robots in an unknown environment","authors":"Ishani Saha, A. Senthil","doi":"10.1109/ICCCV.2013.6906740","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906740","url":null,"abstract":"Robot technology has been rapidly developed more & more robots such as humanoid robots work with humans. The objective of this project is to develop a system for an autonomous mobile robot for searching and tracking sound source based target using sound sensors. Finding objects or events by following a sound source direction is an intuitive response for human and animal when they cannot see the target. Lego nxt sound sensor can detect the frequency of sound but is unable to detect the direction from where the sound is originating. PSO algorithm has been implemented for the optimization of the exact sound source. PSO (particle swarm optimization) is a stochastic population based computational method that optimizes the problem in each iteration, trying to improve the particle solutions and to get better quality of the particles each time. Objective function has been applied to detect the frequency and then the source continuously updates its position on the basis of frequency being detected. So that maximum frequency sound can be detected in minimum possible time and in exact location. Simulation work has been carried out by implementing the PSO algorithm in MATLAB to see how exactly the sound sources are detecting the frequency and at what particular frequency the source is exactly detecting the sound. Results have been computed by changing the number of iterations to see the exact location where the sound source is finding the frequency. Thus the main objective of this paper is to compute that the source is detecting the optimized maximum frequency sound by updating its gbest values continuously in every iteration and finally reaching the best possible value.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117138649","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906738
Prabhat Singh, B. Pandey, T. Kumar, T. Das
In design and implementation of energy efficient counter for energy efficient processor, we are using LVCMOS I/O standard in FPGA. CMOS technology is used to achieve energy efficiency with corresponding low voltage. We observe that when counter operates at 1×106MHz device operating frequency, there is 67.42% reduction in clock power and 75.99% reduction in IO power with LVCMOS I/O Standard. In counter, we are using numbers of flip-flops and register. In this whole work, we are using three different classes of LVCMOS namely LVCMOS15, LVCMOS18 and LVCMOS33. When counter is operating at 1000MHz, the reduction in I/O power requirement of LVCMOS18 is 67.63% and of LVCMOS15 is 75.72% as compared to LVCMOS33. When frame buffer is operating at 10000MHz, the reduction in I/O power requirement of LVCMOS18 is 67.45% and of LVCMOS15 is 75.99% as compared to LVCMOS33. When frame buffer is operating at 100000MHz, there is 67.42% reduction in clock power and 75.99% reduction in IO power with LVCMOS I/O Standard. Other component of dynamic power like Clock power, Logic power and Signal power are independent of I/O standard. This implimentation is made on 28nm 7 Series Kintex-7 (7k70tfbg676-3) FPGA.
{"title":"LVCMOS I/O standard based million MHz high performance energy efficient design on FPGA","authors":"Prabhat Singh, B. Pandey, T. Kumar, T. Das","doi":"10.1109/ICCCV.2013.6906738","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906738","url":null,"abstract":"In design and implementation of energy efficient counter for energy efficient processor, we are using LVCMOS I/O standard in FPGA. CMOS technology is used to achieve energy efficiency with corresponding low voltage. We observe that when counter operates at 1×106MHz device operating frequency, there is 67.42% reduction in clock power and 75.99% reduction in IO power with LVCMOS I/O Standard. In counter, we are using numbers of flip-flops and register. In this whole work, we are using three different classes of LVCMOS namely LVCMOS15, LVCMOS18 and LVCMOS33. When counter is operating at 1000MHz, the reduction in I/O power requirement of LVCMOS18 is 67.63% and of LVCMOS15 is 75.72% as compared to LVCMOS33. When frame buffer is operating at 10000MHz, the reduction in I/O power requirement of LVCMOS18 is 67.45% and of LVCMOS15 is 75.99% as compared to LVCMOS33. When frame buffer is operating at 100000MHz, there is 67.42% reduction in clock power and 75.99% reduction in IO power with LVCMOS I/O Standard. Other component of dynamic power like Clock power, Logic power and Signal power are independent of I/O standard. This implimentation is made on 28nm 7 Series Kintex-7 (7k70tfbg676-3) FPGA.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"93 36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129006667","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}
Pub Date : 2013-12-01DOI: 10.1109/ICCCV.2013.6906736
T. Das, B. Pandey, Md. Atiqur Rahman, T. Kumar, T. Siddiquee
In this work, Capacitance scaling and Frequency scaling is done in order to make energy efficient Image Inverter design. Frequency scaling results variations in power consumption and the Junction temperature of Image Inverter. There is 93.33% change in Logic power, 98.06% change in Signals power, 99.00%change in IOs power, 92.02% change in Leakage power and 77.6% change in Junction temperature. Clocks power, Logic power and Signal powers are independent of the capacitance scaling while the frequency is constant. At the same time IOs power, Leakage power as well as the Junction temperature varies. Along with fixed 1GHz frequency it is found that there is 71.92% increment on IOs power while capacitance is incremented by 90%. At the same time there is a 2.4% increment found in Leakage power while Junction temperature faces an change of 7.14%.
{"title":"Capacitance and frequency scaling based energy efficient image inverter design on FPGA","authors":"T. Das, B. Pandey, Md. Atiqur Rahman, T. Kumar, T. Siddiquee","doi":"10.1109/ICCCV.2013.6906736","DOIUrl":"https://doi.org/10.1109/ICCCV.2013.6906736","url":null,"abstract":"In this work, Capacitance scaling and Frequency scaling is done in order to make energy efficient Image Inverter design. Frequency scaling results variations in power consumption and the Junction temperature of Image Inverter. There is 93.33% change in Logic power, 98.06% change in Signals power, 99.00%change in IOs power, 92.02% change in Leakage power and 77.6% change in Junction temperature. Clocks power, Logic power and Signal powers are independent of the capacitance scaling while the frequency is constant. At the same time IOs power, Leakage power as well as the Junction temperature varies. Along with fixed 1GHz frequency it is found that there is 71.92% increment on IOs power while capacitance is incremented by 90%. At the same time there is a 2.4% increment found in Leakage power while Junction temperature faces an change of 7.14%.","PeriodicalId":109014,"journal":{"name":"2013 International Conference on Communication and Computer Vision (ICCCV)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129140856","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
扫码关注我们
求助内容：
应助结果提醒方式：