Search

International audience; In this paper, we propose a new geometry representation method for multiview image sets. Our approach relies on graphs to describe the multiview geometry information in a compact and controllable way. The links of the graph connect pixels in different images and describe the proximity between pixels in 3D space. These connections are dependent on the geometry of the scene and provide the right amount of information that is necessary for coding and reconstructing multiple views. Our multiview image representation is very compact and adapts the transmitted geometry information as a function of the complexity of the prediction performed at the decoder side. To achieve this, our graph-based representation (GBR) carefully selects the amount of geometry information needed before coding. This is in contrast with depth coding, which directly compresses with losses the original geometry signal, thus making it difficult to quantify the impact of coding errors on geometry-based interpolation. We present the principles of this GBR and we build an efficient coding algorithm to represent it. We compare our GBR approach to classical depth compression methods and compare their respective view synthesis qualities as a function of the compactness of the geometry description. We show that GBR can achieve significant gains in geometry coding rate over depth-based schemes operating at similar quality. Experimental results demonstrate the potential of this new representation.

We propose a novel user authentication system using RGB color- coded images. This system is divided into two parts: a sender system, and a receiver system. When the user inputs a digital password, such as text or numbers, the sender system converts this password to color-coded images, using a previously prepared coding algorithm. The receiver system detects these color-coded images by using a camera, extracts the color values, and decodes them into the original digital password. We present an experimental result of data transfer accuracy, to show that this system can work in real situations.

Image classification is an important topic in computer vision. As a key procedure, encoding the local features to get a compact representation for image affects the final classification accuracy largely. There is no doubt that encoding procedure leads to information loss, due to the existence of quantization error. The residual vector, defined as the difference between the local image feature and its corresponding visual word, is the chief culprit that should be responsible for the quantization error. Many previous algorithms consider it as a coding issue, and focus on reducing the quantization error by reconstructing the feature with more than one visual words, or by the so-called soft-assignment strategy. In this paper, we consider the problem from a different view, and propose an effective and efficient model, which is called Multiple Stage Residual Model (MSRM), to make full use of the residual vector to generate a multiple stage code. Our proposed model is a generic framework, which can be built upon many coding algorithms and improves the image classification performance of the coding algorithms significantly. The experimental results on the image classification benchmarks, such as UIUC 8-Sport, Scene-15, Caltech-101 image dataset, confirm the validity of MSRM.

In video coder, inter-frame prediction results in distortion propagation among adjacent frames, and this distortion dependency is a crucial factor for rate control and video coding algorithm optimization. The macroblock tree (MBTree) is a typical temporal quantization control algorithm, in which a quantization offset δ is employed for adjustment according to the amount of distortion propagation measured by the relative propagation cost ρ. Appropriate δ-ρ model is the key to the MBTree-like adaptive quantization algorithm. The default δ-ρ model in MBTree algorithm is designed in an empirical way with rough model accuracy and insufficient universality to different input source. This paper focuses on this problem and apply the competitive decision mechanism in exploring optimal δ-ρ model, and then proposes an improved δ-ρ model with rate distortion optimization. The simulation results verify that the improved MBTree algorithm with the proposed model achieves up to 0.14 dB BD-PSNR improvement, and 0.29 dB BD-SSIM improvement. The proposed algorithm achieves better temporal bit allocation and reduces the distortion fluctuation in temporal domain, achieving in adaptive quantization control.

The high efficiency video coding (HEVC) standard was developed by JCT-VC in 2010 and was officially released in 2013. Compared to the previous video coding standard of H.264/AVC, HEVC can save about 50% bit-rate for equal perceptual video quality, but the computational complexity significantly increases. Therefore current research is focusing on decreasing the computational complexity and improving the coding timeliness of the HEVC video coding algorithm.

Model Predictive Control(MPC) system uses the current input which minimizes the difference between the desired output and the estimated output in the receding horizon scheme. In many cases (for example, system with constraints or nonlinear system), however, it is not easy to find the optimal solution to the above problem. In this paper, we show that real number coding genetic algorithm can be used to solve the optimal problem for MPC effectively. Also, we show by simulation that the real coding algorithm is mote natural and advantageous than the digital coding one.

