A Geometric Data Structure Applicable to Image Mining and Retrieval

2010 ◽  
pp. 364-373
Author(s):  
T. Iwaszko ◽  
Mahmoud Melkemi ◽  
L. Idoumghar
Keyword(s):  
Data Structure ◽  
Image Mining ◽  
Geometric Data

scholarly journals Efficient Data Structures for Range Shortest Unique Substring Queries

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 276
Author(s):  
Paniz Abedin ◽  
Arnab Ganguly ◽  
Solon P. Pissis ◽  
Sharma V. Thankachan
Keyword(s):  
Information Retrieval ◽  
Data Structure ◽  
Data Structures ◽  
Query Time ◽  
Geometric Data ◽  
Small Constant ◽  
Efficient Data ◽  
Online Queries ◽  
Efficient Data Structures ◽  
Unique Substrings

Let T[1,n] be a string of length n and T[i,j] be the substring of T starting at position i and ending at position j. A substring T[i,j] of T is a repeat if it occurs more than once in T; otherwise, it is a unique substring of T. Repeats and unique substrings are of great interest in computational biology and information retrieval. Given string T as input, the Shortest Unique Substring problem is to find a shortest substring of T that does not occur elsewhere in T. In this paper, we introduce the range variant of this problem, which we call the Range Shortest Unique Substring problem. The task is to construct a data structure over T answering the following type of online queries efficiently. Given a range [α,β], return a shortest substring T[i,j] of T with exactly one occurrence in [α,β]. We present an O(nlogn)-word data structure with O(logwn) query time, where w=Ω(logn) is the word size. Our construction is based on a non-trivial reduction allowing for us to apply a recently introduced optimal geometric data structure [Chan et al., ICALP 2018]. Additionally, we present an O(n)-word data structure with O(nlogϵn) query time, where ϵ>0 is an arbitrarily small constant. The latter data structure relies heavily on another geometric data structure [Nekrich and Navarro, SWAT 2012].

Voronoi diagrams—a survey of a fundamental geometric data structure

1991 ◽  
Vol 23 (3) ◽  
pp. 345-405 ◽  
Author(s):  
Franz Aurenhammer
Keyword(s):  
Data Structure ◽  
Voronoi Diagrams ◽  
Geometric Data

A Comparative Study of Ant and Genetic Algorithms in Digital Mammography

2018 ◽  
pp. 194-200
Author(s):  
J. Magelin Mary ◽  
Chitra K. ◽  
Y. Arockia Suganthi
Keyword(s):  
Genetic Algorithm ◽  
Image Processing ◽  
Medical Image ◽  
Medical Image Processing ◽  
Processing Technique ◽  
Input Image ◽  
Image Processing Technique ◽  
Computational Time ◽  
Image Mining ◽  
The Individual

Image processing technique in general, involves the application of signal processing on the input image for isolating the individual color plane of an image. It plays an important role in the image analysis and computer version. This paper compares the efficiency of two approaches in the area of finding breast cancer in medical image processing. The fundamental target is to apply an image mining in the area of medical image handling utilizing grouping guideline created by genetic algorithm. The parameter using extracted border, the border pixels are considered as population strings to genetic algorithm and Ant Colony Optimization, to find out the optimum value from the border pixels. We likewise look at cost of ACO and GA also, endeavors to discover which one gives the better solution to identify an affected area in medical image based on computational time.

Distributed Modeling Of Building Systems Through Cyber-Physical Integration

2019 ◽  
pp. 12-17
Keyword(s):  
Data Structure ◽  
Operating Conditions ◽  
Physical Models ◽  
Distributed Model ◽  
Physical Processes ◽  
Distributed Modeling ◽  
Distributed Models ◽  
Operating Modes ◽  
Building Systems ◽  
Important Practical Application

This article describes the proposed approaches to creating distributed models that can, with given accuracy under given restrictions, replace classical physical models for construction objects. The ability to implement the proposed approaches is a consequence of the cyber-physical integration of building systems. The principles of forming the data structure of designed objects and distributed models, which make it possible to uniquely identify the elements and increase the level of detail of such a model, are presented. The data structure diagram of distributed modeling includes, among other things, the level of formation and transmission of signals about physical processes inside cyber-physical building systems. An enlarged algorithm for creating the structure of the distributed model which describes the process of developing a data structure, formalizing requirements for the parameters of a design object and its operating modes (including normal operating conditions and extreme conditions, including natural disasters) and selecting objects for a complete group that provides distributed modeling is presented. The article formulates the main approaches to the implementation of an important practical application of the cyber-physical integration of building systems - the possibility of forming distributed physical models of designed construction objects and the directions of further research are outlined.

Flexible telecommand using standard on-board data structure

1983 ◽  
Author(s):  
C. GREEN ◽  
R. ALLEN
Keyword(s):  
Data Structure
Sign in / Sign up

Export Citation Format

Share Document