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

Change Point Detection using the Kantorovich distance algorithm

IFAC-PapersOnLine 2018年第18期51卷 708-713页

作者： Arifin, B.M.S. Li, Zukui Shah, Sirish L. Department of Chemical and Materials Engineering University of Alberta EdmontonT6G 2V4 Canada

In this article, a novel change detection algorithm is proposed based on the Kantorovich distance concept. Incorporating the proposed change detection algorithm with the existing process monitoring tools may assist the operator in detecting dynamic changes in process plants and provide fewer unnecessary (false) alarms as well as fewer missed alarms. The proposed change detection method was tested through simulation data. It is applied to the benchmark Tennessee Eastman (TE) process in online mode. Results prove the efficacy of the proposed method to detect both the sharp and incipient changes. © 2018

关键词： Linear programming Process monitoring Signal detection Change detection Change detection algorithms Change point detection distance algorithm Dynamic changes Kantorovich distance Tennessee Eastman Transient process

来源：评论

学校读者我要写书评

暂无评论

Building Plane Segmentation Based on Point Clouds

引用

REMOTE SENSING 2022年第1期14卷 95页

作者： Su, Zhonghua Gao, Zhenji Zhou, Guiyun Li, Shihua Song, Lihui Lu, Xukun Kang, Ning Univ Elect Sci & Technol China Sch Resources & Environm 2006 Xiyuan Ave Chengdu 611731 Peoples R China Technol Innovat Ctr Geol Informat Minist Nat Resources 45 Fuwai St Beijing 100037 Peoples R China Dev & Res Ctr China Geol Survey 45 Fuwai St Beijing 100037 Peoples R China Hunan Univ Coll Elect & Informat Engn Lushan Rd S Changsha 410082 Peoples R China

