Picture Coding Research Articles

Motives and modifying factors for giving or rejecting psychiatric diagnoses in general medicine and psychiatry – a qualitative interview study

BackgroundThere is a discussion among general practitioners and psychiatrists regarding over-diagnosing versus under-reporting of psychiatric diagnoses. A deeper understanding of this topic is relevant for providing reasonable health care and for planning future studies. A crucial factor to understanding this discussion is the difference in the prevalence of a disease in each sector. One way to attain knowledge about such prevalences is the analysis of routine care data of the sector in question. However, diagnosis-related data might be modified by several additional influencing factors.AimsThis study aims to explore what kind of motives and modifying factors play a role for or against giving psychiatric diagnoses in psychiatric and general medical settings.MethodsTwenty-six semi-structured interviews were conducted with German physicians in the fields of general medicine and psychiatry. Interviews were analysed using content analysis.ResultsThe analysis revealed three major motivational categories for finding a diagnosis: (1) “objective matters” such as “categorisation for research”; (2) “functional and performance-related factors” such as “requirement for medication”, “billing aspects” that go with certain diagnoses or “access to adequate care” and (3) “Individual factors” such as the “personality of a physician”. Similarly, factors emerged that lead to not making psychiatric diagnoses like “fear of stigmatization among patients” or “detrimental insurance status with psychiatric diagnosis”. Additionally participants mentioned other reasons for “not diagnosing a psychiatric diagnosis“, such as “coding of other clinical pictures”.ConclusionThe diagnostic process is a complex phenomenon that goes far beyond the identification of medical findings. This insight should be considered when processing and interpreting secondary data for designing health care systems or designing a study.

Spontaneously emerging internal models of visual sequences combine abstract and event-specific information in the prefrontal cortex

When exposed to sensory sequences, do macaque monkeys spontaneously form abstract internal models that generalize to novel experiences? Here, we show that neuronal populations in macaque ventrolateral prefrontal cortex jointly encode visual sequences by separate codes for the specific pictures presented and for their abstract sequential structure. We recorded prefrontal neurons while macaque monkeys passively viewed visual sequences and sequence mismatches in the local-global paradigm. Even without any overt task or response requirements, prefrontal populations spontaneously form representations of sequence structure, serial order, and image identity within distinct but superimposed neuronal subspaces. Representations of sequence structure rapidly update following single exposure to a mismatch sequence, while distinct populations represent mismatches for sequences of different complexity. Finally, those representations generalize across sequences following the same repetition structure but comprising different images. These results suggest that prefrontal populations spontaneously encode rich internal models of visual sequences reflecting both content-specific and abstract information.

Comparative Analysis of Image Enhancement Algorithms

In the complex instruments utilised in essential fields such as satellite cameras, CT scanners, and High-Resolution Cameras (Underwater), image capture is critical without human-rated aberrations, sounds, or atmospheric disturbances. Even full reference QA (quality assessment) approaches have a limited ability to predict quality accurately. As a result, the difficulty of evaluating and enhancing photographs is further subdivided into domain-specific issues by focusing on a small set of artefacts. The most popular is entropy, which is usually relevant in picture coding: it is a lower limit for the average coding length in bits per pixel that may be attained without any loss of information by an optimal coding scheme. The word 'specific' is significant because it establishes right away that the strategies covered in this paper are primarily problemsolving techniques. For example, a procedure that works well for improving X-ray images may not be the ideal option. Thus, a method that works well for boosting X-ray photos may not be the greatest option for enhancing photographs obtained by a satellite thousands of miles away from the Earth. Image enhancement algorithms proposed in this paper are Intensity-Hue-Saturation transformation, Histogram Equalization algorithms, Edge Detection techniques and Retinex theory algorithms. These algorithms are implemented under satellite imagery, medical scans, underwater images, and their parameter analysis.

GMJ Coding Using Even Felicitous Labeling and Bistar Graphs

In this paper,using GMJ(Graph Message Jumbled) code, we developed a technique for coding a confidential message by applying the even felicitous labeling to the bistar graph Bv>0j.We presented two illustrations for transfering plain text into cipher text(picture coding), method for labeling an even felicitous graph and flowchart is outlined.

GMJ Coding Using Even Felicicitous Labeling and Two Star Graphs

In this paper, we have found a technique for coding a secret messages by applying the even felicitous labeling on the two star graph K 1,φ ∪ K 1,ψ using GMJ (Graph Message Jumbled) code. We provided two illustrations for converting plain text into cipher text (picture coding) and method for labeling the felicitous graph is described.

