发布求助
文献互助 智能选刊 最新文献

3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the最新文献

筛选
英文 中文
Position based watermarking 位置水印
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296425
P. Borges, J. Mayer
{"title":"Position based watermarking","authors":"P. Borges, J. Mayer","doi":"10.1109/ISPA.2003.1296425","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296425","url":null,"abstract":"This paper proposes a block based watermarking scheme where the information is associated to watermark blocks positions in a host image. Considering a digital image of size N/spl times/M there are many possibilities (given by the combination expression) as how to combine a given number of watermarks. For each of these possibilities, it can be assigned a bit string, making use of a coding scheme. The detector searches in the image for k positions that present the highest correlation to watermark blocks, determining where in the image these blocks were embedded. The decoding process relates these positions to a bit string. Also evaluate this technique regarding perceptual impact and show that for the same number of inserted bits use less energy if compared with other watermarking methods.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125726338","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}
引用次数: 8
A video compression technique using zerotree wavelet and hierarchical finite state vector quantization 基于零树小波和分层有限状态矢量量化的视频压缩技术
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296914
I. Kilic, R. Yilmaz
{"title":"A video compression technique using zerotree wavelet and hierarchical finite state vector quantization","authors":"I. Kilic, R. Yilmaz","doi":"10.1109/ISPA.2003.1296914","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296914","url":null,"abstract":"In this paper a video compression technique with comparable low bit rates is presented. The overlapping block motion compensation is combined with discrete wavelet transform which followed by Lloyd Max quantization and zerotree structure. The novel feature of this coding scheme is the combination of hierarchical finite state vector quantization (HFSVQ) with the zerotree structure to encode the quantized wavelet coefficients. In the first stage of our simulation, the intra frame coding using MPEG4-VM, EZW, ZTE and ZTW-HFSVQ are compared at QCIF resolution. In the second stage, MPEG4-VM, EZW, ZTE and H263 are compared with the introduced ZTW-HFSVQ scheme for P-frames. The simulation results are presented in comparison with those scheme mentioned above. It shows that the proposed coding scheme performs better than the other schemes for both I and P frames.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642539","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}
引用次数: 3
Online identification of hidden semiMarkov models 隐半马尔可夫模型的在线辨识
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296424
M. Azimi, P. Nasiopoulos, R. Ward
{"title":"Online identification of hidden semiMarkov models","authors":"M. Azimi, P. Nasiopoulos, R. Ward","doi":"10.1109/ISPA.2003.1296424","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296424","url":null,"abstract":"Hidden Markov models (HMM) are a powerful tool in signal modelling. In an HMM, the probability that signal leaves a state is constant, and hence the duration that signal stays in each state has an exponential distribution. However, this exponential density is not appropriate for a large class of physical signals. Hence, a more sophisticated model, called hidden semiMarkov models (HSMM), are used where the state durations are modelled in some form. This paper presents new signal model for hidden semiMarkov models. This model is based on state duration dependant transition probabilities, where the state duration densities are modelled with parametric distribution functions. An adaptive algorithm for online identification of HSMMs based on our signal model is presented. This algorithm is based on the 'recursive prediction error' technique, where the parameter estimates are updated adaptively in a direction that maximizes the likelihood of parameter estimates. From the numerical results it is shown that the proposed algorithms can successfully estimate the true value of parameters. These results also show that our algorithm can adaptively track the parameter's changes in time.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121988898","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}
引用次数: 6
Widening the remote visualization bottleneck 扩大远程可视化瓶颈
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296889
S. Stegmaier, Joachim Diepstraten, Manfred Weiler, T. Ertl
{"title":"Widening the remote visualization bottleneck","authors":"S. Stegmaier, Joachim Diepstraten, Manfred Weiler, T. Ertl","doi":"10.1109/ISPA.2003.1296889","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296889","url":null,"abstract":"With the advent of generic remote visualization solutions, accessing distant graphics resources from the desktop is no longer restricted to specially tailored applications. However, current solutions still suffer from poor interactivity due to limited network bandwidth and high latency. In this paper we present several improvements to our remote visualization system in order to overcome these drawbacks. Different image compression schemes are evaluated with regard to applicability for scientific visualization, showing that image compression alone cannot guarantee interactive frame rates. Therefore, we furthermore present different techniques for alleviating the bandwidth limit, including quality reduction during user interaction or animations. Latency aspects are addressed by employing multi-threading for asynchronous compression and utilizing features of modern programmable graphics adapters for performing the image compression entirely or the graphics card. The presented ideas are integrated in our remote visualization system without violating universality.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124733101","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}
引用次数: 50
Java-based tool for synthetic aperture radar image analysis 基于java的合成孔径雷达图像分析工具
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296478
C. Huallparimachi, D. Rodríguez
{"title":"Java-based tool for synthetic aperture radar image analysis","authors":"C. Huallparimachi, D. Rodríguez","doi":"10.1109/ISPA.2003.1296478","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296478","url":null,"abstract":"This paper describes the design and development of a Java-based distributed system tool-environment for image analysis with special attention given to synthetic aperture radar (SAR) imaging applications. This tool-environment allows a given user to effect important image processing functions such as to visualize, manipulate, improve, filter, detect edges, reduce the noise, as well as to carry out raw data formatting, image formation operations, Kronecker array filtering, and feature extraction on SAR images. Also, this system has the unique option of allowing end-users to add their own customized algorithms as encapsulated operators to act on elements resident on local or remote SAR images-servers on a computer network.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124845986","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}
引用次数: 3
A robust singing melody tracker using adaptive round semitones (ARS) 一个强大的歌唱旋律跟踪器使用自适应圆形半音(ARS)
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296957
Chong-kai Wang, Ren-Yuan Lyu, Yuang-Chin Chiang
{"title":"A robust singing melody tracker using adaptive round semitones (ARS)","authors":"Chong-kai Wang, Ren-Yuan Lyu, Yuang-Chin Chiang","doi":"10.1109/ISPA.2003.1296957","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296957","url":null,"abstract":"In this paper, an approach for melody tracking is proposed and applied to applications of automatic singing transcription. The melody tracker is based on adaptive round semitones (ARS) algorithm, which converts a pitch contour of singing voice to a sequence of music notes. The pitch of singing voice is usually much more unstable than that of musical instruments. A poor-skilled singer may generate voice with even worse pitch correctness. ARS deals with these issues by using a statistic model, which predicts singers' tune scale of the current note dynamically. Compared with the other approaches, ARS achieves the lowest error rate for poor singers and seems much more insensitive to the diversity of singers' singing skills. Furthermore, by adding on the transcription process a heuristic music grammar constraints based on music theory, the error rate can be reduced 20.5%, which beats all the other approaches mentioned in the other literatures.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125239517","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}
引用次数: 8
A new algorithm for radar emitter recognition 雷达辐射源识别的一种新算法
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296468
H. Hassan
{"title":"A new algorithm for radar emitter recognition","authors":"H. Hassan","doi":"10.1109/ISPA.2003.1296468","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296468","url":null,"abstract":"A radar electronic support measures (ESM) system performs the functions of threat detection and area surveillance. The received radar pulses are sorted and segregated by the deinterleaver into a number of radar cells depending on the measured parameters of the received pulses. These radar cells will be submitted to the threat library and compared with the stored parameters of known radars to determine the identity of the estimated radar cells and take appropriate actions against them. However, if the deinterleaver does not work properly, a number of false radars will be generated and some of the military resources may be used against false threats. This paper proposes a method for evaluating the quality of the deinterleaved radar cells by applying a new approach of performing the deinterleaving of radar pulses and identifying their corresponding radars into one step. By applying the proposed method, the high quality deinterleaved cells will be only submitted to the thereat library of the electronic warfare (EW) system to identify their corresponding radars. Thus, avoiding the waste of limited resources against false radars.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125593541","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}
引用次数: 15
Using texture to annotate remote sensed datasets 利用纹理对遥感数据集进行标注
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296871
S. Newsam, Lei Wang, S. Bhagavathy, B. S. Manjunath
{"title":"Using texture to annotate remote sensed datasets","authors":"S. Newsam, Lei Wang, S. Bhagavathy, B. S. Manjunath","doi":"10.1109/ISPA.2003.1296871","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296871","url":null,"abstract":"Texture remains largely underutilized in the analysis of remote sensed datasets compared to descriptors based on the orthogonal spectral dimension. This paper describes our recent efforts towards using texture to automate the annotation of remote sensed imagery. Two applications are described that use the homogeneous texture descriptor recently standardized by MPEG-7. In the first, higher-level access to remote sensed imagery is enabled by using the texture descriptor to model geo-spatial objects. In particular, the common textures, or texture motifs, are characterized as Gaussian mixtures in the high-dimensional feature space. In the second application, the texture descriptor is used to label regions in a large collection of aerial videography in a perceptually meaningful wax. Gaussian mixtures are used to model the distribution of feature vectors for a variety of semantic classes. Frame level similarity retrieval based on semantic layout and semantic histogram is enabled by modeling the spatial arrangement of the labeled regions as a Markov random field.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066801","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}
引用次数: 9
Signal denoising via overlapping atoms in a wavelet domain 在小波域通过重叠原子去噪信号
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296941
V. Bruni, D. Vitulano
{"title":"Signal denoising via overlapping atoms in a wavelet domain","authors":"V. Bruni, D. Vitulano","doi":"10.1109/ISPA.2003.1296941","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296941","url":null,"abstract":"In this paper a novel approach to signal denoising in a wavelet domain is proposed. The signal is adapted to an a priori selected basis considering its details as the result of overlapping elementary atoms at different scale levels. This new proposal is supported by experimental observations along with some preliminary theoretical results.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130203541","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}
引用次数: 5
Robust audio watermarking in wavelet domain using frequency hopping and patchwork method 基于跳频拼接法的小波域鲁棒音频水印
3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the Pub Date : 2003-09-18 DOI: 10.1109/ISPA.2003.1296903
N. Cvejic, T. Seppanen
{"title":"Robust audio watermarking in wavelet domain using frequency hopping and patchwork method","authors":"N. Cvejic, T. Seppanen","doi":"10.1109/ISPA.2003.1296903","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296903","url":null,"abstract":"In this work, we present a novel robust audio watermarking method in wavelet domain. Embedding of watermarks is performed in a perceptually significant set of sub-bands of the host audio. In order to enhance security, watermark is embedded in a randomly selected sub-band of the host audio according to a secret key. Watermark embedding to a mapped subband is done in a predefined time period, similarly to frequency hopping approach in digital communications. Detection method is a statistical method motivated by modified patchwork algorithm, relying on large data sets. Using simple Haar decomposition and test statistics, the algorithm proved itself in the terms of computational complexity. Subjective listening test proved high perceptual transparency of the watermarked audio clips. Using embedding rate of 4.61 bps, high robustness against common audio watermarking attacks was obtained, with average bit error rate lower than 1%.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129902029","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}
引用次数: 37
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信