Pub Date : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974605
Tang Liu, Hailun Xia, Chunyan Feng
Wireless multimedia traffic has increased considerably in recent years, which puts forward higher demand on the capacity of existing network. Multicast, as a transmission strategy with high spectral efficiency, has not been widely studied in heterogeneous cellular network (HetNet). Meanwhile, in order to overcome the shortcoming of conventional multicast scheme (CMS) that the throughput of multicast group is constrained by the user with lowest data rate, we propose a multicast scheme with subgroups over HetNet to effectively improve the system throughput. We formulate an expression of system throughput of the proposed multicast scheme with subcarrier and power constraints and maximize it by optimizing subgroups configuration. It can be proved to be a NP-hard combinatorial problem, then we decouple it into three subproblems, namely, user association (UA), subgroup formation (SF) and resource allocation (RA). In UA, we present a traffic-oriented access method based on reference signal receiving power (RSRP). In SF, the associated users are divided into several subgroups according to their channel state information (CSI) and the users in one subgroup are served with appropriate rate determinated by the CSI level of the subgroup. In RA, Round-Robin schedule and Equal Power schedule are adopted for subcarrier allocation and power allocation respectively. Simulation results show that the system throughput is significantly improved by using our scheme.
{"title":"Multicast scheme with subgroups over heterogeneous cellular network","authors":"Tang Liu, Hailun Xia, Chunyan Feng","doi":"10.1109/ICNIDC.2016.7974605","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974605","url":null,"abstract":"Wireless multimedia traffic has increased considerably in recent years, which puts forward higher demand on the capacity of existing network. Multicast, as a transmission strategy with high spectral efficiency, has not been widely studied in heterogeneous cellular network (HetNet). Meanwhile, in order to overcome the shortcoming of conventional multicast scheme (CMS) that the throughput of multicast group is constrained by the user with lowest data rate, we propose a multicast scheme with subgroups over HetNet to effectively improve the system throughput. We formulate an expression of system throughput of the proposed multicast scheme with subcarrier and power constraints and maximize it by optimizing subgroups configuration. It can be proved to be a NP-hard combinatorial problem, then we decouple it into three subproblems, namely, user association (UA), subgroup formation (SF) and resource allocation (RA). In UA, we present a traffic-oriented access method based on reference signal receiving power (RSRP). In SF, the associated users are divided into several subgroups according to their channel state information (CSI) and the users in one subgroup are served with appropriate rate determinated by the CSI level of the subgroup. In RA, Round-Robin schedule and Equal Power schedule are adopted for subcarrier allocation and power allocation respectively. Simulation results show that the system throughput is significantly improved by using our scheme.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128492285","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974566
Sang-Chul Lee, Si-Yong Lee, Dong-Kyu Chae, Sang-Wook Kim
User-based collaborative filtering suffers from significant amount of computational overhead to find users similar to a target user. To reduce the overhead, we propose a novel method to identify unnecessary users and items in computing the similarity. Also, we propose a data structure to support the method quite efficiently. Through extensive experiments, we show the proposed method outperforms traditional methods up to 33.8 times.
{"title":"Scalable collaborative filtering based on efficient identification of similar users","authors":"Sang-Chul Lee, Si-Yong Lee, Dong-Kyu Chae, Sang-Wook Kim","doi":"10.1109/ICNIDC.2016.7974566","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974566","url":null,"abstract":"User-based collaborative filtering suffers from significant amount of computational overhead to find users similar to a target user. To reduce the overhead, we propose a novel method to identify unnecessary users and items in computing the similarity. Also, we propose a data structure to support the method quite efficiently. Through extensive experiments, we show the proposed method outperforms traditional methods up to 33.8 times.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065831","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974532
Ze Shao, Yang Wang, Xiangzhou Chen, Yan Zhang, Junqin He, Zhiqiang Wang
To improve the power communication network risk assessment techniques, we proposed a network risk assessment method for power business. The method is based on the risk assessment relationship model consisted of communication network and power network. According to the risk caused by different levels business faults in physical link layer, network topology layer and business layer, the model uses probabilistic methods to calculate the loss of business caused by network element fault, and then comes out the network risk for business. The simulation results show that this method is easy to understand, and can be deployed to identify the business weaknesses through the risk assessment results, targeted to enhance link reliability or adjust service deployment, reducing the risk of the network.
{"title":"A network risk assessment methodology for power communication business","authors":"Ze Shao, Yang Wang, Xiangzhou Chen, Yan Zhang, Junqin He, Zhiqiang Wang","doi":"10.1109/ICNIDC.2016.7974532","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974532","url":null,"abstract":"To improve the power communication network risk assessment techniques, we proposed a network risk assessment method for power business. The method is based on the risk assessment relationship model consisted of communication network and power network. According to the risk caused by different levels business faults in physical link layer, network topology layer and business layer, the model uses probabilistic methods to calculate the loss of business caused by network element fault, and then comes out the network risk for business. The simulation results show that this method is easy to understand, and can be deployed to identify the business weaknesses through the risk assessment results, targeted to enhance link reliability or adjust service deployment, reducing the risk of the network.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114404889","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974616
C. Fan, Ting Dong, Z. Wen, Qiong Wu
An optimization algorithm (LEA algorithm) of wireless sensor networks based on network fractal dimension calculation is proposed and intended to tackle energy limitation of nodes and their imbalanced energy consumption. Compared with LEA algorithm about the energy consumption, which is based on both long range dependence model (PFM model) and short range related model (TIAF model), where PFM and TIAF model are related to network structure dimension and network data flow dimension respectively, the Optimization algorithm not only calculates each cluster or sub-networks dimension in one round in order to decide which dimension is higher than the threshold and then makes changes, but also calculates data flow dimension in order to select a better route for data transmission. The methods of dimension calculation for network structure and data flow are simply fractal and multifractal. Simulation results show that the proposed method can more effectively lengthen the network lifetime and nodes working hours than the traditional methods.
{"title":"A low energy algorithm of wireless sensor networks based on fractal dimension","authors":"C. Fan, Ting Dong, Z. Wen, Qiong Wu","doi":"10.1109/ICNIDC.2016.7974616","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974616","url":null,"abstract":"An optimization algorithm (LEA algorithm) of wireless sensor networks based on network fractal dimension calculation is proposed and intended to tackle energy limitation of nodes and their imbalanced energy consumption. Compared with LEA algorithm about the energy consumption, which is based on both long range dependence model (PFM model) and short range related model (TIAF model), where PFM and TIAF model are related to network structure dimension and network data flow dimension respectively, the Optimization algorithm not only calculates each cluster or sub-networks dimension in one round in order to decide which dimension is higher than the threshold and then makes changes, but also calculates data flow dimension in order to select a better route for data transmission. The methods of dimension calculation for network structure and data flow are simply fractal and multifractal. Simulation results show that the proposed method can more effectively lengthen the network lifetime and nodes working hours than the traditional methods.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127125870","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974582
Yanhui Guo, L. Yang, Xiaomeng Gao, Kun Wu
With the increasingly rampant malicious attacks of Android terminal, this paper proposes a detection technology of Android platform source code security based on static analysis. The technology uses the existing static analysis technology of Java source code, and joins Android implicit methods invocation processing, at last gets the control flow graph and data flow graph, which are based on Android source code and have no breakpoint. The technology analysis the malicious behavior of Android source code depending on the information flow graph, and then get the main loophole and flaw existed in Android project. Using this technology to detect multiple open source Android projects, the experimental results show that this technology can effectively detect the main loophole and flaw existing in Android source code. What's more, the technology can display complete attack path, which is convenient for developers to modify and maintain the project. Therefore, this technology has high practical value.
{"title":"The static detection analysis technology of Android source codes","authors":"Yanhui Guo, L. Yang, Xiaomeng Gao, Kun Wu","doi":"10.1109/ICNIDC.2016.7974582","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974582","url":null,"abstract":"With the increasingly rampant malicious attacks of Android terminal, this paper proposes a detection technology of Android platform source code security based on static analysis. The technology uses the existing static analysis technology of Java source code, and joins Android implicit methods invocation processing, at last gets the control flow graph and data flow graph, which are based on Android source code and have no breakpoint. The technology analysis the malicious behavior of Android source code depending on the information flow graph, and then get the main loophole and flaw existed in Android project. Using this technology to detect multiple open source Android projects, the experimental results show that this technology can effectively detect the main loophole and flaw existing in Android source code. What's more, the technology can display complete attack path, which is convenient for developers to modify and maintain the project. Therefore, this technology has high practical value.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415211","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974592
Hao Yu, Yumei Wang, Yu Liu
In wireless video broadcast system, Cooperative coding technique combines the cooperative communications with channel coding technique so as to guarantees high performance, which could bring better experience for users. But the high performance is as the cost of more bandwidth to serve more data size. In this paper, we propose a cooperative coding scheme using fountain code to decrease the data size we need to transport. We present the cooperative coding schemes with decode-forward (DF) mode. The experiment results show that this scheme decreases the data size that we need to transport compared with those using LDPC codes and improves the throughput.
{"title":"Cooperative video coding scheme with fountain code on the concentration on data size","authors":"Hao Yu, Yumei Wang, Yu Liu","doi":"10.1109/ICNIDC.2016.7974592","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974592","url":null,"abstract":"In wireless video broadcast system, Cooperative coding technique combines the cooperative communications with channel coding technique so as to guarantees high performance, which could bring better experience for users. But the high performance is as the cost of more bandwidth to serve more data size. In this paper, we propose a cooperative coding scheme using fountain code to decrease the data size we need to transport. We present the cooperative coding schemes with decode-forward (DF) mode. The experiment results show that this scheme decreases the data size that we need to transport compared with those using LDPC codes and improves the throughput.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125682389","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974525
Yaodong Huang, Xiaohong Huang, Pei Zhang
The rapid development of container-based virtualization provides an alternative to virtual machine technology used in cloud environment. However, we notice that the shortcoming in networking of this technology, such as complexity in communication between containers in different hosts and the waste of network addresses when directly allocating public IP addresses to containers, limits its availability on complicated scenarios. In order to solve these problems, we propose a solution named SDN-based NGroups Management Scheme (SNMS). In our solution, containers are organized into different NGroups, and public network addresses are allocated to NGroups too. Containers in the same NGroup can communicate with each other using “localhost” as target, and clients outside of an NGroup can fetch services using this NGroup's address. We adopt SDN technology to route traffic in order to accomplish these objectives. In this paper, we present detailed design for the solution and build a prototype based on our design. By using our prototype, container's position has nothing to do with service providing, and public network addresses are greatly saved because containers inside an NGroup share the same network configuration to the outside world. In the meantime, the performance of creating containers and HTTP downloading in our prototype is not bad than, in some case even better than, those in existing solutions nowadays.
{"title":"SDN-based container management scheme with flexibly addresses allocation capability","authors":"Yaodong Huang, Xiaohong Huang, Pei Zhang","doi":"10.1109/ICNIDC.2016.7974525","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974525","url":null,"abstract":"The rapid development of container-based virtualization provides an alternative to virtual machine technology used in cloud environment. However, we notice that the shortcoming in networking of this technology, such as complexity in communication between containers in different hosts and the waste of network addresses when directly allocating public IP addresses to containers, limits its availability on complicated scenarios. In order to solve these problems, we propose a solution named SDN-based NGroups Management Scheme (SNMS). In our solution, containers are organized into different NGroups, and public network addresses are allocated to NGroups too. Containers in the same NGroup can communicate with each other using “localhost” as target, and clients outside of an NGroup can fetch services using this NGroup's address. We adopt SDN technology to route traffic in order to accomplish these objectives. In this paper, we present detailed design for the solution and build a prototype based on our design. By using our prototype, container's position has nothing to do with service providing, and public network addresses are greatly saved because containers inside an NGroup share the same network configuration to the outside world. In the meantime, the performance of creating containers and HTTP downloading in our prototype is not bad than, in some case even better than, those in existing solutions nowadays.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124368031","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974543
H. Son, Seongjin Lee, Y. Won
File system metadata is indispensable in both describing the data and maintaining the file system. Despite the importance of metadata in the file system, the overhead of maintaining the metadata cannot be taken lightly. It is because the metadata also have to be persisted on the storage device and it consumes IO bandwidth as well as creates journaling overhead. In this paper, we find that the random write with synchronous performance of a storage is significantly affected by not only the hardware performance but also timer interrupt interval of the kernel. Extending the timer interrupt interval allows reducing the write volume and increasing the random write followed by fsync() performance of EXT4 file system. We propose intermittent mtime timestamp update on Coarse grain mtime interval instead of Fine grain mtime interval. The experiment results with mtime update interval of 1 second show that the total write volume is decreased by 75% and 28%, respectively compared to total write volume of 1 ms and 10 ms mtime interval, and the throughput increased 3.1× and 1.2× compared to 1 ms and 10 ms mtime interval. Coarse grain mtime update is resolve to the journaling overhead issues while still logging mtime timestamp.
{"title":"Effect of timer interrupt interval on file system synchronization overhead","authors":"H. Son, Seongjin Lee, Y. Won","doi":"10.1109/ICNIDC.2016.7974543","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974543","url":null,"abstract":"File system metadata is indispensable in both describing the data and maintaining the file system. Despite the importance of metadata in the file system, the overhead of maintaining the metadata cannot be taken lightly. It is because the metadata also have to be persisted on the storage device and it consumes IO bandwidth as well as creates journaling overhead. In this paper, we find that the random write with synchronous performance of a storage is significantly affected by not only the hardware performance but also timer interrupt interval of the kernel. Extending the timer interrupt interval allows reducing the write volume and increasing the random write followed by fsync() performance of EXT4 file system. We propose intermittent mtime timestamp update on Coarse grain mtime interval instead of Fine grain mtime interval. The experiment results with mtime update interval of 1 second show that the total write volume is decreased by 75% and 28%, respectively compared to total write volume of 1 ms and 10 ms mtime interval, and the throughput increased 3.1× and 1.2× compared to 1 ms and 10 ms mtime interval. Coarse grain mtime update is resolve to the journaling overhead issues while still logging mtime timestamp.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116577705","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974626
E. Jang
In this paper, a new way of evaluating image compression performance is proposed in order to reflect the human visual perception perspective in image compression and its applications: “No noticeable difference (NND) is allowed in commercial use.” Various methodologies have been proposed and utilized to evaluate image compression performance with both objective and subjective measures for the given rate-distortion curve, which is used to claim that a codec is better than another in a quantitative manner. In this paper, a NND-based subjective experiment is carried out to see if the existing standard image codecs such as JPEG and JPEG2000 still make a reasonable difference in performance. The experimental results on standard test images reveal that there is no great difference in performance between the two standard codecs including a few cases where JPEG outperformed JPEG2000.
为了反映人类在图像压缩及其应用中的视觉感知视角，本文提出了一种新的评价图像压缩性能的方法:“No visible difference (NND) is allowed In commercial use”。已经提出并利用各种方法来评估图像压缩性能，对给定的率失真曲线进行客观和主观测量，用于声称编解码器在定量方式上优于另一个。本文通过基于nnd的主观实验，考察JPEG、JPEG2000等现有标准图像编解码器在性能上是否仍然存在合理的差异。在标准测试图像上的实验结果表明，两种标准编解码器的性能没有太大差异，包括少数情况下JPEG优于JPEG2000。
{"title":"No noticeable difference evaluation of image data compression","authors":"E. Jang","doi":"10.1109/ICNIDC.2016.7974626","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974626","url":null,"abstract":"In this paper, a new way of evaluating image compression performance is proposed in order to reflect the human visual perception perspective in image compression and its applications: “No noticeable difference (NND) is allowed in commercial use.” Various methodologies have been proposed and utilized to evaluate image compression performance with both objective and subjective measures for the given rate-distortion curve, which is used to claim that a codec is better than another in a quantitative manner. In this paper, a NND-based subjective experiment is carried out to see if the existing standard image codecs such as JPEG and JPEG2000 still make a reasonable difference in performance. The experimental results on standard test images reveal that there is no great difference in performance between the two standard codecs including a few cases where JPEG outperformed JPEG2000.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133916428","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974596
Hayato Iwata, M. Abe, M. Kawamata
This paper proposes a fast estimation method of subpixel displacement of images using the phase-only correlation with chirp transform algorithm. The subpixel displacement estimation using phase-only correlarion has high robustness and accuracy but requires high computational cost. The chirp transform is used to the subpixel displacement estimation to reduce the computational cost when the range of displacement to be estimated is limited to small area. The proposed method is applied to the displacement estimation of images, and is able to reduce computation time to 1/3 of that of a conventional method.
{"title":"Fast subpixel displacement estimation for images using chirp transform algorithm","authors":"Hayato Iwata, M. Abe, M. Kawamata","doi":"10.1109/ICNIDC.2016.7974596","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974596","url":null,"abstract":"This paper proposes a fast estimation method of subpixel displacement of images using the phase-only correlation with chirp transform algorithm. The subpixel displacement estimation using phase-only correlarion has high robustness and accuracy but requires high computational cost. The chirp transform is used to the subpixel displacement estimation to reduce the computational cost when the range of displacement to be estimated is limited to small area. The proposed method is applied to the displacement estimation of images, and is able to reduce computation time to 1/3 of that of a conventional method.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133937501","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
扫码关注我们
求助内容：
应助结果提醒方式：