Esophageal talkers may have reduced intelligibility due to both time domain and frequency domain variability. The unpredictable nature of esophageal speech can cause problems when automatic procedures are used in applications such as long-distance telephone messages. The current study compared a standard coding algorithm (LPC-10e) with a novel approach to determining voiced periods (vocal tract area functions) in the speech of esophageal talkers. The results of the study showed that the sentences synthesized with the vocal tract area function algorithm were more intelligible than those synthesized with the standard LPC-10e algorithm. Supplemental information, such as vocal tract area functions, may be useful in determining voiced epochs when variability in vocal parameters is high.

A balanced code over the set Φ m ⊆ℂ of all m-th roots of unity, m∈ℕ, is a block code such that each code word is balanced, that is, the complex sum of its components (or weight) is equal to 0. This paper demonstrates some general properties, for m prime and for m=4. Further, this paper contains some efficient coding algorithms for m=3 and completely solves the problem of designing efficient coding methods for balanced codes over Φ m , when m=4.

The author proposed an effective wavelet-based ECG compression algorithm (Rajoub, 2002). The reported extraordinary performance motivated us to explore the findings and to use it in our research activity. During the implementation of the proposed algorithm several important points regarding accuracy, methodology, and coding were found to be improperly substantiated. This paper discusses these findings and provides specific subjective and objective measures that could improve the interpretation of compression results in these research-type problems.

This paper introduces reconfigurable computing (RC) and specifically chooses one of the prototypes in this field, MorphoSys (M1) [1 - 5]. The paper addresses the results obtained when using RC in mapping algorithms pertaining to digital coding in relation to previous research [6 - 10]. The chosen algorithms relate to cyclic coding techniques, namely the CCITT CRC-16 and the CRC-16. A performance analysis study of the M1 RC system is also presented to evaluate the efficiency of the algorithm execution on the M1 system. For comparison purposes, three other systems where used to map the same algorithms showing the advantages and disadvantages of each compared with the M1 system. The algorithms were run on the 8x8 RC (reconfigurable) array of the M1 (MorphoSys) system; numerical examples were simulated to validate our results, using the MorphoSys mULATE program, which simulates MorphoSys operations., Comment: 30 Pages, 11 figures, 9 tables. arXiv admin note: substantial text overlap with arXiv:1904.04953

The newly published 3D-HEVC has received a remarkable response due to its high compression efficiency which is based on High Efficiency Video Coding (HEVC). However, the complexity of its encoding process is also large as a result of introducing the coding units (CU) size decision process together with the rate distortion optimization (RDO) process. In this paper, a fast coding algorithm making good use of the interview correlations is proposed. With the inter-view correlation statistical analysis, the CU depth candidates of the dependent views can be predicted from the independent view instead of the brute force RDO process in determining CU depth. The experimental results show that the proposed method saves 51% time in texture coding and the loss is negligible.

Spectral maxima sound coding algorithms, for example n-of-m strategies, used in commercial cochlear implant devices rely on selecting channels with the highest energy in each frequency band. This technique works well in quiet, but is inherently problematic in noisy conditions when noise dominates the target, and noise-dominant channels are mistakenly selected for stimulation. A new channel selection criterion is proposed to addresses this shortcoming which adaptively assigns weights to each time-frequency unit based on the formant location of speech and instantaneous signal to noise ratio. The performance of the proposed technique is evaluated acutely with three cochlear implant users in different noise scenarios. Results indicate that the proposed technique improves speech intelligibility and perception quality, particularly at low signal-to-noise ratio. Significance of the proposed technique lies in its ability to be integrated with the existing sound coding framework employed within commercial cochlear implant processors, making it easier to adapt for resource-limited and time critical devices.

