Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chin-Tu Chen

dblp:78/3285 · DBLP profile ↗
← Back
19ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14Graphics, computer vision, multimedia, augmented reality and games · 11Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video processing · 75% Audio and music processing · 25%
Theoretical computer science
2 papers
Automata and formal languages · 62% Algorithms and data structures · 38%
Artificial intelligence
2 papers
Knowledge representation and reasoning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image transform
gabor transform
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994
Audio and music processing
time-frequency analysis
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning
spatial reasoning
0.011992
Spatial reasoning based on multivariate belief functions · CVPR 1992
Medical and health informatics › medical imaging
medical image analysis
0.011992
Spatial reasoning based on multivariate belief functions · CVPR 1992
Image and video processing › image restoration
bayesian image restoration
0.011991
Image Restoration Using Gibbs Priors: Boundary Modeling, Treatment of Blurring, and Selection of Hyperparameter · IEEE Trans. Pattern Anal. Mach. Intell. 1991
Image and video processing › image restoration
image deblurring
0.011991
Image Restoration Using Gibbs Priors: Boundary Modeling, Treatment of Blurring, and Selection of Hyperparameter · IEEE Trans. Pattern Anal. Mach. Intell. 1991
Image and video processing
image restoration
0.011991
Image Restoration Using Gibbs Priors: Boundary Modeling, Treatment of Blurring, and Selection of Hyperparameter · IEEE Trans. Pattern Anal. Mach. Intell. 1991
Automata and formal languages
grammar formalisms
0.011989
A Computational Model for Process-Grammar · Artif. Intell. 1989
Algorithms and data structures › fourier transform
fast fourier transform
0.011994
An efficient algorithm to compute the complete set of discrete Gabor coefficients · IEEE Trans. Image Process. 1994

Methods — techniques the papers use, named apart from their topics

