@conference {13179,
	title = {Semi-Parametric Model-Based Clustering for DNA Microarray Data},
	booktitle = {Pattern Recognition, 2006. ICPR 2006. 18th International Conference on},
	volume = {3},
	year = {2006},
	month = {2006//00/0},
	pages = {324 - 327},
	abstract = {Various clustering methods have been proposed for the analysis of gene expression data, but conventional clustering algorithms have several critical limitations; how to set parameters such as number of clusters, initial cluster centers, and so on. In this paper, we propose a semi-parametric model-based clustering algorithm in which the underlying model is a mixture of Gaussian. Each gene expression data builds a Gaussian kernel, and the uncertainty of microarray data is naturally integrated in the data representation. Our algorithm provides a principled method to automatically determine parameters - number of components in the mixture, mean, covariance, and weight of each Gaussian - by mean-shift procedure (Comaniciu and Meer, 1999) and curvature fitting. After the initialization, expectation maximization (EM) algorithm is employed for clustering to achieve maximum likelihood (ML). The performance of our algorithm is compared with standard EM algorithm using real data as well as synthetic data},
	keywords = {clustering;, clustering;DNA;Gaussian, computing;genetics;pattern, data;Gaussian, data;maximum, DNA, Expression, fitting;data, kernel;Gaussian, likelihood;mean-shift, maximization;gene, Microarray, mixtures;curvature, model-based, procedure;semiparametric, processes;biology, representation;expectation},
	doi = {10.1109/ICPR.2006.1044},
	author = {Han,Bohyung and Davis, Larry S.}
}
@conference {12659,
	title = {A method for converting a smiling face to a neutral face with applications to face recognition},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/977 - ii/980 Vol. 2 - ii/977 - ii/980 Vol. 2},
	abstract = {The human face displays a variety of expressions, like smile, sorrow, surprise, etc. All these expressions constitute nonrigid motions of various features of the face. These expressions lead to a significant change in the appearance of a facial image which leads to a drop in the recognition accuracy of a face-recognition system trained with neutral faces. There are other factors like pose and illumination which also lead to performance drops. Researchers have proposed methods to tackle the effects of pose and illumination; however, there has been little work on how to tackle expressions. We attempt to address the issue of expression invariant face-recognition. We present preprocessing steps for converting a smiling face to a neutral face. We expect that this would in turn make the vector in the feature space to be closer to the correct vector in the gallery, in an appearance-based face recognition. This conjecture is supported by our recognition results which demonstrate that the accuracy goes up if we include the expression-normalization block.},
	keywords = {appearance-based, Expression, Face, face;, feature, invariant, motion;, neutral, nonrigid, normalization;, recognition;, smiling},
	doi = {10.1109/ICASSP.2005.1415570},
	author = {Ramachandran, M. and Zhou,S. K and Jhalani, D. and Chellapa, Rama}
}
@conference {12685,
	title = {Facial similarity across age, disguise, illumination and pose},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/10//},
	pages = {1999 - 2002 Vol. 3 - 1999 - 2002 Vol. 3},
	abstract = {Illumination, pose variations, disguises, aging effects and expression variations are some of the key factors that affect the performance of face recognition systems. Face recognition systems have always been studied from a recognition perspective. Our emphasis is on deriving a measure of similarity between faces. The similarity measure provides insights into the role each of the above mentioned variations play in affecting the performance of face recognition systems. In the process of computing the similarity measure between faces, we suggest a framework to compensate for pose variations and introduce the notion of {\textquoteright}half-faces{\textquoteright} to circumvent the problem of non-uniform illumination. We used the similarity measure to retrieve similar faces from a database containing multiple images of individuals. Moreover, we devised experiments to study the effect age plays in affecting facial similarity. In conclusion, the similarity measure helps in studying the significance facial features play in affecting the performance of face recognition systems.},
	keywords = {Aging, database, databases;, disguise;, effect;, Expression, Face, half-face;, illumination;, image, lighting;, pose, recognition, recognition;, retrieval;, system;, variation;, visual},
	doi = {10.1109/ICIP.2004.1421474},
	author = {Ramanathan,N. and Chellapa, Rama and Roy Chowdhury, A.K.}
}
@conference {12700,
	title = {Intra-personal kernel space for face recognition},
	booktitle = {Automatic Face and Gesture Recognition, 2004. Proceedings. Sixth IEEE International Conference on},
	year = {2004},
	month = {2004/05//},
	pages = {235 - 240},
	abstract = {Intra-personal space modeling proposed by Moghaddam et al. has been successfully applied in face recognition. In their work the regular principal subspaces are derived from the intra-personal spacce using a principal componen analysis and embedded in a probabilistic formulation. In this paper, we derive the principal subspace from the intro-personal kernel space by developing a probabilistic analysis for kernel principal components for face recognition. We test this algorithm on a subset of the FERET database with illumination and facial expression variations. The recognition performance demonstrates its advantage over other traditional subspace approaches.},
	keywords = {analysis;, component, Expression, Face, facial, illumination, intra-personal, Kernel, lighting;, principal, probabilistic, probability;, recognition;, space;, variation;},
	doi = {10.1109/AFGR.2004.1301537},
	author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.}
}
@article {14097,
	title = {Analysis of stage-specific gene expression in the bloodstream and the procyclic form of Trypanosoma brucei using a genomic DNA-microarray},
	journal = {Molecular and Biochemical Parasitology},
	volume = {123},
	year = {2002},
	month = {2002/08/28/},
	pages = {115 - 123},
	abstract = {A microarray comprising 21[punctuation space]024 different PCR products spotted on glass slides was constructed for gene expression studies on Trypanosoma brucei. The arrayed fragments were generated from a T. brucei shotgun clone library, which had been prepared from randomly sheared and size-fractionated genomic DNA. For the identification of stage-specific gene activity, total RNA from in vitro cultures of the human, long slender form and the insect, procyclic form of the parasite was labelled and hybridised to the microarray. Approximately 75\% of the genomic fragments produced a signal and about 2\% exhibited significant differences between the transcript levels in the bloodstream and procyclic forms. A few results were confirmed by Northern blot analysis or reverse-transcription and PCR. Three hundred differentially regulated clones have been selected for sequencing. So far, of 33 clones that showed about 2-fold or more over-expression in bloodstream forms, 15 contained sequences similar to those of VSG expression sites and at least six others appeared non-protein-coding. Of 29 procyclic-specific clones, at least eight appeared not to be protein-coding. A surprisingly large proportion of known regulated genes was already identified in this small sample, and some new ones were found, illustrating the utility of genomic arrays.},
	keywords = {Expression, Gene, Microarray, Regulation, Trypanosoma brucei},
	isbn = {0166-6851},
	doi = {16/S0166-6851(02)00138-X},
	url = {http://www.sciencedirect.com/science/article/pii/S016668510200138X},
	author = {Diehl,Susanne and Diehl,Frank and El-Sayed, Najib M. and Clayton,Christine and Hoheisel,J{\"o}rg D.}
}
@article {14957,
	title = {Efficient algorithms for list ranking and for solving graph problems on the hypercube},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {1},
	year = {1990},
	month = {1990/01//},
	pages = {83 - 90},
	abstract = {A hypercube algorithm to solve the list ranking problem is presented. Let <e1>n</e1> be the length of the list, and let <e1>p</e1> be the number of processors of the hypercube. The algorithm described runs in time O(<e1>n</e1>/<e1>p</e1>) when <e1>n</e1>= Omega;(<e1>p</e1> <sup>1+ epsi;</sup>) for any constant epsi; gt;0, and in time O(<e1>n </e1> log <e1>n</e1>/<e1>p</e1>+log<sup>3</sup> <e1>p</e1>) otherwise. This clearly attains a linear speedup when <e1>n</e1>= Omega;(<e1>p</e1> <sup>1+ epsi;</sup>). Efficient balancing and routing schemes had to be used to achieve the linear speedup. The authors use these techniques to obtain efficient hypercube algorithms for many basic graph problems such as tree expression evaluation, connected and biconnected components, ear decomposition, and st-numbering. These problems are also addressed in the restricted model of one-port communication},
	keywords = {algorithm;hypercube, algorithms;graph, algorithms;linear, algorithms;sorting;, balancing;one-port, basic, communication;sorting;st-numbering;tree, complexity;graph, components;ear, decomposition;graph, evaluation;computational, Expression, graph, problems;biconnected, problems;hypercube, ranking;load, speedup;list, theory;parallel},
	isbn = {1045-9219},
	doi = {10.1109/71.80127},
	author = {Ryu,K. W. and JaJa, Joseph F.}
}
