Graphics Recognition -- from Re-engineering to Retrieval

Invited talk. Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we discuss how the focus in document analysis, generally speaking, and in graphics recognition more specifically, has moved from re-engineering problems to indexing and information retrieval. After a review of ongoing work on these topics, we propose some challenges for the years to come

An Investigation into the development of an interactive archival catalog of art within the Rochester Institute of Technology

RIT has no complete visual and /or factual catalog of the pieces of art presently displayed in public areas. Many pieces of work on campus are in desperate need of repair as well as plaques to identify the work. Visions, the only known bound record of a selection of artwork on the Henrietta campus, was produced by the RIT Communications Office in 1975. The Archives in Wallace Memorial Library have a small collection of slides of various artworks, however, many works of art are currently missing. Several valuable pieces of work were lost in the move from the city campus to Henrietta, and some pieces have yet to be removed from storage in Physical Plant. RIT is not fully aware of what is currently located in public areas. This interactive catalog will create a complete visual and factual catalog of the artwork located in public areas on the RIT Henrietta campus. Being interac tive, this catalog will include full-color images, sound, QuickTime movie clips and text about the piece of work, its location on campus, the artist, as well as any other relevant information that can be gathered on the work. The catalog will be user-friendly so that anyone with little or no computer experience will have no trouble operating the program. Information on the artwork along with a full-color image of the piece will be displayed on each card. This interactive archival catalog will be simple for anyone to use. People with or without computer skills or experience with multimedia applications should discover that this catalog is a faster and more entertaining way to retrieve data. This thesis will investigate past, present and future storage meth ods for information. In addition, this project will research how effective interac tive archival storage is. Upon completion, the Interactive Archival Catalog will be tested by thirty students from the School of Fine and Applied Arts, the College of Photographic Arts and Sciences, and the School for Printing Management and Sciences. The students will be asked to play with the catalog for at least ten minutes and then answer some questions about it. The questions and responses can be found in Chapter 6, page 35. All comments and suggestions were noted and changes that needed to be made were corrected. The purpose of this catalog is to introduce the RIT community to the art work present on campus. Implementing interactive multimedia makes the data search experience an enjoyable and interesting one. If the catalog is successful, people will develop an appreciation of the artwork on this campus as well as an interest in interactive data storage and retrieval systems

An Interactive Visual Approach to Construction Project Scheduling

Sound project management is an important pillar of success for a construction company. Project schedules are the primary tools for communicating the thinking and planning by the management team to all the stakeholders in a construction project. Traditional project scheduling software have become an indispensable tool for managers in various project oriented industries for tracking the schedule, the budget and resource requirements of a project as well as for preparing reports, providing on-line access to project information and communication with the members of the project team. However, these benefits are realized only after the project information is entered into the computer and updated periodically. Setting up a computer schedule for a construction project requires entering into the computer not only all project activities and their durations and resource requirements but also organizing and sequencing of project activities. This requires considerable time and effort and consequently a full-scale time study is not usually performed for all projects. New parametric CAD software is revolutionizing the way architects, engineers and contractors work and can significantly increase construction management productivity by substantially reducing the manual work necessary for computerized construction scheduling. The data model of new parametric CAD software allows easy exchange of building design information among various software systems during design, construction and service life of projects. Research is underway at Marquette University to investigate how new parametric CAD software such as Autodesk Revit can improve construction scheduling and project control functions. The main objective of the research is to find a simple and intuitive way for transferring the necessary project information from an architectural CAD model to scheduling software and streamlining sequencing and organizing project activities. Achieving this objective will eliminate one of the most tedious and time consuming steps in creating a construction project schedule. The study proposes a visual approach to extracting project information and transferring them to scheduling software. In this approach, first a 3D model of the project is created using project\u27s digital Revit CAD files. Extraction, organizing, sequencing and transferring of project elements to scheduling software is performed during a walkthrough of the 3D model. During a walkthrough, the user can select a building element by pointing to the element. This capability allows the user to select both an element and its predecessors before executing a command that sends the information to the scheduling program. This approach reduces the tedious task of listing, organizing, sequencing, and transferring construction project information to scheduling software to a simple expedition inside the building

Transform Based And Search Aware Text Compression Schemes And Compressed Domain Text Retrieval

