Организация хранения и поиска образа лица в объектно-ориентированной базе лиц

The aim of the work is to develop an algorithm functioning by a face recognition system using object-oriented databases. The system provides automatic identification of the desired object or identifies someone using a digital photo or video frame from a video source. The technology includes comparing pre-scanned face elements from the resulting image with prototypes of faces stored in the database. Modern packages of object-oriented databases give the user the opportunity to create a new class with the specified attributes and methods, obtain classes that inherit attributes and methods from super classes, create instances of the class, each of which has a unique object identifier, extract these instances one by one or in groups, and also download and perform these procedures. Using a convolutional neural network in the algorithm allows the transition from specific features of the image to more abstract details.Целью работы является разработка алгоритма функционированием системой распознавания лиц с использованием объектно-ориентированных баз данных. Система обеспечивает автоматическую идентификацию искомого объекта или идентифицирует кого-либо по цифровой фотографии или видеокадру из видеоисточника. Технология включает сравнение предварительно сканированных элементов лица из полученного изображения с прообразами лиц, хранимых в базе данных. Современные пакеты объектно-ориентированных баз данных дают пользователю возможность создания нового класса с заданными атрибутами и методами, получения классов, наследующих атрибуты и методы от суперклассов, создавать экземпляры класса, каждый из которых обладает уникальным объектным идентификатором, извлекать эти экземпляры по одному или группами, а также загружать и выполнять эти процедуры. Использование в алгоритме свёрточной нейронной сети позволяет осуществить переход от конкретных особенностей изображения к более абстрактным деталям

COOPERATIVE QUERY ANSWERING FOR APPROXIMATE ANSWERS WITH NEARNESS MEASURE IN HIERARCHICAL STRUCTURE INFORMATION SYSTEMS

Cooperative query answering for approximate answers has been utilized in various problem domains. Many challenges in manufacturing information retrieval, such as: classifying parts into families in group technology implementation, choosing the closest alternatives or substitutions for an out-of-stock part, or finding similar existing parts for rapid prototyping, could be alleviated using the concept of cooperative query answering. Most cooperative query answering techniques proposed by researchers so far concentrate on simple queries or single table information retrieval. Query relaxations in searching for approximate answers are mostly limited to attribute value substitutions. Many hierarchical structure information systems, such as manufacturing information systems, store their data in multiple tables that are connected to each other using hierarchical relationships - "aggregation", "generalization/specialization", "classification", and "category". Due to the nature of hierarchical structure information systems, information retrieval in such domains usually involves nested or jointed queries. In addition, searching for approximate answers in hierarchical structure databases not only considers attribute value substitutions, but also must take into account attribute or relation substitutions (i.e., WIDTH to DIAMETER, HOLE to GROOVE). For example, shape transformations of parts or features are possible and commonly practiced. A bar could be transformed to a rod. Such characteristics of hierarchical information systems, simple query or single-relation query relaxation techniques used in most cooperative query answering systems are not adequate. In this research, we proposed techniques for neighbor knowledge constructions, and complex query relaxations. We enhanced the original Pattern-based Knowledge Induction (PKI) and Distribution Sensitive Clustering (DISC) so that they can be used in neighbor hierarchy constructions at both tuple and attribute levels. We developed a cooperative query answering model to facilitate the approximate answer searching for complex queries. Our cooperative query answering model is comprised of algorithms for determining the causes of null answer, expanding qualified tuple set, expanding intersected tuple set, and relaxing multiple condition simultaneously. To calculate the semantic nearness between exact-match answers and approximate answers, we also proposed a nearness measuring function, called "Block Nearness", that is appropriate for the query relaxation methods proposed in this research

A query model and an object algebra for object-oriented databases

Ankara : The Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1993.Thesis (Ph. D.) -- Bilkent University, 1993.Includes bibliographical references leaves 99-109.A query model is an important component of any database system. In this sense, the relational model has a well defined underlying query model. On the other hand, a well defined query model for object-oriented databases has not been accepted yet. This is one of the common complaints against object-oriented databases. So defining a formal object algebra is one of the most challenging steps in developing a theory for object-oriented databases. In object-oriented data models, although messages serve to manipulate the database, a query model is still required to effectively deal with more complex situations and to facilitate associative access. In this thesis, a query model for object-oriented databases is described, where both the structure and the behavior of objects are handled. Not only the manipulation of existing objects, but also the creation of new objects and the introduction of new relationships are supported in the model. Equivalents to the five basic operations of the relational model as ivell as other additional operations such as one level project, nest and aggregate function application are defined. Hence, the proposed object algebra subsumes the relational algebra. Linear recursion is also supported without requiring any additional operator to serve the purpose. Both the operands as well as the results of these operations are characterized as having a pair of sets -a set of objects and a set of message expressions (sequences of messages) applicable to them. The closure property is shown to be preserved in a natural way by the results of operations possessing the same characteristics as the operands in a query. It is shown that every class possesses the properties of an operand by defining a set of objects and deriving a set of message expressions for it. Furthermore, it is shown that the output of a query has the characteristics of a class. Thus, it is also shown how the super/subclass relationships of the result of a query with its operands can be established and how the result can be placed persistently in the lattice (schema) as a class. Such a class is naturally and properly placed in the lattice by maximizing reusability due to inheritance. Also equivalent object algebra expressions are presented and the associativity of the cross-product operation which is an important property in query optimization is proved. Lastly, as it was recognized that schema evolution is an important requirement to be satisfied by object-oriented databases, hence the handling of schema evolution functions through the proposed object algebra operations is also developed as another contribution of the thesis.Al- Hajj, RedaPh.D