检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

4,257 篇 会议
64 篇 期刊文献
2 册 图书

馆藏范围

4,323 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,428 篇 工学
- 1,613 篇 计算机科学与技术...
- 1,167 篇 信息与通信工程
- 944 篇 软件工程
- 670 篇 电气工程
- 280 篇 光学工程
- 144 篇 电子科学与技术（可...
- 125 篇 生物工程
- 122 篇 控制科学与工程
- 88 篇 生物医学工程（可授...
- 79 篇 仪器科学与技术
- 68 篇 机械工程
- 43 篇 化学工程与技术
- 33 篇 网络空间安全
- 25 篇 动力工程及工程热...
- 25 篇 安全科学与工程
- 21 篇 测绘科学与技术
- 21 篇 轻工技术与工程
1,097 篇 医学
- 1,086 篇 临床医学
- 38 篇 基础医学(可授医学...
- 33 篇 药学(可授医学、理...
1,023 篇 理学
- 745 篇 物理学
- 350 篇 数学
- 134 篇 生物学
- 99 篇 统计学（可授理学、...
- 44 篇 化学
- 32 篇 系统科学
191 篇 管理学
- 109 篇 图书情报与档案管...
- 92 篇 管理科学与工程(可...
- 30 篇 工商管理
32 篇 法学
- 29 篇 社会学
12 篇 军事学
9 篇 文学
7 篇 教育学
6 篇 经济学
5 篇 农学

主题

531 篇 image coding
460 篇 image processing
351 篇 visual communica...
310 篇 visualization
253 篇 feature extracti...
223 篇 image segmentati...
173 篇 image compressio...
166 篇 image reconstruc...
149 篇 video coding
146 篇 cameras
134 篇 training
132 篇 humans
124 篇 image quality
120 篇 image color anal...
111 篇 image enhancemen...
111 篇 signal processin...
110 篇 image retrieval
103 篇 image edge detec...
102 篇 decoding
100 篇 deep learning

机构

36 篇 shanghai jiao to...
29 篇 institute of ima...
24 篇 school of electr...
20 篇 university of sc...
18 篇 shanghai jiao to...
16 篇 shanghai jiao to...
16 篇 tianjin univ sch...
16 篇 beijing universi...
12 篇 institute for in...
12 篇 school of electr...
11 篇 university of el...
11 篇 cas key laborato...
11 篇 tsinghua univ de...
10 篇 univ sci & techn...
10 篇 peking univ inst...
10 篇 tsinghua univ de...
10 篇 institute of ima...
9 篇 zhejiang univers...
9 篇 smart computer v...
9 篇 xidian univ sch ...

作者

34 篇 zhai guangtao
26 篇 sumei li
25 篇 song li
22 篇 li sumei
21 篇 guangtao zhai
19 篇 li li
18 篇 li song
18 篇 min xiongkuo
16 篇 dong liu
16 篇 shan liu
15 篇 andré kaup
15 篇 yang xiaokang
14 篇 chen zhibo
13 篇 xie rong
13 篇 xiongkuo min
13 篇 gao wen
11 篇 m. vetterli
11 篇 heming sun
11 篇 zhibo chen
11 篇 zhenzhong chen

语言

4,232 篇 英文
66 篇 土耳其文
26 篇 中文
12 篇 其他
1 篇 法文

检索条件"任意字段=Conference on Visual Communications and Image Processing 2004"

共 4323 条记录，以下是4151-4160 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Partition encoding based on graph representation and geometric approximation of contours for region-based video coding.

Partition encoding based on graph representation and geometr...

引用

1997 conference on visual communications and image processing

作者： Sanson, H Labelle, L CCETT (France)

ISBN: (纸本)0819424358

This paper presents a solution for image partition encoding, usable for region-based image or video compression. This solution consists of several elements which can eventually be used separately in other contexts such as the recent VOP contour encoding defined withing the ISO-MPEG-4 standardization effort. Namely, these elements are the graph representation of the contour network topology on the one hand, and the B-spline approximation of the contour geometry, approximation carried out on a purely geometric criterion on the other hand. The role of the graph repesentation is two-fold;to enable the regeneration of region labels at the decoder side, without needing to send them along with the contour geometry, which could be jeopardized otherwise by contour approximation errors, and to save the coding of the contours starting points. Such label regeneration is based on the extraction of the list of consecutive arcs corresponding to the external region boundary only from the graph structure. The algorithm for such an extraction is given as well as the encoding of the graph structure. Compression of the geometric information is obtained through contour approximation by B-spline curves. Such an approximation combines a Least Mean Squares curve fitting and a gradient-based geometric curve evolution from this first approximation. Finally, a solution is proposed for the encoding of the resulting B-spline control points.

关键词： region-based image coding partition coding graph geometric curve approximation B-splines

来源：评论

学校读者我要写书评

暂无评论

Motion field and image intensity segmentation for object-oriented coding of video sequences

Motion field and image intensity segmentation for object-ori...

引用

1997 conference on visual communications and image processing

作者： LeQuang, D Zaccarin, A Univ. Laval (Canada)

ISBN: (纸本)0819424358

A number of object-oriented coding algorithms have been proposed for coding video sequences at low bit rates. Instead of estimating motion of pixel blocks, these algorithms segment each image into regions of uniform motion and estimate the motion of these regions. Estimating the segmentation and computing motion parameters are evidently closely related. Most algorithms iteratively compute complex motion parameters and segmentation estimates, and typically computationally intensive. image intensity segmentations were also used instead of motion field segmentations based on the hypothesis that adjacent pixels with similar luminance values are part of the same object, and therefore share common motion parameters. We previously proposed a simple two-stage algorithm for which 1) a translational block-motion field is used to compute a translational motion field and its segmentation, 2) an optical flow field is then used to compute affine motion parameters for each segmented region. In this paper, we propose to replace the translational block motion field by another translational motion field which assigns a motion vector to each region of an image intensity segmentation. This approach combines the advantages of both intensity and motion field segmentations, generates motion field segmentations that matches the scene content more closely with 15% - 25% fewer objects, and therefore reduces the side bit rate required for coding the motion field segmentation.

关键词： object-oriented video coding motion field motion compensation segmentation low bit rate

来源：评论

学校读者我要写书评

暂无评论

Stereo image compression based on disparity field segmentation

Stereo image compression based on disparity field segmentati...

引用

1997 conference on visual communications and image processing

作者： Woo, W Ortega, A Univ. of Southern California (United States)

ISBN: (纸本)0819424358

The increasing demand for 3D imaging and recent developments of autostereoscopic displays will accelerate the usage of 3D systems in various areas. However, limited channel bandwidth is, as for monocular images, the main bottleneck for realizing 3D systems. As a result, an efficient compression algorithm will be essential to reduce the bandwidth requirement while maintaining the perceptual visual quality at the decoder. In this paper, we will focus on compression of stereo images. When it comes to stereo image coding, we can take advantage of binocular redundancy by using disparity compensation. The most popular disparity compensation method approaches so far have been block based methods, due mostly to their simplicity. Block based methods, however, may suffer from blocking artifacts at low bit rates due to the uniform disparity assumption within a fixed block. Meanwhile, if we reduce the block size, the disparity estimation may suffer from various noise effects which result in increases of bit rates for the disparity. Considering these observations, we estimate disparity based on a small block or a pixel with the energy equation derived from the MRF model. In order to prevent oversmoothing across boundaries, we use the combined intensity edges of two images as an initial disparity boundary. Then, we segment the resulting smooth disparity field. Finally, the disparity and the starting position are encoded using DPCM and the corresponding boundary is encoded using Run Length Chain coding. At the end of this paper, we present experimental results.

关键词： stereo image coding disparity estimation segmentation Markov Random Field (MRF)

来源：评论

学校读者我要写书评

暂无评论

Real-time MPEG video over LAN with DSM-CC signaling

Real-time MPEG video over LAN with DSM-CC signaling

引用

1997 conference on visual communications and image processing

作者： Kan, KS Chen, CT Loui, A National Central Univ. (Taiwan) CRISC Corp. (United States) Bell Communications Research (United States)

ISBN: (纸本)0819424358

For video applications such as video-on-demand, signaling is an important step for service initialization including service setup, authentication, and resource allocation This paper describes the design and implementation of an experimental platform for delivery of real-time MPEG encoded video over LAN with DSM-CC signaling. The platform consists of a real-time MPEG encoder system as a server, a network node workstation, and a client with MPEG decoding capability. Specifically, we have implemented a client-initiated subset of the DSM-CC user-to-network (UN) protocol for signaling. Communication between the network node and server/client is achieved by using the TCP/IP protocol. The network node provides the functionality of upstream message exchange, UN and/or UU (user-to-user) resource negotiation, and MPEG bitstream relay. The operation of our current video platform setup is quite robust and can deliver MPEG video up to about 1.5 Mb/s via DSM-CC protocols. It is demonstrated that practical implementation of video applications is feasible over small-scale LANs.

关键词： MPEG DSM-CC real-time encoding LAN video video-on-demand video server

来源：评论

学校读者我要写书评

暂无评论

Shape adaptive discrete wavelet transform for coding arbitrarily shaped texture

Shape adaptive discrete wavelet transform for coding arbitra...

引用

1997 conference on visual communications and image processing

作者： Li, SP Li, WP Lehigh Univ. (United States)

ISBN: (纸本)0819424358

This paper presents a shape adaptive discrete wavelet transform (SA-DWT) scheme for coding arbitrarily shaped texture. The proposed SA-DWT can be used for object-oriented image coding. The number of coefficients after SA-DWT is identical to the number of pels contained in the arbitrarily shaped image objects. The locality property of wavelet transform and self-similarity among subbands are well preserved throughout this process. For a rectangular region, the SA-DWT is identical to a standard wavelet transform. With SA-DWT1 conventional wavelet based coding schemes can be readily extended to the coding of arbitrarily shaped objects. The proposed shape adaptive wavelet transform is not unitary but the small energy increase is restricted at the boundary of objects in subbands. Two approaches of using the SA-DWT algorithm for object-oriented image and video coding are presented. One is to combine scalar SA-DWT with Embedded Zerotree Wavelet (EZW) coding technique (called SA-EZW), the other is an extension of the normal vector wavelet coding (VWC) technique (called SA-VWC) to arbitrarily shaped objects. Results of applying SA-VWC to real arbitrarily shaped texture coding are also given at the end of this paper.

关键词： object-oriented image coding arbitrarily shaped object coding shape-adaptive wavelet transform embedded zerotree wavelet coding vector wavelet coding shape-adaptive vector wavelet coding shape-adaptive DCT

来源：评论

学校读者我要写书评

暂无评论

Low frequency coefficient prediction for image coding

Low frequency coefficient prediction for image coding

引用

Proceedings of the 1997 1st International conference on Information, communications and Signal processing, ICICS. Part 3 (of 3)

作者： Cham, W.K. Yeung, M.C.Au Chinese Univ of Hong Kong Shatin Hong Kong

It has been shown that about 80% of the DC coefficients of a transformed image can be discarded at the encoder and then restored at the decoder using a DC coefficient restoration (DCCR) algorithm. This approach can improve the compression rate of JPEG by over 10% at low bit rates. In this paper, we extend the DCCR algorithm not only to restore DC coefficients but also to predict some of the (0, 1)th and (1, 0)th AC coefficients. The prediction thus allows these AC coefficients to be represented using less bits. Experimental results show that, almost in all cases, images coded using the proposed algorithm have higher PSNR and better visual quality than those coded using only the DCCR.

关键词： Signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

Vector-based postprocessing of MPEG-2 signals for digital TV-receivers

Vector-based postprocessing of MPEG-2 signals for digital TV...

引用

1997 conference on visual communications and image processing

作者： Blume, H Amer, A Schroder, H UNIV DORTMUND INST COMMUN TECHWORKING GRP CIRCUITS INFORMAT PROCD-44221 DORTMUNDGERMANY

ISBN: (纸本)0819424358

Digital transmission of video signals and block-based coding/decoding schemes produce new artifacts such as Blocking, Dirty Window, Ringing and Mosquite Effects. These artifacts become worse with decreasing MPEG-2 data rates. Therefore the reduction of MPEG-artifacts becomes an attractive feature for digital TV-receivers. On the other hand an important feature for digital receivers is the performance of their postprocessing techniques such as object recognition, motion estimation, vector-based upconversion and noise reduction on MPEG-signals which are decoded in a receiver-based module called 'Set Top Box'. In this paper different models dealing with the interaction between 'Set Top Box' and digital receiver are discussed. Hereby the influence of MPEG-artifacts on postprocessing methods is studied and methods for combining MPEG-2 decoding, artifact removal and postprocessing are presented. A vector-based upconversion algorithm which applies nonlinear center weighted median filters (CWM) is presented. Assuming a 2-channel model of the human visual system (HVS) with different spatio temporal characteristics, errors of the separated channels can be orthogonalized and avoided by an adequate splitting of the spectrum. Hereby a very robust vector error tolerant upconversion method which significantly improves the interpolation quality is achieved. This paper describes also a concept for temporal recursive noise and MPEG-artifact filtering on TV images based on visual noise perception characteristics. Different procedures in the spatial subbands lead to results well matched to the requirements of the human visual system. Using a subband-based noise filter temporally non correlated MPEG-artifacts can significantly be reduced. image analysis using object recognition for video postprocessing becomes more important. Therefore a morphological, contour-based multilevel object recognition method which even stays robust in strongly corrupted MPEG-2 images is also introduced.

关键词： MPEG-2 MPEG-2 artifacts motion estimation noise reduction object recognition postprocessing artifact reduction upconversion spatial subband processing morphological erosion

来源：评论

学校读者我要写书评

暂无评论

Dependent quantization for stereo image coding

Dependent quantization for stereo image coding

引用

visual communications and image processing 1998 conference

作者： Woo, W Ortega, A Univ So Calif Dept Elect Syst Engn Integrated Media Syst Ctr Los Angeles CA 90089 USA

ISBN: (纸本)0819427497

In this paper, we address the problem of optimal bit allocation for stereo images. Conventional rate-distortion (RD) based methods have mainly concentrated on minimizing total distortion within a given bit budget by independently encoding each image. However, stereo image coding, like video coding, requires a dependent bit allocation framework to further improve encoding performance because binocular and spatial dependencies are introduced by the disparity estimation and differential pulse coded modulation (DPCM) of the disparity vector field. We first formulate the dependent bit allocation problem for stereo image coding and extend it to blockwise dependent bit allocation. We then focus on tile blockwise dependent quantization because using open-loop disparity estimation decouples the dependent bit allocation problem into two independent problems;disparity estimation and dependent quantization. The encoding complexity and delay in the dependent quantization framework can be significantly reduced Ly exploiting the unidirectional binocular dependency. An optimal set of quantizers can be selected using the Viterbi algorithm. For a given three quantization scales, the proposed scheme provides higher PSNR, about 3dB compared to JPEG without disparity compensation and 0.5dB compared to optimal independent blockwise quantization with disparity compensation. The proposed scheme can help develop a fast and efficient Lit allocation strategy, be a benchmark of practical rate control schemes or be used in asymmetric applications, which may involve offline encoding, such as CD-ROM, DVD, video-on-demand, etc.

关键词： stereo image coding dependent bit allocation blockwise quantization Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal piecewise linear image coding

Optimal piecewise linear image coding

引用

visual communications and image processing 1998 conference

作者： Saupe, D Univ Freiburg Inst Informat D-79110 Freiburg Germany

ISBN: (纸本)0819427497

Piecewise linear (PL) image coding proceeds in three steps: 1. A digital image is converted into a 1D-signal using a scanning procedure, for example by scanning lines in a zig-zag or Hilbert order. 2. The signal is approximated by the graph of a piecewise linear function, which consists of a finite number of connected line segments. 3. Entropy encoding of the sequence of the segment end points. In this step differential coding can be used for one or both coordinate sequences of the end points. To ensure a desired approximation quality a constraint is imposed, e.g., on the root-mean-square error of the PL signal. In this paper we consider uniform approximation (L-infinity-distortion limited compression). Two problems are addressed: First, an optimal PL approximation in the sense of a minimal number of segments is to be obtained. Second, when entropy coding of the segments is used, how can one jointly optimize the variable length code and the PL approximation yielding a better or even minimal rate without violating the uniform error bound? The first problem is solved by dynamic programming, the second is approached by using Huffman coding and an annealing procedure in which the design of the Huffman tables and the dynamic programming is alternatingly iterated using a cost function that reflects the codeword lengths of the current variable length code. This algorithm is guaranteed to converge to a (locally) minimum length code. We describe the algorithms, implementation issues, compare two different scanning procedures, the zig-zag line scan and the Hilbert scan, and report results for encoding various test images.

关键词： nearlossless image coding sequence coding piecewise linear coding fan-based coding dynamic programming distortion limited compression annealing Hilbert scan

来源：评论

学校读者我要写书评

暂无评论

Architecture design of motion estimation for ITU-T H.263

Architecture design of motion estimation for ITU-T H.263

引用

1997 conference on visual communications and image processing

作者： Ku, CW Lin, GS Chen, LG Lee, YP National Taiwan Univ. (Taiwan)

ISBN: (纸本)0819424358

Digitalized video and audio system has become the trend of the progress in multimedia, because it provides great performance in quality and feasibility of processing. However, as the huge amount of information is needed while the bandwidth is limitted, data compression plays an important role in the system. Say, for a 176 x 144 monochromic sequence with 10 frames/sec frame rate, the bandwidth is about 2Mbps. This wastes much channel resource and limits the applications. MPEG (moving picttre ezpert groip) standardizes the video codec scheme, and it performs high compression ratio while providing good quality. MPEG-i is used for the frame size about 352 x 240 and 30 frames per second, and MPEG-2 provides scalibility and can be applied on scenes with higher definition, say HDTV (high definition television). On the other hand, some applications concerns the very low bit-rate, such as videophone and video-conferencing. Because the channel bandwidth is much limitted in telephone network, a very high compression ratio must be required. ITU-T announced the H.263 video coding standards to meet the above requirements.8 According to the simulation results of TMN-5,22 it outperforms 11.263 with little overhead of complexity. Since wireless communication is the trend in the near future, low power design of the video codec is an important issue for portable visual telephone. Motion estimation is the most computation consuming parts in the whole video codec. About 60% of the computation is spent on this parts for the encoder. Several architectures were proposed for efficient processing of block matching algorithms. In this paper, in order to meet the requirements of 11.263 and the expectation of low power consumption, a modified sandwich architecture in21 is proposed. Based on the parallel processing philosophy, low power is expected and the generation of either one motion vector or four motion vectors with half-pixel accuracy is achieved concurrently. In additi

关键词： Motion estimation Video Video compression Computer programming Parallel processing Video coding visualization Data compression Multimedia Video processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共433页 << < 412 413 414 415 416 417 418 419 420 421 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：