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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,414 篇 会议
56 册 图书
27 篇 期刊文献

馆藏范围

1,497 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,009 篇 工学
- 904 篇 计算机科学与技术...
- 399 篇 软件工程
- 390 篇 电气工程
- 125 篇 信息与通信工程
- 119 篇 光学工程
- 83 篇 生物工程
- 62 篇 生物医学工程（可授...
- 54 篇 电子科学与技术（可...
- 38 篇 控制科学与工程
- 33 篇 化学工程与技术
- 27 篇 机械工程
- 17 篇 安全科学与工程
- 16 篇 仪器科学与技术
- 8 篇 材料科学与工程（可...
- 8 篇 建筑学
- 8 篇 土木工程
363 篇 医学
- 360 篇 临床医学
- 26 篇 基础医学(可授医学...
- 25 篇 药学(可授医学、理...
344 篇 理学
- 174 篇 物理学
- 143 篇 数学
- 86 篇 生物学
- 44 篇 统计学（可授理学、...
- 31 篇 化学
- 15 篇 系统科学
87 篇 管理学
- 65 篇 图书情报与档案管...
- 21 篇 管理科学与工程(可...
- 12 篇 工商管理
11 篇 农学
- 11 篇 作物学
10 篇 法学
- 9 篇 社会学
5 篇 经济学
1 篇 教育学
1 篇 文学
1 篇 艺术学

主题

132 篇 computer vision
86 篇 image processing
79 篇 image segmentati...
53 篇 feature extracti...
52 篇 computer graphic...
46 篇 deep learning
45 篇 cameras
35 篇 face recognition
35 篇 artificial intel...
35 篇 shape
30 篇 image reconstruc...
29 篇 object detection
29 篇 robustness
28 篇 image color anal...
24 篇 image enhancemen...
23 篇 image edge detec...
23 篇 biometrics
23 篇 image processing...
22 篇 pattern recognit...
22 篇 layout

机构

20 篇 indian statistic...
19 篇 indian institute...
17 篇 department of co...
14 篇 computer vision ...
12 篇 indian institute...
11 篇 department of el...
10 篇 indian inst tech...
9 篇 indian stat inst...
9 篇 indian institute...
9 篇 indian inst tech...
9 篇 indian institute...
8 篇 indian institute...
8 篇 department of el...
8 篇 indian institute...
8 篇 indian inst sci ...
8 篇 indian inst tech...
7 篇 indian inst tech...
7 篇 indian institute...
7 篇 indian inst tech...
7 篇 indian inst tech...

作者

40 篇 chaudhury santan...
29 篇 chaudhuri subhas...
26 篇 mukherjee jayant...
20 篇 das sukhendu
19 篇 raman shanmugana...
18 篇 santanu chaudhur...
17 篇 balasubramanian ...
16 篇 harit gaurav
16 篇 lall brejesh
15 篇 babu r. venkates...
15 篇 chanda bhabatosh
14 篇 mukherjee dipti ...
13 篇 das partha prati...
12 篇 biswas prabir ku...
12 篇 mishra deepak
11 篇 raman balasubram...
11 篇 sukhendu das
10 篇 biswas soma
10 篇 bhowmick partha
10 篇 bhavsar arnav

语言

1,485 篇 英文
9 篇 中文
4 篇 其他

检索条件"任意字段=Proceedings of the Tenth Indian Conference on Computer Vision, Graphics and Image Processing"

共 1497 条记录，以下是1271-1280 订阅

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

详细简洁

排序：

Fragment Based Tracking for Scale and Orientation Adaptation

Fragment Based Tracking for Scale and Orientation Adaptation

引用

6th indian conference on computer vision, graphics and image processing

作者： Srikrishnan, V. Nagaraj, T. Chaudhuri, Subhasis Indian Inst Technol Dept Elect Engn VIP Lab Bombay 400076 Maharashtra India

ISBN: (纸本)9781424442195

In this work, we propose a simple yet highly effective algorithm for tracking a target through significant scale and orientation change. We divide the target into a number of fragments and tracking of the whole target is achieved by coordinated tracking of the individual fragments. We use the mean shift algorithm to move the individual fragments to the nearest minima, though an), other method like integral histograms could also be used. In contrast to the other fragment based approaches, which fix the relative positions of fragments within the target, we permit the fragments to move freely within certain bounds. Furthermore, we use a constant velocity Kalman filter for two purposes. Firstly, Kalman filter achieves robust tracking because of usage of a motion model. Secondly, to maintain coherence amongst the fragments, we use a coupled state transition model for the Kalman filter Using the proposed tracking algorithm, we have experimented on several videos consisting of several hundred frames length each and obtained excellent results.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Quantization Based Data Hiding Scheme for Efficient Quality Access Control of images using DWT via Lifting

Quantization Based Data Hiding Scheme for Efficient Quality ...

引用

6th indian conference on computer vision, graphics and image processing

作者： Phadikar, Amit Maity, Santi P. Kundu, Malay K. MCKV Inst Engn Dept Informat Technol Liluah 711204 Howrah India Bengal Engn & Sci Univ Dept Informat Technol Howrah 711103 India Indian Stat Inst Mach Intelligence Unit & Ctr Soft Comp Kolkata 700108 India

ISBN: (纸本)9781424442195

This paper proposes a transform domain data-hiding scheme for quality access control of images. The original image is decomposed into tiles by applying n-level lifting-based Discrete Wavelet Transformation (DWT). A binary watermark image (external information) is spatially dispersed using the sequence of number generated by a secret key. The encoded watermark bits are then embedded into all DWT-coefficients of n(th)-level and only in the high-high (HH) coefficients of the subsequent levels using dither modulation (DM) but without complete self-noise suppression. It is well known that due to insertion of external information, there will be degradation in visual quality of the host image (cover). The degree of deterioration depends on the amount of external data insertion as well as step size used for DM. If this insertion process is reverted, better quality of images can be accessed. To achieve that goal, watermark bits are detected using minimum distance decoder and the remaining self-noise due to information embedding is suppressed to provide better quality of image. The simulation results have shown the validity of this claim.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

High Speed and Memory Efficient Parallel Bit Plane Coding Architecture for JPEG2000

High Speed and Memory Efficient Parallel Bit Plane Coding Ar...

引用

6th indian conference on computer vision, graphics and image processing

作者： Suman, Tenugu Chatterjee, Sumit Kumar Chakrabarti, Indrajit Indian Inst Technol Dept Elect & Elect Commun Engn Kharagpur 721302 W Bengal India

ISBN: (纸本)9781424442195

Bit Plane coding (BPC) constitutes an important component of the EBCOT Tier-1 block of JPEG2000 encoder. This paper proposes an efficient parallel hardware structure to implement the computation intensive word level bit plane coding algorithm. The proposed architecture computes the context and decision for all bit planes in parallel. The three coding passes are merged for all bit planes in a scan while the samples are coded in sequence. The proposed parallel BPC architecture offers a speed of 31 over the serial BPC architecture. Its memory requirement is independent of the size of the codeblock. The speed of the proposed architecture has been shown to be significantly faster than an architecture which has been recently reported in literature. The system architecture has been functionally verified by ModelSim and synthesized by TSMC 0.25 mu m vtvt CMOS cell libraries.

关键词： bit plane coding JPEG2000 encoder codeblock parallel architecture

来源：评论

学校读者我要写书评

暂无评论

Object Mining using a Matching Graph on Very Large image Collections

Object Mining using a Matching Graph on Very Large Image Col...

引用

6th indian conference on computer vision, graphics and image processing

作者： Philbin, James Zisserman, Andrew Univ Oxford Dept Engn Sci Visual Geometry Grp Oxford OX1 2JD England

ISBN: (纸本)9781424442195

Automatic organization of large, unordered image collections is an extremely challenging problem with many potential applications. Often, what is required is that images taken in the same place, of the same thing, or of the same person be conceptually grouped together. This work focuses on grouping images containing the same object, despite significant changes in scale, viewpoint and partial occlusions, in very large (1M+) image collections automatically gathered from Flickr The scale of the data and the extreme variation in imaging conditions makes the problem very challenging. We describe a scalable method that first computes a matching graph over all the images. image groups can then be mined from this graph using standard clustering techniques. The novelty we bring is that both the matching graph and the clustering methods are able to use the spatial consistency between the images arising from the common object (if there is one). We demonstrate our methods on a publicly available dataset of 5K images of Oxford, a 37K image dataset containing images of the Statue of Liberty and a much larger 1M image dataset of Rome. This is, to our knowledge, the largest dataset to which image-based data mining has been applied.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Subjective performance of texture based algorithm for face verification: the role of databases

Subjective performance of texture based algorithm for face v...

引用

6th indian conference on computer vision, graphics and image processing, ICVGIP 2008

作者： Raghavendra, R. Rao, Ashok Kumar.G, Hemantha Department of studies in Computer Science University of Mysore Mysore-570 006 India Dept of Computer Science J.S.S. College of Arts Commerce and Science Mysore-570 025 India

ISBN: (纸本)9780769534763

This paper address new face verification scheme based on Log-Gabor filter (texture based) and Gaussian Mixture Model. The proposed method consists of three parts. The first part is a Log-Gabor filtering on facial image. The second part is to model the Log-Gabor filter response using Gaussian Mixture Model to obtain more than one set of features. The third part is transforming the set of features using subspace methods such as Principal Component Analysis (PCA) and Independent Component Analysis (ICA). Thus, in this paper two methods namely Log-Gabor Mixture Model (LGMM) based on PCA and Log-Gabor Mixture Model based (LGMM) on ICA is proposed. Proposed methods are evaluated for its performance by conducting series of experiments on three image databases: ORL, AR, YALE face database. The nature of type & size of databases chosen on the performance of these algorithms are also studied. The experimental results indicate the efficacy of the proposed methods and varied nature of results based on these algorithms. © 2008 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Fast, Processor-Cardinality Agnostic PRNG with a Tracking Application

Fast, Processor-Cardinality Agnostic PRNG with a Tracking Ap...

引用

6th indian conference on computer vision, graphics and image processing

作者： Janowczyk, Andrew Chandran, Sharat Aluru, Srinivas Indian Inst Technol Dept Comp Sci & Engn ViGIL Bombay 400076 Maharashtra India Iowa State Univ Sci & Technol Ames IA 50011 USA

ISBN: (纸本)9781424442195

As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly important. At the same time, execution time demands have seen algorithms being implemented on evolving parallel hardware such as GPUs. The Mersenne Twister (MT) [7] has proven to be the current state of the art for generating high quality random numbers, and the Nvidia provided software for parallel MT is in widespread use. While execution time is important, development time is also critical. As processor cardinality changes, a foundation for generating simulations that will vary only in execution time and not in the actual result is useful;otherwise the development time will be impacted. In this paper we present an implementation of the Lagged Fibonacci Generator (LFG) considered to be of quality equal [7] to MT on the GPU. Unlike MT LFG has this important processor-cardinality agnostic capability that is - as the number of processing resources changes, the overall sequence of random numbers remains the same. This feature notwithstanding, our basic implementation is roughly as fast as the parallel MT;an in-memory version is actually 25% faster in execution time. Both parallel MT as well as parallel LFG show enormous speedup over their sequential counterparts. Finally, a prototype particle filter tracking application shows that our method works not just in parallel computing theory, but also in practice for vision applications, providing a decrease of 60% in execution time.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

A Parallel Architecture for Successive Elimination Block Matching Algorithm

A Parallel Architecture for Successive Elimination Block Mat...

引用

6th indian conference on computer vision, graphics and image processing

作者： Srinivasarao, B. K. N. Chakrabarti, Indrajit Indian Inst Technol Dept Elect & Elect Commun Engn Kharagpur 721302 W Bengal India

ISBN: (纸本)9781424442195

This paper proposes a parallel architecture for a successive elimination algorithm (SEA), which is used in block matching motion estimation. SEA effectively eliminates the search points within the search window and thus decreases the number of matching evaluation instances that require very intensive computations compared to the standard full search algorithm (FSA). The proposed architecture for SEA decreases the time to calculate the motion vector by 57 percent compared to FSA. The performance while applying the SEA to several standard video clips has been shown to be same compared to the standard FSA. The proposed architecture uses 16 processing elements accompanied with use of intelligent data arrangement and memory configuration. A technique for reducing external memory accesses has also been developed. The proposed architecture for SEA provides an efficient solution for applications requiring real-time motion estimations. For, it serves to compute motion vectors in less amount of time while requiring almost same power and some increase in area compared to a similar architecture for implementing the full search algorithm. A register-transfer level implementation as well as simulation results on benchmark video clips are presented. Relevant design statistics on area and power for comparing between SEA and FSA implementations are also provided.

关键词： motion estimation parallel architectures successive elimination video processing processing element

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Based Slow and Fast Moving Video Object Detection Scheme Using Compound Markov Random Field Model

An Evolutionary Based Slow and Fast Moving Video Object Dete...

引用

6th indian conference on computer vision, graphics and image processing

作者： Subudhi, Badri Narayan Nanda, Pradipta Kumar Natl Inst Technol Dept Elect Engn Rourkela India CV Raman Coll Engn Dept Elect & TeleCommun Bhubaneswar Orissa India

ISBN: (纸本)9781424442195

We propose an evolving scheme to detect slow as well as fast moving objects in a video sequence. The proposed scheme employ, both spatio-temporal and temporal segmentation to obtain the Video Object plane and hence detection. We propose a Compound Markov Random Field Model as the a priori image model that takes into account the spatial distribution of the current frame, temporal frames and the edge maps of the temporal frames. The spatio-temporal segmentation is cast as a pixel labeling problem and the labels are the MAP estimates. The MAP estimates of a frame are obtained by a hybrid algorithm. The spatial segmentation of a given frame evolves to generate the spatial segmentation of the subsequent frames. The evolved spatial segmentation together with the temporal segmentation produces the Video Object Plane (VOP) and hence detection. Our scheme does require the computation of spatio-temporal segmentation of the initial frame thus speeding up the whole process. The results of the proposed scheme are compared with JSEG method are found to be better in terms of the misclassification error

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

Robust Detection of Microaneurysms for Sight Threatening Retinopathy Screening

Robust Detection of Microaneurysms for Sight Threatening Ret...

引用

6th indian conference on computer vision, graphics and image processing

作者： Bhalerao, Abhir Patanaik, Amiya Anand, Sarabjot Saravanan, Pounnusamy Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Indian Inst Technol Kharagpur W Bengal India Univ Hosp Coventry & Warwickshire Warwickshire England

ISBN: (纸本)9781424442195

Diabetic retinopathy is one of the major causes of blindness. However diabetic retinopathy does not usually cause a loss of sight until it has reached an advanced stage. The earliest sign of the disease are microaneurysms (MA) which appear as small red dots on retinal fundus images. Various screening programmes have been established in the UK and other countries to collect and assess images on a regular basis, especially in the diabetic population. A considerable amount of time and money is spent in manually grading these images, a large percentage of which are normal. By automatically identifying the normal images, the manual workload and costs could be reduced greatly while increasing the effectiveness of the screening programmes. A novel method of microaneurysm detection from digital retinal screening images is proposed. It is based on filtering using complex-valued circular-symmetric filters, and an eigen-image, morphological analysis of the candidate regions to reduce the false-positive rate. We detail the image processing algorithms and present results on a typical set of 89 image from a published database. Our method is shown to have a best operating sensitivity of 82.6% at a specificity of 80.2% which makes it viable for screening. We discuss the results in the context of a model of visual search and the ROC curves that it can predict.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

A Switched Predictive Coding Method for Lossless Video Coding

A Switched Predictive Coding Method for Lossless Video Codin...

引用

6th indian conference on computer vision, graphics and image processing

作者： Tiwari, Anil Kumar Kumar, R. V. Raja LNM Inst Informat Technol Jaipur Rajasthan India Indian Inst Technol Kharagpur W Bengal India

ISBN: (纸本)9781424442195

This paper presents a switched predictive coding method for lossless compression of video. In the proposed method, a set of switched predictors is found by a training process that uses only a small number of successive frames of a video and then the trained predictors are used with a large number of the frames of the video. To find the predictors, the pixels of the successive frames are first classified based on an estimate of activity level in their neighbouring pixels and then LS based feedback type of predictors are estimated for all the pixels belonging to each of the classes. We propose a total of 21 classes, which are obtained by combining the seven slope bins of Gradient Adjusted Predictor (GAP) and three classified temporal contexts. After collecting the predictors for pixels belonging to each of the 21 classes, the best predictor in terms of minimum zero-order entropy, is chosen to represent the various classes. Simulation results show that the application of the set of the predictors results in competitive performance with the LOPT - one of the best methods in terms of achievable compression ratio. Our method and LOPT has same order of coding complexity while our decoder is computationally very simple as against high complexity of LOPT based decoder

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 124 125 126 127 128 129 130 131 132 133 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：