Showing papers on "Encoding (memory) published in 1992"

Memory and working-with-memory: A component process model based on modules and central systems

Abstract: A neuropsychological model of memory is proposed that incorporates Fodor's (1983) idea of modules and central systems. The model has four essential components: (1) a non-frontal neocortical component that consists of perceptual (and perhaps interpretative semantic) modules that mediate performance on item-specific, implicit tests of memory, (2) a modular medial temporal/hippocampal component that mediates encoding, storage, and retrieval on explicit, episodic tests of memory that are associative/cue dependent, (3) a central system, frontal-lobe component that mediates performance on explicit tests that are strategic and on procedural tests that are rule-bound, and (4) a basal ganglia component that mediates performance on sensorimotor, procedural tests of memory. The usefulness of the modular/central system construct is explored and evidence from studies of normal, amnesic, agnosic, and demented people is provided to support the model.

A Structural Model of Autobiographical Memory

Abstract: The structural model of autobiographical memory proposes that memories are dynamically constructed ‘on-line’ rather than retrieved directly from memory. A generative retrieval process successively samples long-term memory structures which retain knowledge of phenomenal experiences occurring at encoding or thematic knowledge relating to the meaning of an event. Knowledge of phenomenal experiences and associated thematic knowledge are combined by a central processing resource and in this way an autobiographical memory is constructed. The structural model is supported by a wide range of findings within autobiographical memory research and from studies of amnesia. Moreover, the structural model strongly emphasises the role of the self in autobiographical memory construction. The model also implies that the ‘experience’ of remembering arises when knowledge of past phenomenal experience is incorporated into current processing sequences.

Method of verifying fake-proof video identification data

Abstract: A fake-proof card verification system allows for the reading of data from an EEPROM memory device. A photographic-type image is stored in the memory device. The data comprises a data table containing randomly distributed unique serialized information. This information may be the serial number of the encoding read/write terminal, or the issue number of the particular identification information created by the encoding terminal. Desired verification data is downloaded from a central processing system. Advantageously, the system uses color cell compression for the acquisition, digitization and compression of the photographic-type image, which may be a facial representation, fingerprint, signature, voice print, eye retina or any other unique personal identification in a compressed form which may read by the decoding system to verify the positive identification of the presenter.

System for encoding personalized identification for storage on memory storage devices

Abstract: A fake-proof card encoding system comprises an encoding read/write device utilizing components that allow for the recording of data to an EEPROM memory device. A photographic-type image is acquired, digitized and compressed for storage in the memory. The data comprises a data table containing randomly distributed unique serialized information. This information may be the serial number of the encoding read/write terminal, or the issue number of the particular identification information created by the encoding terminal. Advantageously, the system uses color cell compression for the acquisition, digitization and compression of the photographic-type image, which may be a facial representation, fingerprint, signature, voice print, eye retina or any other unique personal identification in a compressed form which may later be machine read to verify the positive identification of the presenter.

Variations in synaptic plasticity and types of memory in corticohippocampal networks

Abstract: If Synaptic long-term potentiation (LTP) represents a memory storage mechanism, its induction and expression characteristics may constitute rules governing encoding and read-out of memory in cortical circuitry, The presence of variants of the LTP effect in different anatomical networks provides grounds for predictions about the types of memory operations to which potentiation contributes. Computer modeling studies incorporating the complex rules for LTP induction and the characteristics of expressed potentiation can be used to make such predictions specific. We review ttie types of synaptic plasticity found in the successive stages of the corticohippocampal pathway, and present results indicating that LTP does participate in definably different forms of memory, suggesting a classification of memory types differing somewhat from categories deduced from behavioral studies. Specifically, the results suggest that subtypes of memory operate serially, in an “assembly line” of specialized functions, each of which adds a unique aspect to the processing of memories. The effects of lesions on the encoding versus expression of memory can be interpreted from the perspective of this hypothesis.

System for decoding and displaying personalized indentification stored on memory storage device

