6 results on '"Yi-Hong Chu"'
Search Results
2. Density Conscious Subspace Clustering for High-Dimensional Data
- Author
-
Kun-Ta Chuang, Jen-Wei Huang, Yi-Hong Chu, Ming-Syan Chen, and De-Nian Yang
- Subjects
Clustering high-dimensional data ,business.industry ,Computer science ,Feature vector ,Pattern recognition ,Linear subspace ,Computer Science Applications ,Data set ,Computational Theory and Mathematics ,Principal component analysis ,Artificial intelligence ,Cluster analysis ,business ,Divergence (statistics) ,Subspace topology ,Information Systems - Abstract
Instead of finding clusters in the full feature space, subspace clustering is an emergent task which aims at detecting clusters embedded in subspaces. Most of previous works in the literature are density-based approaches, where a cluster is regarded as a high-density region in a subspace. However, the identification of dense regions in previous works lacks of considering a critical problem, called "the density divergence problemrdquo in this paper, which refers to the phenomenon that the region densities vary in different subspace cardinalities. Without considering this problem, previous works utilize a density threshold to discover the dense regions in all subspaces, which incurs the serious loss of clustering accuracy (either recall or precision of the resulting clusters) in different subspace cardinalities. To tackle the density divergence problem, in this paper, we devise a novel subspace clustering model to discover the clusters based on the relative region densities in the subspaces, where the clusters are regarded as regions whose densities are relatively high as compared to the region densities in a subspace. Based on this idea, different density thresholds are adaptively determined to discover the clusters in different subspace cardinalities. Due to the infeasibility of applying previous techniques in this novel clustering model, we also devise an innovative algorithm, referred to as DENCOS (density conscious subspace clustering), to adopt a divide-and-conquer scheme to efficiently discover clusters satisfying different density thresholds in different subspace cardinalities. As validated by our extensive experiments on various data sets, DENCOS can discover the clusters in all subspaces with high quality, and the efficiency of DENCOS outperformes previous works.
- Published
- 2010
3. Learning-Based Vertebra Detection and Iterative Normalized-Cut Segmentation for Spinal MRI
- Author
-
Szu-Hao Huang, Yi-Hong Chu, Shang-Hong Lai, and C.L. Novak
- Subjects
musculoskeletal diseases ,Normalization (statistics) ,Computer science ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Image processing ,Pattern Recognition, Automated ,Artificial Intelligence ,Robustness (computer science) ,Image Processing, Computer-Assisted ,medicine ,Humans ,Computer vision ,Segmentation ,AdaBoost ,Electrical and Electronic Engineering ,Process (anatomy) ,Radiological and Ultrasound Technology ,medicine.diagnostic_test ,business.industry ,Reproducibility of Results ,Bayes Theorem ,Pattern recognition ,Magnetic resonance imaging ,Image segmentation ,musculoskeletal system ,Magnetic Resonance Imaging ,Spine ,Object detection ,Computer Science Applications ,Vertebra ,medicine.anatomical_structure ,Artificial intelligence ,business ,Algorithms ,Software - Abstract
Automatic extraction of vertebra regions from a spinal magnetic resonance (MR) image is normally required as the first step to an intelligent spinal MR image diagnosis system. In this work, we develop a fully automatic vertebra detection and segmentation system, which consists of three stages; namely, AdaBoost-based vertebra detection, detection refinement via robust curve fitting, and vertebra segmentation by an iterative normalized cut algorithm. In order to produce an efficient and effective vertebra detector, a statistical learning approach based on an improved AdaBoost algorithm is proposed. A robust estimation procedure is applied on the detected vertebra locations to fit a spine curve, thus refining the above vertebra detection results. This refinement process involves removing the false detections and recovering the miss-detected vertebrae. Finally, an iterative normalized-cut segmentation algorithm is proposed to segment the precise vertebra regions from the detected vertebra locations. In our implementation, the proposed AdaBoost-based detector is trained from 22 spinal MR volume images. The experimental results show that the proposed vertebra detection and segmentation system can achieve nearly 98% vertebra detection rate and 96% segmentation accuracy on a variety of testing spinal MR images. Our experiments also show the vertebra detection and segmentation accuracies by using the proposed algorithm are superior to those of the previous representative methods. The proposed vertebra detection and segmentation system is proved to be robust and accurate so that it can be used for advanced research and application on spinal MR images.
- Published
- 2009
4. Reducing Redundancy in Subspace Clustering
- Author
-
De-Nian Yang, Yi-Ju Chen, Ming-Syan Chen, and Yi-Hong Chu
- Subjects
Fuzzy clustering ,Computer science ,Correlation clustering ,computer.software_genre ,Computer Science Applications ,Determining the number of clusters in a data set ,ComputingMethodologies_PATTERNRECOGNITION ,Redundancy (information theory) ,Computational Theory and Mathematics ,Data mining ,Cluster analysis ,Time complexity ,computer ,Subspace topology ,Information Systems - Abstract
In this paper, we first study an important but unsolved dilemma in the literature of subspace clustering, which is referred to as ldquoinformation overlapping-data coveragerdquo challenge. Current solutions of subspace clustering usually invoke a grid-based apriori-like procedure to identify dense regions and construct subspace clusters afterward. Due to the nature of monotonicity property in apriori-like procedures, it is inherent that if a region is identified as dense, all its projected regions are also identified as dense, causing overlapping/redundant clustering information to be inevitably reported to users when generating clusters from such highly correlated regions. However, naive methods to filter redundant clusters will incur a challenging problem in the other side of the dilemma, called the ldquodata coveragerdquo issue. Note that two clusters may have highly correlated dense regions but their data members could be highly different to each other. Arbitrarily removing one of them may lose the coverage of data with clustering information, thus likely reporting an incomplete and biased clustering result. In this paper, therefore, we further propose an innovative algorithm, called "nonredundant subspace cluster miningrdquo (NORSC), to efficiently discover a succinct collection of subspace clusters while also maintaining the required degree of data coverage. NORSC not only avoids generating the redundant clusters with most of the contained data covered by higher dimensional clusters to resolve the information overlapping problem but also limits the information loss to cope with the data coverage problem. As shown by our experimental results, NORSC is very effective in identifying a concise and small set of subspace clusters, while incurring time complexity in orders of magnitude better than that of previous works.
- Published
- 2009
5. QED: An Efficient Framework for Temporal Region Query Processing
- Author
-
Kun-Ta Chuang, Ming-Syan Chen, and Yi-Hong Chu
- Subjects
Knowledge extraction ,Computer science ,Temporal logic ,Data mining ,computer.software_genre ,Raw data ,computer ,Computer Science::Databases ,Temporal database - Abstract
In this paper, we explore a new problem of ”temporal dense region query” to discover the dense regions in the constrainted time intervals which can be separated or not. A Querying tEmporal Dense Region framework (abbreviated as QED) proposed to deal with this problem consists of two phases: (1) an offline maintaining phase, to maintain the statistics of data by constructing a number of summarized structures, RF-trees; (2) an online query processing phase, to provide an efficient algorithm to execute queries on the RF-trees. The QED framework has the advantage that by using the summarized structures, RF-trees, the queries can be executed efficiently without accessing the raw data. In addition, a number of RF-trees can be merged with one another efficiently such that the queries will be executed efficiently on the combined RF-tree. As validated by our empirical studies, the QED framework performs very efficiently while producing the results of high quality.
- Published
- 2005
6. Reducing Redundancy in Subspace Clustering.
- Author
-
Yi-Hong Chu, Ying-Ju Chen, De-Nian Yang, and Ming-Syan Chen
- Subjects
- *
DOCUMENT clustering , *DATA mining , *ALGORITHMS , *INFORMATION filtering , *GRID computing - Abstract
In this paper, we first study an important but unsolved dilemma in the literature of subspace clustering, which is referred to as "information overlapping-data coverage" challenge. Current solutions of subspace clustering usually invoke a grid-based Apriori-like procedure to identify dense regions and construct subspace clusters afterward. Due to the nature of monotonicity property in Apriori- like procedures, it is inherent that if a region is identified as dense, all its projected regions are also identified as dense, causing overlapping/redundant clustering information to be inevitably reported to users when generating clusters from such highly correlated regions. However, naive methods to filter redundant clusters will incur a challenging problem in the other side of the dilemma, called the "data coverage" issue. Note that two clusters may have highly correlated dense regions but their data members could be highly different to each other. Arbitrarily removing one of them may lose the coverage of data with clustering information, thus likely reporting an incomplete and biased clustering result. In this paper, therefore, we further propose an innovative algorithm, called "NOnRedundant Subspace Cluster mining" (NORSC), to efficiently discover a succinct collection of subspace clusters while also maintaining the required degree of data coverage. NORSC not only avoids generating the redundant clusters with most of the contained data covered by higher dimensional clusters to resolve the information overlapping problem but also limits the information loss to cope with the data coverage problem. As shown by our experimental results, NORSC is very effective in identifying a concise and small set of subspace clusters, while incurring time complexity in orders of magnitude better than that of previous works. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.