In this paper, a novel simple algorithm based on the simplified semilogarithmic quantizer is proposed for Laplacian source coding. An analysis of the signal to quantization noise ratio (SQNR) of the simplified semilogarithmic quantizer is provided in the wide variance range for the cases of discrete input samples and continual input samples with Laplacian distribution. For the assumed discrete input samples and continual input samples it is shown that the higher SQNR is achieved by the proposed semilogarithmic quantizer when compared to the uniform quantizer. Another major contribution of this paper is the proof that in the area of smaller variance values the simplified semilogarithmic quantizer provides significantly higher SQNR values than the uniform quantizer, which is of great importance, especially in image coding, where the range of smaller variances is more probable than the range of higher variance values. Due to the simple realization structure and higher achieved SQNR than the uniform quantizer, one can expect that the proposed algorithm will be very applicable in coding of signals which, as well as speech signals and signals of difference between adjacent pixel values of image, follow Laplacian distribution. DOI: http://dx.doi.org/10.5755/j01.eee.20.3.6679

The previous several chapters discussed feature coding from the viewpoint of theoretical analysis. In this chapter, we will provide experimental analysis for different categories of feature coding algorithms. Firstly, we will introduce several classic databases (involving image classification, object categorization and scene recognition) and the corresponding experimental set-ups. Then, representative coding algorithms will be chosen from each category and evaluated on different visual tasks. Finally, we will provide experimental analysis with respect to the influence of coding algorithms, codebook sizes and numbers of training samples to various visual tasks, as well as a comparison among different implementations of the Bag-of-Features model.

The evaluation of a vector coding technique to quantify intersegmental coupling within a limb over multiple cycles of walking is described. The angular position of the knee with respect to the hip during walking was examined based on relative motion plots generated from videographic data. Participants included one able-bodied individual and one with spinal cord injury; the latter was assessed before and after participating in an assisted walking program. Vector coding of the frame-to-frame changes in hip/knee relationship was used to quantify the relative motion plots. Vector analysis techniques were then used to produce a single value that represents the overall variability of the hip/knee coupling relationship over multiple cycles. Hypothetical and random data were also used to evaluate the coding algorithm. In addition, the technique was compared to an earlier method in the analysis of this same data. Vector coding provided an easily interpretable method of quantifying the intersegmental coupling relationships and assessing the degree of consistency in the intralimb coordination over multiple cycles. The measure is sensitive to change in the kinematic variables and appears to have good validity. In addition, this technique has advantages over prior techniques as it allows simultaneous comparison of multiple cycles, calculations are performed quickly, and the algorithm is easy to program.

This paper presents an efficient video coding algorithm: Three-dimensional embedded subband coding with optimized truncation (3-D ESCOT), in which coefficients in different subbands are independently coded using fractional bit-plane coding and candidate truncation points are formed at the end of each fractional bit-plane. A rate-distortion optimized truncation scheme is used to multiplex all subband bitstreams together into a layered one. A novel motion threading technique is proposed to form threads along the motion trajectories in a scene. For efficient coding of motion threads, memory-constrained temporal wavelet transforms are applied along entire motion threads. Block-based motion threading is implemented in conjunction with 3-D ESCOT in a real video coder. Extension of 3-D ESCOT to object-based coding is also addressed. Experiments demonstrate that 3-D ESCOT outperforms MPEG-4 for most test sequences at the same bit rate.

When communicating at a very-low bit-rate, video coders are unable to preserve high visual quality for all images. A selection of key regions according to human viewing and understanding may therefore be useful: it allows extracting essential features and to code them with a high quality, while the remainder of the image is coarsely transmitted. Such an approach requires a signal decomposition allowing an adaptive spatial variant bit allocation. Matching pursuits (MP) explicitly select the information to he transmitted among a large and overcomplete set of functions and quantize it according to a fixed and constant step. For MF, bit allocation is equivalent to function selection. This makes matching pursuits well suited for spatial variant bit allocation, since functions matched to important objects can be chosen. In this paper, we first show the abilities of matching pursuits to allocate an available bit-budget according to a semantic understanding of the scene. This semantic information can be provided either automatically or interactively. Second, the possibility to incorporate perceptive criteria within the MP coding algorithm is investigated. (C) 2001 Elsevier Science B.V. All rights reserved.

Monte Carlo simulations with up to 176(5) spins confirm the Chen-Dohm theory for the five-dimensional Ising model. Also world record sizes 1000192²; 9984³; 880(4); 48(6) and 21(7) spins were simulated in the literature, and we describe the needed multi-spin coding algorithm.