Abstract: A fake-proof card decoding system allows for the reading of data from an EEPROM memory device. A photographic-type image is stored in the memory device. The data comprises a data table containing randomly distributed unique serialized information. This information may be the serial number of the encoding read/write terminal, or the issue number of the particular identification information created by the encoding terminal. Advantageously, the system uses color cell compression for the acquisition, digitization and compression of the photographic-type image, which may be a facial representation, fingerprint, signature, voice print, eye retina or any other unique personal identification in a compressed form which may read by the decoding system to verify the positive identification of the presenter.

Encoding mechanical design features for recognition via neural nets

Abstract: Within mechanical computer-aided design (CAD), pattern-recognition techniques are fundamental to feature recognition. The use of neural net software as the pattern-recognition element depends upon encoding schemes which extract critical information from candidate geometric subsets. The trained memory can then determine if a particular candidate geometric subset corresponds to a feature of interest. Successful experiments with particular encoding schemes over a restricted class of features will be presented. Neural nets were chosen with the long-term view toward a feature-recognition architecture where the end-user could customize the domain of features that can be recognized. The training of the neural net memory would be achieved through a graceful graphics interface. Extensive programming and knowledge bases would be avoided. This envisioned architecture will be presented to provide a context for the encoding schemes.

Cognitive binding: A computational-modeling analysis of a distinction between implicit and explicit memory

Abstract: Four models were compared on repeated explicit memory (fragment cued recall) or implicit memory (fragment completion) tasks (Hayman & Tulving, 1989a). In the experiments, when given explicit instructions to complete fragments with words from a just-studied list---the explicit condition---people showed a dependence relation between the first and the second fragment targeted at the same word. However, when subjects were just told to complete the (primed) fragments---the implicit condition---stochastic independence between the two fragments resulted. Three distributed models---CHARM, a competitive-learning model, and a back-propagation model produced dependence, as in the explicit memory test. In contrast, a separate-trace model, MINERVA, showed independence, as in the implicit task. It was concluded that explicit memory is based on a highly interactive network that glues or binds together the features within the items, as do the first three models. The binding accounts for the dependence relation. Implicit memory appears to be based, instead, on separate non interacting traces.

A pseudo-relaxation learning algorithm for bidirectional associative memory

Abstract: A fast iterative learning algorithm for the bidirectional associative memory (BAM) called PRLAB is introduced. PRLAB utilizes the pseudo-relaxation method adapted from the relaxation method for solving systems of linear inequalities. PRLAB is very fast, is well suited for a neural network implementation, guarantees the recall of all training patterns, is highly insensitive to learning parameters, and offers high scalability for large applications. PRLAB exploits the maximum storage capacity of the BAM and guarantees perfect recall of all trained pairs. For guaranteed storage, no special form of encoding or preprocessing is necessary. >

Flexible encoding method and architecture for high speed data transmission and storage

Abstract: In data transmission and storage using encoding through finite-state machines, the feedback link that updates each finite-state machine after each encoding step presents a bottleneck for a high speed implementation. The invention solves this problem for a class of finite-state machines that includes the encoder for the known 8B/10B Widmer-Franaszek code. The architecture consists of parallel finite-state units that are pipelined to run at a relatively low clock frequency. State updating is broken down into a feedforward part and a feedback part. In the feedback part, the state of each unit can be updated with a single operation. This allows efficient implementation of the finite-state encoder for practically any data rate just by appropriate pipelining and parallel processing.

Hierarchy encoding system of multi-level image through dither conversion

Abstract: A multi-level image is encoded through dither conversion and hierarchy encoding with high image compression ratio and satisfactory image quality for low resolution images. An original multi-level image is first reduced so that a plurality of reduced images are obtained. Each reduced multi-layer image is then dithered to bi-level image, and finally each dithered bi-level image is encoded starting the smallest and the lowest resolution image to the largest and the highest resolution image. No temporary memory for reduced multi-level image is necessary, as a common multi-level line memory (LM2, LM3, LM4) doubles for storing a reduced multi-level image and a temporary memory for effecting dither conversion.

Method and device for encoding image

