{"title":"Converting DN value to reflectance directly by relative radiometric normalization","authors":"Changmiao Hu, Ping Tang","doi":"10.1109/CISP.2011.6100483","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100483","url":null,"abstract":"An automatic algorithm for relative radiometric normalization is presented. It directly normalizes the digital numbers (DN) of images band-by-band to surface reflectance. A united linear relationship from DN of target images to surface reflectance of reference images is derived and the applicable conditions are given. The iteratively re-weighted multivariate alteration detection (IR-MAD) transformation is used to select pseudo-invariant features (PIFs) automatically. The procedure is simple, fast and completely automatic. The algorithm is applied to normalize two Landsat TM images, and the result is satisfactory in both accuracy and consistency.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124515166","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":"Research on RFID tag anti-collision algorithm","authors":"Du Huai-chang","doi":"10.1109/CISP.2011.6100777","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100777","url":null,"abstract":"Radio Frequency Identification (RFID) technology is a radio frequency signal using automatic target recognition and access to relevant information technology is now involved in all aspects of daily life. But it can lead to incorrect data reading because of collision. Tag anti-collision is one of the key problems of RFID system. The techniques of Time Division Multiple Access (TDMA) can solve this problem. There are several anti-collision algorithms, such as Aloha, Slotted Aloha, binary search, dynamic binary search and so on. We analysis and research various anti-collision algorithms and compare the differences between each other, and to obtain the most efficient algorithm. By comparing them, we can obtain the most efficient algorithms.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071330","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}
Lei Li, Jun Zhao, Danfeng Zhang, Lin Lu, Zhizhong Wang
{"title":"Virtual lumen insufflation and its application in virtual endoscopy","authors":"Lei Li, Jun Zhao, Danfeng Zhang, Lin Lu, Zhizhong Wang","doi":"10.1109/CISP.2011.6100551","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100551","url":null,"abstract":"In this paper, we present a virtual lumen insufflation algorithm and its applications in virtual endoscopy of both pipe-like and non-pipe-like organs. The surface of the lumen outer wall was modeled as isotropic elastic shell elements. The insufflation procedure was simulated by nonlinear finite element method with a constant air pressure exerted on the interior of the shell. The deformation of the inner surface of the lumen was implemented by thin plate spline based kernel transformation. Experiments with both phantom and ten CT data sets were designed to validate the effectiveness of the proposed algorithm. The results show the insufflated lumen is helpful in extending visual field, and extracting exact centerline. Therefore, it will improve visualization quality of virtual straightening, unfolding, and eversion. Compared to the real insufflation, the virtual insufflation can be performed on any kind of surfaces without the closed requirement, and does not change the status of the inner surface. The virtual insufflation will be an effective complement of the real insufflation, especially in some organs, such as blood vessel and bladder, that are unsuitable or hard to insufflate, and some patients who have perforations with increasing risk if performing insufflation.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127641994","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":"Fast inter-view prediction and mode selection for multiview video coding","authors":"Wei Zhu, Peng Chen, Yayu Zheng, Jie Feng","doi":"10.1109/CISP.2011.6100006","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100006","url":null,"abstract":"Multiview video coding (MVC) compresses the multiview video for efficiency storage and transmission, and it has been standardized as a recent extension of the H.264/AVC. In this paper, a fast inter-view prediction and mode selection algorithm is proposed to reduce the heavy computational complexity of MVC. First, partition activity of Inter modes is calculated by using the optimal Intra mode. Then, inter-view prediction is determined by employing the partition activity and the textural complexity of depth. Finally, Inter modes are selected by utilizing the partition activity and the textural complexity of pixels. As compared to the full mode decision, experimental results show that the proposed algorithm achieves 68% time saving on average with negligible loss of rate-distortion performance. As compared to the state-of-the-art fast algorithm, the proposed algorithm obtains higher and more stable time saving over a wide range of quantization parameters for different test sequences.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127647671","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":"Image database encoding using HYBRID video encoder","authors":"Jimin Xiao, T. Tillo, Xuan Zhang","doi":"10.1109/CISP.2011.6100260","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100260","url":null,"abstract":"How to compress a set of images in an efficient way is one of the most popular research topics. Currently, one of the most preferred standards for compressing still images is JPEG2000 which mainly utilizes Discrete Wavelet Transformation. The video compression standard AVC/H.264, however, can also be applied to compress a set of still images. It has been proved that H.264 Intra Mode has similar or even better compression performance than JPEG2000 in terms of PSNR. This paper proposes an innovative approach that mainly depends Inter Prediction Mode of H.264, to compress a set of still images. Considering different compression performances for different image sequences, this paper also proposes an algorithm to determine the optimal sequence of images that helps Inter Prediction Mode to gain better performance. Experimental results reveal that H.264 Inter Prediction Mode outperforms JPEG2000 in terms of PSNR. The gain of H.264 can be further enhanced when the sequence of images is rearranged according to the images sequencing algorithm proposed in this paper.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127726099","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 fast image coding algorithm based on lifting wavelet transform","authors":"Xuechun Wang, Shenxiao Liu, Fang Han","doi":"10.1109/CISP.2011.6100373","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100373","url":null,"abstract":"In order to make the image compression algorithm have higher compression ratio and better image recovery quality, based on SPIHT algorithm analysis, an efficient image coding algorithm FSPIHT(Fast Set Partitioning In Hierarchical Trees) has been proposed. The algorithm introduces the lifting wavelet and a wavelet basis (V9/3) based on human visual system, the classification of LIS (the List of Insignificant Sets) is deleted in the new compression algorithm, the hierarchical trees in wavelet decomposition are coded equally from son generation to grandson generation. The experimental result proves that the rebuilt image of this algorithm has better visual effect and moreover improves coding speed.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422258","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 research on stereo matching algorithm for underwater image","authors":"Huibin Wang, H. Sun, Jie Shen, Zhe Chen","doi":"10.1109/CISP.2011.6100367","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100367","url":null,"abstract":"To realize the accuracy and stability of the underwater binocular image matching, this paper design a stereo matching algorithm based on Harris corner detection. Firstly, apply median and homomorphic filtering for underwater stereo image preprocessing to minimize noise and enhance image contrast. Secondly, apply the corner feature extraction and matching method based on Harris for obtaining the characteristic information of underwater target. And then apply the constraint condition to eliminate the error matched points, so as to improve the underwater image matching stability. Finally, the experiments verify the algorithm proposed in this paper, and the experimental results have shown the effectiveness of this algorithm.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126546395","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":"Effective methods for Brinell Hardness Measure based on vision","authors":"Jie Jiang, Jian Dong","doi":"10.1109/CISP.2011.6100587","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100587","url":null,"abstract":"In the Brinell Hardness Measure System based on vision, the measuring accuracy is greatly influenced by the huge interference, strong noises and non-smooth indentation edge in the indentation image amplified by object glass because of too many scratches on the surface and too small indentation of the metal block to be measured. In order to calibrate the practical pixel length, a standard gauge block and the Least Squares Method are adopted to fit the line of the block's edge. In the process of extracting the indentation diameter, the method based on region growing is utilized to segment the image and then, the circle detection method based on Existence Probability is applied to detect the indentation edge. The experiment testifies that these methods, which have better real-time performance and robustness, can better recover indentation edge and acquire indentation diameter.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128172131","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 line matching method based on local and global appearance","authors":"Yueqiang Zhang, Heng Yang, Xiaolin Liu","doi":"10.1109/CISP.2011.6100414","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100414","url":null,"abstract":"This paper proposes a line matching method based on both local neighborhood gradient and global structure information of lines. Firstly we generate an initial set of line segment correspondences using our improved Mean Standard Deviation Line Descriptor (MSLD). Then candidate matches those violate the global topological structure of lines are removed to eliminate wrong matches. Finally iterative topological filter is used to search for more matches, whilst global angle constrains are implemented to get rid of wrong matches and make the algorithm more efficient. Experiments show that the proposed method is highly robust under the conditions of heavy illumination change, rotation, image blur, viewpoint change, scale change, etc. Comparisons on image database demonstrate that our method greatly outperforms the state-of-art methods in matching accuracy and efficiency.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125640474","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}
Li-Qin Jia, Cheng-Zhang Peng, Hong-Min Liu, Zhi-Heng Wang
{"title":"A fast randomized circle detection algorithm","authors":"Li-Qin Jia, Cheng-Zhang Peng, Hong-Min Liu, Zhi-Heng Wang","doi":"10.1109/CISP.2011.6100372","DOIUrl":"https://doi.org/10.1109/CISP.2011.6100372","url":null,"abstract":"In this paper, we present a fast randomized circle detection algorithm applied to determine the centers and radii of circular components. Firstly, the gradient of each pixel in the image is computed using Gaussian template. Then, the edge map of the image, obtained by applying canny edge detector, is tackled to acquire the curves consisting of 8-adjacency connected edge points. Subsequently, for the detection of the center, N edge points for each curve are picked up, and the point, passed through by the most gradient lines of the edge points, corresponds to a center. The radius can be received by computing the distance between the center and the corresponding edge points. The algorithm performs much better in terms of efficiency compared to randomized circle detection algorithm (RCD), in which a mass of accumulations are done by random sampling. Synthetic images and natural images are used to test the capability of the proposed algorithm. The experimental results indicate that the presented algorithm consumes less computing resources, has excellent performance for detection of single circle, multiple circles, concentric circles, partial circles and overlapped circles, and also has good accuracy despite the presence of different noises and interference.","PeriodicalId":301048,"journal":{"name":"2011 4th International Congress on Image and Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761478","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}