For a rational /spl alpha//spl isin/(0,1), let /spl Ascr//sub n/spl times/m,/spl alpha// be the set of binary n/spl times/m arrays in which each row has Hamming weight /spl alpha/m and each column has Hamming weight /spl alpha/n, where /spl alpha/m and /spl alpha/n are integers. (The special case of two-dimensional balanced arrays corresponds to /spl alpha/=1/2 and even values for n and m.) The redundancy of /spl Ascr//sub n/spl times/m,/spl alpha// is defined by /spl rho//sub n/spl times/m,/spl alpha//=nmH(/spl alpha/)-log/sub 2/|/spl Ascr//sub n/spl times/m,/spl alpha//| where H(x)=-xlog/sub 2/x-(1-x)log/sub 2/(1-x). Bounds on /spl rho//sub n/spl times/m,/spl alpha// are obtained in terms of the redundancies of the sets /spl Ascr//sub /spl Lscr/,/spl alpha// of all binary /spl Lscr/-vectors with Hamming weight /spl alpha//spl Lscr/, /spl Lscr//spl isin/{n,m}. Specifically, it is shown that /spl rho//sub n/spl times/m,/spl alpha///spl les/n/spl rho//sub m,/spl alpha//+m/spl rho//sub n,/spl alpha// where /spl rho//sub /spl Lscr/,/spl alpha//=/spl Lscr/H(/spl alpha/)-log/sub 2/|/spl Ascr//sub /spl Lscr/,/spl alpha//| and that this bound is tight up to an additive term O(n+log m). A polynomial-time coding algorithm is presented that maps unconstrained input sequences into /spl Ascr//sub n/spl times/m,/spl alpha// at a rate H(/spl alpha/)-(/spl rho//sub m,/spl alpha///m).

Low bit-rate speech coding is a key technology for multimedia telecommunications. A number of coding algorithms have been developed for various applications. When optimizing or characterizing a codec, for example, one needs to evaluate its performance based on a subjective quality assessment, which is time-consuming and expensive. Therefore, objective quality measures that correlate well with subjective quality have been developed to estimate subjective quality. Several objective quality measures have been proposed to the ITU-T (International Telecommunication Union Telecommunication Standardization Sector), and a methodology to compare their performance needs to be developed. In this paper we propose a method for demonstrating the accuracy of an objective estimation of subjective quality. We then applied the proposed method to compare the performance of objective quality measures that have been candidates for Recommendation in ITU-T.

The paper presents an efficient word coding algorithm for PAL-based programmable devices with have a strictly determined (constant) number of product terms attached to each individual output cell. The algorithm is used to determine the coding capacity of certain logic blocks included in a popular CPLD and FPGA. The work shows continuation of research presented in (Kania, 1998; Kania, 1999).

Since illegal copying of digital contents is becoming a serious problem, this paper proposes a new digital watermarking method using motion compensated vectors of a digital video coding algorithm such as MPEG. The embedded information is protected by error correcting code from an alteration attack. The error probability of the embedded information after a re-encoding attack can potentially he made less than 10-5 for appropriate parameter values. The relationship between the SNR-of the proposed method and resistance to re-encoding attack is also considered. We also propose several new embedding methods that can improve the SNR of a video signal with a digital watermark by controlling the embedding area adaptively. We expect the proposed method to play an important role in copyright protection of multimedia contents in the coming network society.

Wireless video communication is particularly challenging because it combines the already difficult problem of efficient compression with the additional and usually contradictory need to make the compressed bit stream robust to channel errors. We describe design and implementation strategies for error-robust video communications with an emphasis on techniques compatible with the coding approaches used in the ISO (MPEG-4) and ITU standards organizations. These techniques include modifications to the video coding algorithms as well as to the system layers that perform packetization and multiplexing.

The paper proposes a pipelined architecture of a visual block pattern truncation coding algorithm to minimize the mean square error. Using this chip, the VBPTC based system can be applied to real-time encoding for moving pictures.

