Kai-Chen Huang

Learn More
The rapid increase in the availability of geospatial data has motivated the effort to seamlessly integrate this information into an information-rich and realistic 3D environment. However, heterogeneous data sources with varying degrees of consistency and accuracy pose a challenge to such efforts. We describe the Geospatial Decision Making (GeoDec) system,(More)
We present SOLVER, a Java applet that uses Constraint Processing (CP) techniques to assist human users in solving Sudoku puzzles. We also showcase CONSTRUCTOR, another applet that allows users to enter and store puzzles , which they can then load in SOLVER. These ap-plets are available from sudoku.unl.edu/Solver and su-doku.unl.edu/Constructor. Our goals(More)
In this paper, a low-complexity video stitching algorithm and its system prototype are proposed. With the novel design, users can obtain a high-resolution, high quality and seamless 360-degree panoramic video immediately by stitching the images with overlapped regions. Most of the present works are focused on image stitching instead of video stitching. In(More)
This paper presents an adaptive bandwidth allocation (ABA) model for Internet-attached wireless broadband network, WiMAX (IEEE 802.16). The proposed ABA algorithm consists of three allocation phases. First, ABA would reserve the unsolicited bandwidth for constant-bit-rate traffic (UGS). Then, polling bandwidth is allocated for real-time traffic (rtPS) to(More)
• Work on proposals for government funding applications (STTR, SBIR) • Develop products to separate raster maps into layers (e.g., road layer, text layer, etc.) and fuse the layers with satellite imagery • Develop products to extract swimming pools from imagery and utilize reverse geocoding techniques to identify the owner's mailing addresses • Develop(More)
In this thesis, we model the Sudoku puzzle, a known NP-complete problem [ Yato, 2003 ] , as a Constraint Satisfaction Problem (CSP) and investigate solving it using Constraint Processing (CP) techniques. We study and compare the effectiveness of several constraint propagation algorithms. We investigate the use of CP techniques to support interaction with(More)
  • 1