In recent times, we have witnessed an unprecedented growth of textual information via the Internet, digital libraries and archival text in many applications. While a good fraction of this information is of transient interest, useful information of archival value will continue to accumulate. We need ways to manage, organize and transport this data from one point to the other on data communications links with limited bandwidth. We must also have means to speedily find the information we need from this huge mass of data. Sometimes, a single site may also contain large collections of data such as a library database, thereby requiring an efficient search mechanism even to search within the local data. To facilitate the information retrieval, an emerging ad hoc standard for uncompressed text is XML which preprocesses the text by putting additional user defined metadata such as DTD or hyperlinks to enable searching with better efficiency and effectiveness. This increases the file size considerably, underscoring the importance of applying text compression. On account of efficiency (in terms of both space and time), there is a need to keep the data in compressed form for as much as possible. Text compression is concerned with techniques for representing the digital text data in alternate representations that takes less space. Not only does it help conserve the storage space for archival and online data, it also helps system performance by requiring less number of secondary storage (disk or CD Rom) accesses and improves the network transmission bandwidth utilization by reducing the transmission time. Unlike static images or video, there is no international standard for text compression, although compressed formats like .zip, .gz, .Z files are increasingly being used. In general, data compression methods are classified as lossless or lossy. Lossless compression allows the original data to be recovered exactly. Although used primarily for text data, lossless compression algorithms are useful in special classes of images such as medical imaging, finger print data, astronomical images and data bases containing mostly vital numerical data, tables and text information. Many lossy algorithms use lossless methods at the final stage of the encoding stage underscoring the importance of lossless methods for both lossy and lossless compression applications. In order to be able to effectively utilize the full potential of compression techniques for the future retrieval systems, we need efficient information retrieval in the compressed domain. This means that techniques must be developed to search the compressed text without decompression or only with partial decompression independent of whether the search is done on the text or on some inversion table corresponding to a set of key words for the text. In this dissertation, we make the following contributions: (1) Star family compression algorithms: We have proposed an approach to develop a reversible transformation that can be applied to a source text that improves existing algorithm\u27s ability to compress. We use a static dictionary to convert the English words into predefined symbol sequences. These transformed sequences create additional context information that is superior to the original text. Thus we achieve some compression at the preprocessing stage. We have a series of transforms which improve the performance. Star transform requires a static dictionary for a certain size. To avoid the considerable complexity of conversion, we employ the ternary tree data structure that efficiently converts the words in the text to the words in the star dictionary in linear time. (2) Exact and approximate pattern matching in Burrows-Wheeler transformed (BWT) files: We proposed a method to extract the useful context information in linear time from the BWT transformed text. The auxiliary arrays obtained from BWT inverse transform brings logarithm search time. Meanwhile, approximate pattern matching can be performed based on the results of exact pattern matching to extract the possible candidate for the approximate pattern matching. Then fast verifying algorithm can be applied to those candidates which could be just small parts of the original text. We present algorithms for both k-mismatch and k-approximate pattern matching in BWT compressed text. A typical compression system based on BWT has Move-to-Front and Huffman coding stages after the transformation. We propose a novel approach to replace the Move-to-Front stage in order to extend compressed domain search capability all the way to the entropy coding stage. A modification to the Move-to-Front makes it possible to randomly access any part of the compressed text without referring to the part before the access point. (3) Modified LZW algorithm that allows random access and partial decoding for the compressed text retrieval: Although many compression algorithms provide good compression ratio and/or time complexity, LZW is the first one studied for the compressed pattern matching because of its simplicity and efficiency. Modifications on LZW algorithm provide the extra advantage for fast random access and partial decoding ability that is especially useful for text retrieval systems. Based on this algorithm, we can provide a dynamic hierarchical semantic structure for the text, so that the text search can be performed on the expected level of granularity. For example, user can choose to retrieve a single line, a paragraph, or a file, etc. that contains the keywords. More importantly, we will show that parallel encoding and decoding algorithm is trivial with the modified LZW. Both encoding and decoding can be performed with multiple processors easily and encoding and decoding process are independent with respect to the number of processors

Data modelling for emergency response

Emergency response is one of the most demanding phases in disaster management. The fire brigade, paramedics, police and municipality are the organisations involved in the first response to the incident. They coordinate their work based on welldefined policies and procedures, but they also need the most complete and up-todate information about the incident, which would allow a reliable decision-making.\ud There is a variety of systems answering the needs of different emergency responders, but they have many drawbacks: the systems are developed for a specific sector; it is difficult to exchange information between systems; the systems offer too much or little information, etc. Several systems have been developed to share information during emergencies but usually they maintain the nformation that is coming from field operations in an unstructured way.\ud This report presents a data model for organisation of dynamic data (operational and situational data) for emergency response. The model is developed within the RGI-239 project ‘Geographical Data Infrastructure for Disaster Management’ (GDI4DM)

Symbol descriptor based on shape context and vector model of information retrieval

International audienceIn this paper we present an adaptative method for graphic symbol representation based on shape contexts. The proposed descriptor is invariant under classical geometric transforms (rotation, scale) and based on interest points. To reduce the complexity of matching a symbol to a large set of candidates we use the popular vector model for information retrieval. In this way, on the set of shape descriptors we build a visual vocabulary where each symbol is retrieved on visual words. Experimental results on complex and occluded symbols show that the approach is very promising