Planes are essential features to describe the shapes of buildings. The segmentation of a plane is significant when reconstructing a building in three dimensions. However, there is a concern about the accuracy in segmenting plane from point cloud data. The objective of this paper was to develop an effective segmentation algorithm for building planes that combines the region growing algorithm with the distance algorithm based on boundary points. The method was tested on point cloud data from a cottage and pantry as scanned using a Faro Focus 3D laser range scanner and Matterport Camera, respectively. A coarse extraction of the building plane was obtained from the region growing algorithm. The coplanar points where two planes intersect were obtained from the distance algorithm. The building plane's optimal segmentation was then obtained by combining the coarse extraction plane points and the corresponding coplanar points. The results show that the proposed method successfully segmented the plane points of the cottage and pantry. The optimal distance thresholds using the proposed method from the uncoarse extraction plane points to each plane boundary point of cottage and pantry were 0.025 m and 0.030 m, respectively. The highest correct rate and the highest error rate of the cottage's (pantry's) plane segmentations using the proposed method under the optimal distance threshold were 99.93% and 2.30% (98.55% and 2.44%), respectively. The F1 score value of the cottage's and pantry's plane segmentations using the proposed method under the optimal distance threshold reached 97.56% and 95.75%, respectively. This method can segment different objects on the same plane, while the random sample consensus (RANSAC) algorithm causes the plane to become over-segmented. The proposed method can also extract the coplanar points at the intersection of two planes, which cannot be separated using the region growing algorithm. Although the RANSAC-RG method combining the RANSAC algorithm and

关键词： building plane point clouds region growing algorithm distance algorithm boundary points

来源：评论

学校读者我要写书评

暂无评论

Automatic Standardization System for Free Text Addresses 27

Automatic Standardization System for Free Text Addresses

引用

27th Signal Processing and Communications Applications Conference (SIU)

作者： Cebeci, Salih ozyilmaz, Merve Ince, Gokhan Hepsiexpress Kocaeli Turkey Istanbul Tech Univ Bilgisayar Muhendisligi Bolumu Istanbul Turkey

ISBN: (纸本)9781728119045

In cases where addresses entry should be entered as free text, it is necessary for the delivery service quality to be improved by correcting the errors and deficiencies of the addresses and standardizing them to geographic coordinate information. In our study, it is aimed to develop a system using Support Vector Machines algorithm which is used on matching free text address data with standard address. The model trained with using classified data serves to express the similarity between a free text address and a standard address as a numerical value. It is confirmed that using the developed system, queries made with free text addresses over a database created from 250.000 addresses, the system has achieved a matching accuracy exceeding 81%.

关键词： text matching distance algorithm

来源：评论

学校读者我要写书评

暂无评论

Fault location of multistage feeders in distribution network 4

Fault location of multistage feeders in distribution network

引用

4th International Conference on Intelligent Green Building and Smart Grid (IGBSG)

作者： Chen, Yanxia Wang, Lu Ji, Hongquan Wang, Jian Yu, Xijuan Gu, Jun Beijing Elect Power Res Inst Beijing 100075 Peoples R China China Three Gorges Univ Coll Elect Engn & New Energy Yichang 443000 Peoples R China Beijing Elect Power Co Beijing 100075 Peoples R China

ISBN: (纸本)9781728121482

To enhance the fault location precision of multistage feeders in distribution network, a new section location method is proposed. In this paper, the fault characteristics of transient zero-sequence current transient components are analyzed, and the amplitude characteristics of zero-sequence current in the upstream and downstream nodes of the fault point are determined by using the mathematical relationship. The Hausdorff distance algorithm is introduced to construct a comprehensive criterion combining section distance and correlation coefficient. Further, the fault section can be effectively distinguished by comparing the criterion with the set threshold The Matlab simulation demonstrates that the proposed method can accurately locate the fault section.

关键词： Multistage feeders distance algorithm correlation coefficient comprehensive criterion section location

来源：评论

学校读者我要写书评

暂无评论

Keystroke dynamics for authentication in smartphone

Keystroke dynamics for authentication in smartphone

引用

7th International Conference on Information and Communication Technology Convergence (ICTC) - Towards Smarter Hyper-Connected World

作者： Roh, Jong-hyuk Lee, Sung-Hun Kim, Soohyung ETRI Cyber Secur Res Div Daejeon South Korea Univ Sci & Technol ETRI Daejeon South Korea

ISBN: (纸本)9781509013258

When entering a PIN on the touch screen of smartphone, users have their unique patterns, which shows different time interval, strength, position, and usage angel. Using this user's pattern, it is possible to distinguish the imposter who knows the user's PIN, then the PIN verification can be enhanced in the smartphone environment. In this paper, we tested classifiers with five features that can be extracted from smartphone sensors. Also, we collected keystroke data for each user's posture, and compared the characteristics of the posture. We consider the importance of preprocessing and feature combinations.

关键词： keystroke dynamics data preprocessing distance algorithm

来源：评论

学校读者我要写书评

暂无评论

A Low Overhead Progressive Transmission for Visual Descriptor Based on Image Saliency

引用

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING 2015年第1期25卷 125-145页

作者： Du, Yegang Li, Zhiyang Stojmenovic, Milos Qu, Wenyu Qi, Heng Dalian Maritime Univ Coll Informat Sci & Technol Dalian Peoples R China Singidunum Univ Dept Informat & Comp Belgrade Serbia Dalian Univ Technol Sch Comp Sci & Technol Dalian Peoples R China

A typical mobile visual search (MVS) application generally follows the client-server architecture. Query images or these descriptors are transmitted from the mobile client to the remote server via the wireless network, to retrieval similar images from the database maintained in the server. Due to bandwidth constrained wireless networks, transmission latency is a bottleneck in present MVS. In some recent works, progressive transmission strategies have been proposed to reduce the transmission latency. The two main concerns in the progressive transmission are finding a proper priority of transmission and making up the recognition rate caused by the transmission loss. To address the two issues, a novel MVS framework is proposed in this paper, consisting of two main parts: a new progressive transmission model based on image saliency (MVSS) and a new matching metric designing for matching silent parts with whole images. Many experiments have been done on the public Stanford image set to evaluate the proposed MVSS system, and the results demonstrate that our framework not only reduces the transmission latency but also achieves a better retrieval accuracy, when comparing with the existing progressive transmission mechanisms.

关键词： Saliency bag of words distance algorithm mobile visual search image retrieval

来源：评论

学校读者我要写书评

暂无评论

MVSS: Mobile Visual Search Based on Saliency

MVSS: Mobile Visual Search Based on Saliency

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Du, Yegang Li, Zhiyang Qu, Wenyu Miao, Siyang Wang, Songhe Qi, Heng Dalian Maritime Univ Coll Informat Sci & Technol Dalian 116023 Peoples R China Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China

ISBN: (纸本)9780769550886

With development of content-based image retrieval (CBIR), mobile visual search (MVS) is a promising application. In typical MVS, similar images are retrieved from the database maintained by the server, given a query image taken by mobile devices. Different from general CBIR, the problem of transmission latency should be considered in MVS. In existing work, the progressive transmission is proposed to minimize the data size in transmission by low-dimensional feature descriptors and compression coding in order to reduce the transmission latency in MVS. Although the retrieval speed is improved by existing progressive transmission methods, the result accuracy is decreased because of the information loss in these methods. To address this problem, this paper proposes a novel framework for MVS which consists of a new progressive transmission model based on image saliency (MVSS) and a new distance metric corresponding to the proposed progressive transmission model. In our framework, we use SIFT descriptors to represent images, which can preserve more information than other low-dimensional feature descriptors and compression coding. Although SIFT is high-dimensional descriptor, we only transmit the SIFT descriptors in salient regions of image to reduce the transmission latency. We evaluate our framework on Stanford image set, and the results demonstrate that our framework not only reduces the transmission latency but also achieves a better retrieval accuracy.

关键词： saliency bag of words distance algorithm

来源：评论

学校读者我要写书评

暂无评论

Two algorithms for biospecimen comparison and differentiation using SNP genotypes

引用

PHARMACOGENOMICS 2013年第4期14卷 379-390页

作者： Morris, Scott Gel, Esma S. Smith, Jordan V. Paulauskis, Joseph D. van den Boom, Dirk Oeth, Paul Penny, Robert Int Genom Consortium Phoenix AZ 85004 USA Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA Sequenom Inc San Diego CA 92121 USA

Biobanks are frequently required to verify specimen relationships. We present two algorithms to compare SNP genotype patterns that provide an objective, high-throughput tool for verification. Methods: The first algorithm allows for comparison of all holdings within a biobank, and is well suited to construct sample relationships de novo for comparison with assumed relationships. The second algorithm is tailored to oncology, and allows one to confirm that paired DNAs from malignant and normal tissues are from the same individual in the presence of copy number variations. To evaluate both algorithms, we used an internal training data set (n = 1504) and an external validation data set (n = 1457). Results: In comparison with the results from manual review and a priori knowledge of patient relationships, we identified no errors in interpreting sample relationships within our validation data set. Conclusion: We provide an efficient and objective method of automated data ana-lysis that is currently lacking for establishing and verifying specimen relationships in biobanks.

关键词： biobanking distance algorithm human identification loss of heterozygosity SNP

来源：评论

学校读者我要写书评

暂无评论

Trajectory planning and collisions detector for robotic arms

引用

NEURAL COMPUTING & APPLICATIONS 2012年第8期21卷 2105-2114页

作者： de Jesus Rubio, Jose Garcia, Enrique Pacheco, Jaime Inst Politecn Nacl ESIME Azcapotzalco Secc Estudios Posgrad & Invest Mexico City 02250 DF Mexico

The major contributions of this paper are as follows: (1) the Gilbert-Johnson-Keerthi (GJK) algorithm is a collisions detector algorithm, a modified Gilbert-Johnson-Keerthi algorithm is presented, the proposed GJK algorithm uses a different distance, (2) some examples of GJK algorithm are presented, in the last example, the GJK distance algorithm is used to detect the collisions of a camera with its environment inside of a warehouse, the camera cannot cross any part of the structure of the warehouse, the camera needs to go around the structure, when the camera touches the structure, the camera goes to the right or to the left, (3) the time used in a cycle of work of the transelevator robotic arm is presented, it can be extended to other kind of robotic arms, (4) some examples of the time used in a cycle of work are presented, in the least example, the algorithm is used to control the time needed for the transelevator to go from one place to other one, (5) this paper presents a new trajectory planning algorithm which divides the trajectory in n periods, when n is equal to 2, the proposed algorithm is the same as other algorithms, but for n higher than 2, the proposed algorithm gives other optional trajectories, so the proposed algorithm lets the designer to take a better trajectory than with the previous algorithms, (6) some examples of the proposed trajectories planning algorithm are presented, in the least example, the proposed trajectory planning algorithm is used to control the movements of a transelevator inside of a warehouse.

关键词： Collisions detector algorithm distance algorithm Cycle of work algorithm Trajectory planning algorithm

来源：评论

学校读者我要写书评

暂无评论

A Clustering Method Based on K-Means algorithm

引用

Physics Procedia 2012年 25卷 1104-1109页

作者： Youguo Li Haiyan Wu Department of Computer Science Xinyang Agriculture College Xinyang Henan 464000 China

In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-Means algorithm effectively solved two disadvantages of the traditional algorithm, the first one is greater dependence to choice the initial focal point, and another one is easy to be trapped in local minimum [1] , [2] .

关键词： cluster analysis K-Means algorithm distance algorithm samples of pattern

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：