Abstract: PURPOSE:To obtain highly efficient encoding method and device without generating deterioration in picture quality independently of the size of motion in respect to image encoding method and device to be used at the time of compressing, transmitting and recording a digital image. CONSTITUTION:An activity calculating circuit 1 calculates field activity Ai and a frame activity Ar for an inputted image in each block in a frame. A frame/field encoding judging circuit 2 executes judgment for switching the encoding of a frame unit adopted when the number of blocks satisfying Ai>=Ar is more than a fixed value to the encoding of a field unit when the number of blocks is reduced to less than the fixed value. An encoding circuit 3 executes the encoding of the frame unit or field unit based upon the judgment.

Attentional resource demands of stimulus encoding for persons with and without mental retardation.

Abstract: Speed of encoding differences between individuals with and without mental retardation were examined to determine whether they stem from an automatically executed cognitive process or from encoding processes that require attentional resources. In Experiment 1, encoding functions were generated for physical identity and name identity encoding while subjects retained a full memory load or half memory load. Size of memory load influenced encoding times for all subjects. However, the pattern of group differences suggested that subjects with mental retardation allocated fewer attentional resources to encoding, even though encoding may require more of their resources for efficient execution. These conclusions were supported in Experiment 2, in which resource allocation was assessed using response times to auditory probes placed at various locations in the semantic encoding and decision task.

Encoding/decoding system for moving picture signal and device therefor

Abstract: PURPOSE:To improve encoding efficiency by detecting the directional quantity of movement in the respective picture of objects to exist within a determined area, changing the position of the determined area corresponding to the directional quantity of the movement and encoding the area. CONSTITUTION:A window is determined in the center part of a picture in advance and a reading address signal is generated. Then, the original point of the window is moved according to a central movement vector supplied from a frequency distribution measure device 3 from a next frame and a new window picture reading address signal is generated. Besides, an address control signal 102 generated in an address control circuit 4 is supplied to a frame memory 1. Then, an encoder 5 orthogonal-converts a picture signal 103 of the window supplied from the frame memory 1 and reduces redundancy by encoding with movement compensation, etc. Thus, encoding efficiency can be raised.

Adaptive encoding device for color image

Abstract: PURPOSE:To efficiently encode a color image by multi-encoding only a pattern area and binary-encoding all the areas CONSTITUTION:An image area separation part 3 discriminates whether it is a binary area or a multi-area in terms of block In a binary image generation part 6, a binary area is binarized by a prescribed threshold, the multi-area is set to 0 or 1, and the all areas are binarized as a result of an image area separation A binary image encoding part 8 performs a binary encoding for binary data A natural image extraction part 7 extracts the multi-area and a natural image encoding part 10 performs a multi-encoding for the only multi- area The encoded data of the binary image, the multi-image and area information is transmitted

Input pattern encoding through generalized adaptive search

Abstract: In a neural network approach to a sequence prediction problem such as Chinese character prediction, if an orthogonal set is used to encode the Chinese characters, there will be more than 6000 units in the input layer. The authors demonstrate that the number of units in the input layer can be greatly reduced with proper encoding. A neural network maps a group of input vectors to a group of target vectors. It generalizes the responses for inputs that are similar to the inputs on which it has been trained. With this similarity property, if the input pattern vectors are encoded according to the interrelationship among the target patterns, the network may behave better, and fewer units will be needed in the input layer. The authors present such an input pattern encoding method for a neural network with recurrent connections. A modified genetic algorithm was used to do a generalized adaptive search for a good encoding. >

Data communication system

Abstract: PURPOSE:To shorten time for picture transfer while advancing output starting time and securing consecutive output by performing picture transfer with small blocks while varying block size. CONSTITUTION:A transmitter 12 sends data from picture input 1 to an encoding device 2, and communication lines 71 and 72 notifies it to a transfer control part 4 every time when encoding is ended. A control part 4 finds encoding picture data amount per scanning line and calculates data compression rate through calculation. The using state of a reception memory 9 is estimated from usable memory capacity information in error correction system of the reception memory 9 from a receiver 13, data amount, and data compression rate, and picture block size is selected and decided. Thus, time from data transfer start to output start to a picture output part can be shortened by varying the block size.

