Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY  > F.2.2 Nonnumerical Algorithms and Problems 
LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY
By: Hasmik Sahakyan, Levon Aslanyan (3393 reads)
Rating: (1.00/10)

Abstract: A special quality of discrete tomography problem solutions that requires the ray difference is considered. Two classes of reconstruction tasks of (0,1)-matrices with different rows are studied: matrices with prescribed column and row sums and matrices with prescribed column sums only. Both cases are known as algorithmically open problems. We reformulate them as integer programming problems. Depending on parameters obtained, the Lagrangean relaxation model and then variable splitting technique, or a greedy heuristics approaches are applied for getting approximate solutions. In later case an optimization version is considered, where the objective is to maximize the number of pair-wise different row rays, which in case of existence of a matrix, is equivalent to the requirement of row differences.

Keywords: discrete tomography, (0,1)-matrices, integer programming

ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems: Computations on discrete structures

Link:

LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY

Hasmik Sahakyan, Levon Aslanyan

http://www.foibg.com/ijitk/ijitk-vol04/ijitk04-1-p04.pdf

Print
F.2.2 Nonnumerical Algorithms and Problems
article: CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES · LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY · CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS · IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION · APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE · SELF-MODIFICATED PREDICATE NETWORKS · THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH DECREASING · CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 · CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... · EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE RECOGNITION PROBLEM · THE INVERSE METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN ... · EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ... · DISCRETE ARTIFICIAL INTELLIGENCE PROBLEMS AND NUMBER OF STEPS OF THEIR SOLUTION · ON STRUCTURAL RECOGNITION WITH LOGIC AND DISCRETE ANALYSIS · SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ... · REALIZATION OF AN OPTIMAL SCHEDULE FOR THE TWO-MACHINE · RECENT RESULTS ON STABILITY ANALYSIS ... · LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.54MB ]   [ GZIP Disabled ]   [ Server load: 0.51 ]
Powered by Tikiwiki CMS/Groupware