This paper deals with an image coding scheme based on overlapped projections and geometrical vector quantization. As far as still images are concerned, we present a simple coding algorithm, in which, the concept of projection, normally employed in tomographic applications, and geometric vector quantization are used to describe, in a compact way, circular overlapping regions in which the input image is subdivided. In this way it is possible to represent in a good way, contour and edge information without introducing significant blocking artefacts. The proposed coding techniques can also be used to represent images at progressive levels of quality. This aim can be simply obtained by increasing the number of projections used to describe each image region. Simulations carried out on several test images showed interesting results. An extension of this projection-based coding techniques is proposed for moving images too. In this case projections are used to describe in a compact way, the motion compensated luminance differences between the current image and the previous coded one.

Atom-Centered Multilayer Code (ACMC) is a novel coding algorithm by characterizing the sphere environment of a non-hydrogen atom, called center atom. This algorithm starts from the center atom and then develops to its environment layer by layer automatically without predefining specific fragments, and the number of layers is determined on the structure of the coded compound without limit. Fast searching strategy at the atomic level is obtained by using this code. The coding process and the global structure and substructure searching are discussed with examples.

In order to solve the EPC codec problems based on Internet of Things (IOT) applications for trade enterprises, in this chapter an EPC codec system is designed for enterprise applications. According to the “Tag Data Standards,” we design the encoding and decoding algorithm/schema of SGTIN-96. On the basis of the algorithm/schema, the system has improved its coding and decoding algorithm, making the coding algorithm more simple and practical and improving the efficiency. Besides, it also has realized the transformation between SGTIN-96 and GTIN-14, which makes the final printed electronic tag contain both a bar code and the EPC code, and realizes the compatibility of bar code and EPC code. The coding and decoding system can code and decode well for the products of the trade enterprise. Through the system, SGTIN-96 labels can be generated and printed. And the content of SGTIN-96 labels can be decoded. Finally, we test the codec system to prove that it can achieve our established requirements.

Bose-Chaudhuri-Hocquenghem (BCH) coding based on chip communication network is proposed to achieve optimal Energy-Perfomabilty trade-off. The proposed encoding and decoding scheme is applied to Butterfly-fat-tree (BFT) architecture. The proposed design improves Perform-ability range in comparison with conventional schemes while saving energy by 5%. BCH achieves high perform-ability (0.9) at high noise effect (σ N =0.135V). At short wire lengths (0.05mm), BCH saves energy 5% while increasing perform-ability (0.9) and reliability.

A major objective of inpatient stroke care is the prevention of medical and neurological complications, although rare, hemorrhagic transformation (HT) of an ischemic stroke (IS) can cause neurological deterioration and is associated with an increased risk of death.1 If HT can be reliably identified in administrative data, it could become a component of hospital quality benchmarks. Previous studies have used administrative data to define HT of IS; however, the accuracy of International Classification of Diseases, Ninth Revision ( ICD9 ) coding for this condition is unknown.2–4 Coding algorithms used in previous studies have varied, but all have required a discharge diagnosis of IS, defined by ICD9 code or Clinical Classification Software code, and a discharge ICD9 for intracranial hemorrhage. We aimed to determine the accuracy of ICD9 coding for HT after IS using the Greater Cincinnati/Northern Kentucky Stroke Study (GCNKSS). The purpose of the GCNKSS is to ascertain all strokes among a 5-county region that includes Cincinnati. Study personnel identified potential cases from January 1, 2005, through December 31, 2005, by screening emergency department encounters and inpatient admissions at 17 acute care hospitals for discharge ICD9 codes for stroke (430–436). Data are collected for all cases of IS, intracerebral hemorrhage (ICH), and subarachnoid hemorrhage. Potential cases were excluded if they had a discharge/autopsy diagnosis …

Many industries are anticipating the arrival of auto-stereoscopic video products and services based on multi-view images. Since multi-view images necessitate a large bandwidth, an efficient coding algorithm is desired. An approach that synthesizes multi-view images from a few views and depth maps is expected to be a promising method for accomplishing this. In this paper, an efficient and easyto-apply multi-view image coding algorithm based on a depth map is proposed. The experimental results show its fast encoding and decoding speed together with subjectively good quality of synthesized view images.

