{"id":{"repo_id":"purdue-thes","oai_identifier":"oai:docs.lib.purdue.edu:open_access_dissertations-2877"},"canonical_url":"https://search.ndltd.org/etd/purdue-thes/oai:docs.lib.purdue.edu:open_access_dissertations-2877","repository":{"repo_id":"purdue-thes","name":"Purdue University","base_url":"https://docs.lib.purdue.edu/do/oai/"},"display":{"title":"Clustering and Segmentation with Application in Document Image Processing","abstract":"In this dissertation, we introduce a set of algorithms for document image processing, which are in the research area of color clustering and binarization. Color quantization algorithms are used to select a small number of colors that can accurately represent the content of a particular image. In this research, we introduce a novel color quantization algorithm which is based on the minimization of a modifed Lp norm rather than the more traditional L2 norm associated with mean square error (MSE) [1]. We demonstrate that the Lp optimization approach has two advantages. First, it produces more accurate perceived quality results, especially for important colors in small regions; and second, the norm’s value can be used as an e ective criterion for selecting the minimum number of colors necessary to achieve accurate representation of the image. Binarization algorithms are used to create a binary representation of a raster document image, typically with the intent of identifying text and separating it from background content. In this work, we propose a binarization algorithm via one-pass local classifcation [2]. The algorithm frst generates the initial binarization results by local thresholding, then corrects the results using a one-pass local classifcation strategy, followed by the process of component inversion. The experimental results demonstrate that our algorithm achieves a much lower binarization error rate than other popular binarization/thresholding algorithms. It is also demonstrated that the proposed algorithm achieves a somewhat lower binarization error rate than the state-of-the-art algorithm COS [3], while requiring signifcantly less computation.","abstract_html":"In this dissertation, we introduce a set of algorithms for document image processing, which are in the research area of color clustering and binarization. Color quantization algorithms are used to select a small number of colors that can accurately represent the content of a particular image. In this research, we introduce a novel color quantization algorithm which is based on the minimization of a modifed Lp norm rather than the more traditional L2 norm associated with mean square error (MSE) [1]. We demonstrate that the Lp optimization approach has two advantages. First, it produces more accurate perceived quality results, especially for important colors in small regions; and second, the norm’s value can be used as an e ective criterion for selecting the minimum number of colors necessary to achieve accurate representation of the image. Binarization algorithms are used to create a binary representation of a raster document image, typically with the intent of identifying text and separating it from background content. In this work, we propose a binarization algorithm via one-pass local classifcation [2]. The algorithm frst generates the initial binarization results by local thresholding, then corrects the results using a one-pass local classifcation strategy, followed by the process of component inversion. The experimental results demonstrate that our algorithm achieves a much lower binarization error rate than other popular binarization/thresholding algorithms. It is also demonstrated that the proposed algorithm achieves a somewhat lower binarization error rate than the state-of-the-art algorithm COS [3], while requiring signifcantly less computation.","abstract_has_math":false,"creators":["Xue, Haitao"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Charles A. Bouman","Jan P. Allebach","Mary L. Comer","Mireille Boutin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:51:27Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://docs.lib.purdue.edu/open_access_dissertations/1663","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://docs.lib.purdue.edu/open_access_dissertations/1663","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://docs.lib.purdue.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adocs.lib.purdue.edu%3Aopen_access_dissertations-2877","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Charles A. Bouman","Jan P. Allebach","Mary L. Comer","Mireille Boutin"]},{"key":"dc:creator","label":"Author","values":["Xue, Haitao"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2017-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://docs.lib.purdue.edu/open_access_dissertations/1663"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this dissertation, we introduce a set of algorithms for document image processing, which are in the research area of color clustering and binarization. Color quantization algorithms are used to select a small number of colors that can accurately represent the content of a particular image. In this research, we introduce a novel color quantization algorithm which is based on the minimization of a modifed Lp norm rather than the more traditional L2 norm associated with mean square error (MSE) [1]. We demonstrate that the Lp optimization approach has two advantages. First, it produces more accurate perceived quality results, especially for important colors in small regions; and second, the norm’s value can be used as an e ective criterion for selecting the minimum number of colors necessary to achieve accurate representation of the image. Binarization algorithms are used to create a binary representation of a raster document image, typically with the intent of identifying text and separating it from background content. In this work, we propose a binarization algorithm via one-pass local classifcation [2]. The algorithm frst generates the initial binarization results by local thresholding, then corrects the results using a one-pass local classifcation strategy, followed by the process of component inversion. The experimental results demonstrate that our algorithm achieves a much lower binarization error rate than other popular binarization/thresholding algorithms. It is also demonstrated that the proposed algorithm achieves a somewhat lower binarization error rate than the state-of-the-art algorithm COS [3], while requiring signifcantly less computation."]},{"key":"dc:title","label":"Title","values":["Clustering and Segmentation with Application in Document Image Processing"]}]}],"canonical_facts":{"dc:contributor":["Charles A. Bouman","Jan P. Allebach","Mary L. Comer","Mireille Boutin"],"dc:creator":["Xue, Haitao"],"dc:date.created":["2017-12-01T08:00:00Z"],"dc:description.abstract":["In this dissertation, we introduce a set of algorithms for document image processing, which are in the research area of color clustering and binarization. Color quantization algorithms are used to select a small number of colors that can accurately represent the content of a particular image. In this research, we introduce a novel color quantization algorithm which is based on the minimization of a modifed Lp norm rather than the more traditional L2 norm associated with mean square error (MSE) [1]. We demonstrate that the Lp optimization approach has two advantages. First, it produces more accurate perceived quality results, especially for important colors in small regions; and second, the norm’s value can be used as an e ective criterion for selecting the minimum number of colors necessary to achieve accurate representation of the image. Binarization algorithms are used to create a binary representation of a raster document image, typically with the intent of identifying text and separating it from background content. In this work, we propose a binarization algorithm via one-pass local classifcation [2]. The algorithm frst generates the initial binarization results by local thresholding, then corrects the results using a one-pass local classifcation strategy, followed by the process of component inversion. The experimental results demonstrate that our algorithm achieves a much lower binarization error rate than other popular binarization/thresholding algorithms. It is also demonstrated that the proposed algorithm achieves a somewhat lower binarization error rate than the state-of-the-art algorithm COS [3], while requiring signifcantly less computation."],"dc:identifier":["https://docs.lib.purdue.edu/open_access_dissertations/1663"],"dc:title":["Clustering and Segmentation with Application in Document Image Processing"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:51:27Z"}