AMGL Coding Techniques With Skolem Mean Like Labeling and Two Star Graphs

In this paper, we have found a technique for coding a secret messages by applying the skolem mean like labeling on the two star graph K 1,φ Λ K 1,π for two different cases π = φ+1 and π = φ+4 using AMGL (Alphabets maneuvered Graph Labeling) code. We provided two illustrations for converting plain text into cipher text (picture coding) and method for labeling the skolem mean like graph is described.

Coding Technique With Two and Three Stars, SSML(N4,L2) and GMJ CODE

In this paper, we introduce a coding technique for converting a text message using sub super mean labeling on two and three star graphs to a picture coding message. The first part of this paper there are some definitions and discussions for the existence graph and in the second part there are some illustrations to explain how the text message is converted in to picture code, by using graph labeling, and it maintain secrecy, possess intricacy and provide a sense of sufficiency. Secrecy is the practice of hiding information from certain individuals or groups who do not have the need to know, perhaps while sharing it with other individuals that which is kept hidden is known as secret.

Animated Personalities: Cartoon Characters and Stardom in American Theatrical Shorts

Animated Personalities: Cartoon Characters and Stardom in American Theatrical Shorts

Characterization and measure of infinite two-dimensional strong prefix codes

A set X⊆Σ++ of rectangular pictures over an alphabet Σ is a two-dimensional code if any picture over Σ is tilable in at most one way with pictures in X. Finite strong prefix codes were introduced as a family of decidable two-dimensional codes. We consider infinite strong prefix codes and give a characterization for the maximal ones based on the iterated extensions. Moreover, we study some properties related to the measure of these codes of pictures and prove some connections with the codes of strings.

Power-, Area-, and Compression-Efficient Eight-Point Approximate 2-D Discrete Tchebichef Transform Hardware Design Combining Truncation Pruning and Efficient Transposition Buffers

Due to the intensive use of discrete transforms in image/video coding, the search for fast and power-efficient design approaches for their hardware implementation becomes essential. The Discrete Tchebichef Transform (DTT) represents a discrete class of the Chebyshev orthogonal polynomials, and it is an alternative for the Discrete Cosine Transform, commonly used in picture coding. The state-of-the-art approximate DTT matrix is composed of 0, 1, -1, 2, and -2 values. In this work, we propose a new approximation for the 8-point DTT, with a higher power- and compression-efficiency by exploring coefficient truncation, leading to the values 1/16, -1/16, 1/8, and -1/8. Considering operations with integers, the smaller magnitude of coefficients causes truncation in the internal transform calculations and leads to lower values for the non-diagonal residues, which reduces non-orthogonality. The results show that the proposed 8-point pruned approximate DTT hardwired ASIC solutions increase the maximum frequency up to 64%, minimize the circuit area up to 43.6%, and saves up to 65.4% in power dissipation. The results of our DTT approximation proposal mapped for FPGA show an increase of up to 58.9% on maximum frequency, and savings of about 28.7% and 32.2% on slices and dynamic power, respectively, when compared with the literature. Our approximate DTT proposal also achieves higher compression ratio and less quality loss in the compressed image, when compared to state-of-the-art approximate DTT hardware designs.

Full sets of pictures to encode pictures

A picture, or two-dimensional (2D) string, is a rectangular array of symbols over a finite alphabet. In this paper, we introduce the notion of fullness for sets of strings and sets of pictures. Fullness is a local counterpart of completeness. While in 1D fullness coincides with completeness, in 2D complete sets of pictures are a subset of full ones. This new notion allows introducing the encoding of a picture. The definition of encoding is based on the one of cutting decomposition. If a set of pictures X is full then any picture has an encoding over X; furthermore, the encoding is unique if X is a univocally full set. Univocally full sets coincide with the maximal strong prefix codes of pictures that were recently introduced. At last, we show an encoding algorithm for pictures, which relies on a new tree data structure to represent univocally full sets.

Exploring approximations in 4- and 8- point DTT hardware architectures for low-power image compression

