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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

163 篇 会议
21 篇 期刊文献
5 册 图书

馆藏范围

189 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

107 篇 工学
- 69 篇 计算机科学与技术...
- 58 篇 软件工程
- 27 篇 信息与通信工程
- 22 篇 光学工程
- 19 篇 控制科学与工程
- 15 篇 机械工程
- 13 篇 电气工程
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 生物工程
- 6 篇 化学工程与技术
- 5 篇 电子科学与技术（可...
- 4 篇 土木工程
- 3 篇 仪器科学与技术
- 3 篇 建筑学
- 3 篇 航空宇航科学与技...
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
63 篇 理学
- 47 篇 数学
- 20 篇 物理学
- 10 篇 统计学（可授理学、...
- 9 篇 生物学
- 3 篇 化学
- 3 篇 系统科学
- 1 篇 大气科学
17 篇 管理学
- 10 篇 管理科学与工程(可...
- 10 篇 图书情报与档案管...
- 2 篇 工商管理
3 篇 法学
- 3 篇 社会学
2 篇 医学

主题

48 篇 pattern recognit...
34 篇 image processing
26 篇 image segmentati...
17 篇 shape
16 篇 automation
15 篇 computer vision
15 篇 image reconstruc...
14 篇 image analysis
12 篇 cameras
8 篇 ceramics
7 篇 mobile robots
7 篇 computer graphic...
7 篇 feature extracti...
7 篇 robustness
6 篇 image edge detec...
6 篇 robot sensing sy...
6 篇 visualization
6 篇 biomedical imagi...
6 篇 image color anal...
6 篇 pattern analysis

机构

21 篇 pattern recognit...
15 篇 pattern recognit...
9 篇 pattern recognit...
6 篇 institute for co...
6 篇 institute of com...
5 篇 image processing...
5 篇 faculty of compu...
4 篇 institute of com...
4 篇 pattern recognit...
4 篇 vienna universit...
4 篇 institute for co...
4 篇 pattern recognit...
4 篇 pattern recognit...
3 篇 institute for co...
3 篇 pattern recognit...
3 篇 pattern recognit...
3 篇 the institute of...
3 篇 image processing...
2 篇 pattern recognit...
2 篇 japan advanced i...

作者

29 篇 kropatsch walter...
15 篇 r. sablatnig
15 篇 sablatnig robert
12 篇 m. kampel
12 篇 robert sablatnig
11 篇 h. bischof
11 篇 bischof horst
11 篇 sergiu nedevschi
10 篇 haxhimusa yll
9 篇 kampel martin
8 篇 walter g. kropat...
6 篇 kampel m.
5 篇 menard christian
5 篇 g. langs
5 篇 langs georg
4 篇 glantz roland
4 篇 walter kropatsch
4 篇 thirde david
4 篇 ion adrian
4 篇 lettner martin

语言

184 篇 英文
4 篇 其他
1 篇 中文

检索条件"机构=head of the Image Processing and Pattern Recognition Group"

共 189 条记录，以下是1-10 订阅

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

详细简洁

排序：

Reducing the Computational Complexity of the Eccentricity Transform of a Tree 13th

Reducing the Computational Complexity of the Eccentricity...

引用

13th IAPR-TC-15 International Workshop on Graph-Based Representations in pattern recognition, GbRPR 2023

作者： Banaeyan, Majid Kropatsch, Walter G. Pattern Recognition and Image Processing Group TU Wien Vienna Austria

ISBN: (纸本)9783031427947

This paper proposes a novel approach to reduce the computational complexity of the eccentricity transform (ECC) for graph-based representation and analysis of shapes. The ECC assigns to each point within a shape its geodesic distance to the furthest point, providing essential information about the shape’s geometry, connectivity, and topology. Although the ECC has proven valuable in numerous applications, its computation using traditional methods involves heavy computational complexity. To overcome this limitation, we present a method that computes the ECC of a tree, significantly reducing the computational complexity from O(n2log(n) ) to O(b), where n and b are the numbers of vertices and branching points in the tree, respectively. Our method begins by computing the ECC for tree structures, which are simpler representations of shapes. Subsequently, we introduce the concept of a 3D curve that corresponds to a smooth shape without holes, enabling the computation of the ECC for more complex shapes. By leveraging the 3D curve representation, our method provides an upper-bound approximation of the ECC, which can be effectively utilized in various applications. The proposed approach not only preserves the valuable properties of the ECC but also significantly reduces the computational burden, making it a more efficient and practical solution for graph-based representation and analysis of shapes in both 2D and 3D contexts. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Removing Redundancies in Binary images 2nd

Removing Redundancies in Binary Images

引用

2nd International Conference on Intelligent Systems and pattern recognition, ISPR 2022

作者： Banaeyan, Majid Batavia, Darshan Kropatsch, Walter G. Pattern Recognition and Image Processing Group 193/03 TU Wien Vienna Austria

ISBN: (纸本)9783031082764

Every day a huge amount of digital data is generated. processing such big data encourages efficient data structure and parallelized operations. In this regard, this paper proposes a graph-based method reducing the memory requirement of the data storage. Graphs as a versatile representative tool in intelligent systems and pattern recognition may consist of many nonessential edges accumulating memory. This paper defines the structure of such redundant edges in the neighborhood graph of a 2D binary image. We introduce a novel approach for contracting the edges that simultaneously assists in determining the structurally redundant edges. In addition, finding a set of independent edges, the redundant edges are removed in parallel with the complexity O(1 ). Theoretically, we prove that the maximum number of redundant edges is bounded by half of all edges. Practical results show the memory requirement decreases significantly depending on the input data in different categories of binary image data sets. Using the combinatorial map as the data structure, first the topological structure of the graph is preserved. Second, the method can be extended to higher dimensions (nD). © 2022, Springer Nature Switzerland AG.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Parallel O(log(n) ) Computation of the Adjacency of Connected Components 3rd

Parallel O(log(n) ) Computation of the Adjacency of Conne...

引用

3rd International Conference on pattern recognition and Artificial Intelligence, ICPRAI 2022

作者： Banaeyan, Majid Kropatsch, Walter G. TU Wien Pattern Recognition and Image Processing Group 193/03 Vienna Austria

ISBN: (纸本)9783031092817

Connected Component Labeling (CCL) is a fundamental task in pattern recognition and image processing algorithms. It groups the pixels into regions, such that adjacent pixels have the same label while pixels belonging to distinct regions have different labels. The common linear-time raster scan CCL techniques have a complexity of O(image- size) in a 2D binary image. To speed up the procedure of the CCL, the paper proposes a new irregular graph pyramid. To construct this pyramid, we use a new formalism [1] that introduces an order of the pixels in the base grid to detect the redundant edges through the hierarchical structure. These redundant edges, unlike the usual methods of constructing the irregular pyramid, are removed before contracting the edges. This not only simplifies the construction processes but may decrease memory consumption by approximately half. To perform the CCL task efficiently the proposed parallel algorithm reduces the complexity to O(log(n) ) where the n is the diameter of the largest connected component in the image. In addition, using an efficient combinatorial structure the topological properties of the connected components including adjacency of CCs, multi-boundaries and inclusions are preserved. Finally, the mathematical proofs provide fully parallel implementations and lead to efficient results in comparison with the state-of-the-art. © 2022, Springer Nature Switzerland AG.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Accuracy vs Speed Trade-offs in Multi-Frame LiDAR-based Linear Correction for Visual Odometry 19

Accuracy vs Speed Trade-offs in Multi-Frame LiDAR-based Line...

引用

19th IEEE International Conference on Intelligent Computer Communication and processing Conference, ICCP 2023

作者： Cobarzan, Corvin-Petrut Golban, Catalin-Cosmin Nedevschi, Sergiu Technical University of Cluj-Napoca Computer Science Department Romania Technical University of Cluj-Napoca Image Processing and Pattern Recognition Group Romania

ISBN: (纸本)9798350370355

Our previously proposed linear approach for reducing the global drift of a video-based frame-to-frame trajectory estimation method corrects it at selected points in time based on the alignment of one past and the current 3D LiDAR measurements (see [7]). In this paper we improve on that method essentially by adding multi-past frame LiDAR point cloud alignment constraints and by performing the correction more often. While this significantly improves the accuracy of the estimation, it has the downside effect of decreasing the overall runtime performance. We thus study the trade-off between accuracy and speed and propose a couple of higher accuracy but real time correction versions. Their evaluation on the KITTI dataset results in an overall performance falling into the so called SLAM-nonSLAM gap. © 2023 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Pyramidal Connected Component Labeling by Irregular Graph Pyramid 5

Pyramidal Connected Component Labeling by Irregular Graph Py...

引用

5th International Conference on pattern recognition and image Analysis, IPRIA 2021

作者： Banaeyan, Majid Kropatsch, Walter G. Vienna University of Technology Pattern Recognition and Image Processing Group 193/03 Vienna Austria

ISBN: (纸本)9781665426596

This paper presents a new logarithmic-time algorithm which simultaneously assigns labels to all connected components of a binary image in parallel. The irregular graph pyramid of an input binary image is constructed based on the optimized combinatorial structure. The novel small built pyramid has only three levels and is created at worst case with O(log(N2)) complexity for a N× N-sized (2D) binary image. To assign a label to each connected component, instead of the common linear-time raster scan techniques (with complexity O(N2)), only two important movements, namely bottom-up and top-down traversing, are needed. First, in the bottom-up traversing, the redundant connections are removed and the contraction kernels are contracted. This results in a simpler graph at top of the pyramid each of its vertices has a unique label identifying corresponding connected component. Such reduced graph preserves all connecting relations including inclusions. Second, in the top-down traversing, each unique label propagates down into each individual corresponding pixel at the base level. The complexity of the labeling propagation procedure in worst cases is O (log(image - size)). The GPU implementation of the algorithm has high performance and the bottleneck is the bandwidth of the memory or equivalently the number of available independent processing elements. Finally, the experimental results show the proposed algorithm outperforms the other state-of-the-art methods. © 2021 IEEE.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Vehicle Routing Problem with Time Windows using Hybrid Metaheuristic Dragonfly Algorithm and Variable Neighborhood Search: Work on Progress 11

Vehicle Routing Problem with Time Windows using Hybrid Metah...

引用

11th International Conference on Electrical Engineering, Computer Science and Informatics, EECSI 2024

作者： Yunita, Yunita Stiawan, Deris Rini, Dian Palupi Sriwijaya University Faculty of Computer Science Indonesia Sriwijaya University Intelligent System Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Communication Network and Information Security Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Image Processing Dan Pattern Recognition Laboratory Group Faculty of Computer Science South Sumatera Palembang Indonesia

ISBN: (纸本)9798350355314

One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems © 2024 IEEE.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Anatomy recognition in CT images of head and neck region via precision atlases

Anatomy recognition in CT images of head and neck region via...

引用

Medical Imaging 2021: image processing

作者： Li, Jieyu Udupa, Jayaram K. Tong, Yubing Odhner, Dewey Torigian, Drew A. Institute of Image Processing and Pattern Recognition Department of Automation Shanghai Jiao Tong University China Medical Image Processing Group Department of Radiology University of Pennsylvania United States

ISBN: (纸本)9781510640214

Multi-atlas segmentation methods will benefit from atlases covering the complete spectrum of population patterns, while the difficulties in generating such large enough datasets and the computation burden required in the segmentation procedure reduce its practicality in clinical application. In this work, we start from a viewpoint that different parts of the target object can be recognized by different atlases and propose a precision atlas selection strategy. By comparing regional similarity between target image and atlases, precision atlases are ranked and selected by the frequency of regional best match, which have no need to be globally similar to the target subject at either image-level or object-level, largely increasing the implicit patterns contained in the atlas set. In the proposed anatomy recognition method, atlas building is first achieved by all-totemplate registration, where the minimum spanning tree (MST) strategy is used to select a registration template from a subset of radiologically near-normal images. Then, a two-stage recognition process is conducted: in rough recognition, sub-image level similarity is calculated between the test image and each image of the whole atlas set, and only the atlas with the highest similarity contributes to the recognition map regionally;in refined recognition, the atlases with the highest frequencies of best match are selected as the precision atlases and are utilized to further increase the accuracy of boundary matching. The proposed method is demonstrated on 298 computed tomography (CT) images and 9 organs in the head and Neck (HN) body region. Experimental results illustrate that our method is effective for organs with different segmentation challenge and samples with different image quality, where remarkable improvement in boundary interpretation is made by refined recognition and most objects achieve a localization error within 2 voxels. © 2021 SPIE.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

Accuracy vs Speed Trade-offs in Multi-Frame LiDAR-based Linear Correction for Visual Odometry

Accuracy vs Speed Trade-offs in Multi-Frame LiDAR-based Line...

引用

IEEE International Conference on Intelligent Computer Communication and processing (ICCP)

作者： Corvin-Petruţ Cobârzan Cătălin-Cosmin Golban Sergiu Nedevschi Computer Science Department Technical University of Cluj-Napoca Romania Image Processing and Pattern Recognition Group Technical University of Cluj-Napoca Romania

关键词：

来源：评论

学校读者我要写书评

暂无评论

image = Structure + Few Colors

Image = Structure + Few Colors

引用

Joint IAPR International Workshops on Structural, Syntactic and Statistical Techniques in pattern recognition, S+SSPR 2020

作者： Batavia, Darshan Gonzalez-Diaz, Rocio Kropatsch, Walter G. TU Wien Pattern Recognition and Image Processing Group 193/03 Vienna Austria Applied Math I University of Seville Seville Spain

ISBN: (纸本)9783030739720

Topology plays an important role in computer vision by capturing the structure of the objects. Nevertheless, its potential applications have not been sufficiently developed yet. In this paper, we combine the topological properties of an image with hierarchical approaches to build a topology preserving irregular image pyramid (TIIP). The TIIP algorithm uses combinatorial maps as data structure which implicitly capture the structure of the image in terms of the critical points. Thus, we can achieve a compact representation of an image, preserving the structure and topology of its critical points (maxima, the minima and the saddles). The parallel algorithmic complexity of building the pyramid is O(log d) where d is the diameter of the largest object. We achieve promising results for image reconstruction using only a few color values and the structure of the image, although preserving fine details including the texture of the image. © 2021, Springer Nature Switzerland AG.

关键词： image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Visual Odometry Drift Reduction Based on LiDAR Point Clouds Alignment 17

Visual Odometry Drift Reduction Based on LiDAR Point Clouds ...

引用

17th IEEE International Conference on Intelligent Computer Communication and processing, ICCP 2021

作者： Golban, Cǎtǎlin-Cosmin Cobârzan, Corvin-Petruţ Nedevschi, Sergiu Technical University of Cluj-Napoca Computer Science Department Romania Technical University of Cluj-Napoca Image Processing and Pattern Recognition Group Romania

ISBN: (纸本)9781665409766

Visual and LiDAR based odometry methods are key enablers for autonomous robots sub-problems such as mapping and localization or temporal aggregation and fusion of sensor data. When it comes to trajectory reconstruction the errors of independent local estimations accumulate over time, resulting in overall drifts from the real trajectory. This paper proposes a method for reducing the global drift by correcting the video-based frame-to-frame trajectory estimation at selected points in time based on the alignment of past and current LiDAR 3D measurements. The main strength of the proposed method is the formulation of the problem as a system of linear equations, which is an adequate numerical approximation as the corrective component is small enough. In this way we eliminate the need to deploy expensive non-linear optimization methods for calculating the correction transform. © 2021 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：