Objective To evaluate the validity of the International Classification of Diseases, 10th Revision (ICD-10) diagnosis code for hyponatraemia (E87.1) in two settings: at presentation to the emergency department and at hospital admission. Design Population-based retrospective validation study. Setting Twelve hospitals in Southwestern Ontario, Canada, from 2003 to 2010. Participants Patients aged 66 years and older with serum sodium laboratory measurements at presentation to the emergency department (n=64 581) and at hospital admission (n=64 499). Main outcome measures Sensitivity, specificity, positive predictive value and negative predictive value comparing various ICD-10 diagnostic coding algorithms for hyponatraemia to serum sodium laboratory measurements (reference standard). Median serum sodium values comparing patients who were code positive and code negative for hyponatraemia. Results The sensitivity of hyponatraemia (defined by a serum sodium ≤132 mmol/l) for the best-performing ICD-10 coding algorithm was 7.5% at presentation to the emergency department (95% CI 7.0% to 8.2%) and 10.6% at hospital admission (95% CI 9.9% to 11.2%). Both specificities were greater than 99%. In the two settings, the positive predictive values were 96.4% (95% CI 94.6% to 97.6%) and 82.3% (95% CI 80.0% to 84.4%), while the negative predictive values were 89.2% (95% CI 89.0% to 89.5%) and 87.1% (95% CI 86.8% to 87.4%). In patients who were code positive for hyponatraemia, the median (IQR) serum sodium measurements were 123 (119–126) mmol/l and 125 (120–130) mmol/l in the two settings. In code negative patients, the measurements were 138 (136–140) mmol/l and 137 (135–139) mmol/l. Conclusions The ICD-10 diagnostic code for hyponatraemia differentiates between two groups of patients with distinct serum sodium measurements at both presentation to the emergency department and at hospital admission. However, these codes underestimate the true incidence of hyponatraemia due to low sensitivity.

Local feature coding has drawn much attention in recent years. Many excellent coding algorithms have been proposed to improve the bag-of-words model. This paper proposes a new local feature coding method called local hypersphere coding (LHC) which possesses two distinctive differences from traditional coding methods. Firstly, we describe local features by the edges between visual words. Secondly, the reconstruction center is moved from the origin to the nearest visual word, thus feature coding is performed on the hypersphere of feature space. We evaluate our coding method on several benchmark datasets for image classification. The experimental results of the proposed method outperform several state-of-the-art coding methods, indicating the effectiveness of our method.

In this contribution the application of signal adaptive, dynamic time-frequency decompositions for the bitrate reduction of high quality audio signals is considered. We introduce a novel algorithm, Frequency-Varying Modulated Lapped Transforms (FV MLT), for the construction of almost arbitrary time-frequency resolutions. This algorithm combines the well known wavelet packet decomposition with tree-structured two-channel filter banks and Time-Varying Modulated Lapped Transforms (TV MLT). We compare the different techniques and explain in detail the benefits for perceptual source coding that result from the adaption of the time-frequency resolution: the efficient concentration of the signal energy to only a few transform coefficients, representing the signal, and the particularly well suited signal description for the perceptual dynamic bit allocation. Finally, we present a coding algorithm, which uses the proposed decomposition and vields bit rates between 50 and 64 kbit/s for monophonic CD quality signals.

In this paper I describe some of the design issues and research questions associated with objectbased video coding algorithms, as well as the new applications made possible. I propose a hardware and software strategy to cope with the computational demands (stream-based computing combined with automatic resource management) and also briefly introduce object-based audio representations that are linked to the video representations.

In a memoryless vector quantization (VQ) of images, each image block is quantized independently, while its corresponding index is sent to the decoder. Since the image blocks are highly correlated, many blocks may correspond to the same index. This paper presents a noiseless coding algorithm which groups up the blocks with the same index and then encodes the group path efficiently. Simulation results indicate that the new algorithm improves coding efficiency without introducing any extra loss of information.

