{"title":"Document skew detection using minimum-area bounding rectangle","authors":"R. Safabakhsh, Shahram Khadivi","doi":"10.1109/ITCC.2000.844226","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844226","url":null,"abstract":"Detection of document skew is an important step in document image analysis. The paper presents a new method for calculation of document skew. The method forms large connected components by a smoothing algorithm and calculates the document skew by finding the orientation of the minimum-area bounding rectangle of one of several connected components. Connection of text to non-text in the smoothing step does not degrade the performance of the method. The smoothing parameters are determined automatically and no manual adjustment is necessary. The method is not limited in the range of detectable skew angles and the achievable accuracy. Experimental results show the high performance of the algorithm in detecting document skew for a variety of documents with different levels of complexity.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115430198","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":"QoS management at the transport layer","authors":"V. Tsaoussidis, S. Wei","doi":"10.1109/ITCC.2000.844244","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844244","url":null,"abstract":"This work reports on further implementation and testing of the Application Oriented Transport Protocol (AOTP). AOTP is an experimental protocol above IP that provides end-to-end transport service with functionality to trade off reliability, throughput and/or jitter in order to support the application layer with the required quality of service. Our protocol, based on QoS tradeoffs, can favor application and/or user-specific QoS characteristics of importance, at the expense of others, less significant. We outline the protocol's specification and mechanisms. AOTP provides an adjustable partially reliable service, priority-based error recovery strategy and dynamic playback management. We have tested the mechanisms using a video transmission application and a simulated, low-bandwidth environment with variable error characteristics. We characterize the tradeoffs associated with these mechanisms; we argue that the application layer can yield significant QoS achievements even within the confines of given environmental constraints, when the transport layer utilizes efficiently the tradeoffs developed in the communication system.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128192722","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":"Implications for high capacity data hiding in the presence of lossy compression","authors":"D. Kundur","doi":"10.1109/ITCC.2000.844177","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844177","url":null,"abstract":"We derive capacity bounds for watermarking and data hiding in the presence of just noticeable difference (JND) perceptual coding for a class of techniques that do not suffer from host signal interference. By modeling the lossy compression distortions on the hidden data using non-Gaussian statistics, we demonstrate that binary antipodal channel codes achieve capacity. It is shown that the data hiding capacity is at most equal to the loss in storage efficiency bit rate if watermarking and quantization for lossy compression occur in the same domain.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128333798","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 new approach for load balancing using differential load measurement","authors":"P. Kulkarni, I. Sengupta","doi":"10.1109/ITCC.2000.844205","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844205","url":null,"abstract":"In distributed systems uneven arrival of the tasks may overload few hosts keeping the rest of the hosts lightly loaded or even idle. This results in overall poor system performance in spite of the system capabilities. To utilize the capabilities of distributed systems load balancing can be used. Load balancing always comes with a lot of overheads. We propose an algorithm based on differential load measurement (DLM) for the load balancing. This algorithm helps us in selecting proper hosts for load balancing which can lead us to performance improvement of the system.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130469800","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":"Projection-based multiuser receiver over frequency selective channels","authors":"Zhengyuan Xu","doi":"10.1109/ITCC.2000.844189","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844189","url":null,"abstract":"In multiuser communication, the receiver's performance is degraded by multiuser interference (MUI) as well as multipath distortions. This paper aims at elimination of these side effects. By projecting the received data onto the orthogonal code space of interfering users, equivalent single user and MUI free data vectors are obtained. Since the projection matrix consists of orthonormal bases, the whiteness of original additive Gaussian noise is still preserved after projection operation. Therefore various detection techniques, e.g., constant modulus algorithm (CMA), subspace, iterative least squares with projection (ILSP), etc. can be successfully applied to estimate transmitted symbols and the multipath channel of the desired user but with reduced complexity and asymptotically optimal performance. The proposed receiver is simulated by ILSP method and its performance compared with the RAKE receiver and the decorrelating receiver. Much lower bit error probability is achieved for a wide range of signal to noise ratios.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125708159","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 unified derivation of operational matrices for integration in systems analysis","authors":"Jiunn-Lin Wu, Chin-Hsing Chen, Chih-Fan Chen","doi":"10.1109/ITCC.2000.844267","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844267","url":null,"abstract":"Using the operational matrix of an orthogonal function to perform integration for solving, identifying and optimizing a linear dynamic system has several advantages: (1) the method is computer oriented, thus solving higher order differential equations becomes a matter of dimension increasing; (2) the solution is a multi-resolution type; (3) the answer is convergent, even the size of increment is very large. The traditional method for deriving the operational matrix is very involved and not unified, this paper presents a new unified approach to deriving the operational matrices of orthogonal functions. We apply it first to the derivation of the operational matrices of the square wave group which consist of (i) the block pulse function, (ii) the Walsh function and (iii) the Haar wavelet function, then to the sinusoidal group which includes (i) the discrete Fourier transform, (ii) the discrete cosine transform and (iii) the discrete Hartley transform. Finally, we use the operational matrices to solve a linear differential equation to demonstrate its usefulness.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256659","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":"Implementation image data convolutions operations in FPGA reconfigurable structures for real-time vision systems","authors":"K. Wiatr, E. Jamro","doi":"10.1109/ITCC.2000.844199","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844199","url":null,"abstract":"In this paper different architectures for real time image constant coefficients convolutions are considered. Accordingly, look-up-table (LUT) based multiplication/convolution, LUT based distributed arithmetic (DA) convolution and multiplierless convolution (MC) implementations into FPGA structures has been investigated. In one result, the choice between these architectures depends on given coefficients values, however in most cases the MC preferable. Furthermore the change of coefficient values in real-time systems is also considered. This work is a contribution to worldwide intense research on developing reconfigurable and user dedicated custom computing machines (CCM).","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131916679","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}
R. Hashemi, D. Owen, Mark S. Smith, T. Flanigan, J. Talburt
{"title":"The effects of image enhancement in OCR systems: a prototype","authors":"R. Hashemi, D. Owen, Mark S. Smith, T. Flanigan, J. Talburt","doi":"10.1109/ITCC.2000.844276","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844276","url":null,"abstract":"The accuracy of the optical character recognition (OCR) systems is highly dependent upon the quality of the image. We investigate and propose solutions to several issues that can arise in the processing of binary images of scanned, typeset text. The issues of concern are image residues from adjacent lines, character touching, boldface character recognition, and text repairing.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134109989","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":"Dequantization bias for JPEG decompression","authors":"J. R. Price, M. Rabbani","doi":"10.1109/ITCC.2000.844179","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844179","url":null,"abstract":"Standard JPEG decompression reconstructs quantized DCT coefficients to the center for the quantization bin. This fails to exploit the nonuniform distribution of the AC coefficients. Assuming a Laplacian distribution, we derive a maximum likelihood estimate of the Laplacian parameter, based on the quantized coefficients available at the decoder, and use this estimate to optimally bias the reconstruction levels during decompression. As a decoder enhancement, this technique is fully compatible with the JPEG standard and does not modify the JPEG compressed bit stream. Extensive simulations indicate that, at typical compression ratios, biased reconstruction results in modest PSNR improvements-about 0.25 dB or higher-and slight subjective improvements, for little or no computational cost. Furthermore, simulations show that the PSNR improvements are very close (within 0.07 dB) to the best theoretically possible.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133939197","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":"Energy-efficient indexing on a broadcast channel in a mobile database access system","authors":"Y. C. Chehadeh, A. Hurson, L. Miller","doi":"10.1109/ITCC.2000.844251","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844251","url":null,"abstract":"Advances in communication and computation technologies and the recent marriage between the two allows users to have access to information sources via portable, mobile computing devices, and wireless connection. Broadcasting has been suggested as a possible solution for several limitations within this new environment. In order to limit the amount of energy consumed at the mobile unit, indexing can be considered as an energy-efficient solution within the broadcasting environment. In this work, we suggest possible allocation strategies of indexes along with their data objects (for an object-oriented database environment) on the broadcast channel. We conduct the timing analysis and simulation necessary to observe the effects of the allocation strategies on both the response time and energy consumption at the mobile clients.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130190692","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}