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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,413 篇 会议
55 册 图书
27 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,010 篇 工学
- 901 篇 计算机科学与技术...
- 410 篇 软件工程
- 389 篇 电气工程
- 131 篇 信息与通信工程
- 122 篇 光学工程
- 90 篇 生物工程
- 65 篇 生物医学工程（可授...
- 58 篇 电子科学与技术（可...
- 38 篇 控制科学与工程
- 34 篇 化学工程与技术
- 29 篇 机械工程
- 21 篇 仪器科学与技术
- 17 篇 安全科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 建筑学
- 8 篇 土木工程
347 篇 医学
- 344 篇 临床医学
- 27 篇 基础医学(可授医学...
- 26 篇 药学(可授医学、理...
333 篇 理学
- 158 篇 物理学
- 147 篇 数学
- 93 篇 生物学
- 47 篇 统计学（可授理学、...
- 32 篇 化学
- 16 篇 系统科学
92 篇 管理学
- 69 篇 图书情报与档案管...
- 23 篇 管理科学与工程(可...
- 13 篇 工商管理
12 篇 农学
- 12 篇 作物学
10 篇 法学
- 9 篇 社会学
6 篇 经济学
3 篇 教育学
2 篇 文学
1 篇 艺术学

主题

142 篇 computer vision
80 篇 image processing
77 篇 image segmentati...
54 篇 computer graphic...
54 篇 feature extracti...
52 篇 cameras
46 篇 deep learning
38 篇 shape
35 篇 face recognition
34 篇 image reconstruc...
33 篇 artificial intel...
30 篇 robustness
28 篇 object detection
28 篇 image color anal...
25 篇 image enhancemen...
25 篇 image edge detec...
25 篇 pattern recognit...
25 篇 layout
24 篇 biometrics
23 篇 image processing...

机构

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,484 篇 英文
8 篇 中文
3 篇 其他

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

共 1495 条记录，以下是891-900 订阅

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

详细简洁

排序：

Finding group interactions in social gathering videos 14

Finding group interactions in social gathering videos

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Bhargava, Neha Chaudhuri, Subhasis Indian Institute of Technology Bombay Mumbai India

ISBN: (纸本)1595930361

In this paper, we propose a framework for recognizing the group dynamics embedded in social gathering videos. We aim to identify interacting sub-groups present in a scene. In particular we are interested in identifying the participants converging to form a group, the participants dispersing from a group and the ones in static groups. We use the linear cyclic pursuit (LCP) based framework to model the collective motion. The proposed algorithm employs trajectories of individuals over a period of time to estimate the model parameters. We show that the details of group dynamics are hidden in the eigenvalues and eigenvectors of the pursuit matrix. The experiments are done on the simulated data as well as on the real gathering videos. The results show a promising scope of the proposed approach. Copyright 2014 ACM.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Anatomical model-guided segmentation of brain MR image sequences 14

Anatomical model-guided segmentation of brain MR image seque...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Mondal, Prasenjit Mukhopadhyay, Jayanta Sural, Shamik Bhattacharyya, Pinak Pani Department of Computer Science and Engineering Indian Institute of Technology Kharagpur West Benagl India School of Information Technology Indian Institute of Technology Kharagpur West Benagl India Department of Radiology Quadra Medical Services Pvt. Ltd. Kolkata India

ISBN: (纸本)1595930361

This paper presents a method for segmentation of human brain magnetic resonance (MR) image sequences based on a 3D human brain model (triangulated mesh). The brain model is composed of four components, namely, cerebrum, cerebellum, brain stem and pituitary gland. Synthesized image sequences are extracted from the model at regular intervals for sagittal and coronal views as done in MR imaging. To align a series of real MR images with these synthesized cross-sections, an efficient dynamic programming based computational technique has been used that obtains the optimal synthesized cross-section sequence corresponding to the series of MR images. For automatic segmentation of anatomical structures from the MR images, each aligned synthesized cross-section is overlaid on the corresponding physical MR image by carrying out appropriate geometric transformation. This transformation produces model guided boundaries for four segments corresponding to cerebrum, cerebellum, brain stem and pituitary gland. Subsequently, these initial contours are further refined by the method of active contouring, which provides segmentation of 3D MR images into the above mentioned four parts. The proposed method compares well with the recently proposed Charged Fluid Model (CFM) based approach and level set segmentation method in terms of accuracy at a significantly lower computational cost. Copyright 2014 ACM.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

Robust articulated chain identification via consensual clustering 14

Robust articulated chain identification via consensual clust...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Gadia, Romil Mukerjee, Amitabha Indian Institute of Technology Kanpur India

ISBN: (纸本)1595930361

Approaches to articulated kinematic chain analysis suffer from a lack of robustness in segmentation which affects all upstream tasks. In this work, we consider revolute chains (all joints are hinges, or ball-and-socket), and show that Sparse Spectral Clustering (SSC) is more likely to agree on tracked data points that are far from the joint. We then develop two variants of consensual clustering which marks tracks as outliers if different classifiers do not agree. This leaves a large set of points in each link, and enables robust segmentation for many real-life situations. In addition to results on Hopkins-155 [18] and Yan-Pollefeys [21, 22, 23] datasets, we also release additional datasets involving revolute chains. Copyright is held by the authors.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

ProLoSAC : An improved RANSAC algorithm for pairwise registration of 3D point clouds 14

ProLoSAC : An improved RANSAC algorithm for pairwise registr...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Pankaj, Dhanya S. Nidamanuri, Rama Rao Pinnamaneni, Bhanu Prasad Indian Institute of Space Science and Technology Thiruvananthapuram India Rajalakshmi Engineering College Chennai India

ISBN: (纸本)1595930361

Registration of partially overlapping 3D point clouds of an object is the initial phase in the 3D modeling pipeline. The automatic coarse alignment of a pair of 3D images is usually performed by 3D feature matching. Robust estimators like RANSAC are employed for 3D transformation estimation from point correspondences obtained by feature matching, in the presence of outliers. The number of RANSAC iterations required depends directly on the number of correspondences and inliers. Many variants of RANSAC have been proposed for the computer vision tasks like stereo matching, structure and motion estimation, image retrieval etc. This paper presents a study on the potential of two widely stated RANSAC variants - PROSAC and LoSAC - for 3D registration. Further, a new algorithm -ProLoSAC - which combines the relative merits of the two is proposed. The proposed algorithm has been evaluated on different pairs of partially overlapping 3D views of three different 3D models. The results indicate that the proposed algorithm finds the best transformation in less iteration compared to the other algorithms. Copyright 2014 ACM.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Fingerprint enhancement using unsupervised hierarchical feature learning 14

Fingerprint enhancement using unsupervised hierarchical feat...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Sahasrabudhe, Mihir Namboodiri, Anoop M. Centre for Visual Information Technology IIIT Hyderabad India

ISBN: (纸本)1595930361

We present an approach for learning low- and high-level fingerprint structures in an unsupervised manner, which we use for enhancement of fingerprint images and estimation of orientation fields, frequency images, and region masks. We incorporate the use of a convolutional deep belief network to learn features from greyscale, clean fingerprint images. We also show that reconstruction performed by the learnt network works as a suitable enhancement of the fingerprint, and hierarchical probabilistic inference is able to estimate overall fingerprint structures as well. Our approach performs better than Gabor-based enhancement and short time Fourier transform-assisted enhancement on images it was trained on. We further use information from the learnt features in first layer, which are short and oriented ridge structures, to extract the orientation field, frequency image, and region mask of input fingerprints. Copyright 2014 ACM.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

High throughput MR image reconstruction using compressed sensing 14

High throughput MR image reconstruction using compressed sen...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Deka, Bhabesh Datta, Sumit Dept. of Electronics and Communication Engg. Tezpur University Tezpur Assam784028 India

ISBN: (纸本)1595930361

Magnetic resonance imaging (MRI) is an essential soft tissue imaging technique. Major limitation of this imaging technique is due to its slow acquisition. MR image reconstruction using the compressed sensing (CS) has mainly two research areas, one, how efficiently MRI data can be acquired and the other is how fast the reconstruction can be done without degrading the quality of the reconstructed images. From the recent study, it is observed that the TV-1 -2 model for MR image reconstruction from random under-sampled data gives the best result. In this paper, we propose a novel high throughput MR image reconstruction algorithm without compromising the quality. The experimental results show that the proposed method is quite efficient compared to the state-of-the-art MR image reconstruction techniques based on compressed sensing in terms of the cpu time and the quality of the reconstructed images. Copyright 2014 ACM.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Digitization of historic inscription images using cumulants based simultaneous blind source extraction 14

Digitization of historic inscription images using cumulants ...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Jayanthi, N. Tomar, Ayush Raj, Aman Indu, S. Chaudhury, Santanu Delhi Technological University New Delhi India Indian Institute of Technology New Delhi India

ISBN: (纸本)1595930361

In this paper a novel method to address the problem of enhancement and binarization of historic inscription images is presented. Inscription images in general have no distinction between the text layer and background layer due to absence of color difference and possess highly correlated signals and noise. The proposed technique provides a suitable method to separate the text layer from the historic inscription images by considering the problem as blind source separation which aims to calculate the independent components from a linear mixture of source signals, by maximizing a contrast function based on higher order cumulants. Further, the results are compared with existing ICA based techniques like NGFICA and Fast-ICA. Copyright 2014 ACM.

关键词： Blind source separation

来源：评论

学校读者我要写书评

暂无评论

Distributed video coding using local rank transform 14

Distributed video coding using local rank transform

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Mallick, Kallol Mukherjee, Jayanta Indian Institute of Technolgy Kharagpur Kharagpur India

ISBN: (纸本)1595930361

In today's world, with advanced technology and easily available portable gadgets as enabler, video has become an important medium of communication. While, the standard H.264/AVC has produced extremely good results, it has not been suitable for this application domain as it is computationally intensive and unsuitable for low-power resources. In distributed video coding (DVC), an encoder requires less computation than the decoder, which usually runs at sites of higher computational resources. Our approach is to find out a novel approach in DVC, to reduce encoder complexity, using local rank transform (LRT). LRT relies on the relative ordering of local intensity values for application on visual correspondence problem. Use of LRT in DVC, to the best of our knowledge, has not been reported in literature before. First, we have developed techniques for image reconstruction using LRT and then design a DVC codec using it. We show analytically and by experimental results, that, in power-rate-distortion model, LRT encoder outperforms standard encoder (LDPCA in Stanford architecture) specially in low bit rate condition. Copyright 2014 ACM.

关键词： image reconstruction

来源：评论

学校读者我要写书评

暂无评论

An interactive framework for reconstructing 3D neuronal structures 14

An interactive framework for reconstructing 3D neuronal stru...

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Kumar, Kanuj Natarajan, Vijay Sikdar, S.K. Srinivas, Kalyan V. Computer Science and Automation Indian Institute of Science Bangalore India Supercomputer Education and Research Centre Indian Institute of Science Bangalore India Molecular Biophysics Unit Indian Institute of Science Bangalore India

ISBN: (纸本)1595930361

Neuron reconstruction is a complex and tedious task and neurobiologists today have to rely on time-consuming manual methods. Methods that entail manual tracing may introduce systematic inaccuracies. This necessitates the use of automated methods for reconstruction of neuronal structures. Despite recent advancements, the automation of reconstruction process either does not exhibit robustness against noise of microscopy images or fails to capture precise dendritic structures. This motivates the development of semiautomated methods that require crucial but minimal expert user input. In this paper, we present a fast and interactive framework for reconstruction of neuronal structures that employs automatic methods while allowing a user to provide expert input if the results are unsatisfactory. The framework is designed as a multi-stage pipeline, where in the user provides numerical input parameters to guide the reconstruction process and validates the output of automated methods visually. The user is also assisted by the framework in calculating the optimal values of required parameters for reconstruction. The framework is also able to handle discontinuities and produce a connected geometric model of the neuron structure. Copyright 2014 ACM.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Secret image sharing using fractal codes 14

Secret image sharing using fractal codes

引用

9th indian conference on computer vision, graphics and image processing, ICVGIP 2014

作者： Acharya, Aniruddha Babu, R. Venkatesh Video Analytics Laboratory Supercomputer Education Research Center Indian Institute of Science Bangalore India

ISBN: (纸本)1595930361

Secret sharing is a well known problem of cryptography. A secret has to be shared among a group of N people, in such a way that only when at least K of them use their shares, the secret is revealed. A special case of this problem is secret image sharing, where the secret is an image. Prior work on image sharing has predominantly been visual secret sharing on binary images, where decoding is done by stacking the shares and viewing them. Some of the works address gray scale and color image sharing too. We target secret image sharing for gray scale images and propose a novel solution based on fractal encoding and decoding. The main advantage of our method as compared to the other schemes is that the space complexity of the shares is O(1). That is the sum total of space required for all the shares is independent of N. We have not seen this property in any of the previous works of image sharing. We achieve this by avoiding the use of images as shares, and using partial and modified fractal codes instead. Moreover, our method implicitly does compression along with image sharing. The proposed algorithm has decoding time complexity O(N), which is the state of the art. Experiments have shown that the proposed method is robust to security attacks. Copyright 2014 ACM.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：