A disc reproducing apparatus and recording apparatus

Abstract: The present invention is directed to a disc reproducing apparatus in which a signal recorded on a disc is optically read out from the disc and reproduced as an audio signal. This disc reproducing apparatus comprises an optical pickup (9) tracing tracks formed on the disc to optically read out a signal recorded on the disc, a first decoding unit (10) for decoding an output signal of the optical pickup and outputting the same at a first transfer rate, a memory (14) in which digital data output from the first decoding unit is stored temporarily, a controller (13) for controlling write and read of the memory such that the digital data is intermittently written in the memory at the first transfer rate and the digital data is continuously read out from the memory at a second transfer rate lower than the first transfer rate, a second decoding unit (15) for decoding the digital data read out from the memory and outputting the same as an audio signal at the second transfer rate, and a display device (19) for displaying an amount of the digital data stored in the memory so that an increase or decrease of the amount of the digital data can be visually confirmed. Further, the present invention is directed to a disc recording apparatus in which an input digital audio signal is encoded and recorded on a disc. This disc recording apparatus comprises a first encoding unit for compressing an input digital audio signal, a memory in which compressed data from the first encoding unit is temporarily stored, a second encoding unit for intermittently receiving the compressed data stored in the memory and outputting encoded data as recording data to be recorded on the disc at its predetermined position, a controller for controlling the memory such that the compressed data from the first encoding unit is continuously written in the memory and the compressed data stored in the memory is intermittently read out from the memory at every predetermined data amount, and a display device for displaying a storage amount of the compressed data stored in the memory so that an increase or decrease of the amount of the compressed data can be visually confirmed. Therefore, since the amount of data stored in the memory is displayed so that the user can recognize the operation state of the memory intuitively and readily.

Hardware to support runtime intelligence

Abstract: An associative memory system that is specialized to support the syntax and associated pattern-matching rules common to declarative expression is discussed. A coprocessor board based on an array of custom VLSI chips that combine both logic and memory is described. It is shown how this hardware supports a number of popular intelligent-system architectures. Application to querying a dynamic database is considered. >

Method for encoding and decoding audio signal and audio reproducing device using the method

Abstract: PURPOSE: To obtain the encoding and decoding method which can incorporate the audio signal lasting for several minutes and its reproducing circuit on an IC card and to obtain the audio reproducing device which has a memory, wherein the audio signal obtained by this encoding method is recorded, and a reproducing circuit, which uses the decoding method, on the IC card. CONSTITUTION: A code book is generated by classifying the audio signal into partial patterns, putting similar partial patterns together, and selecting respective representative patterns are selected and giving codes, and the code sequence data on the respective partial patterns of the audio signal are generated by using the code book, and compressed together with the code book and written in the memory 13; when the audio signal is reproduced, the compressed code sequence data read out of the memory 13 are expanded by the reproducing circuit 14, the respective codes of the expanded code sequence data are replaced with the representative patterns to make join parts smooth, and the patterns are decoded. COPYRIGHT: (C)1994,JPO&Japio

Picture encoding system

Abstract: PURPOSE:To reproduce a picture at an arbitrary display speed by dividing conversion coeffients of respective blocks into N areas based on the spacial frequency and performing variable length encoding with each area as the unit and storing code data obtained by variable length encoding with each area as the unit and managing the code data volume with each area as the unit CONSTITUTION:Picture data is divided to rectangular blocks by a block dividing part 1 and is converted to conversion coefficients in a DCT/quantizing part 2 by two-dimensional discrete cosine transformation and is quantized and is stored in a buffer memory 3 An address generating part 6 controls the read/ write address of the buffer memory 3 Conversion coefficients of the buffer memory 3 are zigzag scanned and are encoded by a Huffman encoding part 4 A code buffer 9 is divided to N areas, and code data is stored in correspond ing buffer areas by an encoding control part 5

Entropy encoding circuit

