{"title":"A study on non-octave scalable coding with filter bank and its performance evaluation using EBCOT","authors":"T. Nakachi, T. Sawabe, J. Suzuki, T. Fujii","doi":"10.1109/ISCIT.2004.1413835","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1413835","url":null,"abstract":"JPEG2000, an international standard for still image compression, has various features, such as high coding performance, unified lossless/lossy compression, resolution scalability and SNR scalability. Resolution scalability is an especially promising feature. Unfortunately, the current implementation of resolution scalability is restricted to powers of two. We propose non-octave scalable coding. Two types of non-octave scalable coding are implemented. One is based on a DCT filter bank and the other uses a wavelet transform. The latter model is compatible with JPEG2000, part 2. By using the proposed algorithm, images of various resolutions can be decoded from a compressed bit stream. Experimental results show the effectiveness of the proposed algorithm.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115657594","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 case study on freshness based scoring for fresh information retrieval","authors":"N. Sato, M. Uehara, Y. Sakai","doi":"10.1109/ISCIT.2004.1412481","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412481","url":null,"abstract":"For most businesses, fresh information retrieval is very important. However, it is difficult for conventional search engines based on centralized architecture to retrieve really fresh information, because they take a long time to collect documents via Web robots. In contrast to a centralized architecture, a search engine based on a distributed architecture does not need to collect documents, because each site independently makes an index. As a result, distributed search engines can retrieve really fresh information. However, fast indexing is not enough to easily retrieve fresh information. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance; so, we proposed FTF-IDF (fresh term frequency multiplied by inverse document frequency) as a scoring method that considers both freshness and relevance. In this paper, we describe a verification of FTF-IDF on an actual Web diary.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114544847","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":"Two-valued and three-valued integrand codes for real-valued self-orthogonal finite-length sequence","authors":"Y. Tanada, Peng Shao, Y. Fujii","doi":"10.1109/ISCIT.2004.1412849","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412849","url":null,"abstract":"A real-valued self-orthogonal finite-length sequence has a zero sidelobe autocorrelation function, but requires linearity of the transmitter amplifier. The paper proposes two-valued and three-valued integrand codes in order to transmit the real-valued self-orthogonal finite-length sequence. The codes are integrated through a transmission path and lead to those with a chip waveform similar to a one-cycle sine pulse. The correlation output for the three-valued integrand code takes a lower sidelobe error than that for the two-valued integrand code.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601348","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":"Space-time multi-user detection techniques for CDMA communication systems","authors":"N. Kaewpraek, C. Chayawan","doi":"10.1109/ISCIT.2004.1412449","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412449","url":null,"abstract":"In this paper, we have proposed the method of Davidon-Fletcher-Powell (DFP) to solving the problem of multiuser detection (MUD). It can be shown that DFP significantly improves the performance of MUD by reducing the number of iterations and residual error. This technique also provides rapid convergence to the optimal value. The simulation shows that the DFP method can improve up to 30% of performance with 3-dB SNR.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126162860","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":"Throughput analysis of IEEE 802.11e wireless LANs and efficient block ack mechanism","authors":"Il-Gu Lee, Hyung-Joun Yoo, Sin-Chong Park","doi":"10.1093/ietcom/E88-B.1.402","DOIUrl":"https://doi.org/10.1093/ietcom/E88-B.1.402","url":null,"abstract":"In the recent draft of the 802.11e MAC (IEEE, Aug. 1999), the hybrid coordinator (HC) gives transmission opportunity (TXOP) for a station to transmit burst frames in TXOP for improving throughput efficiency. In this paper, we express the expected throughput for the block ack policy in polled TXOP as a closed form function of the number of burst MSDUs, the number of fragmented MPDUs, the data payload length, the frame retry count, the wireless channel condition, and the selected PHY mode. Based on our simulation study and analysis, we show that the TXOP and proper ack policy can enhance system performance, and that there are the block ack efficient block size and frame length to transmit the burst frames for each PHY mode. Moreover, we also show that when the block ack mechanism is combined with link adaptation, it has better throughput performance.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765708","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}
S. Imaeda, S. Kobashi, Y. Kitamura, K. Kondo, Y. Hata, T. Yanagida
{"title":"Analysis of ER-fMRI time series with modified mother wavelet","authors":"S. Imaeda, S. Kobashi, Y. Kitamura, K. Kondo, Y. Hata, T. Yanagida","doi":"10.1109/ISCIT.2004.1413837","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1413837","url":null,"abstract":"Investigating the shape and time to a peak, called the HR delay, of hemodynamic response (HR) gives a novel tool to analyze human brain function. We have previously proposed an analysis method for detecting activated areas and measuring HR delay simultaneously. We improve the performance of the method by modifying a mother wavelet. The modified mother wavelet is based on an HR function defined mathematically by the SPM (statistical parametric mapping) software by K.J. Friston et al. (see Human Brain Mapping, vol.2, p.189-210, 1995). To evaluate the proposed method, it and conventional methods are applied to phantom data and data from human subjects. The results indicate that the proposed method could detect activated areas equivalent to those found by conventional methods, and more accurately.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127575576","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":"Using projection and loop for segmentation of touching Thai typewritten","authors":"S. Watcharabutsarakham","doi":"10.1109/ISCIT.2004.1412896","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412896","url":null,"abstract":"This paper proposes a segmentation technique for touching Thai typewritten characters. Thai characters vary in size and position when they are in a sentence. A Thai word is composed of consonants, vowels and tones. Touching characters can occur both in horizontal and vertical directions. The proposed technique uses structural characteristics to detect suitable segmentation points in both directions. The segmentation process consists of four steps. First the height and then the position of characters are used to identify character zones. Next, size and both horizontal and vertical projections are used to classify the types of touching. Lastly, touching characters are segmented using directions and positions identified by the previous steps. The edge of touching characters is used to identify the edge of two isolated characters. The proposed segmentation technique is tested with both electronic typewriters and manual portable typewriters. Segmentation accuracy of 95.4% has been obtained for two hundred sentences of typewritten thesis documents.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131535642","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":"Evaluation of the new feature types for question classification with support vector machines","authors":"Marcin Skowron, Kenji Araki","doi":"10.1109/ISCIT.2004.1413873","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1413873","url":null,"abstract":"Question classification is of crucial importance for question answering. In question classification, the accuracy of machine learning algorithms was found to significantly outperform other approaches. The two key issues in classification with a ML-based approach are classifier design and feature selection. Support vector machines is known to work well for sparse, high dimensional problems. However, the frequently used bag-of-words approach does not take full advantage of information contained in a question. To exploit this information we introduce three new feature types: subordinate word category, question focus and syntactic-semantic structure. As the results demonstrate, the inclusion of the new features provides higher accuracy of question classification compared to the standard bag-of-words approach and other ML based methods such as SVM with the tree kernel, SVM with error correcting codes and SNoW. A classification accuracy of 84.6% obtained using the three introduced feature types is as of yet the highest reported in the literature.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442956","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":"Elliptic curve scalar point multiplication using radix-4 Booth's algorithm [cryptosystems]","authors":"Sangook Moon","doi":"10.1109/ISCIT.2004.1412454","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412454","url":null,"abstract":"The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the top level of GF (Galois field) multiplication and GF division, has been the double-and-add algorithm, which is being recently challenged by the NAF (non-adjacent format) algorithm. In this paper, we propose a more efficient and novel approach of a scalar multiplication method than existing double-and-add by applying redundant recoding which originates from radix-4 Booth's algorithm. We call the novel algorithm quad-and-add. After deriving the algorithm, we created a new GF operation, named point quadruple, and verified it with calculations of a real-world application. The derived numerical expressions were verified using both C programs and HDL (hardware description language). The proposed method can be utilized in many elliptic curve security applications for handling efficient and fast calculations.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448988","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. Nakanishi, Hiroyuki Sakamotot, Naoto Nishiguchit, Yoshio Itoht, Yutaka Fukuil
{"title":"Multi-matcher on-line signature verification in DWT domain","authors":"I. Nakanishi, Hiroyuki Sakamotot, Naoto Nishiguchit, Yoshio Itoht, Yutaka Fukuil","doi":"10.1109/ISCIT.2004.1412897","DOIUrl":"https://doi.org/10.1109/ISCIT.2004.1412897","url":null,"abstract":"The paper presents a multi-matcher on-line signature verification system which fuses the verification scores in the pen-position parameter and the pen-movement angle parameter at the decision level. The pen-position parameter consists of horizontal, x, and vertical, y, coordinates, and the pen-movement angle parameter is derived from the pen-position parameter. Features of pen-position and pen-movement angle are extracted by sub-band decomposition using the discrete wavelet transform (DWT). In pen-position, high frequency sub-band signals are considered as individual features to enhance the difference between a genuine signature and its forgery. On the other hand, low frequency sub-band signals are utilized as features for suppressing the intra-class variation in the pen-movement angle. Verification is achieved by adaptive signal processing using the extracted features. Verification scores in the pen-position and the pen-movement angle are integrated using a weighted sum rule to make the total decision. Experimental results show that fusion of pen-position and pen-movement angle can improve verification performance.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134169627","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}