Due to the intensive use of discrete transforms in picture coding, the search for fast and power-efficient approaches for their hardware implementation gains importance. The Discrete Tchebichef Transform (DTT) represents a discrete class of the Chebyshev orthogonal polynomials, and it is an alternative for the Discrete Cosine Transform, commonly used in picture coding. High energy compaction and decorrelation are the main properties of the DTT. The state-of-the-art approximate DTT matrix is composed of 0, 1, − 1, 2, and − 2 coefficient values. In this work, we propose a new approximation for both the 4-point and 8-point integer DTT with better quality and power-efficiency. We explore the effects of coefficient truncation, whose values are 1/16, − 1/16, 1/8, − 1/8, 1/4, and − 1/4. Considering operations with integers, the smaller values of coefficients causes truncation in the internal transform calculations and leads to smaller values for the non-diagonal residues, which reduces the non-orthogonality. We have also selectively pruned the rows of the state-of-the-art approximate DTT matrix. The results show that the proposed pruned approximate DTT hardwired solutions increases the maximum frequency up to 5%, minimizes circuit area by over 30%, with savings of up to 32.4% in power dissipation with a higher compression ratio and fewer quality losses in the compressed image, when compared with state-of-the-art approximate DTT hardware designs.

Fast BGP Face Retrieval Based on K-means Clustering

The traditional face image retrieval method is to compare the target picture with all the pictures in the database one by one, resulting in great time consumption. This paper used the binary gradient pattern (BGP) as face feature extractor. Firstly, the database was encoded offline. Then the encoded database was offline clustered. Next, we extracted the feature of the target picture by BGP and found the nearest clustering centre from the database encoding. Finally, the target picture code for retrieval was selected in the target class.

Using Pruning and Truncation for Power-Efficient 2-D Approximate Tchebichef Transform Hardware Architecture

Due to the intensive use of discrete transforms in pic-ture coding, the search for fast and power-efficient approaches for their hardware implementation has gained importance. The DTT (Discrete Tchebichef Transform) represents a discrete class of the Chebyshev orthogonal polynomials, and it is an al-ternative for the DCT (Discrete Cosine Transform), commonly used in picture coding. In this work, we propose a new approx-imation for the integer DTT, with better quality and power-ef-ficiency by exploring truncation and pruning. The principal idea is reduce the values of coefficients to fractions enables trun-cation by shifts in the internal transform calculations and lead to lower values for the non-diagonal residues, which reduces non-orthogonality. We have also selectively pruned the rows of the state-of-the-art approximate DTT matrix. The approximate DTT architectures were synthesized for ASIC in Cadence RTL Compiler tool using a realistic power extraction methodology considering real-inputs vectors and the delays, with the Nangate 45 nm standard cells library. The synthesis results show that the proposed-pruned approximate DTT hardwired solution in-creases the maximum frequency about 10.78%, minimize cells area by 50.2%, with savings up to 55.9% of power dissipation with more compression ratio and less quality losses in the com-pressed image, when compared with state-of-the-art approxi-mate DTT hardware designs.

ONCE AGAIN ABOUT THE ROLE OF SIGNAL SYSTEMS IN COGNITION AND SIGNIFICATION OF THE WORLD, OR WHY ONE’S MOUTH IS WATERING AT THE WORD LEMON

The article deals with the interrelation of the first and the second signal systems of a man in his perception of sensual information and its further reflection in a text message. Sensual information is perceived via five sensor (modal) canals. Modality, discussed in the article, refers to qualitative characteristics of human senses. Modalities are taste, odour, sound, colour etc. It is stated that different modalities have different possibilities of being reflected in a text. The article analyzes potencies of a monocode and a polycode text in reflecting different modal information. A purely verbal message contains mainly narration about all modalities, retelling about something which is cold or hot, smooth or rough, big or small, balmy or stinking. Anyway, the author appeals to the reader’s sensual memory. Whatever modal information comes to the reader via verbal code message it is to be recreated in his imagination. The only modality which can be partially reproduced is audial modality. Sound imitation and capitalization/petite are the means of reproducing the quality and quantity of an audial phenomenon. A unity of verbal and picture codes in a polycode text suggests both a narration and a reproduction of visual modality. A bright example of such type of text is a museum catalogue, containing a reproduction of a picture and a text annotation. The addressee of such polycode message acts alternately as a reader and as a viewer, receiving printed text (the second signal system – words) in its linear development then switching to picture reproduction (the first signal system – visual images) in its holistic presentation. Parcels of information are frequently doubled in pictorial and verbal components of such messages, thus enhancing their impact upon the addressee. The presence of an experiencer/narrator figure is obligatory in a message about some sensual information, which is another proof of an absolute anthropocentricity of a language image of the world.

Light Field Image Coding Using High-Order Intrablock Prediction

