{"title":"On the Sensitivity of Two-Channel IIR Filter Banks with Variable Crossover Frequency","authors":"J. Ćertić, L. Milic","doi":"10.1109/ISPA.2007.4383669","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383669","url":null,"abstract":"In this paper, we investigate the sensitivities of the magnitude responses for the two classes of two-channel IIR filter banks. The term class I denotes the IIR filter pair implemented as a parallel connection of two all-pass filters, whereas class II stays for the tapped cascaded interconnection of two identical all-pass filters. A simple tuning scheme that shifts the crossover frequency of the start-up IIR half-band filter pair to the desired location has been introduced recently. In this paper, we concentrate on the effects, which appear when the finite-precision arithmetic is used to implement the tuning formulae. For the two classes of two-channel IIR filter banks, we demonstrate by means of examples the sensitivities of the magnitude frequency characteristics, and show the effects of those sensitivities to the accuracy of the tuning procedure.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134600259","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 Mathematical Model to Estimate Out of Focus Blur","authors":"M. Moghaddam","doi":"10.1109/ISPA.2007.4383705","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383705","url":null,"abstract":"Blur identification is one of the most important parts of image restoration. The most conventional blur that occurs in images is out of focus, which is generated because of lens defocus. In this paper, a new method is presented to estimate out of focus blur parameters robustly. This method is based on mathematical modeling of zero crossing in log of Fourier spectrum. We have presented a formula to calculate out of focus blur parameters using circular hough transform and statistical measures. Experimental results show the error tolerance of the method is about 2% and this works on noisy images with SNR ges 55 dB, robustly.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"12 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133461740","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}
Xiang Wang, Wanli Pei, Wei Lei, Xuemei Yu, Ikdong Kim, W. Wolf
{"title":"A Kind VLSI Design of Vector Quantization Algorithm for Image Compression","authors":"Xiang Wang, Wanli Pei, Wei Lei, Xuemei Yu, Ikdong Kim, W. Wolf","doi":"10.1109/ISPA.2007.4383709","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383709","url":null,"abstract":"The VLSI architecture is simulated and verified on a FPGA device successfully. The design is described at RTL level using Verilog HDL. Based on Altera Cyclone device EP1C12Q240C8, synthesis and post-simulation are conducted with Quartus II 4.2 and Modelsim SE Plus 5.8b. For the synthesized device 38% of the logic resource and 20% of the memory is used. The maximum clock frequency is 100.52 MHz. A new fast search algorithm for VQ which is appropriate for hardware implementation is proposed in this paper. In the new search algorithm, the codebook and the input image vectors are classified into three groups: horizontal (H), vertical (V) and even (E). The algorithm is simulated functionally and verified on FPGA. Verification result indicates that the new searching algorithm is more effective for hardware implementation and has higher speed. When the frequency is 50 MHz, the device can compress a 512times512 grayscale still image in 10 ms. The compression ratio is 16:1 and the quality of the reconstructed image is high. Furthermore, with some modification the encoding system can easily handle real-time video even color images.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116539877","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":"Low-Complexity Constant Multiplication Using Carry-Save Arithmetic for High-Speed Digital Filters","authors":"O. Gustafsson, L. Wanhammar","doi":"10.1109/ISPA.2007.4383692","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383692","url":null,"abstract":"In this work we discuss the realization of constant multiplication using a minimum number of carry-save adders. We consider both non-redundant and carry-save representation for the input data. For both cases we present all possible interconnection topologies, using up to six and five adders, respectively. These are sufficient to realize constant multiplications for all coefficients with a wordlength up to 19 bits.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122223344","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":"Rotation Angle Estimation Algorithms for Textures and Their Real-Time Implementation on the FU-SmartCam","authors":"C. Ulas, S. Demir, O. Toker, K. Fidanboylu","doi":"10.1109/ISPA.2007.4383739","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383739","url":null,"abstract":"In this paper, we study rotation angle estimation algorithms for textures and discuss their real-time implementation on the FU-SmartCam. Rotation angle estimation for textures is closely related to the weft-straightening problem encountered in the textile industry. Earlier weft-straightening machines were based on simpler sensors and hardware, but with the increased complexity of fabric types, and demand for faster and more accurate machines, the whole industry started to switch to real-time machine vision based systems. For example, one of the leading companies in this area, Erhardt+Leimer, started to implement realtime machine vision systems based on the tattile smart camera. In this work, we both study rotation angle estimation algorithms for textures, and their real-time implementation on the locally developed Fatih University smart camera (FU-SmartCam). We also compare the FU-SmartCam with the tattile smart camera used in the Erhardt+Leimer system, both in terms of hardware and ease of prototyping.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123882033","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":"Properties of a Natural Ordering Relation for Octagonal Neighborhood Sequences","authors":"A. Fazekas, A. Hajdu, L. Hajdu","doi":"10.1109/ISPA.2007.4383684","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383684","url":null,"abstract":"Neighborhood sequences play an important role in several branches of discrete geometry and image processing. The literature of such sequences is very wide. In this paper we give a survey on results on a natural partial ordering relation for generalized nD octagonal neighborhood sequences. As this ordering does not have nice properties for each subset of such neighborhood sequences, we also investigate another relation and provide several properties for it. We put special emphasize on neighborhood sequences which generate metrics on Zn. In certain applications it can be useful to compare any two neighborhood sequences -however, none of these partial orderings is a total ordering. For this purpose, we investigate a norm-like concept, called velocity, which fits very well to the natural ordering relation. We also define a metric for neighborhood sequences, and investigate its properties.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125527971","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}
I. Dindoyal, T. Lambrou, Jing Deng, Andrew Todd-Pokropek
{"title":"Automatic segmentation of low resolution fetal cardiac data using snakes with shape priors","authors":"I. Dindoyal, T. Lambrou, Jing Deng, Andrew Todd-Pokropek","doi":"10.1109/ISPA.2007.4383751","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383751","url":null,"abstract":"This paper presents a level set deformable model to segment all four chambers of the fetal heart simultaneously. We show its results in 2D on 53 images taken from only 8 datasets. Due to our lack of sufficient data we built only a mean template from the training data instead of a full active shape model. Using rigid registration the template was registered to unseen images and the snakes were guided by individual chamber priors as they evolved in unison to segment missing cardiac structures in the presence of high noise. Using a leave one out approach most of the segmentation errors are within 3 pixels of manually traced contours.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124425980","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":"Theory of Neighborhood Sequences on Hexagonal Grids","authors":"B. Nagy","doi":"10.1109/ISPA.2007.4383725","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383725","url":null,"abstract":"In this paper distances based on neighborhood sequences in hexagonal grid are analysed. From every vertex of the grid one can step to various neighbors directed by a neighborhood sequence, which allows to vary the used neighborhood relations step by step. The distances of two vertices are defined as the lengths of shortest paths between them. Theoretic results, such as algorithm to provide a shortest path, computing the distance and properties of distances are shown. Necessary and sufficient condition to have metric distance is proven. Digital circles and discs are described as well.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123290210","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}
Zhenyu Liu, Yang Song, Yiqing Huang, Lingfeng Li, S. Goto, T. Ikenaga
{"title":"Edge Gradient Based Fast Inter Motion Estimation for H.264/AVC","authors":"Zhenyu Liu, Yang Song, Yiqing Huang, Lingfeng Li, S. Goto, T. Ikenaga","doi":"10.1109/ISPA.2007.4383663","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383663","url":null,"abstract":"H.264/AVC coding standard processes variable block size (VBS) motion estimation(ME) on multiple reference frames (MRF) to improve the coding gain. However, the computation is also increased in proportion to the product of the reference frame number and the inter modes. Through mathematical analysis, it is illustrated that the motion-compensated prediction error is mainly determined by the edge gradient amplitude. The image block being rich of texture and sharp edges contains much high frequency signal and this nature makes VBS MRF ME essential. The spatial homogeneity of a block is decided by its maximum edge gradient and its threshold for the edge gradient detection, which is 5 times quantization parameter (QP), is derived from rate-distortion theory. For the homogenous block, its ME computation for the futile reference frames and inter modes can be saved. Through evaluating the edge gradient, the block motion speed can be estimated to reduce the search area of integer ME. Based on the homogeneity of one 8times8 block, its Lagrangian Multiplier is also optimized to improve the coding quality. Moreover, we also provide a fast 'skip_mb' detection algorithm based on Hadamard coefficients and the current QP. Experimental results show that 61.4%-88.9% computation can be saved by our approaches with the competitive coding quality as the exhaustive search algorithm.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"11 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124234214","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}
Zhenwei Su, Jinwei Wang, Ming-Deng Huang, Chunhua Gao, M. Petrou
{"title":"A machine vision system with an irregular imaging function","authors":"Zhenwei Su, Jinwei Wang, Ming-Deng Huang, Chunhua Gao, M. Petrou","doi":"10.1109/ISPA.2007.4383737","DOIUrl":"https://doi.org/10.1109/ISPA.2007.4383737","url":null,"abstract":"Traditional machine vision systems sample images at a fixed resolution and a presetting speed in one inspection. When detecting small defects in a large background, there is usually a large amount of redundancy in the image data. To solve this problem, a machine vision system with an irregular imaging function is presented in the paper. The system can irregularly sample images with a high resolution in the defect area and a low resolution in the background area, which reduces the total data in image processing and increases the speed and accuracy of real-time inspection significantly.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132671686","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}