Perceptual parameters ICLD, ICTD and ICC has a very important practical significance, so the use of these parameters, the researchers propose parameters based on FFT frequency domain binaural cue coding method to achieve a better stereo encoding quality. Compared with the FFT, modulation spliced transform (Modulated Lapped Transform, MLT) has an energy concentration, facilitating the removal of the characteristics of inter-blocking effect. Therefore, this article will be applied to binaural cue coding MLT transform them, to achieve a binaural cue coding method based MLT transform

Surveillance video system as an effective means of public safety widely appeared in people’s life in recent years. Traditional video coding technology, the encoding process is complex, computation, and conflicts with hardware limitations of the monitoring system. This paper presents a kind method used to design and train redundant dictionary based on image region. Each frame is divided into same-sized area with equal blocks, then the image areas of the same position are put together as the training sample library of regional redundant dictionary. In this way, redundant dictionary compression results in the occupied volume can be reduce. On top of this dictionary, surveillance video compression coding algorithm based on the regional dictionary is designed and implemented. Experimental results show that the proposed algorithm can effectively improve the compression ratio of the algorithm.

Summary The objective of this study was to develop and validate coding algorithms for epilepsy using ICD-coded inpatient claims, physician claims, and emergency room (ER) visits. 720/2049 charts from 2003 and 1533/3252 charts from 2006 were randomly selected for review from 13 neurologists’ practices as the “gold standard” for diagnosis. Epilepsy status in each chart was determined by 2 trained physicians. The optimal algorithm to identify epilepsy cases was developed by linking the reviewed charts with three administrative databases (ICD 9 and 10 data from 2000 to 2008) including hospital discharges, ER visits and physician claims in a Canadian health region. Accepting chart review data as the gold standard, we calculated sensitivity, specificity, positive, and negative predictive value for each ICD-9 and ICD-10 administrative data algorithm (case definitions). Of 18 algorithms assessed, the most accurate algorithm to identify epilepsy cases was “2 physician claims or 1 hospitalization in 2 years coded” (ICD-9 345 or G40/G41) and the most sensitive algorithm was “1 physician clam or 1 hospitalization or 1 ER visit in 2 years.” Accurate and sensitive case definitions are available for research requiring the identification of epilepsy cases in administrative health data.

This paper describes the basic principles of adaptive arithmetic coder, then analyzes the key modules of the coding process for VLSI realization and proposes good solutions, which especially include the time cost part implemented with parallel mechanism. With that, an optimized hardware model is built up, and the correctness is verified through Post-Place & Route model simulation. The synthesis result is also given to show the performance. At last, the experimental results show that our method is correct and efficient, it has theoretical significance and practical value.

This paper will review the advances which have been made in both electrically and optically addressed spatial light modulators and coding algorithms, which bring the realization of advanced optical systems such as 3D display closer.

An algorithm for coding of chemical structures is proposed based on a chemistry oriented line notation language. The latter is based on simple rules providing an almost convention free specification of molecular connectivity. A very useful feature of the proposed molecular code is that it has a line notation form, i.e. it can be interpreted according to the line notation language rules. Both the line notation language and molecular code are based on the principle of decomposition of the molecular graph into biconnected components (cyclic fragments or single atoms). The decomposition graph is a tree, each vertex of which stands for a biconnected component. Within the coding algorithm first the codes for each biconnected component are formed and then they are used as vertex labels of the decomposition tree. Since large chemical graphs usually consist of several biconnected components this method improves, to a great extent, the average time complexity of the algorithm. Terminal cyclic radicals and chain fragments of the molecular graph appear as unique substrings in the line notation code which enhances their computer perception.

Stimulated by the popular Local Binary Pattern (LBP) coding, we propose a new operator, i.e. the Local Difference (LD) coding. Different from other local coding approaches, the LD coding extracts direction information of both first-order and second-order difference. We apply the LD coding in feature extraction for face recognition, and obtain a very low dimensional feature in comparison with the classic operator such as the Uniform LBP (U-LBP). Experimental results show that the feature obtained with the LD operator could increase or maintain the recognition rate with much lower number of feature dimension.

In this paper, we first introduced the settings needed to run AVS encoding program. And then, elaborated on the AVS code optimization methods from two aspects: DCT-optimization and the quantify function optimization. The experimental results show that the optimization achieved the desired effect.

