@conference {12436,
	title = {Sparse dictionary-based representation and recognition of action attributes},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {707 - 714},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective function for learning a sparse dictionary of action attributes. The objective function maximizes the mutual information between what has been learned and what remains to be learned in terms of appearance information and class distribution for each dictionary item. We propose a Gaussian Process (GP) model for sparse representation to optimize the dictionary objective function. The sparse coding property allows a kernel with a compact support in GP to realize a very efficient dictionary learning process. Hence we can describe an action video by a set of compact and discriminative action attributes. More importantly, we can recognize modeled action categories in a sparse feature space, which can be generalized to unseen and unmodeled action categories. Experimental results demonstrate the effectiveness of our approach in action recognition applications.},
	keywords = {action attributes, appearance information, class distribution, Dictionaries, dictionary learning process, Encoding, Entropy, Gaussian process model, Gaussian processes, Histograms, HUMANS, Image coding, image representation, information maximization, learning (artificial intelligence), modeled action categories, Mutual information, Object recognition, probabilistic logic, sparse coding property, sparse dictionary-based recognition, sparse dictionary-based representation, sparse feature space, unmodeled action categories},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126307},
	author = {Qiang Qiu and Zhuolin Jiang and Chellapa, Rama}
}
@conference {15269,
	title = {A cooperative combinatorial Particle Swarm Optimization algorithm for side-chain packing},
	booktitle = {IEEE Swarm Intelligence Symposium, 2009. SIS {\textquoteright}09},
	year = {2009},
	month = {2009/04/30/March},
	pages = {22 - 29},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Particle Swarm Optimization (PSO) is a well-known, competitive technique for numerical optimization with real-parameter representation. This paper introduces CCPSO, a new Cooperative Particle Swarm Optimization algorithm for combinatorial problems. The cooperative strategy is achieved by splitting the candidate solution vector into components, where each component is optimized by a particle. Particles move throughout a continuous space, their movements based on the influences exerted by static particles that then get feedback based on the fitness of the candidate solution. Here, the application of this technique to side-chain packing (a proteomics optimization problem) is investigated. To verify the efficiency of the proposed CCPSO algorithm, we test our algorithm on three side-chain packing problems and compare our results with the provably optimal result. Computational results show that the proposed algorithm is very competitive, obtaining a conformation with an energy value within 1\% of the provably optimal solution in many proteins.},
	keywords = {Algorithm design and analysis, Amino acids, combinatorial mathematics, cooperative combinatorial particle swarm optimization algorithm, Design optimization, Encoding, Feedback, numerical optimization, Optimization methods, particle swarm optimisation, Particle swarm optimization, Partitioning algorithms, Proteins, proteomics, proteomics optimization, Robustness, side-chain packing},
	isbn = {978-1-4244-2762-8},
	doi = {10.1109/SIS.2009.4937840},
	author = {Lapizco-Encinas,G. and Kingsford, Carl and Reggia, James A.}
}
@article {12352,
	title = {Parameterized Looped Schedules for Compact Representation of Execution Sequences in DSP Hardware and Software Implementation},
	journal = {IEEE Transactions on Signal Processing},
	volume = {55},
	year = {2007},
	month = {2007/06//},
	pages = {3126 - 3138},
	abstract = {In this paper, we present a technique for compact representation of execution sequences in terms of efficient looping constructs. Here, by a looping construct, we mean a compact way of specifying a finite repetition of a set of execution primitives. Such compaction, which can be viewed as a form of hierarchical run-length encoding (RLE), has application in many very large scale integration (VLSI) signal processing contexts, including efficient control generation for Kahn processes on field-programmable gate arrays (FPGAs), and software synthesis for static dataflow models of computation. In this paper, we significantly generalize previous models for loop-based code compaction of digital signal processing (DSP) programs to yield a configurable code compression methodology that exhibits a broad range of achievable tradeoffs. Specifically, we formally develop and apply to DSP hardware and software synthesis a parameterizable loop scheduling approach with compact format, dynamic reconfigurability, and low-overhead decompression},
	keywords = {Application software, array signal processing, code compression methodology, compact representation, Compaction, data compression, Design automation, Digital signal processing, digital signal processing chips, DSP, DSP hardware, embedded systems, Encoding, Field programmable gate arrays, field-programmable gate arrays (FPGAs), FPGA, Hardware, hierarchical runlength encoding, high-level synthesis, Kahn process, loop-based code compaction, looping construct, parameterized loop schedules, program compilers, reconfigurable design, runlength codes, scheduling, Signal generators, Signal processing, Signal synthesis, software engineering, software implementation, static dataflow models, Very large scale integration, VLSI},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2007.893964},
	author = {Ming-Yung Ko and Zissulescu,C. and Puthenpurayil,S. and Bhattacharyya, Shuvra S. and Kienhuis,B. and Deprettere,E. F}
}
@conference {18568,
	title = {Field-to-frame transcoding with spatial and temporal downsampling},
	booktitle = {Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on},
	volume = {4},
	year = {1999},
	month = {1999///},
	pages = {271 -275 vol.4 - 271 -275 vol.4},
	abstract = {We present an algorithm for transcoding high-rate compressed bitstreams containing field-coded interlaced video to lower-rate compressed bitstreams containing frame-coded progressive video. We focus on MPEG-2 to H.263 transcoding, however these results can be extended to other lower-rate video compression standards including MPEG-4 simple profile and MPEG-1. A conventional approach to the transcoding problem involves decoding the input bitstream, spatially and temporally downsampling the decoded frames, and re-encoding the result. The proposed transcoder achieves improved performance by exploiting the details of the MPEG-2 and H.263 compression standards when performing interlaced to progressive (or field to frame) conversion with spatial downsampling and frame-rate reduction. The transcoder reduces the MPEG-2 decoding requirements by temporally downsampling the data at the bitstream level and reduces the H.263 encoding requirements by largely bypassing H.263 motion estimation by reusing the motion vectors and coding modes given in the input bitstream. In software implementations, the proposed approach achieved a 5 times; speedup over the conventional approach with only a 0.3 and 0.5 dB loss in PSNR for the Carousel and Bus sequences},
	keywords = {data compression, decoding, Encoding, field-coded interlaced video, field-to-frame transcoding, frame-coded progressive video, H.263 motion estimation, H.263 transcoding, high-rate compressed bitstreams, lower-rate compressed bitstreams, Motion estimation, MPEG-1, MPEG-2, MPEG-4, spatial downsampling, standards, temporal downsampling, transcoder, video coding, video compression standards},
	doi = {10.1109/ICIP.1999.819593},
	author = {Wee,S.J. and Apostolopoulos,J.G. and Feamster, Nick}
}
@conference {11993,
	title = {Self-calibration from image derivatives},
	booktitle = {Sixth International Conference on Computer Vision, 1998},
	year = {1998},
	month = {1998/01/04/7},
	pages = {83 - 89},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This study investigates the problem of estimating the calibration parameters from image motion fields induced by a rigidly moving camera with unknown calibration parameters, where the image formation is modeled with a linear pinhole-camera model. The equations obtained show the flow to be clearly separated into a component due to the translation and the calibration parameters and a component due to the rotation and the calibration parameters. A set of parameters encoding the latter component are linearly related to the flow, and from these parameters the calibration can be determined. However, as for discrete motion, in the general case it is not possible, to decouple image measurements from two frames only into their translational and rotational component. Geometrically, the ambiguity takes the form of a part of the rotational component being parallel to the translational component, and thus the scene can be reconstructed only up to a projective transformation. In general, for a full calibration at least four successive image frames are necessary with the 3D-rotation changing between the measurements. The geometric analysis gives rise to a direct self-calibration method that avoids computation of optical flow or point correspondences and uses only normal flow measurements. In this technique the direction of translation is estimated employing in a novel way smoothness constraints. Then the calibration parameters are estimated from the rotational components of several flow fields using Levenberg-Marquardt parameter estimation, iterative in the calibration parameters only. The technique proposed does not require calibration objects in the scene or special camera motions and it also avoids the computation of exact correspondence. This makes it suitable for the calibration of active vision systems which have to acquire knowledge about their intrinsic parameters while they perform other tasks, or as a tool for analyzing image sequences in large video databases},
	keywords = {3D-rotation, active vision, Calibration, CAMERAS, discrete motion, Encoding, Equations, image derivatives, image formation, image measurements, Image motion analysis, image motion fields, Image reconstruction, Image sequences, large video databases, Layout, Levenberg-Marquardt parameter estimation, linear pinhole-camera model, Motion estimation, Motion measurement, Optical computing, parameter estimation, projective transformation, rigidly moving camera, self-calibration, smoothness constraints, unknown calibration parameters},
	isbn = {81-7319-221-9},
	doi = {10.1109/ICCV.1998.710704},
	author = {Brodsky, T. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {12799,
	title = {Efficient model checking via the equational μ-calculus},
	booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings},
	year = {1996},
	month = {1996/07/27/30},
	pages = {304 - 312},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper studies the use of an equational variant of the modal μ-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the μ-calculus. Using this translation, one may then employ μ-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*},
	keywords = {Automata, BDD-based algorithms, Boolean functions, Calculus, compositional model-checking approaches, computational complexity, Computer science, CTL*, Data structures, Encoding, equational variant, equational μ-calculus, Equations, expressive temporal logic, Logic, Maintenance, modal μ-calculus, Model checking, on-the-fly procedures, Surges, temporal logic, temporal logic model checking, unified framework},
	isbn = {0-8186-7463-6},
	doi = {10.1109/LICS.1996.561358},
	author = {Bhat,G. and Cleaveland, Rance}
}
@conference {12787,
	title = {Efficient on-the-fly model checking for CTL},
	booktitle = {, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS {\textquoteright}95. Proceedings},
	year = {1995},
	month = {1995/06/26/29},
	pages = {388 - 397},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing {\textquotedblleft}global algorithm{\textquotedblright} for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice},
	keywords = {Algorithm design and analysis, Automata, computational complexity, Computer science, CTL, Encoding, finite automata, finite-state system, global algorithm, Logic, LTL, on-the-fly model checking, Performance analysis, Safety, State-space methods, sublogic, temporal logic, time complexity},
	isbn = {0-8186-7050-9},
	doi = {10.1109/LICS.1995.523273},
	author = {Bhat,G. and Cleaveland, Rance and Grumberg,O.}
}
@article {16791,
	title = {An efficient pictorial database system for PSQL},
	journal = {IEEE Transactions on Software Engineering},
	volume = {14},
	year = {1988},
	month = {1988/05//},
	pages = {639 - 650},
	abstract = {Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R+-trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures},
	keywords = {alphanumeric encodings, Computer science, Data structures, Database languages, database management systems, Database systems, Encoding, Image coding, Image databases, multidimensional B-trees, Object oriented databases, pictorial database system, PSQL, query language, query languages, R+-trees, Relational databases, Spatial databases, spatial objects, spatial search, User interfaces},
	isbn = {0098-5589},
	doi = {10.1109/32.6141},
	author = {Roussopoulos, Nick and Faloutsos,C. and Sellis,T.}
}