discrete gabor transform · 0.0FFT · 0.0dempster-shafer theory · 0.0blackboard architecture · 0.0belief functions · 0.0computational modeling · 0.0iterative conditional averages · 0.0gibbs prior · 0.0bayesian modeling · 0.0
YearPublicationVenuePosition
1998 Morphologic field warping: a volumetric deformation method for medical image registration
abstract
An automated method is proposed for anatomic standardization that elastically map one subject's MR image to a standard reference MR image to enable inter-subject and cross-group studies. In this method, linear transformations based on bicommissural stereotaxy are first applied to grossly align the input image to the reference image. Then, an active contour model is employed to refine the contour and surface description of the input image. Based on the contour and surface correspondence established in these previous steps, a non-linear transformation is determined using the proposed weighted local reference coordinate systems to warp the input image. In this method, geometric correspondence established based on contour matching is used to control the warping and the actual image values corresponding to registered coordinates need not be similar. We tested this algorithm on various synthetic and real images for inter-subject registration of MR images.
Wen-Shiang Vincent Shih, Wei-Chung Lin, Sang-Yong Rhee, Chin-Tu Chen
ICPR4
1996 Fractional box-counting approach to fractal dimension estimation
abstract
The estimation of the fractal dimension is essential in fractal-based image segmentation, classification and shape analysis. The most popular estimation approach is based on box-counting. However, the partition and counting methods used in the regular box-counting scheme produces inaccurate results. In this paper, a more accurate fractional box-counting approach is proposed to estimate the fractal dimension in an image. By separating the concepts of base scale and counting scale, the new approach is able to use a deformable box to capture fractal property at some predetermined resolution. Preliminary results using the fractional box-counting approach have demonstrated that it is an accurate and efficient method.
Wei-Chung Lin, Chin-Tu Chen
ICPR3
1996 Recovery of 3-D closed surfaces using progressive shell models
abstract
This paper is concerned with the problems of reconstructing a closed surface from scattered, noisy 3-D data. A progressive shell model is a 3-D extension of the 2-D progressive contour model. We employ finite element methods (FEMs) to reduce the number of the required variables and improve the efficiency in storage and computation. The fundamental forms in differential geometry are used to measure rigid-motion invariant properties and formulate the internal energy of the shell. We also develop a wireframe model associated with a subdivision scheme to overcome the difficulty of generating a smooth boundary between two adjacent patches. This is a direct application of the 2-D contour model where curve segments or wires are used instead of patches. In the subdivision scheme, we impose the co-plane constraints to determine a unique normal vector at the interpolated mid-point. To demonstrate the descriptive ability of a wireframe model, we conduct experiments on 3-D data set of a tumor and a face.
Remin Lin, Wei-Chung Lin, Chin-Tu Chen
ICPR3
1996 Adaptive finite-element meshes for progressive contour models
abstract
This paper presents a progressive contour model based on the idea of deforming a contour from an initial shape as a source of prior knowledge by minimizing a defined contour energy to extract a desired contour from an image. The internal component of the contour energy imposes smoothness constraints on the displacements of deformations and the external component establishes the correspondence between the contour and image edges. A sequence of deformations is determined by repeatedly deforming and updating the initial contour. We show that the contour deformed by this sequence will smoothly and progressively approach a uniquely defined contour. We implement this model using a finite-element method, a multigrid algorithm, and an unconstrained optimization method. This approach offers several attractive advantages including a satisfactory convergence rate and the adaptation of the smoothness constraints.
Remin Lin, Wei-Chung Lin, Chin-Tu Chen
ICPR3
1996 Contour model guided image warping for image interpolation
abstract
An interpolation method, morphological field morphing, using contours of organs as the control parameters is proposed to recover the intensity information in the physical gaps of serial cross-sectional images. Contour information derived from a contour-model-based segmentation process is processed and used as the control parameters to warp the corresponding regions in both input images into comparable shapes. In this way, the reliability of establishing the correspondence among different segments of the same organs is improved and the intensity information for the interpolated intermediate slices can be derived more faithfully. In comparison with the existing intensity interpolation algorithms that only search for corresponding points based on intensity information, this method provides more meaningful correspondence relationships by warping corresponding regions in images into similar shapes before resampling to account for significant shape differences.
Wen-Shiang Vincent Shih, Wei-Chung Lin, Chin-Tu Chen
ICPR3
1995 Artificial neural networks for 3-D motion analysis. I. Rigid motion
abstract
Proposes an approach applying artificial neural net techniques to 3D rigid motion analysis based on sequential multiple time frames. The approach consists of two phases: (1) matching between every two consecutive frames and (2) estimating motion parameters based on the correspondences established. Phase 1 specifies the matching constraints to ensure a stable and coherent feature correspondence establishment between two sequential time frames and configures a 2D Hopfield neural net to enforce these constraints. Phase 2 constructs a 3-layer net to estimate parameters through supervised learning. The method performs motion analysis based on sequential multiple time frames. It represents an effective way to achieve optimal matching between two frames using neural net techniques. The energy function of the Hopfield net is designed to reflect the matching constraints and the minimization of this function leads to the optimal feature correspondence establishment. The approach introduces the learning concept to motion estimation. The structure of the net provides the flexibility in estimating motion parameters based on information from multiple frames.
Wei-Chung Lin, Chin-Tu Chen
IEEE Trans. Neural Networks3
1995 Artificial neural networks for 3-D motion analysis-Part II: Nonrigid motion
abstract
For pt. I see ibid., p. 1386-93 (1995). An approach applying artificial neural net techniques to 3D nonrigid motion analysis is proposed. The 3D nonrigid motion of the left ventricle of a human heart is examined using biplanar cineangiography data, consisting of 3D coordinates of 30 coronary artery bifurcation points of the left ventricle and the correspondences of these points taken over 10 time instants during the heart cardiac cycle. The motion is decomposed into global rigid motion and a set of local nonrigid deformations which are coupled with the global motion. The global rigid motion can be estimated precisely as a translation vecto and a rotation matrix. Local nonrigid deformation estimation is discussed. A set of neural nets similar in structure and dynamics but different in physical size is proposed to tackle the problem of nonrigidity. These neural networks are interconnected through feedbacks. The activation function of the output layer is selected so that a feedback is involved in the output updating. The constraints are specified to ensure stable and globally consistent estimation. The objective is to find the optimal deformation matrices that satisfy the constraints for all coronary artery bifurcation points of the left ventricle. The proposed neural networks differ from other existing neural network models in their unique structure and dynamics.
Wei-Chung Lin, Chin-Tu Chen
IEEE Trans. Neural Networks3
1994 Fuzzy neural networks for 3-D heart motion understanding
abstract
A fuzzy neural network based approach to 3-D heart motion understanding is proposed. Knowledge from cardiologists is used to specify different classes of motion and classification rules. The objective of this approach is to find the decisions for all possible classes of motion in the form of possibilities. Experiments on real data have been conducted to corroborate the proposed techniques.
Wei-Chung Lin, Chin-Tu Chen
ICPR (2)3
1994 An efficient algorithm to compute the complete set of discrete Gabor coefficients
abstract
The discrete Gabor (1946) transform algorithm is introduced that provides an efficient method of calculating the complete set of discrete Gabor coefficients of a finite-duration discrete signal from finite summations and to reconstruct the original signal exactly from the computed expansion coefficients. The similarity of the formulas between the discrete Gabor transform and the discrete Fourier transform enables one to employ the FFT algorithms in the computation. The discrete 1-D Gabor transform algorithm can be extended to 2-D as well.
Liwa Wang, Chin-Tu Chen, Wei-Chung Lin
IEEE Trans. Image Process.2
1994 Incorporation of correlated structural images in PET image reconstruction
abstract
Reports on a new method in which spatially correlated magnetic resonance (MR) or X-ray computed tomography (CT) images are employed as a source of prior information in the Bayesian reconstruction of positron emission tomography (PET) images. This new method incorporates the correlated structural images as anatomic templates which can be used for extracting information about boundaries that separate regions exhibiting different tissue characteristics. In order to avoid the possible introduction of artifacts caused by discrepancies between functional and anatomic boundaries, the authors propose a new method called the "weighted line site" method, in which a prior structural image is employed in a modified updating scheme for the boundary variable used in the iterative Bayesian reconstruction. This modified scheme is based on the joint probability of structural and functional boundaries. As to the structural information provided by CT or MR images, only those which have high joint probability with the corresponding PET data are used; whereas other boundary information that is not supported by the PET image is suppressed. The new method has been validated by computer simulation and phantom studies. The results of these validation studies indicate that this new method offers significant improvements in image quality when compared to other reconstruction algorithms, including the filtered backprojection method and the maximum likelihood approach, as well as the Bayesian method without the use of the prior boundary information.
Xiaolong Ouyang, Wing Hung Wong, Valen E. Johnson, Xiaoping Hu 0001, Chin-Tu Chen
IEEE Trans. Medical Imaging5
1993 Constraint satisfaction neural networks for image recognition
Eric Chen-Kuo Tsao, Wei-Chung Lin, Chin-Tu Chen
Pattern Recognit.3
1992 Spatial reasoning based on multivariate belief functions
abstract
The authors propose knowledge representation and evidence propagation schemes based on multivariate belief functions and present a medical image recognition system to demonstrate the effectiveness of their application to spatial reasoning. The proposed system, which is based on the blackboard architecture, can mimic the reasoning process of a human expert in identifying the anatomical structures in a set of correlated images acquired from X-ray CT and PD- and T/sub 2/-weighted MRI. In the blackboard-oriented system, different kinds of evidence provided by various knowledge sources form a hierarchy of evidential space to which the Dempster-Shafer theory is applied. The multivariate belief functions are used to represent domain specific knowledge such as rules or facts.>
Shiuh-Yung Chen, Wei-Chung Lin, Chin-Tu Chen
CVPR3
1992 Constraint satisfaction neural networks for image segmentation
Wei-Chung Lin, Eric Chen-Kuo Tsao, Chin-Tu Chen
Pattern Recognit.3
1991 Evaluating the EM algorithm for image processing using a human visual fidelity criterion
abstract
A new image quality metric consistent with the properties of the human visual system is derived. Using the EM algorithm, the authors restore a blurred image and quantify the improvement in image quality with both the new metric and the mean square error (MSE). From these results, the advantages of the new metric are obvious. The EM algorithm is modified according to the underlying mathematical structure of the new metric, which results in improved performance.>
James C. Brailean, Barry J. Sullivan, Chin-Tu Chen, Maryellen L. Giger
ICASSP3
1991 Dempster-Shafer reasoning for medical image recognition
abstract
A medical image recognition system is described whose reasoning module uses the features of the Dempster-Shafer (D-S) theory such as compatible frames and multivariate belief functions. The proposed expert system, which is based on the blackboard architecture, is capable of mimicking the reasoning process of a human expert in dividing a set of correlated X-ray CT and T-1 and T2-weighted MR images into semantically meaningful entities. In the blackboard-oriented system, different kinds of evidence provided by various knowledge sources form a hierarchy of evidential space to which D-S theory is applied. Several experimental results are given to illustrate the performance of the proposed system.>
Wei-Chung Lin, Shiuh-Yung Chen, Chin-Tu Chen
ICTAI3
1991 Split-and-merge image segmentation based on localized feature analysis and statistical tests
Shiuh-Yung Chen, Wei-Chung Lin, Chin-Tu Chen
CVGIP Graph. Model. Image Process.3
1991 Image Restoration Using Gibbs Priors: Boundary Modeling, Treatment of Blurring, and Selection of Hyperparameter
abstract
The authors propose a Bayesian model for the restoration of images based on counts of emitted photons. The model treats blurring within the context of an incomplete data problem and utilizes a Gibbs prior to model the spatial correlation of neighboring regions. The Gibbs prior includes line sites to account for boundaries between regions, and the line sites are assigned continuous values to permit efficient estimation using a method called iterative conditional averages. In addition, the effect of blurring in masking differences between images and the effects of misspecifying the amount of blurring are discussed.>
Valen E. Johnson, Wing Hung Wong, Xiaoping Hu 0001, Chin-Tu Chen
IEEE Trans. Pattern Anal. Mach. Intell.4
1989 A Computational Model for Process-Grammar
Wei-Chung Lin, Cheng-Chung Liang, Chin-Tu Chen
Artif. Intell.3
1989 A new surface interpolation technique for reconstructing 3D objects from serial cross-sections
Wei-Chung Lin, Shiuh-Yung Chen, Chin-Tu Chen
Comput. Vis. Graph. Image Process.3