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

2006 International Conference on Image Processing最新文献

筛选
英文 中文
Low-Complexity Video Compression Combining Adaptive Multifoveation and Reuse of High-Resolution Information 结合自适应多注视点和高分辨率信息复用的低复杂度视频压缩
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.313038
Giorgio Pioppo, R. Ansari, A. Khokhar, G. Masera
{"title":"Low-Complexity Video Compression Combining Adaptive Multifoveation and Reuse of High-Resolution Information","authors":"Giorgio Pioppo, R. Ansari, A. Khokhar, G. Masera","doi":"10.1109/ICIP.2006.313038","DOIUrl":"https://doi.org/10.1109/ICIP.2006.313038","url":null,"abstract":"The phenomenon of reduced spatial resolution perceived away from the point of gaze (foveation point) in a scene by the human visual system can be gainfully exploited in image and video compression. Interest has recently evolved from single foveation points to dynamic and multiple points of foveation, implementing which entails significantly increased complexity in the encoder. In this paper, a novel idea of efficiently combining adaptive multipoint foveation with salvaged high-resolution information for reuse in real-time video to maintain higher resolution in peripheral regions is proposed. The idea is implemented with a fast algorithm for multi-foveation processing, in conjunction with standard-compliant decoding. The new multi-foveation algorithm is integrated with the H.264/AVC standard for testing. Simulation results show a compression gain ranging from 2.25% to more than 11%, without degrading the perceived quality and PSNR and with minimal addition to the complexity of a standard uniform-resolution codec.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406624","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}
引用次数: 2
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures 显示多处骨折的计算机断层图像序列的虚拟颅面重建
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312766
A. Chowdhury, S. Bhandarkar, R. W. Robinson, Jack C. Yu
{"title":"Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures","authors":"A. Chowdhury, S. Bhandarkar, R. W. Robinson, Jack C. Yu","doi":"10.1109/ICIP.2006.312766","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312766","url":null,"abstract":"A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. The problem is formulated as one of combinatorial pattern matching and solved in two stages. First, the opposable fracture surfaces are identified using a maximum weight graph matching algorithm where the fracture surfaces are modeled as the vertices of a weighted graph. The edge weights between pairs of vertices are treated as elements of a score matrix, whose values are a linear combination of (a) the Hausdorff distance, and (b) a score function based on fracture surface characteristics. Second, the pairs of opposable fracture surfaces identified in the first stage are actually registered using the Iterative Closest Point (ICP) algorithm enhanced with a graph theoretic improvisation. The correctness of the registration in the second stage is constantly monitored by volumetric matching of the reconstructed mandible with an intact mandible. Experimental results on simulated CT image sequences of broken human mandibles are presented.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"65 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045933","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}
引用次数: 16
Tracking Motion-Blurred Targets in Video 跟踪视频中的运动模糊目标
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312943
Shengyang Dai, Ming Yang, Ying Wu, A. Katsaggelos
{"title":"Tracking Motion-Blurred Targets in Video","authors":"Shengyang Dai, Ming Yang, Ying Wu, A. Katsaggelos","doi":"10.1109/ICIP.2006.312943","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312943","url":null,"abstract":"Many emerging applications require tracking targets in video. Most existing visual tracking methods do not work well when the target is motion-blurred (especially due to fast motion), because the imperfectness of the target's appearances invalidates the image matching model (or the measurement model) in tracking. This paper presents a novel method to track motion-blurred targets by taking advantage of the blurs without performing image restoration. Unlike the global blur induced by camera motion, this paper is concerned with the local blurs that are due to target's motion. This is a challenging task because the blurs need to be identified blindly. The proposed method addresses this difficulty by integrating signal processing and statistical learning techniques. The estimated blurs are used to reduce the search range by providing strong motion predictions and to localize the best match accurately by modifying the measurement models.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117194639","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}
引用次数: 54
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction 基于树的信号重构正交匹配追踪算法
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312578
C. La, M. Do
{"title":"Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction","authors":"C. La, M. Do","doi":"10.1109/ICIP.2006.312578","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312578","url":null,"abstract":"Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve those problems. In many multiscale bases (e.g. wavelets), signals of interest (e.g. piecewise-smooth signals) not only have few significant coefficients, but also those significant coefficients are well-organized in trees. We propose to exploit this sparse tree representation as additional prior information for linear inverse problems with limited numbers of measurements. In particular, our proposed algorithm named tree-based orthogonal matching pursuit (TOMP) is shown to provide significant better reconstruction compared to methods that only use sparse representation assumption.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132744904","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}
引用次数: 90
Hierarchical Dental X-Ray Radiographs Matching 分级牙科x光片匹配
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.313061
O. Nomir, M. Abdel-Mottaleb
{"title":"Hierarchical Dental X-Ray Radiographs Matching","authors":"O. Nomir, M. Abdel-Mottaleb","doi":"10.1109/ICIP.2006.313061","DOIUrl":"https://doi.org/10.1109/ICIP.2006.313061","url":null,"abstract":"The goal of forensic dentistry is to identify individuals based on their dental characteristics. In this paper we present a new matching technique for identifying missing, and wanted individuals from their dental X-ray records. Given a dental record, usually a postmortem (PM) radiograph, the proposed technique searches a database of ante mortem (AM) radiographs and retrieves the best matches from the database. The technique is based on matching teeth contours using hierarchical Chamfer distance. The proposed technique has two main stages: feature extraction, and teeth matching. During retrieval, according to a matching distance between the AM and PM teeth, AM radiographs that are most similar to a given PM image, are found and presented to the user. The experimental results on a database of 162 AM images show that the technique is robust for identifying individuals based on their dental records.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133826524","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}
引用次数: 23
Spatially Constrained Wiener Filter with Markov Autocorrelation Modeling for Image Resolution Enhancement 基于马尔可夫自相关建模的空间约束维纳滤波图像分辨率增强
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.313062
Jiazheng Shi, S. Reichenbach
{"title":"Spatially Constrained Wiener Filter with Markov Autocorrelation Modeling for Image Resolution Enhancement","authors":"Jiazheng Shi, S. Reichenbach","doi":"10.1109/ICIP.2006.313062","DOIUrl":"https://doi.org/10.1109/ICIP.2006.313062","url":null,"abstract":"This paper develops a practical method for image resolution enhancement. The method optimizes the spatially constrained Wiener filter for an efficiently parameterized model of the image autocorrelation based on a Markov random field (MRF) with affine transformation. The paper presents a closed-form solution to parameterize the model for an image. The enhancement method is computationally efficient, because it is formulated as convolution with a small kernel. Because the kernel is small, it can be optimized efficiently and only a small portion of the MRF autocorrelation model is required. Because the autocorrelation model parameters and optimal filter can be computed quickly, the method can be optimized locally for adaptive processing. Experimental results indicate that the new method can balance the error-budget tradeoff between signal error and aliasing error.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113975101","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
Automatic Business Card Scanning with a Camera 带有相机的自动名片扫描
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312471
G. Hua, Zicheng Liu, Zhengyou Zhang, Ying Wu
{"title":"Automatic Business Card Scanning with a Camera","authors":"G. Hua, Zicheng Liu, Zhengyou Zhang, Ying Wu","doi":"10.1109/ICIP.2006.312471","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312471","url":null,"abstract":"In this paper, we present a system to automatically extract, rectify and enhance business card images. First the business card image patch is automatically segmented by minimizing a novel local-global variational energy. Second a quadrangle is fitted to the segmented image patch. With the four corner points of the quadrangle, we then estimate the physical aspect ratio of the business card and obtain a homography to rectify the quadrangle back to rectangular shape. We finally enhance the contrast of the rectified business card image using a S-shaped curve. Extensive experiments demonstrated the efficacy and robustness of our system.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116529621","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}
引用次数: 19
Error Concealment Using Direction-Oriented Candidate Set and Predicted Boundary Matching Criteria 基于方向候选集和预测边界匹配准则的错误隐藏
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.313011
Chorng-Yann Su, Shiou-Haur Tsay, Chia-Hao Huang
{"title":"Error Concealment Using Direction-Oriented Candidate Set and Predicted Boundary Matching Criteria","authors":"Chorng-Yann Su, Shiou-Haur Tsay, Chia-Hao Huang","doi":"10.1109/ICIP.2006.313011","DOIUrl":"https://doi.org/10.1109/ICIP.2006.313011","url":null,"abstract":"In this paper, we propose two novel approaches for the error concealment used in H.264 codec. The first one is a direction-oriented candidate set, which decides a proper candidate set of motion vectors by using the trend of collocated motion vector. The second is a predicted boundary matching criterion, which uses one-order prediction of pixel value on boundary to reduce the incurred error of traditional boundary matching criterion. Compared with the bidirectional motion vector refinement (BMVR), the proposed approaches can elevate about 0.75 dB of peak-signal to noise ratio (PSNR) value and perform well especially for the video sequences with moderate and fast motion.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122308705","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
Matching of Objects Moving Across Disjoint Cameras 在不相交的相机上移动的物体的匹配
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312725
E. Cheng, M. Piccardi
{"title":"Matching of Objects Moving Across Disjoint Cameras","authors":"E. Cheng, M. Piccardi","doi":"10.1109/ICIP.2006.312725","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312725","url":null,"abstract":"Matching of single individuals as they move across disjoint camera views is a challenging task in video surveillance. In this paper, we present a novel algorithm capable of matching single individuals in such a scenario based on appearance features. In order to reduce the variable illumination effects in a typical disjoint camera environment, a cumulative color histogram transformation is first applied to the segmented moving object. Then, an incremental major color spectrum histogram representation (IMCSHR) is used to represent the appearance of a moving object and cope with small pose changes occurring along the track. An IMCHSR-based similarity measurement algorithm is also proposed to measure the similarity of any two segmented moving objects. A final step of post-matching integration along the object's track is eventually applied. Experimental results show that the proposed approach proved capable of providing correct matching in typical situations.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408577","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}
引用次数: 38
Multiscale Image Disparity Estimation using the Quaternion Wavelet Transform 基于四元数小波变换的多尺度图像视差估计
2006 International Conference on Image Processing Pub Date : 2006-12-01 DOI: 10.1109/ICIP.2006.312547
Wai Lam Chan, Hyeokho Choi, Richard Baraniuk
{"title":"Multiscale Image Disparity Estimation using the Quaternion Wavelet Transform","authors":"Wai Lam Chan, Hyeokho Choi, Richard Baraniuk","doi":"10.1109/ICIP.2006.312547","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312547","url":null,"abstract":"We propose an efficient multiscale image disparity estimation algorithm that estimates the local translations needed to align different regions in two images. The algorithm is based on the dual-tree quaternion wavelet transform (QWT). Each QWT coefficient features a magnitude and three phase angles; we exploit the fact that two of the phase angles are covariant with image shifts in the horizontal and vertical directions. By fusing phase information across multiple scales, we combat the phase unwrapping problem that has traditionally plagued phase-based disparity estimation techniques. The result is a linear-time algorithm that provides reliable estimates of both small and large image shifts. The algorithm is completely image-based; that is, it involves no extraction of feature points or other landmarks. It can be used as a front-end for image processing and computer vision tasks such as image registration, motion estimation, and stereo matching. We present results with a real-world image sequence.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134510404","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信