This paper proposes a two-stage high-order intrablock prediction method for light field image coding. This method exploits the spatial redundancy in lenslet light field images by predicting each image block, through a geometric transformation applied to a region of the causal encoded area. Light field images comprise an array of microimages that are related by complex geometric transformations that cannot be efficiently compensated by state-of-the-art image coding techniques, which are usually based on low-order translational prediction models. The two-stage nature of the proposed method allows us to choose the order of the prediction model most suitable for each block, ranging from pure translations to projective or bilinear transformations, optimized according to an appropriate rate-distortion criterion. The proposed higher order intrablock prediction approach was integrated into a high efficiency video coding (HEVC) codec and evaluated for both unfocused and focused light field camera models, using different resolutions and microlens arrays. Experimental results show consistent bitrate savings, which can go up to 12.62%, when compared to a lower order intrablock prediction solution and 49.82% when compared to HEVC still picture coding.

Two-dimensional comma-free and cylindric codes

A two-dimensional code of pictures is defined as a set X⊆Σ⁎⁎ such that any picture over Σ is tilable in at most one way with pictures in X. It has been proved that it is undecidable whether a finite set of pictures is a code. Here we introduce two classes of picture codes: the comma-free codes and the cylindric codes, with the aim of generalizing the definitions of comma-free (or self-synchronizing) code and circular code of strings. The properties of these classes are studied and compared, in particular in relation to maximality and completeness. As a byproduct, we introduce self-covering pictures and study their periodicity issues.

Picture codes and deciphering delay

A set X of pictures over an alphabet Σ is a code if any picture over Σ is tilable in at most one way with pictures in X. The codicity problem is in general undecidable. Recently, the prefix picture codes were introduced as a decidable subclass of codes that generalize the prefix string codes. In the string theory, the finite deciphering delay sets are some interesting codes which coincide with the prefix codes when the delay is equal to 0. An analogous notion is introduced for the picture codes and it is proved that the codes with deciphering delay k form a decidable class of picture codes which includes interesting examples and special cases.

Error-resilient packet-switched mobile video telephony with channel-adaptive rateless coding and early reference picture selection

Providing high-quality video for packet-switched wireless video telephony on handheld devices is a challenging task due to packet loss, varying bandwidth, and end-to-end delay constraints. While many error resilience techniques have been proposed for video transmission over wireless channels, only a few were specifically designed for mobile video telephony. We propose a low-complexity channel-adaptive error resilience technique for packet-switched mobile video telephony, which combines rateless coding, feedback, and reference picture selection. In contrast to previous approaches, our technique uses cumulative feedback at every transmission opportunity and predicts when decoding is likely to fail so that reference picture selection can be triggered at an early stage. Experimental results for H.264 video sequences show that the proposed technique can achieve improvements of 1.64 dB in peak signal-to-noise ratio over benchmark techniques in simulated Long-Term Evolution networks.

Polymodality of senses in the mirror of a polycode text, or once again on the anthropocentricity of linguistics

The article deals with the interrelation of the first and the second signal systems of a man in his perception of sensual information and its further reflection in a text message. Sensual information is perceived via five sensor (modal) canals. Modality, discussed in the article, refers to qualitative characteristics of human senses. Modalities are taste, odour, sound, colour etc. It is stated that different modalities have different possibilities of being reflected in a text. The article analyzes potencies of a monocode and a polycode text in reflecting different modal information. A purely verbal message contains mainly narration about all modalities, retelling about something which is cold or hot, smooth or rough, big or small, balmy or stinking. Anyway, the author appeals to the reader’s sensual memory. Whatever modal information comes to the reader via verbal code message it is to be recreated in his imagination. The only modality which can be partially reproduced is audial modality. Sound imitation and capitalization/petite are the means of reproducing the quality and quantity of an audial phenomenon. A unity of verbal and picture codes in a polycode text suggests both a narration and a reproduction of visual modality. A bright example of such type of text is a museum catalogue, containing a reproduction of a picture and a text annotation. The addressee of such polycode message acts alternately as a reader and as a viewer, receiving printed text (the second signal system – words) in its linear development then switching to picture reproduction (the first signal system – visual images) in its holistic presentation. Parcels of information are frequently doubled in pictorial and verbal components of such messages, thus enhancing their impact upon the addressee.The presence of an experiencer/narrator figure is obligatory in a message about some sensual information, which is another proof of an absolute anthropocentricity of a language image of the world.