Abstract: PURPOSE:To perform memory writing at parallel processing speed without increasing the number of data bits per one sample by successively reading data stored in a buffer memory corresponding to a variable length encoder with a pause. CONSTITUTION:A predictive encoding data by one line is inputted from input terminals 11 to 14 and encoded by variable length encoders 21 to 24. The encoding data and a writing clock to buffer memories 31 to 34 are inputted and the reading is performed by a reading clock inputted from an input terminal 6, and the reading data is outputted from an output terminal 5. At this time, the data by one line is successively read out from the buffer memories 31 to 34, but output terminals (e) are linked with a data bus, and the multiplexing of reading data of the buffer memories 31 to 34 is performed on it. The occupancy amount to be used to control the buffer memories 31 to 34 is outputted from an output terminal 7 with each buffer memory occupancy amount added by an adder 4.

Optical ic card

Abstract: PURPOSE:To record a key used in encoding or the address on a data recording part on an IC memory by together mounting an integrated circuit part and an optical data recording part on one card and adding a CPU, an encoding circuit, a random number generating circuit and the IC memory to the integrated circuit part CONSTITUTION:An optical card is loaded with a data recording part 1 irradiating a card base material with laser beam to write data on the card base material and irradiating the same with weak laser beam to make it possible to read the recorded data by the reflected beam thereof and a modularized integrated circuit 2 The IC module 2 is loaded with a CPU 9, a random number generating circuit 8, an encoding circuit 5, a small capacity IC memory 7, an input interface 4 and an output interface 6 The key used in encoding, the recorded address on an optical memory 1 and the used address of the encoding circuit 5 are recorded on the IC memory 7

Text information processor and print dot signal generator for processor

Abstract: PURPOSE:To perform high speed printing with use of low capacity memories by a method wherein data are encoded and stored to compress the redundancy, and a process in which encoded data are expanded to dot data is executed parallel. CONSTITUTION:When an expansion process of a page of text data is completed, a main processor 210 has a compression/expansion processor 250 execute an encoding process in which the dot data expanded in a frame memory 261 are compressed, and the data encoded by said process are stored in an encoded data memory 263. The encoded data are read out from the encoded memory 263 line by line and decoded. The compression/expansion processor 250 is controlled so that the dot data obtained by the decoding process are stored in a buffer memory of an output circuit 270. The output circuit 270 outputs the dot data to a laser beam printer 300 as serial video signals synchronously with scan synchronous signals given by the laser printer 300 and printing is performed.

A dynamic approach to improve sparsely encoded associative memory capability

Abstract: A method for improving sparsely encoded associative memory storage capacity based on dynamic thresholding is presented. Under the dynamic thresholding scheme, the sparsely encoding method is shown to have greater storage capacity than the ordinary associative memory. The results are also considered from the storage sensitivity point of view. Simulation results are consistent with the quantitative analysis. It is found that system capacity is strongly dependent on the selected threshold. Selection of threshold is based on each neuron working close to its threshold assumption. This makes it possible to find a more reasonable storage capacity by using signal part and mean noise only. >

A New Boundary-based Shape Recognition Technique

Abstract: In this paper, a new 2D-Shape-encoding scheme is introduced which is based on the idea of the Angle-Of-Sight (AOS). Using this scheme, a shape can be efficiently transformed into a 1D signature by recording the AOS-vs-distance of each boundary point with'respect to a shape-specific Chord-Of-Sight (COS). The COS is selected by using an extension of the notion of shape boundary, to the idea of shape-specific points and the characteristic ellipse (CE). The AOS signature has many important properties including: It is information-preserving, and thus unique; It does not require boundary smoothing; It has its own select- able smoothing property; It can provide a set of multi-scale representations by means of a simple operation; It is transformation-invariant; It is defined at all points; It preserves symmetries. As well, for matching purposes, a two-level matching process is proposed using a global meas- ure (the eccentricity of the CE of a shape) and a dissimilarity measure based on the AOS signature. The encoding and matching techniques developed have been tested %with 35 manufactured objects. The results obtained show that the AOS signature and the two-level-matching technique are quite effective and reliable for the recognition of 2D-shapes of typical manufactured objects.