The literature on patient safety measures derived from routinely collected hospital data was reviewed to inform indicator development. MEDLINE and Embase databases and Web sites were searched. Of 1738 citations, 124 studies describing the application, evaluation, or validation of hospital-based medical error or complication of care measures were reviewed. Studies were frequently conducted in the United States (n = 88) between 2005 and 2009 (n = 77) using Agency for Healthcare Research and Quality patient safety indicators (PSIs; n = 79). The most frequently cited indicators included "postoperative hemorrhage or hematoma" and "accidental puncture and laceration." Indicator refinement is supported by international coding algorithm translations but is hampered by data issues, including coding inconsistencies. The validity of PSIs and similar adverse event screens beyond internal measurement and the effects of organizational factors on patient harm remain uncertain. Development of PSIs in ambulatory care settings, including general practice and psychiatric care, needs consideration.

This work proposes a novel INTRA coding algorithm which can achieve high coding efficiency using temporal-spatial prediction for H.264/AVC. The proposed prediction algorithm can compensate the weak point of individual usage of spatial or temporal prediction. Firstly, a new prediction block is selected in the temporal previous frame. Next, the selected block in the previous frame is used as the reference data to perform spatial prediction with the same reference direction as traditional INTRA modes. The coding process can also be reconstructed in decoder side without additional bit transfer. The simulation results show that the proposed new INTRA modes can achieve about 1dB improvement than the original H.264/AVC.

The primary objective of this paper is to study and develop a GIS-based coding approach and system which will provide the foundation and support for the realization of intelligent management of complicated traffic networks. We choose the links and nodes in an urban network as the entity elements, and design GISbased coding forms, following the rules of uniqueness, expandability, flexibility, and stability. Then, we institute the appropriate coding regulations, thereby defining the mark symbols of different digits in the codes. We focus on the detailed design and program implementation of the calculating algorithm of the position coordinates and the spatial location coding algorithm for road elements. Last, we develop the Beijing Automatic Road Coding System using Visual Basic and Map Objects, which completes the coding for all the nodes and links in the Beijing GIS network.

Use of parenteral nutrition (PN) is indicated for patients who are unable to meet their needs enterally. PN may be administered via custom-compounded mix or commercially available ready-to-use multichamber bags (MCB), but little is known about potential differences in clinical outcomes between these delivery systems. This study was undertaken to assess the feasibility of comparing custom-compounded and MCB PN in a large hospital claims database.Hospital claims data from the Premier Perspective Comparative Hospital Database (PCD) reported from 2005 through 2007 were analyzed. The authors searched the data for patients who received any PN products, including compounded PN and MCB PN. Coding algorithms for identifying patient characteristics, risk factors, and outcomes of interest were explored.Using hospital billing claims, the authors identified patients in the database treated with premixed PN from multichamber bags ("MCB only," n = 4699) and patients treated with custom-compounded PN solution ("compounded PN," n = 64,315). Methods of identifying PN administration groups, patient characteristics and risk factors, outcomes of interest, and data limitations are described.Exploratory analysis suggests that comparisons of PN administered via compounding and MCB are possible using the Premier data. The ability to control for many identifiable risk factors allows data to be presented for the use of PN and related outcomes in both a clinically sensible and relevant manner, albeit with some limitations.

In this paper, by analyzing the characteristics of video motion compensation errors (VMCE) we find that the existence of pulsive components depresses the compression performance of block DCT (BDCT) coding. To overcome this defect, a robust contour-BDCT coding algorithm for VMCE is proposed. It separates pulsive components from VMVE, coding the contour-like pulsive components separately, which makes the processed VMCE suitable for BDCT coding and fully makes use of the characteristics of BDCT coding. Because noise-like pulsive components are discarded and are not coded in our proposed coding algorithm, which only decreases the subjective quality slightly, a large number of bits are saved and can be used to code contour-like pulsive components and the processed VMCE more precisely. At the same time, genuine noise is discarded and is not coded into bit stream too, which makes the proposed coding algorithm very robust for noise. Experimental results show that the proposed coding algorithm can achieve better compression efficiency for VMCE when compared with the traditional BDCT-based coding algorithm.